libstdc++: insert_store_hash_fn_imps.hpp Source File

libstdc++

gp_hash_table_map_/insert_store_hash_fn_imps.hpp
Go to the documentation of this file.
1// -*- C++ -*-
2
3// Copyright (C) 2005-2026 Free Software Foundation, Inc.
4//
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 terms
7// of the GNU General Public License as published by the Free Software
8// Foundation; either version 3, or (at your option) any later
9// version.
10
11// This library is distributed in the hope that it will be useful, but
12// WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14// General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
26
27// Permission to use, copy, modify, sell, and distribute this software
28// is hereby granted without fee, provided that the above copyright
29// notice appears in all copies, and that both that copyright notice
30// and this permission notice appear in supporting documentation. None
31// of the above authors, nor IBM Haifa Research Laboratories, make any
32// representation about the suitability of this software for any
33// purpose. It is provided "as is" without express or implied
34// warranty.
35
36/**
37 * @file gp_hash_table_map_/insert_store_hash_fn_imps.hpp
38 * Contains implementations of gp_ht_map_'s find related functions,
39 * when the hash value is stored.
40 */
41
42#ifdef PB_DS_CLASS_C_DEC
43
44PB_DS_CLASS_T_DEC
45 inline typename PB_DS_CLASS_C_DEC::comp_hash
46PB_DS_CLASS_C_DEC::
47find_ins_pos(key_const_reference r_key, true_type)
48{
49 PB_DS_ASSERT_VALID((*this))
50 comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
51
52 size_type i;
53
54 /* The insertion position is initted to a non-legal value to indicate
55 * that it has not been initted yet.
56 */
57 size_type ins_pos = m_num_e;
58 resize_base::notify_insert_search_start();
59 for (i = 0; i < m_num_e; ++i)
60 {
61 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
62
63 entry* const p_e = m_entries + pos;
64 switch(p_e->m_stat)
65 {
66 case empty_entry_status:
67 {
68 resize_base::notify_insert_search_end();
69 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
70
71 return ((ins_pos == m_num_e) ?
72 std::make_pair(pos, pos_hash_pair.second) :
73 std::make_pair(ins_pos, pos_hash_pair.second));
74 }
75 break;
76 case erased_entry_status:
77 if (ins_pos == m_num_e)
78 ins_pos = pos;
79 break;
80 case valid_entry_status:
81 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
82 r_key, pos_hash_pair.second))
83 {
84 resize_base::notify_insert_search_end();
85 PB_DS_CHECK_KEY_EXISTS(r_key)
86 return std::make_pair(pos, pos_hash_pair.second);
87 }
88 break;
89 default:
90 _GLIBCXX_DEBUG_ASSERT(0);
91 };
92 resize_base::notify_insert_search_collision();
93 }
94 resize_base::notify_insert_search_end();
95 if (ins_pos == m_num_e)
96 __throw_insert_error();
97 return std::make_pair(ins_pos, pos_hash_pair.second);
98}
99
100PB_DS_CLASS_T_DEC
101 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
102PB_DS_CLASS_C_DEC::
103insert_imp(const_reference r_val, true_type)
104{
105 key_const_reference r_key = PB_DS_V2F(r_val);
106 comp_hash pos_hash_pair = find_ins_pos(r_key,
107 traits_base::m_store_extra_indicator);
108
109 _GLIBCXX_DEBUG_ASSERT(pos_hash_pair.first < m_num_e);
110 entry_pointer p_e =& m_entries[pos_hash_pair.first];
111 if (p_e->m_stat == valid_entry_status)
112 {
113 PB_DS_CHECK_KEY_EXISTS(r_key)
114 return std::make_pair(&p_e->m_value, false);
115 }
116
117 PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
118 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
119}
120
121#endif
std::make_pair
constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)
A convenience wrapper for creating a pair from two objects.
Definition stl_pair.h:1169
std::pair
Struct holding two objects (or references) of arbitrary type.
Definition stl_pair.h:307