<!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++: point_iterators.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('a01217_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">point_iterators.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01217.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_/point_iterators.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation class for bin_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">#ifndef PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#define PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <<a class="code" href="a01124.html">ext/pb_ds/tag_and_trait.hpp</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a00746.html">debug/debug.h</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">namespace </span><a class="code" href="a01593.html">__gnu_pbds</a></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">namespace </span>detail</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#define PB_DS_TREE_CONST_IT_C_DEC \</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor"> bin_search_tree_const_it_< \</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor"> Node_Pointer, \</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor"> Value_Type, \</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor"> Pointer, \</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor"> Const_Pointer, \</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor"> Reference, \</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor"> Const_Reference, \</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor"> Is_Forward_Iterator, \</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor"> _Alloc></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">#define PB_DS_TREE_CONST_ODIR_IT_C_DEC \</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor"> bin_search_tree_const_it_< \</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor"> Node_Pointer, \</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"> Value_Type, \</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor"> Pointer, \</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor"> Const_Pointer, \</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"> Reference, \</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor"> Const_Reference, \</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"> !Is_Forward_Iterator, \</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor"> _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_TREE_IT_C_DEC \</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor"> bin_search_tree_it_< \</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor"> Node_Pointer, \</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor"> Value_Type, \</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="preprocessor"> Pointer, \</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="preprocessor"> Const_Pointer, \</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="preprocessor"> Reference, \</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"> Const_Reference, \</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="preprocessor"> Is_Forward_Iterator, \</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"> _Alloc></span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="preprocessor">#define PB_DS_TREE_ODIR_IT_C_DEC \</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor"> bin_search_tree_it_< \</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="preprocessor"> Node_Pointer, \</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor"> Value_Type, \</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor"> Pointer, \</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="preprocessor"> Const_Pointer, \</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="preprocessor"> Reference, \</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="preprocessor"> Const_Reference, \</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor"> !Is_Forward_Iterator, \</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="preprocessor"> _Alloc></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"> /// Const iterator.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> Node_Pointer,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typename</span> Value_Type,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typename</span> Pointer,</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typename</span> Const_Pointer,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typename</span> Reference,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typename</span> Const_Reference,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordtype">bool</span> Is_Forward_Iterator,</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="a11559.html"> 105</a></span>  <span class="keyword">class </span><a class="code" href="a11559.html">bin_search_tree_const_it_</a></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">typedef</span> <a class="code" href="a07667.html">std::bidirectional_iterator_tag</a> <a class="code" href="a07667.html">iterator_category</a>;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::difference_type difference_type;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> Value_Type value_type;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">typedef</span> Pointer pointer;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">typedef</span> Const_Pointer const_pointer;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">typedef</span> Reference reference;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typedef</span> Const_Reference const_reference;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="a11559.html">bin_search_tree_const_it_</a>(<span class="keyword">const</span> Node_Pointer p_nd = 0) </div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  : m_p_nd(const_cast<Node_Pointer>(p_nd))</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  { }</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="a11559.html">bin_search_tree_const_it_</a>(<span class="keyword">const</span> PB_DS_TREE_CONST_ODIR_IT_C_DEC& other) </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  : m_p_nd(other.m_p_nd)</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> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  PB_DS_TREE_CONST_IT_C_DEC& </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  operator=(<span class="keyword">const</span> PB_DS_TREE_CONST_IT_C_DEC& other)</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  m_p_nd = other.m_p_nd;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  PB_DS_TREE_CONST_IT_C_DEC& </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  operator=(<span class="keyword">const</span> PB_DS_TREE_CONST_ODIR_IT_C_DEC& other)</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  {</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  m_p_nd = other.m_p_nd;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</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> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">inline</span> const_pointer</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  operator->()<span class="keyword"> const</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  _GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">return</span> &m_p_nd->m_value;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</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">inline</span> const_reference</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  operator*()<span class="keyword"> const</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  _GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> m_p_nd->m_value;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</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">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  operator==(<span class="keyword">const</span> PB_DS_TREE_CONST_IT_C_DEC & other)<span class="keyword"> const</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> m_p_nd == other.m_p_nd; }</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">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  operator==(<span class="keyword">const</span> PB_DS_TREE_CONST_ODIR_IT_C_DEC & other)<span class="keyword"> const</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> m_p_nd == other.m_p_nd; }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  operator!=(<span class="keyword">const</span> PB_DS_TREE_CONST_IT_C_DEC& other)<span class="keyword"> const</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> m_p_nd != other.m_p_nd; }</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  operator!=(<span class="keyword">const</span> PB_DS_TREE_CONST_ODIR_IT_C_DEC& other)<span class="keyword"> const</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> m_p_nd != other.m_p_nd; }</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>  <span class="keyword">inline</span> PB_DS_TREE_CONST_IT_C_DEC& </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  operator++()</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _GLIBCXX_DEBUG_ASSERT(m_p_nd != 0);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  inc(integral_constant<int,Is_Forward_Iterator>());</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">inline</span> PB_DS_TREE_CONST_IT_C_DEC</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  operator++(<span class="keywordtype">int</span>)</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>  PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  operator++();</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">return</span> ret_it;</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">inline</span> PB_DS_TREE_CONST_IT_C_DEC& </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  operator--()</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  dec(integral_constant<int,Is_Forward_Iterator>());</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</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">inline</span> PB_DS_TREE_CONST_IT_C_DEC</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  operator--(<span class="keywordtype">int</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>  PB_DS_TREE_CONST_IT_C_DEC ret_it(m_p_nd);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  operator--();</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">return</span> ret_it;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  inc(false_type)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  { dec(<a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>()); }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  inc(true_type)</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  {</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (m_p_nd->special()&& </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  m_p_nd->m_p_parent->m_p_parent == m_p_nd)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  m_p_nd = m_p_nd->m_p_left;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</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> </div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">if</span> (m_p_nd->m_p_right != 0)</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  m_p_nd = m_p_nd->m_p_right;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">while</span> (m_p_nd->m_p_left != 0)</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  m_p_nd = m_p_nd->m_p_left;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">return</span>;</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> </div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  Node_Pointer p_y = m_p_nd->m_p_parent;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">while</span> (m_p_nd == p_y->m_p_right)</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>  m_p_nd = p_y;</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  p_y = p_y->m_p_parent;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">if</span> (m_p_nd->m_p_right != p_y)</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  m_p_nd = p_y;</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="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  dec(false_type)</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  { inc(<a class="code" href="a01479.html#ga6a860513044e23d34e553ea986e83fa1">true_type</a>()); }</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  dec(true_type)</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">if</span> (m_p_nd->special() && m_p_nd->m_p_parent->m_p_parent == m_p_nd)</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  {</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  m_p_nd = m_p_nd->m_p_right;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (m_p_nd->m_p_left != 0)</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>  Node_Pointer p_y = m_p_nd->m_p_left;</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">while</span> (p_y->m_p_right != 0)</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  p_y = p_y->m_p_right;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  m_p_nd = p_y;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">return</span>;</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> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  Node_Pointer p_y = m_p_nd->m_p_parent;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">while</span> (m_p_nd == p_y->m_p_left)</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  {</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  m_p_nd = p_y;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  p_y = p_y->m_p_parent;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  }</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (m_p_nd->m_p_left != p_y)</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  m_p_nd = p_y;</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="keyword">public</span>:</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  Node_Pointer m_p_nd;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  };</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"></span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> /// Iterator.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> Node_Pointer,</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">typename</span> Value_Type,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">typename</span> Pointer,</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keyword">typename</span> Const_Pointer,</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">typename</span> Reference,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">typename</span> Const_Reference,</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordtype">bool</span> Is_Forward_Iterator,</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00282"></a><span class="lineno"><a class="line" href="a11563.html"> 282</a></span>  <span class="keyword">class </span><a class="code" href="a11563.html">bin_search_tree_it_</a> : <span class="keyword">public</span> PB_DS_TREE_CONST_IT_C_DEC</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>  <span class="keyword">public</span>:</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="a11563.html">bin_search_tree_it_</a>(<span class="keyword">const</span> Node_Pointer p_nd = 0) </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  : PB_DS_TREE_CONST_IT_C_DEC((Node_Pointer)p_nd)</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  { }</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">inline</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="a11563.html">bin_search_tree_it_</a>(<span class="keyword">const</span> PB_DS_TREE_ODIR_IT_C_DEC& other) </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  : PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)</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> </div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">inline</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  PB_DS_TREE_IT_C_DEC& </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  operator=(<span class="keyword">const</span> PB_DS_TREE_IT_C_DEC& other)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  base_it_type::m_p_nd = other.m_p_nd;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</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></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  PB_DS_TREE_IT_C_DEC& </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  operator=(<span class="keyword">const</span> PB_DS_TREE_ODIR_IT_C_DEC& other)</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  {</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  base_it_type::m_p_nd = other.m_p_nd;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</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>  <span class="keyword">inline</span> <span class="keyword">typename</span> PB_DS_TREE_CONST_IT_C_DEC::pointer</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  operator->()<span class="keyword"> const</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  _GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">return</span> &base_it_type::m_p_nd->m_value;</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> </div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">inline</span> <span class="keyword">typename</span> PB_DS_TREE_CONST_IT_C_DEC::reference</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  operator*()<span class="keyword"> const</span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  _GLIBCXX_DEBUG_ASSERT(base_it_type::m_p_nd != 0);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">return</span> base_it_type::m_p_nd->m_value;</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</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">inline</span> PB_DS_TREE_IT_C_DEC& </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  operator++()</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  PB_DS_TREE_CONST_IT_C_DEC:: operator++();</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</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>  <span class="keyword">inline</span> PB_DS_TREE_IT_C_DEC</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  operator++(<span class="keywordtype">int</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>  PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  operator++();</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">return</span> ret_it;</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> </div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">inline</span> PB_DS_TREE_IT_C_DEC& </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  operator--()</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>  PB_DS_TREE_CONST_IT_C_DEC:: operator--();</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> *<span class="keyword">this</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> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">inline</span> PB_DS_TREE_IT_C_DEC</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  operator--(<span class="keywordtype">int</span>)</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  {</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  PB_DS_TREE_IT_C_DEC ret_it(base_it_type::m_p_nd);</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  operator--();</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">return</span> ret_it;</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> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">typedef</span> PB_DS_TREE_CONST_IT_C_DEC <a class="code" href="a11559.html">base_it_type</a>;</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> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="preprocessor">#undef PB_DS_TREE_CONST_IT_C_DEC</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="preprocessor">#undef PB_DS_TREE_CONST_ODIR_IT_C_DEC</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="preprocessor">#undef PB_DS_TREE_IT_C_DEC</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="preprocessor">#undef PB_DS_TREE_ODIR_IT_C_DEC</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>  } <span class="comment">// namespace detail</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> } <span class="comment">// namespace __gnu_pbds</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="preprocessor">#endif </span></div><div class="ttc" id="a07667_html"><div class="ttname"><a href="a07667.html">std::bidirectional_iterator_tag</a></div><div class="ttdoc">Bidirectional iterators support a superset of forward iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00099">stl_iterator_base_types.h:99</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="a01124_html"><div class="ttname"><a href="a01124.html">tag_and_trait.hpp</a></div></div>
<div class="ttc" id="a11563_html"><div class="ttname"><a href="a11563.html">__gnu_pbds::detail::bin_search_tree_it_</a></div><div class="ttdoc">Iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a01217_source.html#l00282">point_iterators.hpp:282</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="a00746_html"><div class="ttname"><a href="a00746.html">debug.h</a></div></div>
<div class="ttc" id="a11559_html"><div class="ttname"><a href="a11559.html">__gnu_pbds::detail::bin_search_tree_const_it_</a></div><div class="ttdoc">Const iterator.</div><div class="ttdef"><b>Definition:</b> <a href="a01217_source.html#l00105">point_iterators.hpp:105</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="a01217.html">point_iterators.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
>
1053
