3 // Copyright (C) 2005 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32 // Permission to use, copy, modify, sell, and distribute this software
33 // is hereby granted without fee, provided that the above copyright
34 // notice appears in all copies, and that both that copyright notice and
35 // this permission notice appear in supporting documentation. None of
36 // the above authors, nor IBM Haifa Research Laboratories, make any
37 // representation about the suitability of this software for any
38 // purpose. It is provided "as is" without express or implied warranty.
41 * @file hash_prime_size_policy_imp.hpp
42 * Contains an implementation of hash_prime_size_policy.
50 num_distinct_sizes = 28
53 static const size_t s_a_sizes[num_distinct_sizes] =
55 /* Dealing cards... */
82 /* 26 */ 3221225473ul,
84 /* Pot's good, let's play */
91 PB_ASSOC_CLASS_C_DEC::
92 swap(PB_ASSOC_CLASS_C_DEC& /*r_other*/)
96 PB_ASSOC_CLASS_C_DEC::size_type
97 PB_ASSOC_CLASS_C_DEC::
98 get_init_size(size_type suggested_size) const
100 return (get_nearest_larger_size_imp(suggested_size));
104 inline PB_ASSOC_CLASS_C_DEC::size_type
105 PB_ASSOC_CLASS_C_DEC::
106 get_nearest_larger_size(size_type cur_size) const
108 PB_ASSOC_DBG_ONLY(assert_is_one_of_my_sizes(cur_size);)
110 return (get_nearest_larger_size_imp(cur_size));
114 inline PB_ASSOC_CLASS_C_DEC::size_type
115 PB_ASSOC_CLASS_C_DEC::
116 get_nearest_smaller_size(size_type cur_size) const
118 PB_ASSOC_DBG_ONLY(assert_is_one_of_my_sizes(cur_size);)
120 return (*std::lower_bound(detail::s_a_sizes, detail::s_a_sizes + detail::num_distinct_sizes, cur_size - 1));
124 inline PB_ASSOC_CLASS_C_DEC::size_type
125 PB_ASSOC_CLASS_C_DEC::
126 get_nearest_larger_size_imp(size_type size) const
128 const size_t* const p_upper =
129 std::upper_bound(detail::s_a_sizes, detail::s_a_sizes + detail::num_distinct_sizes, size);
131 return ((p_upper == detail::s_a_sizes + detail::num_distinct_sizes)?
136 #ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
139 PB_ASSOC_CLASS_C_DEC::
140 assert_is_one_of_my_sizes(size_type size)
142 const size_t* const p_end =
143 detail::s_a_sizes + detail::num_distinct_sizes;
145 const size_t* const p_found =
146 std::find(detail::s_a_sizes, p_end, size)
148 PB_ASSOC_DBG_ASSERT(p_found != p_end);
150 #endif // #ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG