<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://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.13"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: prefix_search_node_update_imp.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"> $(document).ready(initResizable); </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.13 --> </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"> $(document).ready(function(){initNavTree('a01388_source.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">prefix_search_node_update_imp.hpp</div> </div> </div><!--header--> <div class="contents"> <a href="a01388.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-2015 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/prefix_search_node_update_imp.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains an implementation of prefix_search_node_update.</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <a class="code" href="a06689.html">std::pair</a><</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::const_iterator,</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::const_iterator></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> prefix_range(key_const_reference r_key)<span class="keyword"> const</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword"></span>{</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">const</span> access_traits& r_traits = get_access_traits();</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> (prefix_range(r_traits.begin(r_key), r_traits.end(r_key)));</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <a class="code" href="a06689.html">std::pair</a><</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator,</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> prefix_range(key_const_reference r_key)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> (prefix_range(get_access_traits().<a class="code" href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>(r_key),</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  get_access_traits().<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>(r_key)));</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</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> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <a class="code" href="a06689.html">std::pair</a><</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::const_iterator,</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::const_iterator></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> prefix_range(<span class="keyword">typename</span> access_traits::const_iterator b,</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">typename</span> access_traits::const_iterator e)<span class="keyword"> const</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keyword"></span>{</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <a class="code" href="a06689.html">std::pair<iterator, iterator></a> non_const_ret =</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const_cast<</span>PB_DS_CLASS_C_DEC* <span class="keyword">></span>(<span class="keyword">this</span>)->prefix_range(b, e);</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="keywordflow">return</span> (<a class="code" href="a01431.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(const_iterator(non_const_ret.<a class="code" href="a06689.html#a198b03cffc037835dc1dc01c926ce251">first</a>),</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  const_iterator(non_const_ret.<a class="code" href="a06689.html#a91179413226db12e66346d3673b7835f">second</a>)));</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <a class="code" href="a06689.html">std::pair</a><</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::iterator></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> prefix_range(<span class="keyword">typename</span> access_traits::const_iterator b,</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">typename</span> access_traits::const_iterator e)</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>  Node_Itr nd_it = node_begin();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  Node_Itr end_nd_it = node_end();</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">const</span> access_traits& r_traits = get_access_traits();</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> size_type given_range_length = <a class="code" href="a01487.html#a5852ded2c7147a161b33951ef37ecba8">std::distance</a>(b, e);</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="keywordflow">while</span> (<span class="keyword">true</span>)</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> (nd_it == end_nd_it)</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">return</span> (<a class="code" href="a01431.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(<a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>(), <a class="code" href="a01487.html#a579ff3807b61f57bda29d023b3918504">end</a>()));</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">const</span> size_type common_range_length =</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  base_type::common_prefix_len(nd_it, b, e, r_traits);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (common_range_length >= given_range_length)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  iterator ret_b = this->leftmost_it(nd_it);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  iterator ret_e = this->rightmost_it(nd_it);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> (<a class="code" href="a01431.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(ret_b, ++ret_e));</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  nd_it = next_child(nd_it, b, e, end_nd_it, r_traits);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="keyword">typename</span> PB_DS_CLASS_C_DEC::node_iterator</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> next_child(node_iterator nd_it, <span class="keyword">typename</span> access_traits::const_iterator b,</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">typename</span> access_traits::const_iterator e, node_iterator end_nd_it,</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">const</span> access_traits& r_traits)</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="keyword">const</span> size_type num_children = nd_it.num_children();</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  node_iterator ret = end_nd_it;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  size_type max_length = 0;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (size_type i = 0; i < num_children; ++i)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  node_iterator pot = nd_it.get_child(i);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">const</span> size_type common_range_length =</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  base_type::common_prefix_len(pot, b, e, 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>  <span class="keywordflow">if</span> (common_range_length > max_length)</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>  ret = pot;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  max_length = common_range_length;</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>  }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> (ret);</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> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> operator()(node_iterator <span class="comment">/*nd_it*/</span>, node_const_iterator <span class="comment">/*end_nd_it*/</span>)<span class="keyword"> const</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="keyword"></span>{ }</div><div class="ttc" id="a01487_html_a5852ded2c7147a161b33951ef37ecba8"><div class="ttname"><a href="a01487.html#a5852ded2c7147a161b33951ef37ecba8">std::distance</a></div><div class="ttdeci">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="a00506_source.html#l00114">stl_iterator_base_funcs.h:114</a></div></div> <div class="ttc" id="a06689_html_a91179413226db12e66346d3673b7835f"><div class="ttname"><a href="a06689.html#a91179413226db12e66346d3673b7835f">std::pair::second</a></div><div class="ttdeci">_T2 second</div><div class="ttdoc">first is a copy of the first object </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00102">stl_pair.h:102</a></div></div> <div class="ttc" id="a06689_html"><div class="ttname"><a href="a06689.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type. </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00096">stl_pair.h:96</a></div></div> <div class="ttc" id="a01487_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01487.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initializer_list. </div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00089">initializer_list:89</a></div></div> <div class="ttc" id="a01431_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01431.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects. </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00276">stl_pair.h:276</a></div></div> <div class="ttc" id="a01487_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01487.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initializer_list. ...</div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00099">initializer_list:99</a></div></div> <div class="ttc" id="a06689_html_a198b03cffc037835dc1dc01c926ce251"><div class="ttname"><a href="a06689.html#a198b03cffc037835dc1dc01c926ce251">std::pair::first</a></div><div class="ttdeci">_T1 first</div><div class="ttdoc">second_type is the second bound type </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00101">stl_pair.h:101</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_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="dir_afaff2f5b61f44d50c9875b428318082.html">pb_ds</a></li><li class="navelem"><a class="el" href="dir_f37d910f5ba825954160494085256009.html">detail</a></li><li class="navelem"><a class="el" href="dir_39da7a9cc2a02580c7398f56c552ada2.html">trie_policy</a></li><li class="navelem"><a class="el" href="a01388.html">prefix_search_node_update_imp.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.13 </li> </ul> </div> </body> </html>