libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp

   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_no_store_hash_fn_imps.hpp
  44  * Contains implementations of gp_ht_map_'s insert related functions, when the hash
  45  *    value is not stored.
  46  */
  47
  48 PB_DS_CLASS_T_DEC
  49 inline typename PB_DS_CLASS_C_DEC::size_type
  50 PB_DS_CLASS_C_DEC::
  51 find_ins_pos(const_key_reference r_key, store_hash_false_type)
  52 {
  53   size_type hash = ranged_probe_fn_base::operator()(r_key);
  54
  55   size_type i;
  56
  57   /* The insertion position is initted to a non-legal value to indicate
  58    *     that it has not been initted yet.
  59    */
  60   size_type ins_pos = m_num_e;
  61
  62   resize_base::notify_insert_search_start();
  63
  64   for (i = 0; i < m_num_e; ++i)
  65     {
  66       const size_type pos =
  67         ranged_probe_fn_base::operator()(r_key, hash, i);
  68
  69       PB_DS_DBG_ASSERT(pos < m_num_e);
  70
  71       entry* const p_e = m_a_entries + pos;
  72
  73       switch(p_e->m_stat)
  74         {
  75         case empty_entry_status:
  76           {
  77             resize_base::notify_insert_search_end();
  78
  79             PB_DS_DBG_ONLY(
  80                            map_debug_base::check_key_does_not_exist(r_key);)
  81
  82               return ((ins_pos == m_num_e)? pos : ins_pos);
  83           }
  84           break;
  85         case erased_entry_status:
  86           if (ins_pos == m_num_e)
  87             ins_pos = pos;
  88           break;
  89         case valid_entry_status:
  90           if (hash_eq_fn_base::operator()(
  91                                           PB_DS_V2F(p_e->m_value), r_key))
  92             {
  93               resize_base::notify_insert_search_end();
  94
  95               PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
  96
  97                 return (pos);
  98             }
  99           break;
 100         default:
 101           PB_DS_DBG_ASSERT(0);
 102         };
 103
 104       resize_base::notify_insert_search_collision();
 105     }
 106
 107   resize_base::notify_insert_search_end();
 108
 109   if (ins_pos == m_num_e)
 110     throw insert_error();
 111
 112   return (ins_pos);
 113 }
 114
 115 PB_DS_CLASS_T_DEC
 116 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
 117 PB_DS_CLASS_C_DEC::
 118 insert_imp(const_reference r_val, store_hash_false_type)
 119 {
 120   const_key_reference r_key = PB_DS_V2F(r_val);
 121
 122   const size_type pos =
 123     find_ins_pos(r_key, traits_base::m_store_extra_indicator);
 124
 125   if (m_a_entries[pos].m_stat == valid_entry_status)
 126     {
 127       PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
 128
 129         return (std::make_pair(
 130                                & (m_a_entries + pos)->m_value,
 131                                false));
 132     }
 133
 134   PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key));
 135
 136   return (std::make_pair(
 137                          insert_new_imp(r_val, pos),
 138                          true));
 139 }
 140