libstdc++
gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005-2019 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_no_store_hash_fn_imps.hpp
38  * Contains implementations of gp_ht_map_'s insert related functions,
39  * when the hash value is not stored.
40  */
41 
42 PB_DS_CLASS_T_DEC
43 inline typename PB_DS_CLASS_C_DEC::size_type
44 PB_DS_CLASS_C_DEC::
45 find_ins_pos(key_const_reference r_key, false_type)
46 {
47  size_type hash = ranged_probe_fn_base::operator()(r_key);
48  size_type i;
49 
50  /* The insertion position is initted to a non-legal value to indicate
51  * that it has not been initted yet.
52  */
53  size_type ins_pos = m_num_e;
54  resize_base::notify_insert_search_start();
55  for (i = 0; i < m_num_e; ++i)
56  {
57  const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
58  _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59  entry* const p_e = m_entries + pos;
60  switch(p_e->m_stat)
61  {
62  case empty_entry_status:
63  {
64  resize_base::notify_insert_search_end();
65  PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
66  return (ins_pos == m_num_e) ? pos : ins_pos;
67  }
68  break;
69  case erased_entry_status:
70  if (ins_pos == m_num_e)
71  ins_pos = pos;
72  break;
73  case valid_entry_status:
74  if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
75  {
76  resize_base::notify_insert_search_end();
77  PB_DS_CHECK_KEY_EXISTS(r_key)
78  return pos;
79  }
80  break;
81  default:
82  _GLIBCXX_DEBUG_ASSERT(0);
83  };
84 
85  resize_base::notify_insert_search_collision();
86  }
87  resize_base::notify_insert_search_end();
88  if (ins_pos == m_num_e)
89  __throw_insert_error();
90  return ins_pos;
91 }
92 
93 PB_DS_CLASS_T_DEC
95 PB_DS_CLASS_C_DEC::
96 insert_imp(const_reference r_val, false_type)
97 {
98  key_const_reference r_key = PB_DS_V2F(r_val);
99  const size_type pos = find_ins_pos(r_key,
100  traits_base::m_store_extra_indicator);
101 
102  if (m_entries[pos].m_stat == valid_entry_status)
103  {
104  PB_DS_CHECK_KEY_EXISTS(r_key)
105  return std::make_pair(&(m_entries + pos)->m_value, false);
106  }
107 
108  PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
109  return std::make_pair(insert_new_imp(r_val, pos), true);
110 }
111 
integral_constant< bool, false > false_type
The type used as a compile-time boolean with false value.
Definition: type_traits:78
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:524
Struct holding two objects of arbitrary type.
Definition: stl_pair.h:208