<!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++: rb_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('a01385_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">rb_tree_.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01385.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 rb_tree_map_/rb_tree_.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation for Red Black trees.</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="a01145.html">ext/pb_ds/detail/standard_policies.hpp</a>></span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include <<a class="code" href="a00176.html">utility</a>></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include <<a class="code" href="a00182.html">vector</a>></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <assert.h></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> <span class="preprocessor">#define PB_DS_CLASS_T_DEC \</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor"> template<typename Key, typename Mapped, typename Cmp_Fn, \</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor"> typename Node_And_It_Traits, typename _Alloc></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="preprocessor">#ifdef PB_DS_DATA_TRUE_INDICATOR</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor"># define PB_DS_RB_TREE_NAME rb_tree_map</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor"># define PB_DS_RB_TREE_BASE_NAME bin_search_tree_map</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#ifdef PB_DS_DATA_FALSE_INDICATOR</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor"># define PB_DS_RB_TREE_NAME rb_tree_set</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor"># define PB_DS_RB_TREE_BASE_NAME bin_search_tree_set</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#define PB_DS_CLASS_C_DEC \</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor"> PB_DS_RB_TREE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _Alloc></span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#define PB_DS_RB_TREE_BASE \</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor"> PB_DS_RB_TREE_BASE_NAME<Key, Mapped, Cmp_Fn, Node_And_It_Traits, _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="comment"></span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> /**</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * @brief Red-Black tree.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * @ingroup branch-detail</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> *</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * This implementation uses an idea from the SGI STL (using a</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * @a header node which is needed for efficient iteration).</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> */</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Key,</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">typename</span> Mapped,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">typename</span> Cmp_Fn,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">typename</span> Node_And_It_Traits,</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="a11899.html"> 84</a></span>  <span class="keyword">class </span>PB_DS_RB_TREE_NAME : <span class="keyword">public</span> PB_DS_RB_TREE_BASE</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">typedef</span> PB_DS_RB_TREE_BASE base_type;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::node_pointer node_pointer;</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>  <span class="keyword">public</span>:</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">typedef</span> <a class="code" href="a11167.html">rb_tree_tag</a> <a class="code" href="a11167.html">container_category</a>;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typedef</span> Cmp_Fn cmp_fn;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::size_type size_type;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::difference_type difference_type;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::key_type key_type;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::key_pointer key_pointer;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::key_const_pointer key_const_pointer;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::key_reference key_reference;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::key_const_reference key_const_reference;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::mapped_type mapped_type;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::mapped_pointer mapped_pointer;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::mapped_const_pointer mapped_const_pointer;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::mapped_reference mapped_reference;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::mapped_const_reference mapped_const_reference;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::value_type value_type;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::pointer pointer;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::const_pointer const_pointer;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::reference reference;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::const_reference const_reference;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::point_iterator point_iterator;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::const_iterator point_const_iterator;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::iterator iterator;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::const_iterator const_iterator;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::reverse_iterator reverse_iterator;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::const_reverse_iterator const_reverse_iterator;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::node_update node_update;</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>  PB_DS_RB_TREE_NAME();</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>  PB_DS_RB_TREE_NAME(<span class="keyword">const</span> Cmp_Fn&);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  PB_DS_RB_TREE_NAME(<span class="keyword">const</span> Cmp_Fn&, <span class="keyword">const</span> node_update&);</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>  PB_DS_RB_TREE_NAME(<span class="keyword">const</span> PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  swap(PB_DS_CLASS_C_DEC&);</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>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  copy_from_range(It, It);</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> <a class="code" href="a07767.html">std::pair<point_iterator, bool></a></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  insert(const_reference);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">inline</span> mapped_reference</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  operator[](key_const_reference r_key)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="preprocessor">#ifdef PB_DS_DATA_TRUE_INDICATOR</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  _GLIBCXX_DEBUG_ONLY(assert_valid(__FILE__, __LINE__);)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="a07767.html">std::pair<point_iterator, bool></a> ins_pair =</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  base_type::insert_leaf(value_type(r_key, mapped_type()));</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (ins_pair.second == <span class="keyword">true</span>)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  {</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  ins_pair.first.m_p_nd->m_red = <span class="keyword">true</span>;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  _GLIBCXX_DEBUG_ONLY(this->structure_only_assert_valid(__FILE__, __LINE__);)</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  insert_fixup(ins_pair.first.m_p_nd);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  _GLIBCXX_DEBUG_ONLY(assert_valid(__FILE__, __LINE__);)</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">return</span> ins_pair.first.m_p_nd->m_value.second;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> #<span class="keywordflow">else</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  insert(r_key);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">return</span> base_type::s_null_type;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  erase(key_const_reference);</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">inline</span> iterator</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  erase(iterator);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">inline</span> reverse_iterator</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  erase(reverse_iterator);</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">template</span><<span class="keyword">typename</span> Pred></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">inline</span> size_type</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  erase_if(Pred);</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="keywordtype">void</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  join(PB_DS_CLASS_C_DEC&);</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  split(key_const_reference, 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="keyword">private</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="preprocessor">#ifdef _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</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="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  size_type</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</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="l00186"></a><span class="lineno"> 186</span> <span class="preprocessor">#endif</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> <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  is_effectively_black(<span class="keyword">const</span> node_pointer);</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  initialize();</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>  <span class="keywordtype">void</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  insert_fixup(node_pointer);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  erase_node(node_pointer);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  remove_node(node_pointer);</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="keywordtype">void</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  remove_fixup(node_pointer, node_pointer);</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  split_imp(node_pointer, PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">inline</span> node_pointer</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  split_min();</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="a07767.html">std::pair<node_pointer, node_pointer></a></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  split_min_imp();</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  join_imp(node_pointer, node_pointer);</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>  <a class="code" href="a07767.html">std::pair<node_pointer, node_pointer></a></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  find_join_pos_right(node_pointer, size_type, size_type);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="a07767.html">std::pair<node_pointer, node_pointer></a></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  find_join_pos_left(node_pointer, size_type, size_type);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keyword">inline</span> size_type</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  black_height(node_pointer);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  split_at_node(node_pointer, PB_DS_CLASS_C_DEC&);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  };</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="preprocessor">#define PB_DS_STRUCT_ONLY_ASSERT_VALID(X) \</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor"> _GLIBCXX_DEBUG_ONLY(X.structure_only_assert_valid(__FILE__, __LINE__);)</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="preprocessor">#include <<a class="code" href="a16590.html">ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp</a>></span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="preprocessor">#include <<a class="code" href="a16890.html">ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp</a>></span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="preprocessor">#include <<a class="code" href="a16725.html">ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp</a>></span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="preprocessor">#include <<a class="code" href="a16662.html">ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp</a>></span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="preprocessor">#include <<a class="code" href="a17133.html">ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp</a>></span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="preprocessor">#include <<a class="code" href="a16857.html">ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp</a>></span></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="preprocessor">#undef PB_DS_STRUCT_ONLY_ASSERT_VALID</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="preprocessor">#undef PB_DS_CLASS_T_DEC</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="preprocessor">#undef PB_DS_CLASS_C_DEC</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor">#undef PB_DS_RB_TREE_NAME</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="preprocessor">#undef PB_DS_RB_TREE_BASE_NAME</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="preprocessor">#undef PB_DS_RB_TREE_BASE</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  } <span class="comment">// namespace detail</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> } <span class="comment">// namespace __gnu_pbds</span></div><div class="ttc" id="a11167_html"><div class="ttname"><a href="a11167.html">__gnu_pbds::rb_tree_tag</a></div><div class="ttdoc">Red-black tree.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00153">tag_and_trait.hpp:153</a></div></div>
<div class="ttc" id="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="a16725_html"><div class="ttname"><a href="a16725.html">erase_fn_imps.hpp</a></div></div>
<div class="ttc" id="a17133_html"><div class="ttname"><a href="a17133.html">split_join_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16857_html"><div class="ttname"><a href="a16857.html">info_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="a00182_html"><div class="ttname"><a href="a00182.html">vector</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="a16662_html"><div class="ttname"><a href="a16662.html">debug_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16890_html"><div class="ttname"><a href="a16890.html">insert_fn_imps.hpp</a></div></div>
<div class="ttc" id="a16590_html"><div class="ttname"><a href="a16590.html">constructors_destructor_fn_imps.hpp</a></div></div>
<div class="ttc" id="a01145_html"><div class="ttname"><a href="a01145.html">standard_policies.hpp</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_e6f007bfbd0a1d0cb99fd9d137047b95.html">rb_tree_map_</a></li><li class="navelem"><a class="el" href="a01385.html">rb_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
>
1143
