<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: tag_and_trait.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a01124_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">tag_and_trait.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01124.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2005-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Permission to use, copy, modify, sell, and distribute this software</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// is hereby granted without fee, provided that the above copyright</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// notice appears in all copies, and that both that copyright notice</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// and this permission notice appear in supporting documentation. None</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// of the above authors, nor IBM Haifa Research Laboratories, make any</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// representation about the suitability of this software for any</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// purpose. It is provided "as is" without express or implied</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// warranty.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">/**</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * @file tag_and_trait.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains tags and traits, e.g., ones describing underlying</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * data structures.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> */</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#ifndef PB_DS_TAG_AND_TRAIT_HPP</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#define PB_DS_TAG_AND_TRAIT_HPP</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a00656.html">bits/c++config.h</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include <<a class="code" href="a01151.html">ext/pb_ds/detail/type_utils.hpp</a>></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">/**</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * @namespace __gnu_pbds</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * @brief GNU extensions for policy-based data structures for public use.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> */</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="keyword">namespace </span><a class="code" href="a01593.html">__gnu_pbds</a></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> {<span class="comment"></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> /** @defgroup pbds Policy-Based Data Structures</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * @ingroup extensions</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> *</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * This is a library of policy-based elementary data structures:</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * associative containers and priority queues. It is designed for</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * high-performance, flexibility, semantic safety, and conformance</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * to the corresponding containers in std (except for some points</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * where it differs by design).</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> *</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * For details, see:</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/index.html</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> *</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * @{</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> */</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"></span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> /**</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * @defgroup tags Tags</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * @{ </span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> */</span><span class="comment"></span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> /// A trivial iterator tag. Signifies that the iterators has none of</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> /// std::iterators's movement abilities.</span></div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="a11115.html"> 75</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11115.html">trivial_iterator_tag</a></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  { };</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"></span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> /// Prohibit moving trivial iterators.</span></div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="a01530.html#ga3a45dab56a44f762c97eb0eaee17f6f2"> 79</a></span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a01530.html#ga3a45dab56a44f762c97eb0eaee17f6f2">trivial_iterator_difference_type</a>;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"></span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> /**</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * @defgroup invalidation_tags Invalidation Guarantees</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * @ingroup tags</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * @{</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> */</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"></span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> /**</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * Signifies a basic invalidation guarantee that any iterator,</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * pointer, or reference to a container object's mapped value type</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * is valid as long as the container is not modified.</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> */</span></div><div class="line"><a name="l00093"></a><span class="lineno"><a class="line" href="a11119.html"> 93</a></span>  <span class="keyword">struct </span><a class="code" href="a11119.html">basic_invalidation_guarantee</a></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  { };</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"></span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> /**</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * Signifies an invalidation guarantee that includes all those of</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * its base, and additionally, that any point-type iterator,</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * pointer, or reference to a container object's mapped value type</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * is valid as long as its corresponding entry has not be erased,</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> * regardless of modifications to the container object.</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"> */</span></div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="a11123.html"> 103</a></span>  <span class="keyword">struct </span><a class="code" href="a11123.html">point_invalidation_guarantee</a> : <span class="keyword">public</span> <a class="code" href="a11119.html">basic_invalidation_guarantee</a></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  { };</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"></span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> /**</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> * Signifies an invalidation guarantee that includes all those of</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * its base, and additionally, that any range-type iterator</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> * (including the returns of begin() and end()) is in the correct</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> * relative positions to other range-type iterators as long as its</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * corresponding entry has not be erased, regardless of</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * modifications to the container object.</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> */</span></div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="a11127.html"> 114</a></span>  <span class="keyword">struct </span><a class="code" href="a11127.html">range_invalidation_guarantee</a> : <span class="keyword">public</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  { };<span class="comment"></span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> /**</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> * @defgroup ds_tags Data Structure Type</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> * @ingroup tags</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * @{</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> */</span><span class="comment"></span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> /// Base data structure tag.</span></div><div class="line"><a name="l00125"></a><span class="lineno"><a class="line" href="a11131.html"> 125</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11131.html">container_tag</a></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  { };</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment"></span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> /// Basic sequence.</span></div><div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="a11135.html"> 129</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11135.html">sequence_tag</a> : <span class="keyword">public</span> <a class="code" href="a11131.html">container_tag</a> { };</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"></span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> /// Basic string container, inclusive of strings, ropes, etc.</span></div><div class="line"><a name="l00132"></a><span class="lineno"><a class="line" href="a11139.html"> 132</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11139.html">string_tag</a> : <span class="keyword">public</span> <a class="code" href="a11135.html">sequence_tag</a> { };</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"></span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> /// Basic associative-container.</span></div><div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="a11143.html"> 135</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11143.html">associative_tag</a> : <span class="keyword">public</span> <a class="code" href="a11131.html">container_tag</a> { };</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"></span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> /// Basic hash structure.</span></div><div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="a11147.html"> 138</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11147.html">basic_hash_tag</a> : <span class="keyword">public</span> <a class="code" href="a11143.html">associative_tag</a> { };</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"></span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> /// Collision-chaining hash.</span></div><div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="a11151.html"> 141</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11151.html">cc_hash_tag</a> : <span class="keyword">public</span> <a class="code" href="a11147.html">basic_hash_tag</a> { };</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"></span></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> /// General-probing hash.</span></div><div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="a11155.html"> 144</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11155.html">gp_hash_tag</a> : <span class="keyword">public</span> <a class="code" href="a11147.html">basic_hash_tag</a> { };</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"></span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> /// Basic branch structure.</span></div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="a11159.html"> 147</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11159.html">basic_branch_tag</a> : <span class="keyword">public</span> <a class="code" href="a11143.html">associative_tag</a> { };</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"></span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> /// Basic tree structure.</span></div><div class="line"><a name="l00150"></a><span class="lineno"><a class="line" href="a11163.html"> 150</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11163.html">tree_tag</a> : <span class="keyword">public</span> <a class="code" href="a11159.html">basic_branch_tag</a> { };</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"></span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> /// Red-black tree.</span></div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="a11167.html"> 153</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11167.html">rb_tree_tag</a> : <span class="keyword">public</span> <a class="code" href="a11163.html">tree_tag</a> { };</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"></span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> /// Splay tree.</span></div><div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="a11171.html"> 156</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11171.html">splay_tree_tag</a> : <span class="keyword">public</span> <a class="code" href="a11163.html">tree_tag</a> { };</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"></span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> /// Ordered-vector tree.</span></div><div class="line"><a name="l00159"></a><span class="lineno"><a class="line" href="a11175.html"> 159</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11175.html">ov_tree_tag</a> : <span class="keyword">public</span> <a class="code" href="a11163.html">tree_tag</a> { };</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"></span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> /// Basic trie structure.</span></div><div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="a11179.html"> 162</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11179.html">trie_tag</a> : <span class="keyword">public</span> <a class="code" href="a11159.html">basic_branch_tag</a> { };</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"></span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> /// PATRICIA trie.</span></div><div class="line"><a name="l00165"></a><span class="lineno"><a class="line" href="a11183.html"> 165</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11183.html">pat_trie_tag</a> : <span class="keyword">public</span> <a class="code" href="a11179.html">trie_tag</a> { };</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"></span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> /// List-update.</span></div><div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="a11187.html"> 168</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11187.html">list_update_tag</a> : <span class="keyword">public</span> <a class="code" href="a11143.html">associative_tag</a> { };</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"></span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> /// Basic priority-queue.</span></div><div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="a11191.html"> 171</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11191.html">priority_queue_tag</a> : <span class="keyword">public</span> <a class="code" href="a11131.html">container_tag</a> { };</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"></span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> /// Pairing-heap.</span></div><div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="a11195.html"> 174</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11195.html">pairing_heap_tag</a> : <span class="keyword">public</span> <a class="code" href="a11191.html">priority_queue_tag</a> { };</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"></span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> /// Binomial-heap.</span></div><div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="a11199.html"> 177</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11199.html">binomial_heap_tag</a> : <span class="keyword">public</span> <a class="code" href="a11191.html">priority_queue_tag</a> { };</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"></span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> /// Redundant-counter binomial-heap.</span></div><div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="a11203.html"> 180</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11203.html">rc_binomial_heap_tag</a> : <span class="keyword">public</span> <a class="code" href="a11191.html">priority_queue_tag</a> { };</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"></span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> /// Binary-heap (array-based).</span></div><div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="a11207.html"> 183</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11207.html">binary_heap_tag</a> : <span class="keyword">public</span> <a class="code" href="a11191.html">priority_queue_tag</a> { };</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"></span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> /// Thin heap.</span></div><div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="a11211.html"> 186</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a11211.html">thin_heap_tag</a> : <span class="keyword">public</span> <a class="code" href="a11191.html">priority_queue_tag</a> { };<span class="comment"></span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"></span><span class="comment"> //@}</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"></span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"></span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> /**</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> * @defgroup traits Traits</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * @{</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> */</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"></span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> /**</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * @brief Represents no type, or absence of type, for template tricks.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> *</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * In a mapped-policy, indicates that an associative container is a set.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> *</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> * In a list-update policy, indicates that each link does not need</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * metadata.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> *</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> * In a hash policy, indicates that the combining hash function</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> * is actually a ranged hash function.</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> *</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> * In a probe policy, indicates that the combining probe function</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * is actually a ranged probe function.</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> */</span></div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="a11215.html"> 210</a></span>  <span class="keyword">struct </span><a class="code" href="a11215.html">null_type</a> { };</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"></span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> /// A null node updator, indicating that no node updates are required.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Tp2, <span class="keyword">typename</span> _Tp3, <span class="keyword">typename</span> _Tp4></div><div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="a11219.html"> 214</a></span>  <span class="keyword">struct </span><a class="code" href="a11219.html">null_node_update</a> : <span class="keyword">public</span> <a class="code" href="a11215.html">null_type</a></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  { };</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"></span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> /// Primary template, container traits base.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Tag></div><div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="a11223.html"> 220</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a>;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"></span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"> /// Specialization, cc hash.</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00224"></a><span class="lineno"><a class="line" href="a11227.html"> 224</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11151.html">cc_hash_tag</a>></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">typedef</span> <a class="code" href="a11151.html">cc_hash_tag</a> <a class="code" href="a11151.html">container_category</a>;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">typedef</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a> <a class="code" href="a11123.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  {</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  };</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  };</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"></span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> /// Specialization, gp hash.</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00240"></a><span class="lineno"><a class="line" href="a11231.html"> 240</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11155.html">gp_hash_tag</a>></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  {</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">typedef</span> <a class="code" href="a11155.html">gp_hash_tag</a> <a class="code" href="a11155.html">container_category</a>;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">typedef</span> <a class="code" href="a11119.html">basic_invalidation_guarantee</a> <a class="code" href="a11119.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  };</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  };</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"></span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> /// Specialization, rb tree.</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="a11235.html"> 256</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11167.html">rb_tree_tag</a>></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  {</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">typedef</span> <a class="code" href="a11167.html">rb_tree_tag</a> <a class="code" href="a11167.html">container_category</a>;</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">typedef</span> <a class="code" href="a11127.html">range_invalidation_guarantee</a> <a class="code" href="a11127.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  {</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  order_preserving = <span class="keyword">true</span>,</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  reverse_iteration = <span class="keyword">true</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  };</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  };</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"></span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"> /// Specialization, splay tree.</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="a11239.html"> 272</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11171.html">splay_tree_tag</a>></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">typedef</span> <a class="code" href="a11171.html">splay_tree_tag</a> <a class="code" href="a11171.html">container_category</a>;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">typedef</span> <a class="code" href="a11127.html">range_invalidation_guarantee</a> <a class="code" href="a11127.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  {</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  order_preserving = <span class="keyword">true</span>,</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  reverse_iteration = <span class="keyword">true</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  };</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  };</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"></span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> /// Specialization, ov tree.</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00288"></a><span class="lineno"><a class="line" href="a11243.html"> 288</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11175.html">ov_tree_tag</a>></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  {</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">typedef</span> <a class="code" href="a11175.html">ov_tree_tag</a> <a class="code" href="a11175.html">container_category</a>;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">typedef</span> <a class="code" href="a11119.html">basic_invalidation_guarantee</a> <a class="code" href="a11119.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  order_preserving = <span class="keyword">true</span>,</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  erase_can_throw = <span class="keyword">true</span>,</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  split_join_can_throw = <span class="keyword">true</span>,</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  };</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  };</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"></span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> /// Specialization, pat trie.</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00304"></a><span class="lineno"><a class="line" href="a11247.html"> 304</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11183.html">pat_trie_tag</a>></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">typedef</span> <a class="code" href="a11183.html">pat_trie_tag</a> <a class="code" href="a11183.html">container_category</a>;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">typedef</span> <a class="code" href="a11127.html">range_invalidation_guarantee</a> <a class="code" href="a11127.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  order_preserving = <span class="keyword">true</span>,</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  split_join_can_throw = <span class="keyword">true</span>,</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  reverse_iteration = <span class="keyword">true</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  };</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  };</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"></span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> /// Specialization, list update.</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00320"></a><span class="lineno"><a class="line" href="a11251.html"> 320</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11187.html">list_update_tag</a>></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  {</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">typedef</span> <a class="code" href="a11187.html">list_update_tag</a> <a class="code" href="a11187.html">container_category</a>;</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">typedef</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a> <a class="code" href="a11123.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  {</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  };</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  };</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"></span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> /// Specialization, pairing heap.</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00336"></a><span class="lineno"><a class="line" href="a11255.html"> 336</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11195.html">pairing_heap_tag</a>></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  {</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">typedef</span> <a class="code" href="a11195.html">pairing_heap_tag</a> <a class="code" href="a11195.html">container_category</a>;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">typedef</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a> <a class="code" href="a11123.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  };</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  };</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="comment"></span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"> /// Specialization, thin heap.</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="a11259.html"> 352</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11211.html">thin_heap_tag</a>></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">typedef</span> <a class="code" href="a11211.html">thin_heap_tag</a> <a class="code" href="a11211.html">container_category</a>;</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">typedef</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a> <a class="code" href="a11123.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  {</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  };</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  };</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="comment"></span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> <span class="comment"> /// Specialization, binomial heap.</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00368"></a><span class="lineno"><a class="line" href="a11263.html"> 368</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11199.html">binomial_heap_tag</a>></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">typedef</span> <a class="code" href="a11199.html">binomial_heap_tag</a> <a class="code" href="a11199.html">container_category</a>;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">typedef</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a> <a class="code" href="a11123.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  {</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  };</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  };</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"></span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> /// Specialization, rc binomial heap.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00384"></a><span class="lineno"><a class="line" href="a11267.html"> 384</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11203.html">rc_binomial_heap_tag</a>></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  {</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">typedef</span> <a class="code" href="a11203.html">rc_binomial_heap_tag</a> <a class="code" href="a11203.html">container_category</a>;</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">typedef</span> <a class="code" href="a11123.html">point_invalidation_guarantee</a> <a class="code" href="a11123.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  {</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  split_join_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  };</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  };</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"></span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> /// Specialization, binary heap.</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"></span> <span class="keyword">template</span><></div><div class="line"><a name="l00400"></a><span class="lineno"><a class="line" href="a11271.html"> 400</a></span>  <span class="keyword">struct </span><a class="code" href="a11223.html">container_traits_base</a><<a class="code" href="a11207.html">binary_heap_tag</a>></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  {</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">typedef</span> <a class="code" href="a11207.html">binary_heap_tag</a> <a class="code" href="a11207.html">container_category</a>;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">typedef</span> <a class="code" href="a11119.html">basic_invalidation_guarantee</a> <a class="code" href="a11119.html">invalidation_guarantee</a>;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  order_preserving = <span class="keyword">false</span>,</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  erase_can_throw = <span class="keyword">false</span>,</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  split_join_can_throw = <span class="keyword">true</span>,</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  reverse_iteration = <span class="keyword">false</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  };</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  };</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"></span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> /// Container traits.</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"></span> <span class="comment">// See Matt Austern for the name, S. Meyers MEFC++ #2, others.</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Cntnr></div><div class="line"><a name="l00418"></a><span class="lineno"><a class="line" href="a11275.html"> 418</a></span>  <span class="keyword">struct </span><a class="code" href="a11275.html">container_traits</a></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  : <span class="keyword">public</span> <a class="code" href="a11223.html">container_traits_base</a><typename Cntnr::container_category></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">typedef</span> Cntnr container_type;</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> Cntnr::container_category container_category;</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">typedef</span> <a class="code" href="a11223.html">container_traits_base<container_category></a> <a class="code" href="a11223.html">base_type</a>;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::invalidation_guarantee invalidation_guarantee;</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  {<span class="comment"></span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> /// True only if Cntnr objects guarantee storing keys by order.</span></div><div class="line"><a name="l00429"></a><span class="lineno"><a class="line" href="a11275.html#ace925c8be06b3640abb7b6f486290daba7a8084f7409a761ceaa0de948e82363d"> 429</a></span> <span class="comment"></span> <a class="code" href="a11275.html#ace925c8be06b3640abb7b6f486290daba7a8084f7409a761ceaa0de948e82363d">order_preserving</a> = base_type::order_preserving,</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"></span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> /// True only if erasing a key can throw.</span></div><div class="line"><a name="l00432"></a><span class="lineno"><a class="line" href="a11275.html#ace925c8be06b3640abb7b6f486290daba04adc70b657d67c81caf60c8722c9ada"> 432</a></span> <span class="comment"></span> <a class="code" href="a11275.html#ace925c8be06b3640abb7b6f486290daba04adc70b657d67c81caf60c8722c9ada">erase_can_throw</a> = base_type::erase_can_throw,</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"></span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> /// True only if split or join operations can throw.</span></div><div class="line"><a name="l00435"></a><span class="lineno"><a class="line" href="a11275.html#ace925c8be06b3640abb7b6f486290daba065162f99ac47cfa946b17a85f2e5f1e"> 435</a></span> <span class="comment"></span> <a class="code" href="a11275.html#ace925c8be06b3640abb7b6f486290daba065162f99ac47cfa946b17a85f2e5f1e">split_join_can_throw</a> = base_type::split_join_can_throw,</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"></span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> /// True only reverse iterators are supported.</span></div><div class="line"><a name="l00438"></a><span class="lineno"><a class="line" href="a11275.html#ace925c8be06b3640abb7b6f486290dabad65704fae44294b3e727d6704fd61ab6"> 438</a></span> <span class="comment"></span> <a class="code" href="a11275.html#ace925c8be06b3640abb7b6f486290dabad65704fae44294b3e727d6704fd61ab6">reverse_iteration</a> = base_type::reverse_iteration</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  };</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  };<span class="comment"></span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"></span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">namespace </span>detail</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  {<span class="comment"></span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> /// Dispatch mechanism, primary template for associative types.</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> Key, <span class="keyword">typename</span> Mapped, <span class="keyword">typename</span> _Alloc, <span class="keyword">typename</span> Tag,</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">typename</span> Policy_Tl = null_type></div><div class="line"><a name="l00449"></a><span class="lineno"><a class="line" href="a11279.html"> 449</a></span>  <span class="keyword">struct </span><a class="code" href="a11279.html">container_base_dispatch</a>;</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  } <span class="comment">// namespace detail</span><span class="comment"></span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"></span>} <span class="comment">// namespace __gnu_pbds</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="a11167_html"><div class="ttname"><a href="a11167.html">__gnu_pbds::rb_tree_tag</a></div><div class="ttdoc">Red-black tree.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00153">tag_and_trait.hpp:153</a></div></div>
<div class="ttc" id="a01151_html"><div class="ttname"><a href="a01151.html">type_utils.hpp</a></div></div>
<div class="ttc" id="a11155_html"><div class="ttname"><a href="a11155.html">__gnu_pbds::gp_hash_tag</a></div><div class="ttdoc">General-probing hash.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00144">tag_and_trait.hpp:144</a></div></div>
<div class="ttc" id="a11143_html"><div class="ttname"><a href="a11143.html">__gnu_pbds::associative_tag</a></div><div class="ttdoc">Basic associative-container.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00135">tag_and_trait.hpp:135</a></div></div>
<div class="ttc" id="a11199_html"><div class="ttname"><a href="a11199.html">__gnu_pbds::binomial_heap_tag</a></div><div class="ttdoc">Binomial-heap.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00177">tag_and_trait.hpp:177</a></div></div>
<div class="ttc" id="a00656_html"><div class="ttname"><a href="a00656.html">c++config.h</a></div></div>
<div class="ttc" id="a11187_html"><div class="ttname"><a href="a11187.html">__gnu_pbds::list_update_tag</a></div><div class="ttdoc">List-update.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00168">tag_and_trait.hpp:168</a></div></div>
<div class="ttc" id="a11275_html"><div class="ttname"><a href="a11275.html">__gnu_pbds::container_traits</a></div><div class="ttdoc">Container traits.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00418">tag_and_trait.hpp:418</a></div></div>
<div class="ttc" id="a11175_html"><div class="ttname"><a href="a11175.html">__gnu_pbds::ov_tree_tag</a></div><div class="ttdoc">Ordered-vector tree.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00159">tag_and_trait.hpp:159</a></div></div>
<div class="ttc" id="a11163_html"><div class="ttname"><a href="a11163.html">__gnu_pbds::tree_tag</a></div><div class="ttdoc">Basic tree structure.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00150">tag_and_trait.hpp:150</a></div></div>
<div class="ttc" id="a01593_html"><div class="ttname"><a href="a01593.html">__gnu_pbds</a></div><div class="ttdoc">GNU extensions for policy-based data structures for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a01109_source.html#l00051">assoc_container.hpp:51</a></div></div>
<div class="ttc" id="a11195_html"><div class="ttname"><a href="a11195.html">__gnu_pbds::pairing_heap_tag</a></div><div class="ttdoc">Pairing-heap.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00174">tag_and_trait.hpp:174</a></div></div>
<div class="ttc" id="a11183_html"><div class="ttname"><a href="a11183.html">__gnu_pbds::pat_trie_tag</a></div><div class="ttdoc">PATRICIA trie.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00165">tag_and_trait.hpp:165</a></div></div>
<div class="ttc" id="a11275_html_ace925c8be06b3640abb7b6f486290dabad65704fae44294b3e727d6704fd61ab6"><div class="ttname"><a href="a11275.html#ace925c8be06b3640abb7b6f486290dabad65704fae44294b3e727d6704fd61ab6">__gnu_pbds::container_traits::reverse_iteration</a></div><div class="ttdoc">True only reverse iterators are supported.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00438">tag_and_trait.hpp:438</a></div></div>
<div class="ttc" id="a11211_html"><div class="ttname"><a href="a11211.html">__gnu_pbds::thin_heap_tag</a></div><div class="ttdoc">Thin heap.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00186">tag_and_trait.hpp:186</a></div></div>
<div class="ttc" id="a11131_html"><div class="ttname"><a href="a11131.html">__gnu_pbds::container_tag</a></div><div class="ttdoc">Base data structure tag.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00125">tag_and_trait.hpp:125</a></div></div>
<div class="ttc" id="a11275_html_ace925c8be06b3640abb7b6f486290daba065162f99ac47cfa946b17a85f2e5f1e"><div class="ttname"><a href="a11275.html#ace925c8be06b3640abb7b6f486290daba065162f99ac47cfa946b17a85f2e5f1e">__gnu_pbds::container_traits::split_join_can_throw</a></div><div class="ttdoc">True only if split or join operations can throw.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00435">tag_and_trait.hpp:435</a></div></div>
<div class="ttc" id="a11151_html"><div class="ttname"><a href="a11151.html">__gnu_pbds::cc_hash_tag</a></div><div class="ttdoc">Collision-chaining hash.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00141">tag_and_trait.hpp:141</a></div></div>
<div class="ttc" id="a11275_html_ace925c8be06b3640abb7b6f486290daba7a8084f7409a761ceaa0de948e82363d"><div class="ttname"><a href="a11275.html#ace925c8be06b3640abb7b6f486290daba7a8084f7409a761ceaa0de948e82363d">__gnu_pbds::container_traits::order_preserving</a></div><div class="ttdoc">True only if Cntnr objects guarantee storing keys by order.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00429">tag_and_trait.hpp:429</a></div></div>
<div class="ttc" id="a11219_html"><div class="ttname"><a href="a11219.html">__gnu_pbds::null_node_update</a></div><div class="ttdoc">A null node updator, indicating that no node updates are required.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00214">tag_and_trait.hpp:214</a></div></div>
<div class="ttc" id="a11119_html"><div class="ttname"><a href="a11119.html">__gnu_pbds::basic_invalidation_guarantee</a></div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00093">tag_and_trait.hpp:93</a></div></div>
<div class="ttc" id="a11171_html"><div class="ttname"><a href="a11171.html">__gnu_pbds::splay_tree_tag</a></div><div class="ttdoc">Splay tree.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00156">tag_and_trait.hpp:156</a></div></div>
<div class="ttc" id="a11207_html"><div class="ttname"><a href="a11207.html">__gnu_pbds::binary_heap_tag</a></div><div class="ttdoc">Binary-heap (array-based).</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00183">tag_and_trait.hpp:183</a></div></div>
<div class="ttc" id="a11139_html"><div class="ttname"><a href="a11139.html">__gnu_pbds::string_tag</a></div><div class="ttdoc">Basic string container, inclusive of strings, ropes, etc.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00132">tag_and_trait.hpp:132</a></div></div>
<div class="ttc" id="a01530_html_ga3a45dab56a44f762c97eb0eaee17f6f2"><div class="ttname"><a href="a01530.html#ga3a45dab56a44f762c97eb0eaee17f6f2">__gnu_pbds::trivial_iterator_difference_type</a></div><div class="ttdeci">void trivial_iterator_difference_type</div><div class="ttdoc">Prohibit moving trivial iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00079">tag_and_trait.hpp:79</a></div></div>
<div class="ttc" id="a11191_html"><div class="ttname"><a href="a11191.html">__gnu_pbds::priority_queue_tag</a></div><div class="ttdoc">Basic priority-queue.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00171">tag_and_trait.hpp:171</a></div></div>
<div class="ttc" id="a11127_html"><div class="ttname"><a href="a11127.html">__gnu_pbds::range_invalidation_guarantee</a></div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00114">tag_and_trait.hpp:114</a></div></div>
<div class="ttc" id="a11215_html"><div class="ttname"><a href="a11215.html">__gnu_pbds::null_type</a></div><div class="ttdoc">Represents no type, or absence of type, for template tricks.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00210">tag_and_trait.hpp:210</a></div></div>
<div class="ttc" id="a11115_html"><div class="ttname"><a href="a11115.html">__gnu_pbds::trivial_iterator_tag</a></div><div class="ttdoc">A trivial iterator tag. Signifies that the iterators has none of std::iterators's movement abilities.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00075">tag_and_trait.hpp:75</a></div></div>
<div class="ttc" id="a11275_html_ace925c8be06b3640abb7b6f486290daba04adc70b657d67c81caf60c8722c9ada"><div class="ttname"><a href="a11275.html#ace925c8be06b3640abb7b6f486290daba04adc70b657d67c81caf60c8722c9ada">__gnu_pbds::container_traits::erase_can_throw</a></div><div class="ttdoc">True only if erasing a key can throw.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00432">tag_and_trait.hpp:432</a></div></div>
<div class="ttc" id="a11203_html"><div class="ttname"><a href="a11203.html">__gnu_pbds::rc_binomial_heap_tag</a></div><div class="ttdoc">Redundant-counter binomial-heap.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00180">tag_and_trait.hpp:180</a></div></div>
<div class="ttc" id="a11159_html"><div class="ttname"><a href="a11159.html">__gnu_pbds::basic_branch_tag</a></div><div class="ttdoc">Basic branch structure.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00147">tag_and_trait.hpp:147</a></div></div>
<div class="ttc" id="a11147_html"><div class="ttname"><a href="a11147.html">__gnu_pbds::basic_hash_tag</a></div><div class="ttdoc">Basic hash structure.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00138">tag_and_trait.hpp:138</a></div></div>
<div class="ttc" id="a11135_html"><div class="ttname"><a href="a11135.html">__gnu_pbds::sequence_tag</a></div><div class="ttdoc">Basic sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00129">tag_and_trait.hpp:129</a></div></div>
<div class="ttc" id="a11223_html"><div class="ttname"><a href="a11223.html">__gnu_pbds::container_traits_base</a></div><div class="ttdoc">Primary template, container traits base.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00220">tag_and_trait.hpp:220</a></div></div>
<div class="ttc" id="a11123_html"><div class="ttname"><a href="a11123.html">__gnu_pbds::point_invalidation_guarantee</a></div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00103">tag_and_trait.hpp:103</a></div></div>
<div class="ttc" id="a11279_html"><div class="ttname"><a href="a11279.html">__gnu_pbds::detail::container_base_dispatch</a></div><div class="ttdoc">Dispatch mechanism, primary template for associative types.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00449">tag_and_trait.hpp:449</a></div></div>
<div class="ttc" id="a11179_html"><div class="ttname"><a href="a11179.html">__gnu_pbds::trie_tag</a></div><div class="ttdoc">Basic trie structure.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00162">tag_and_trait.hpp:162</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_029334e92d1e3db3ea7d86241898d8b1.html">ext</a></li><li class="navelem"><a class="el" href="dir_6911148039c30421632b2591b843ac64.html">pb_ds</a></li><li class="navelem"><a class="el" href="a01124.html">tag_and_trait.hpp</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
1006
