<!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++: trie_policy_base.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('a01448_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">trie_policy_base.hpp</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01448.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 trie_policy/trie_policy_base.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation of trie_policy_base.</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_TRIE_POLICY_BASE_HPP</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#define PB_DS_TRIE_POLICY_BASE_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="a01229.html">ext/pb_ds/detail/branch_policy/branch_policy.hpp</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">namespace </span><a class="code" href="a01593.html">__gnu_pbds</a></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">namespace </span>detail</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  {<span class="comment"></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> /// Base class for trie policies.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> Node_CItr, <span class="keyword">typename</span> Node_Itr,</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">typename</span> _ATraits, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="a12011.html"> 53</a></span>  <span class="keyword">class </span><a class="code" href="a12011.html">trie_policy_base</a></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  : <span class="keyword">public</span> <a class="code" href="a11575.html">branch_policy</a><Node_CItr, Node_Itr, _Alloc></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">typedef</span> <a class="code" href="a11575.html">branch_policy<Node_CItr, Node_Itr, _Alloc></a> <a class="code" href="a11575.html">base_type</a>;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">typedef</span> _ATraits access_traits;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> allocator_type::size_type size_type;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">typedef</span> <a class="code" href="a11215.html">null_type</a> <a class="code" href="a11215.html">metadata_type</a>;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">typedef</span> Node_CItr node_const_iterator;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">typedef</span> Node_Itr node_iterator;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> node_const_iterator::value_type const_iterator;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> node_iterator::value_type iterator;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::key_type key_type;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</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="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">virtual</span> const_iterator</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  end() <span class="keyword">const</span> = 0;</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="keyword">virtual</span> iterator</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  end() = 0;</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="keyword">virtual</span> node_const_iterator</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  node_begin() <span class="keyword">const</span> = 0;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">virtual</span> node_iterator</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  node_begin() = 0;</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="keyword">virtual</span> node_const_iterator</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  node_end() <span class="keyword">const</span> = 0;</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">virtual</span> node_iterator</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  node_end() = 0;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">virtual</span> <span class="keyword">const</span> access_traits&</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  get_access_traits() <span class="keyword">const</span> = 0;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> access_traits::const_iterator e_const_iterator;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> <a class="code" href="a07767.html">std::pair<e_const_iterator, e_const_iterator></a> <a class="code" href="a07767.html">prefix_range_t</a>;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">static</span> size_type</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  common_prefix_len(node_iterator, e_const_iterator,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  e_const_iterator, <span class="keyword">const</span> access_traits&);</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">static</span> iterator</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  leftmost_it(node_iterator);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">static</span> iterator</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  rightmost_it(node_iterator);</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">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  less(e_const_iterator, e_const_iterator, e_const_iterator,</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  e_const_iterator, <span class="keyword">const</span> access_traits&);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  };</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> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor">#define PB_DS_CLASS_T_DEC \</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="preprocessor"> template<typename Node_CItr, typename Node_Itr, \</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="preprocessor"> typename _ATraits, typename _Alloc></span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor">#define PB_DS_CLASS_C_DEC \</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor"> trie_policy_base<Node_CItr, Node_Itr, _ATraits, _Alloc></span></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>  PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::size_type</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  common_prefix_len(node_iterator nd_it, e_const_iterator b_r,</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  e_const_iterator e_r, <span class="keyword">const</span> access_traits& r_traits)</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>  prefix_range_t pref_range = nd_it.valid_prefix();</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>  e_const_iterator b_l = pref_range.first;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  e_const_iterator e_l = pref_range.second;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">const</span> size_type range_length_l = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(b_l, e_l);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">const</span> size_type range_length_r = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(b_r, e_r);</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="keywordflow">if</span> (range_length_r < range_length_l)</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  std::swap(b_l, b_r);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  std::swap(e_l, e_r);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</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>  size_type ret = 0;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span> (b_l != e_l)</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> (r_traits.e_pos(*b_l) != r_traits.e_pos(*b_r))</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">return</span> ret;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  ++ret;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  ++b_l;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  ++b_r;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</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>  <span class="keywordflow">return</span> ret;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  leftmost_it(node_iterator nd_it)</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="keywordflow">if</span> (nd_it.num_children() == 0)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">return</span> *nd_it;</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="keywordflow">return</span> leftmost_it(nd_it.get_child(0));</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> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  rightmost_it(node_iterator nd_it)</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>  <span class="keyword">const</span> size_type num_children = nd_it.num_children();</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="keywordflow">if</span> (num_children == 0)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">return</span> *nd_it;</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="keywordflow">return</span> rightmost_it(nd_it.get_child(num_children - 1));</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</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>  PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  less(e_const_iterator b_l, e_const_iterator e_l,</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  e_const_iterator b_r, e_const_iterator e_r,</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">const</span> access_traits& r_traits)</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">while</span> (b_l != e_l)</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>  <span class="keywordflow">if</span> (b_r == e_r)</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  size_type l_pos = r_traits.e_pos(*b_l);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  size_type r_pos = r_traits.e_pos(*b_r);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (l_pos != r_pos)</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">return</span> (l_pos < r_pos);</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>  ++b_l;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  ++b_r;</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="keywordflow">return</span> b_r != e_r;</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> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="preprocessor">#undef PB_DS_CLASS_T_DEC</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="preprocessor">#undef PB_DS_CLASS_C_DEC</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="comment">// namespace detail</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> } <span class="comment">// namespace __gnu_pbds</span></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="preprocessor">#endif // #ifndef PB_DS_TRIE_POLICY_BASE_HPP</span></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="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a11575_html"><div class="ttname"><a href="a11575.html">__gnu_pbds::detail::branch_policy</a></div><div class="ttdoc">Primary template, base class for branch structure policies.</div><div class="ttdef"><b>Definition:</b> <a href="a01229_source.html#l00052">branch_policy.hpp:52</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="a12011_html"><div class="ttname"><a href="a12011.html">__gnu_pbds::detail::trie_policy_base</a></div><div class="ttdoc">Base class for trie policies.</div><div class="ttdef"><b>Definition:</b> <a href="a01448_source.html#l00053">trie_policy_base.hpp:53</a></div></div>
<div class="ttc" id="a01229_html"><div class="ttname"><a href="a01229.html">branch_policy.hpp</a></div></div>
<div class="ttc" id="a11215_html"><div class="ttname"><a href="a11215.html">__gnu_pbds::null_type</a></div><div class="ttdoc">Represents no type, or absence of type, for template tricks.</div><div class="ttdef"><b>Definition:</b> <a href="a01124_source.html#l00210">tag_and_trait.hpp:210</a></div></div>
</div><!-- 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_046615314a7810b7d9f1b56041baafc4.html">trie_policy</a></li><li class="navelem"><a class="el" href="a01448.html">trie_policy_base.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
>
1187
