<!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++: bin_search_tree_.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('a01211_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">bin_search_tree_.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01211.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 bin_search_tree_/bin_search_tree_.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation class for binary search tree.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> */</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include <<a class="code" href="a01112.html">ext/pb_ds/exception.hpp</a>></span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include <<a class="code" href="a01127.html">ext/pb_ds/tree_policy.hpp</a>></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include <<a class="code" href="a01289.html">ext/pb_ds/detail/eq_fn/eq_by_less.hpp</a>></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <<a class="code" href="a01154.html">ext/pb_ds/detail/types_traits.hpp</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a01133.html">ext/pb_ds/detail/cond_dealtor.hpp</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="preprocessor">#include <<a class="code" href="a01148.html">ext/pb_ds/detail/tree_trace_base.hpp</a>></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#include <<a class="code" href="a01139.html">ext/pb_ds/detail/debug_map_base.hpp</a>></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <<a class="code" href="a00176.html">utility</a>></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#include <<a class="code" href="a00071.html">functional</a>></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">#include <<a class="code" href="a00746.html">debug/debug.h</a>></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">namespace </span><a class="code" href="a01593.html">__gnu_pbds</a></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">namespace </span>detail</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#ifdef PB_DS_DATA_TRUE_INDICATOR</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#define PB_DS_BIN_TREE_NAME bin_search_tree_map</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#ifdef PB_DS_DATA_FALSE_INDICATOR</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#define PB_DS_BIN_TREE_NAME bin_search_tree_set</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#define PB_DS_CLASS_T_DEC \</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"> template<typename Key, typename Mapped, typename Cmp_Fn, \</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"> typename Node_And_It_Traits, typename _Alloc></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor">#define PB_DS_CLASS_C_DEC \</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor"> PB_DS_BIN_TREE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc></span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor">#define PB_DS_BIN_TREE_TRAITS_BASE \</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"> types_traits<Key, Mapped, _Alloc, false></span></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="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor">#define PB_DS_DEBUG_MAP_BASE_C_DEC \</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"> debug_map_base<Key, eq_by_less<Key, Cmp_Fn>, \</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"> typename _Alloc::template rebind<Key>::other::const_reference></span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor">#ifdef PB_DS_TREE_TRACE</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor">#define PB_DS_TREE_TRACE_BASE_C_DEC \</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor"> tree_trace_base<typename Node_And_It_Traits::node_const_iterator, \</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor"> typename Node_And_It_Traits::node_iterator, \</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor"> Cmp_Fn, true, _Alloc></span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">/*</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * @brief Binary search tree (BST).</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> *</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> * This implementation uses an idea from the SGI STL (using a @a</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * header node which is needed for efficient iteration).</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="keyword">template</span><<span class="keyword">typename</span> Key, <span class="keyword">typename</span> Mapped, <span class="keyword">typename</span> Cmp_Fn,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typename</span> Node_And_It_Traits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">class </span>PB_DS_BIN_TREE_NAME :</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">public</span> PB_DS_DEBUG_MAP_BASE_C_DEC,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor">#ifdef PB_DS_TREE_TRACE</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">public</span> PB_DS_TREE_TRACE_BASE_C_DEC,</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">public</span> Cmp_Fn,</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">public</span> PB_DS_BIN_TREE_TRAITS_BASE,</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">public</span> Node_And_It_Traits::node_update</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> Node_And_It_Traits traits_type;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">typedef</span> PB_DS_BIN_TREE_TRAITS_BASE traits_base;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">typedef</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">typename</span> _Alloc::template rebind<typename traits_type::node>::other</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  node_allocator;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> node_allocator::value_type node;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> node_allocator::pointer node_pointer;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::null_node_update_pointer</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  null_node_update_pointer;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typedef</span> cond_dealtor<node, _Alloc> cond_dealtor_t;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">typedef</span> PB_DS_DEBUG_MAP_BASE_C_DEC debug_base;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::size_type size_type;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::difference_type difference_type;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::key_type key_type;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::key_pointer key_pointer;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::key_const_pointer key_const_pointer;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::key_reference key_reference;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::key_const_reference key_const_reference;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="preprocessor">#ifdef PB_DS_DATA_TRUE_INDICATOR</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::mapped_type mapped_type;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::mapped_pointer mapped_pointer;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::mapped_const_pointer mapped_const_pointer;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::mapped_reference mapped_reference;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::mapped_const_reference mapped_const_reference;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::value_type value_type;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::pointer pointer;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::const_pointer const_pointer;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::reference reference;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_base::const_reference const_reference;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::point_const_iterator point_const_iterator;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">typedef</span> point_const_iterator const_iterator;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::point_iterator point_iterator;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keyword">typedef</span> point_iterator iterator;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::const_reverse_iterator const_reverse_iterator;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::reverse_iterator reverse_iterator;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::node_const_iterator node_const_iterator;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::node_iterator node_iterator;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> traits_type::node_update node_update;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">typedef</span> Cmp_Fn cmp_fn;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  PB_DS_BIN_TREE_NAME();</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  PB_DS_BIN_TREE_NAME(<span class="keyword">const</span> Cmp_Fn&);</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  PB_DS_BIN_TREE_NAME(<span class="keyword">const</span> Cmp_Fn&, <span class="keyword">const</span> node_update&);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  PB_DS_BIN_TREE_NAME(<span class="keyword">const</span> PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  swap(PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> </div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  ~PB_DS_BIN_TREE_NAME();</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> </div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  empty() <span class="keyword">const</span>;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">inline</span> size_type</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  size() <span class="keyword">const</span>;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">inline</span> size_type</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  max_size() <span class="keyword">const</span>;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  Cmp_Fn&</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  get_cmp_fn();</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">const</span> Cmp_Fn&</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  get_cmp_fn() <span class="keyword">const</span>;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">inline</span> point_iterator</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  lower_bound(key_const_reference);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">inline</span> point_const_iterator</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  lower_bound(key_const_reference) <span class="keyword">const</span>;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">inline</span> point_iterator</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  upper_bound(key_const_reference);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">inline</span> point_const_iterator</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  upper_bound(key_const_reference) <span class="keyword">const</span>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">inline</span> point_iterator</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  find(key_const_reference);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">inline</span> point_const_iterator</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  find(key_const_reference) <span class="keyword">const</span>;</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>  <span class="keyword">inline</span> iterator</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">inline</span> const_iterator</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">inline</span> iterator</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">inline</span> const_iterator</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="a01541.html#a579ff3807b61f57bda29d023b3918504">end</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">inline</span> reverse_iterator</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="a01541.html#ae16f6e3954ee80febd7a13ca23c0cb69">rbegin</a>();</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>  <span class="keyword">inline</span> const_reverse_iterator</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="a01541.html#ae16f6e3954ee80febd7a13ca23c0cb69">rbegin</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">inline</span> reverse_iterator</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="a01541.html#ac61454493a9b25de6eb36656e6e4213e">rend</a>();</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="keyword">inline</span> const_reverse_iterator</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="a01541.html#ac61454493a9b25de6eb36656e6e4213e">rend</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"></span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"> /// Returns a const node_iterator corresponding to the node at the</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"> /// root of the tree.</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"></span> <span class="keyword">inline</span> node_const_iterator</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  node_begin() <span class="keyword">const</span>;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"></span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> /// Returns a node_iterator corresponding to the node at the</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> /// root of the tree.</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"></span> <span class="keyword">inline</span> node_iterator</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  node_begin();</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"></span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> /// Returns a const node_iterator corresponding to a node just</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> /// after a leaf of the tree.</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"></span> <span class="keyword">inline</span> node_const_iterator</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  node_end() <span class="keyword">const</span>;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"></span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> /// Returns a node_iterator corresponding to a node just</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> /// after a leaf of the tree.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"></span> <span class="keyword">inline</span> node_iterator</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  node_end();</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  clear();</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>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  value_swap(PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  initialize_min_max();</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">inline</span> iterator</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  insert_imp_empty(const_reference);</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">inline</span> iterator</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  insert_leaf_new(const_reference, node_pointer, <span class="keywordtype">bool</span>);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">inline</span> node_pointer</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  get_new_node_for_leaf_insert(const_reference, <a class="code" href="a01479.html#gaebe6729ab5488ecc76c762873d226857">false_type</a>);</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>  <span class="keyword">inline</span> node_pointer</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  get_new_node_for_leaf_insert(const_reference, <a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> </div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  actual_erase_node(node_pointer);</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="keyword">inline</span> <a class="code" href="a07767.html">std::pair<node_pointer, bool></a></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  erase(node_pointer);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  update_min_max_for_erased_node(node_pointer);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  clear_imp(node_pointer);</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">inline</span> <a class="code" href="a07767.html">std::pair<point_iterator, bool></a></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  insert_leaf(const_reference);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  rotate_left(node_pointer);</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>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  rotate_right(node_pointer);</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  rotate_parent(node_pointer);</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">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  apply_update(node_pointer, null_node_update_pointer);</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">template</span><<span class="keyword">typename</span> Node_Update_></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  apply_update(node_pointer, Node_Update_*);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  update_to_top(node_pointer, null_node_update_pointer);</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>  <span class="keyword">template</span><<span class="keyword">typename</span> Node_Update_></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  update_to_top(node_pointer, Node_Update_*);</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> </div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  join_prep(PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  join_finish(PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  split_prep(key_const_reference, PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  split_finish(PB_DS_CLASS_C_DEC&);</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>  size_type</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  recursive_count(node_pointer) <span class="keyword">const</span>;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  assert_valid(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  structure_only_assert_valid(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  assert_node_consistent(<span class="keyword">const</span> node_pointer, <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> <span class="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  assert_iterators(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  assert_consistent_with_debug_base(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</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="keywordtype">void</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  assert_node_consistent_with_left(<span class="keyword">const</span> node_pointer,</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  assert_node_consistent_with_right(<span class="keyword">const</span> node_pointer,</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  assert_consistent_with_debug_base(<span class="keyword">const</span> node_pointer,</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  assert_min(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  assert_min_imp(<span class="keyword">const</span> node_pointer, <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  assert_max(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  assert_max_imp(<span class="keyword">const</span> node_pointer, <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> </div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  assert_size(<span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</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="keyword">typedef</span> <a class="code" href="a07767.html">std::pair<const_pointer, const_pointer></a> node_consistent_t;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  node_consistent_t</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  assert_node_consistent_(<span class="keyword">const</span> node_pointer, <span class="keyword">const</span> <span class="keywordtype">char</span>*, <span class="keywordtype">int</span>) <span class="keyword">const</span>;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  initialize();</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  node_pointer</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  recursive_copy_node(<span class="keyword">const</span> node_pointer);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> </div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  node_pointer m_p_head;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  size_type m_size;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">static</span> node_allocator s_node_allocator;</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  };</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="preprocessor">#define PB_DS_STRUCT_ONLY_ASSERT_VALID(X) \</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="preprocessor"> _GLIBCXX_DEBUG_ONLY(X.structure_only_assert_valid(__FILE__, __LINE__);)</span></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="preprocessor">#define PB_DS_ASSERT_NODE_CONSISTENT(_Node) \</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="preprocessor"> _GLIBCXX_DEBUG_ONLY(assert_node_consistent(_Node, __FILE__, __LINE__);)</span></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="preprocessor">#include <<a class="code" href="a16575.html">ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp</a>></span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="preprocessor">#include <<a class="code" href="a16923.html">ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp</a>></span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="preprocessor">#include <<a class="code" href="a16638.html">ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp</a>></span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="preprocessor">#include <<a class="code" href="a16869.html">ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp</a>></span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="preprocessor">#include <<a class="code" href="a16701.html">ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp</a>></span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="preprocessor">#include <<a class="code" href="a16755.html">ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp</a>></span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="preprocessor">#include <<a class="code" href="a16836.html">ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp</a>></span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="preprocessor">#include <<a class="code" href="a17124.html">ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp</a>></span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="preprocessor">#include <<a class="code" href="a17091.html">ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp</a>></span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="preprocessor">#include <<a class="code" href="a17031.html">ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp</a>></span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="preprocessor">#undef PB_DS_ASSERT_NODE_CONSISTENT</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="preprocessor">#undef PB_DS_STRUCT_ONLY_ASSERT_VALID</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="preprocessor">#undef PB_DS_CLASS_C_DEC</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="preprocessor">#undef PB_DS_CLASS_T_DEC</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> <span class="preprocessor">#undef PB_DS_BIN_TREE_NAME</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="preprocessor">#undef PB_DS_BIN_TREE_TRAITS_BASE</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="preprocessor">#undef PB_DS_DEBUG_MAP_BASE_C_DEC</span></div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="preprocessor">#ifdef PB_DS_TREE_TRACE</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="preprocessor">#undef PB_DS_TREE_TRACE_BASE_C_DEC</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  } <span class="comment">// namespace detail</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> } <span class="comment">// namespace __gnu_pbds</span></div><div class="ttc" id="a01151_html"><div class="ttname"><a href="a01151.html">type_utils.hpp</a></div></div>
<div class="ttc" id="a07767_html"><div class="ttname"><a href="a07767.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
<div class="ttc" id="a01479_html_ga6a860513044e23d34e553ea986e83fa1"><div class="ttname"><a href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">std::true_type</a></div><div class="ttdeci">integral_constant< bool, true > true_type</div><div class="ttdoc">The type used as a compile-time boolean with true value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00075">type_traits:75</a></div></div>
<div class="ttc" id="a01148_html"><div class="ttname"><a href="a01148.html">tree_trace_base.hpp</a></div></div>
<div class="ttc" id="a17031_html"><div class="ttname"><a href="a17031.html">policy_access_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16869_html"><div class="ttname"><a href="a16869.html">insert_fn_imps.hpp</a></div></div>
<div class="ttc" id="a00176_html"><div class="ttname"><a href="a00176.html">utility</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="a01139_html"><div class="ttname"><a href="a01139.html">debug_map_base.hpp</a></div></div>
<div class="ttc" id="a01127_html"><div class="ttname"><a href="a01127.html">tree_policy.hpp</a></div></div>
<div class="ttc" id="a17124_html"><div class="ttname"><a href="a17124.html">split_join_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16836_html"><div class="ttname"><a href="a16836.html">info_fn_imps.hpp</a></div></div>
<div class="ttc" id="a17091_html"><div class="ttname"><a href="a17091.html">rotate_fn_imps.hpp</a></div></div>
<div class="ttc" id="a00746_html"><div class="ttname"><a href="a00746.html">debug.h</a></div></div>
<div class="ttc" id="a16701_html"><div class="ttname"><a href="a16701.html">erase_fn_imps.hpp</a></div></div>
<div class="ttc" id="a01112_html"><div class="ttname"><a href="a01112.html">exception.hpp</a></div></div>
<div class="ttc" id="a01479_html_gaebe6729ab5488ecc76c762873d226857"><div class="ttname"><a href="a01479.html#gaebe6729ab5488ecc76c762873d226857">std::false_type</a></div><div class="ttdeci">integral_constant< bool, false > false_type</div><div class="ttdoc">The type used as a compile-time boolean with false value.</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00078">type_traits:78</a></div></div>
<div class="ttc" id="a16923_html"><div class="ttname"><a href="a16923.html">iterators_fn_imps.hpp</a></div></div>
<div class="ttc" id="a01541_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01541.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00099">initializer_list:99</a></div></div>
<div class="ttc" id="a16755_html"><div class="ttname"><a href="a16755.html">find_fn_imps.hpp</a></div></div>
<div class="ttc" id="a01154_html"><div class="ttname"><a href="a01154.html">types_traits.hpp</a></div></div>
<div class="ttc" id="a01541_html_ae16f6e3954ee80febd7a13ca23c0cb69"><div class="ttname"><a href="a01541.html#ae16f6e3954ee80febd7a13ca23c0cb69">std::rbegin</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR auto rbegin(_Container &__cont) -> decltype(__cont.rbegin())</div><div class="ttdoc">Return a reverse iterator pointing to the last element of the container.</div><div class="ttdef"><b>Definition:</b> <a href="a00458_source.html#l00138">range_access.h:138</a></div></div>
<div class="ttc" id="a16575_html"><div class="ttname"><a href="a16575.html">constructors_destructor_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16638_html"><div class="ttname"><a href="a16638.html">debug_fn_imps.hpp</a></div></div>
<div class="ttc" id="a01541_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01541.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00089">initializer_list:89</a></div></div>
<div class="ttc" id="a01133_html"><div class="ttname"><a href="a01133.html">cond_dealtor.hpp</a></div></div>
<div class="ttc" id="a01289_html"><div class="ttname"><a href="a01289.html">eq_by_less.hpp</a></div></div>
<div class="ttc" id="a00071_html"><div class="ttname"><a href="a00071.html">functional</a></div></div>
<div class="ttc" id="a01541_html_ac61454493a9b25de6eb36656e6e4213e"><div class="ttname"><a href="a01541.html#ac61454493a9b25de6eb36656e6e4213e">std::rend</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR auto rend(_Container &__cont) -> decltype(__cont.rend())</div><div class="ttdoc">Return a reverse iterator pointing one past the first element of the container.</div><div class="ttdef"><b>Definition:</b> <a href="a00458_source.html#l00158">range_access.h:158</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="dir_d2bb2cf1f724d87be8822c254402c3cc.html">detail</a></li><li class="navelem"><a class="el" href="dir_9876b92179593345bb9eabe1b5290b66.html">bin_search_tree_</a></li><li class="navelem"><a class="el" href="a01211.html">bin_search_tree_.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
>
1050
