<!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++: hash_prime_size_policy_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('a01355_source.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">hash_prime_size_policy_imp.hpp</div> </div> </div><!--header--> <div class="contents"> <a href="a01355.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 hash_prime_size_policy_imp.hpp</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * Contains a resize size policy implementation.</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">#pragma GCC system_header</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">namespace </span><a class="code" href="a01537.html">detail</a></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">enum</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>  num_distinct_sizes_32_bit = 30,</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  num_distinct_sizes_64_bit = 62,</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  num_distinct_sizes = <span class="keyword">sizeof</span>(std::size_t) != 8 ? </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  num_distinct_sizes_32_bit : num_distinct_sizes_64_bit, </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> </div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// Originally taken from the SGI implementation; acknowledged in the docs.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// Further modified (for 64 bits) from tr1's hashtable.</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::size_t g_a_sizes[num_distinct_sizes_64_bit] =</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">/* 0 */</span> 5ul,</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">/* 1 */</span> 11ul, </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">/* 2 */</span> 23ul, </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">/* 3 */</span> 47ul, </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">/* 4 */</span> 97ul, </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">/* 5 */</span> 199ul, </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">/* 6 */</span> 409ul, </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">/* 7 */</span> 823ul, </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">/* 8 */</span> 1741ul, </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">/* 9 */</span> 3469ul, </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">/* 10 */</span> 6949ul, </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">/* 11 */</span> 14033ul, </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">/* 12 */</span> 28411ul, </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">/* 13 */</span> 57557ul, </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">/* 14 */</span> 116731ul, </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">/* 15 */</span> 236897ul,</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">/* 16 */</span> 480881ul, </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">/* 17 */</span> 976369ul,</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">/* 18 */</span> 1982627ul, </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">/* 19 */</span> 4026031ul,</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">/* 20 */</span> 8175383ul, </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">/* 21 */</span> 16601593ul, </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">/* 22 */</span> 33712729ul,</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">/* 23 */</span> 68460391ul, </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">/* 24 */</span> 139022417ul, </div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">/* 25 */</span> 282312799ul, </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">/* 26 */</span> 573292817ul, </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">/* 27 */</span> 1164186217ul,</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">/* 28 */</span> 2364114217ul, </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">/* 29 */</span> 4294967291ul,</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">/* 30 */</span> (std::size_t)8589934583ull,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">/* 31 */</span> (std::size_t)17179869143ull,</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">/* 32 */</span> (std::size_t)34359738337ull,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">/* 33 */</span> (std::size_t)68719476731ull,</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">/* 34 */</span> (std::size_t)137438953447ull,</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">/* 35 */</span> (std::size_t)274877906899ull,</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">/* 36 */</span> (std::size_t)549755813881ull,</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">/* 37 */</span> (std::size_t)1099511627689ull,</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">/* 38 */</span> (std::size_t)2199023255531ull,</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">/* 39 */</span> (std::size_t)4398046511093ull,</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">/* 40 */</span> (std::size_t)8796093022151ull,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">/* 41 */</span> (std::size_t)17592186044399ull,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">/* 42 */</span> (std::size_t)35184372088777ull,</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">/* 43 */</span> (std::size_t)70368744177643ull,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">/* 44 */</span> (std::size_t)140737488355213ull,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">/* 45 */</span> (std::size_t)281474976710597ull,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">/* 46 */</span> (std::size_t)562949953421231ull, </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">/* 47 */</span> (std::size_t)1125899906842597ull,</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">/* 48 */</span> (std::size_t)2251799813685119ull, </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">/* 49 */</span> (std::size_t)4503599627370449ull,</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">/* 50 */</span> (std::size_t)9007199254740881ull, </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">/* 51 */</span> (std::size_t)18014398509481951ull,</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">/* 52 */</span> (std::size_t)36028797018963913ull, </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">/* 53 */</span> (std::size_t)72057594037927931ull,</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">/* 54 */</span> (std::size_t)144115188075855859ull,</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">/* 55 */</span> (std::size_t)288230376151711717ull,</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">/* 56 */</span> (std::size_t)576460752303423433ull,</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">/* 57 */</span> (std::size_t)1152921504606846883ull,</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">/* 58 */</span> (std::size_t)2305843009213693951ull,</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">/* 59 */</span> (std::size_t)4611686018427387847ull,</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">/* 60 */</span> (std::size_t)9223372036854775783ull,</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">/* 61 */</span> (std::size_t)18446744073709551557ull,</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  };</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> } <span class="comment">// namespace detail</span></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_CLASS_T_DEC</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="keyword">inline</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> hash_prime_size_policy(size_type n) : m_start_size(n)</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> { m_start_size = get_nearest_larger_size(n); }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> swap(PB_DS_CLASS_C_DEC& other)</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> { std::swap(m_start_size, other.m_start_size); }</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> PB_DS_CLASS_C_DEC::size_type</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> get_nearest_larger_size(size_type n)<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="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">const</span> std::size_t* <span class="keyword">const</span> p_upper = <a class="code" href="a01438.html#ga639d56cfebd6f1fbabf344c49a5c5539">std::upper_bound</a>(detail::g_a_sizes, </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  detail::g_a_sizes + detail::num_distinct_sizes, n);</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> (p_upper == detail::g_a_sizes + detail::num_distinct_sizes)</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  __throw_resize_error();</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">return</span> *p_upper;</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> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> PB_DS_CLASS_T_DEC</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="keyword">inline</span> PB_DS_CLASS_C_DEC::size_type</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> PB_DS_CLASS_C_DEC::</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> get_nearest_smaller_size(size_type n)<span class="keyword"> const</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="keyword"></span>{</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">const</span> std::size_t* p_lower = <a class="code" href="a01438.html#ga6f1d41eed9a1fabbae1d54b384b07061">std::lower_bound</a>(detail::g_a_sizes, </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  detail::g_a_sizes + detail::num_distinct_sizes, n);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (*p_lower >= n && p_lower != detail::g_a_sizes)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  --p_lower;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (*p_lower < m_start_size)</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">return</span> m_start_size;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">return</span> *p_lower;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> }</div><div class="ttc" id="a01438_html_ga6f1d41eed9a1fabbae1d54b384b07061"><div class="ttname"><a href="a01438.html#ga6f1d41eed9a1fabbae1d54b384b07061">std::lower_bound</a></div><div class="ttdeci">_ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val)</div><div class="ttdoc">Finds the first position in which val could be inserted without changing the ordering. </div><div class="ttdef"><b>Definition:</b> <a href="a00485_source.html#l01000">stl_algobase.h:1000</a></div></div> <div class="ttc" id="a01438_html_ga639d56cfebd6f1fbabf344c49a5c5539"><div class="ttname"><a href="a01438.html#ga639d56cfebd6f1fbabf344c49a5c5539">std::upper_bound</a></div><div class="ttdeci">_ForwardIterator upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp &__val, _Compare __comp)</div><div class="ttdoc">Finds the last position in which __val could be inserted without changing the ordering. </div><div class="ttdef"><b>Definition:</b> <a href="a00482_source.html#l02107">stl_algo.h:2107</a></div></div> <div class="ttc" id="a01537_html"><div class="ttname"><a href="a01537.html">detail</a></div><div class="ttdef"><b>Definition:</b> <a href="a01355_source.html#l00043">hash_prime_size_policy_imp.hpp:43</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_24c8b87b895f693294ce0a1400cb0080.html">resize_policy</a></li><li class="navelem"><a class="el" href="a01355.html">hash_prime_size_policy_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>