gomp-20050608-branch/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_no_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_no_store_hash_fn_imps.hpp
  42  * Contains implementations of gp_ht_map_'s insert related functions, when the hash
  43  *      value is not stored.
  44  */
  45
  46 PB_ASSOC_CLASS_T_DEC
  47 inline typename PB_ASSOC_CLASS_C_DEC::size_type
  48 PB_ASSOC_CLASS_C_DEC::
  49 find_ins_pos(const_key_reference r_key, int_to_type<false>)
  50 {
  51   size_type hash = my_ranged_probe_fn_base::operator()(r_key);
  52
  53   size_type i;
  54
  55   /* The insertion position is initted to a non-legal value to indicate
  56    *    that it has not been initted yet.
  57    */
  58   size_type ins_pos = m_num_e;
  59
  60   my_resize_base::notify_insert_search_start();
  61
  62   for (i = 0; i < m_num_e; ++i)
  63     {
  64       const size_type pos =
  65         my_ranged_probe_fn_base::operator()(r_key, hash, i);
  66
  67       entry* const p_e = m_a_entries + pos;
  68
  69       switch(p_e->m_stat)
  70         {
  71         case EMPTY_ENTRY_STATUS:
  72           {
  73             my_resize_base::notify_insert_search_end();
  74
  75             PB_ASSOC_DBG_ONLY(
  76                               my_map_debug_base::check_key_does_not_exist(r_key);)
  77
  78               return ((ins_pos == m_num_e)? pos : ins_pos);
  79           }
  80           break;
  81         case ERASED_ENTRY_STATUS:
  82           if (ins_pos == m_num_e)
  83             ins_pos = pos;
  84           break;
  85         case VALID_ENTRY_STATUS:
  86           if (my_hash_eq_fn_base::operator()(
  87                                              PB_ASSOC_V2F(p_e->m_value), r_key))
  88             {
  89               my_resize_base::notify_insert_search_end();
  90
  91               PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
  92
  93                 return (pos);
  94             }
  95           break;
  96         default:
  97           PB_ASSOC_DBG_ASSERT(0);
  98         };
  99
 100       my_resize_base::notify_insert_search_collision();
 101     }
 102
 103   my_resize_base::notify_insert_search_end();
 104
 105   if (ins_pos == m_num_e)
 106     throw cannot_insert();
 107
 108   return (ins_pos);
 109 }
 110
 111 PB_ASSOC_CLASS_T_DEC
 112 inline typename PB_ASSOC_CLASS_C_DEC::data_reference
 113 PB_ASSOC_CLASS_C_DEC::
 114 subscript_imp(const_key_reference r_key, int_to_type<false>)
 115 {
 116   PB_ASSOC_DBG_ONLY(assert_valid();)
 117
 118     const size_type pos =
 119     find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
 120
 121   entry_pointer p_e =& m_a_entries[pos];
 122
 123   if (p_e->m_stat != VALID_ENTRY_STATUS)
 124     return (insert_new_imp(
 125                            value_type(r_key, Data()), pos)->second);
 126
 127   PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
 128
 129     return (p_e->m_value.second);
 130 }
 131
 132 PB_ASSOC_CLASS_T_DEC
 133 inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
 134 PB_ASSOC_CLASS_C_DEC::
 135 insert_imp(const_reference r_val, int_to_type<false>)
 136 {
 137   const_key_reference r_key = PB_ASSOC_V2F(r_val);
 138
 139   const size_type pos =
 140     find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
 141
 142   if (m_a_entries[pos].m_stat == VALID_ENTRY_STATUS)
 143     {
 144       PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
 145
 146         return (std::make_pair(&m_a_entries[pos].m_value, false));
 147     }
 148
 149   PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key));
 150
 151   return (std::make_pair(
 152                          insert_new_imp(r_val, pos),
 153                          true));
 154 }
 155
 156 PB_ASSOC_CLASS_T_DEC
 157 inline typename PB_ASSOC_CLASS_C_DEC::pointer
 158 PB_ASSOC_CLASS_C_DEC::
 159 insert_new_imp(const_reference r_val, size_type pos)
 160 {
 161   PB_ASSOC_DBG_ASSERT(m_a_entries[pos].m_stat != VALID_ENTRY_STATUS);
 162
 163   if (do_resize_if_needed())
 164     pos = find_ins_pos(PB_ASSOC_V2F(r_val),
 165                        my_hash_traits_base::s_store_hash_indicator);
 166
 167   PB_ASSOC_DBG_ASSERT(m_a_entries[pos].m_stat != VALID_ENTRY_STATUS);
 168
 169   entry* const p_e = m_a_entries + pos;
 170
 171   new (&p_e->m_value) value_type(r_val);
 172
 173   p_e->m_stat = VALID_ENTRY_STATUS;
 174
 175   my_resize_base::notify_inserted(++m_num_used_e);
 176
 177   PB_ASSOC_DBG_ONLY(my_map_debug_base::
 178                     insert_new(p_e->m_value.first);)
 179
 180     PB_ASSOC_DBG_ONLY(assert_valid();)
 181
 182     return (static_cast<pointer>(&p_e->m_value));
 183 }
 184