1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006 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 2, 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// You should have received a copy of the GNU General Public License 17// along with this library; see the file COPYING. If not, write to 18// the Free Software Foundation, 59 Temple Place - Suite 330, Boston, 19// MA 02111-1307, USA. 20 21// As a special exception, you may use this file as part of a free 22// software library without restriction. Specifically, if other files 23// instantiate templates or use macros or inline functions from this 24// file, or you compile this file and link it with other files to 25// produce an executable, this file does not by itself cause the 26// resulting executable to be covered by the GNU General Public 27// License. This exception does not however invalidate any other 28// reasons why the executable file might be covered by the GNU General 29// Public License. 30 31// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 32 33// Permission to use, copy, modify, sell, and distribute this software 34// is hereby granted without fee, provided that the above copyright 35// notice appears in all copies, and that both that copyright notice 36// and this permission notice appear in supporting documentation. None 37// of the above authors, nor IBM Haifa Research Laboratories, make any 38// representation about the suitability of this software for any 39// purpose. It is provided "as is" without express or implied 40// warranty. 41 42/** 43 * @file insert_store_hash_fn_imps.hpp 44 * Contains implementations of gp_ht_map_'s find related functions, 45 * when the hash value is stored. 46 */ 47 48PB_DS_CLASS_T_DEC 49inline typename PB_DS_CLASS_C_DEC::comp_hash 50PB_DS_CLASS_C_DEC:: 51find_ins_pos(const_key_reference r_key, true_type) 52{ 53 _GLIBCXX_DEBUG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();) 54 comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key); 55 56 size_type i; 57 58 /* The insertion position is initted to a non-legal value to indicate 59 * that it has not been initted yet. 60 */ 61 size_type ins_pos = m_num_e; 62 resize_base::notify_insert_search_start(); 63 for (i = 0; i < m_num_e; ++i) 64 { 65 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); 66 67 entry* const p_e = m_entries + pos; 68 switch(p_e->m_stat) 69 { 70 case empty_entry_status: 71 { 72 resize_base::notify_insert_search_end(); 73 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_does_not_exist(r_key);) 74 75 return ((ins_pos == m_num_e) ? 76 std::make_pair(pos, pos_hash_pair.second) : 77 std::make_pair(ins_pos, pos_hash_pair.second)); 78 } 79 break; 80 case erased_entry_status: 81 if (ins_pos == m_num_e) 82 ins_pos = pos; 83 break; 84 case valid_entry_status: 85 if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash, 86 r_key, pos_hash_pair.second)) 87 { 88 resize_base::notify_insert_search_end(); 89 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(r_key);) 90 return std::make_pair(pos, pos_hash_pair.second); 91 } 92 break; 93 default: 94 _GLIBCXX_DEBUG_ASSERT(0); 95 }; 96 resize_base::notify_insert_search_collision(); 97 } 98 resize_base::notify_insert_search_end(); 99 if (ins_pos == m_num_e) 100 __throw_insert_error(); 101 return std::make_pair(ins_pos, pos_hash_pair.second); 102} 103 104PB_DS_CLASS_T_DEC 105inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool> 106PB_DS_CLASS_C_DEC:: 107insert_imp(const_reference r_val, true_type) 108{ 109 const_key_reference r_key = PB_DS_V2F(r_val); 110 comp_hash pos_hash_pair = find_ins_pos(r_key, 111 traits_base::m_store_extra_indicator); 112 113 _GLIBCXX_DEBUG_ASSERT(pos_hash_pair.first < m_num_e); 114 entry_pointer p_e =& m_entries[pos_hash_pair.first]; 115 if (p_e->m_stat == valid_entry_status) 116 { 117 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_exists(r_key)); 118 return std::make_pair(&p_e->m_value, false); 119 } 120 121 _GLIBCXX_DEBUG_ONLY(map_debug_base::check_key_does_not_exist(r_key)); 122 return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true); 123} 124 125