libstdc++
cc_hash_table_map_/insert_store_hash_fn_imps.hpp
Go to the documentation of this file.
1 // -*- C++ -*-
2 
3 // Copyright (C) 2005-2014 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 cc_hash_table_map_/insert_store_hash_fn_imps.hpp
38  * Contains implementations of cc_ht_map_'s insert related functions,
39  * when the hash value is stored.
40  */
41 
42 PB_DS_CLASS_T_DEC
44 PB_DS_CLASS_C_DEC::
45 insert_imp(const_reference r_val, true_type)
46 {
47  PB_DS_ASSERT_VALID((*this))
48  key_const_reference key = PB_DS_V2F(r_val);
49  comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(key);
50  entry_pointer p_e = m_entries[pos_hash_pair.first];
51  resize_base::notify_insert_search_start();
52 
53  while (p_e != 0 && !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value),
54  p_e->m_hash,
55  key, pos_hash_pair.second))
56  {
57  resize_base::notify_insert_search_collision();
58  p_e = p_e->m_p_next;
59  }
60 
61  resize_base::notify_insert_search_end();
62  if (p_e != 0)
63  {
64  PB_DS_CHECK_KEY_EXISTS(key)
65  return std::make_pair(&p_e->m_value, false);
66  }
67 
68  PB_DS_CHECK_KEY_DOES_NOT_EXIST(key)
69  return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
70 }
71 
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:276
ISO C++ entities toplevel namespace is std.
Struct holding two objects of arbitrary type.
Definition: stl_pair.h:96