old-autovect-branch/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005 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
   7 // terms of the GNU General Public License as published by the
   8 // Free Software Foundation; either version 2, or (at your option)
   9 // any later version.
  10
  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.
  15
  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,
  19 // USA.
  20
  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.
  29
  30 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
  31
  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.
  39
  40 /**
  41  * @file insert_store_hash_fn_imps.hpp
  42  * Contains implementations of cc_ht_map_'s insert related functions, when the hash
  43  *      value is stored.
  44  */
  45
  46 PB_ASSOC_CLASS_T_DEC
  47 inline typename PB_ASSOC_CLASS_C_DEC::data_reference
  48 PB_ASSOC_CLASS_C_DEC::
  49 subscript_imp(const_key_reference r_key, int_to_type<true>)
  50 {
  51   PB_ASSOC_DBG_ONLY(assert_valid();)
  52
  53     comp_hash pos_hash_pair = my_ranged_hash_fn_base::operator()(r_key);
  54
  55   entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
  56
  57   my_resize_base::notify_insert_search_start();
  58
  59   while (p_e != NULL&&
  60          !my_hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second))
  61     {
  62       my_resize_base::notify_insert_search_collision();
  63
  64       p_e = p_e->m_p_next;
  65     }
  66
  67   my_resize_base::notify_insert_search_end();
  68
  69   if (p_e != NULL)
  70     {
  71       PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
  72
  73         return (p_e->m_value.second);
  74     }
  75
  76   PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
  77
  78     return (insert_new_imp(
  79                            value_type(r_key, Data()), pos_hash_pair)->second);
  80 }
  81
  82 PB_ASSOC_CLASS_T_DEC
  83 inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
  84 PB_ASSOC_CLASS_C_DEC::
  85 insert_imp(const_reference r_val, int_to_type<true>)
  86 {
  87   PB_ASSOC_DBG_ONLY(assert_valid();)
  88
  89     const_key_reference r_key = PB_ASSOC_V2F(r_val);
  90
  91   comp_hash pos_hash_pair = my_ranged_hash_fn_base::operator()(r_key);
  92
  93   entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
  94
  95   my_resize_base::notify_insert_search_start();
  96
  97   while (p_e != NULL&&
  98          !my_hash_eq_fn_base::operator()(
  99                                          PB_ASSOC_V2F(p_e->m_value),
 100                                          p_e->m_hash,
 101                                          r_key, pos_hash_pair.second))
 102     {
 103       my_resize_base::notify_insert_search_collision();
 104
 105       p_e = p_e->m_p_next;
 106     }
 107
 108   my_resize_base::notify_insert_search_end();
 109
 110   if (p_e != NULL)
 111     {
 112       PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
 113
 114         return (
 115                 std::make_pair(
 116                                static_cast<pointer>(&p_e->m_value),
 117                                false));
 118     }
 119
 120   PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
 121
 122     return (
 123             std::make_pair(
 124                            insert_new_imp(r_val, pos_hash_pair),
 125                            true));
 126 }
 127
 128 PB_ASSOC_CLASS_T_DEC
 129 inline typename PB_ASSOC_CLASS_C_DEC::pointer
 130 PB_ASSOC_CLASS_C_DEC::
 131 insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair)
 132 {
 133   // Following lines might throw an exception.
 134
 135   if (do_resize_if_needed())
 136     r_pos_hash_pair = my_ranged_hash_fn_base::operator()(
 137                                                          PB_ASSOC_V2F(r_val));
 138
 139   entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator);
 140
 141   // At this point no exceptions can be thrown.
 142
 143   p_e->m_hash = r_pos_hash_pair.second;
 144
 145   p_e->m_p_next = m_a_p_entries[r_pos_hash_pair.first];
 146
 147   m_a_p_entries[r_pos_hash_pair.first] = p_e;
 148
 149   my_resize_base::notify_inserted(++m_num_used_e);
 150
 151   PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(r_key);)
 152
 153     PB_ASSOC_DBG_ONLY(assert_valid();)
 154
 155     return (static_cast<pointer>(&p_e->m_value));
 156 }
 157