libstdc++
gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2011 Free Software Foundation, Inc.
00004 //
00005 // This file is part of the GNU ISO C++ Library.  This library is free
00006 // software; you can redistribute it and/or modify it under the terms
00007 // of the GNU General Public License as published by the Free Software
00008 // Foundation; either version 3, or (at your option) any later
00009 // version.
00010 
00011 // This library is distributed in the hope that it will be useful, but
00012 // WITHOUT ANY WARRANTY; without even the implied warranty of
00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00014 // General Public License for more details.
00015 
00016 // Under Section 7 of GPL version 3, you are granted additional
00017 // permissions described in the GCC Runtime Library Exception, version
00018 // 3.1, as published by the Free Software Foundation.
00019 
00020 // You should have received a copy of the GNU General Public License and
00021 // a copy of the GCC Runtime Library Exception along with this program;
00022 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
00023 // <http://www.gnu.org/licenses/>.
00024 
00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
00026 
00027 // Permission to use, copy, modify, sell, and distribute this software
00028 // is hereby granted without fee, provided that the above copyright
00029 // notice appears in all copies, and that both that copyright notice
00030 // and this permission notice appear in supporting documentation. None
00031 // of the above authors, nor IBM Haifa Research Laboratories, make any
00032 // representation about the suitability of this software for any
00033 // purpose. It is provided "as is" without express or implied
00034 // warranty.
00035 
00036 /**
00037  * @file gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp
00038  * Contains implementations of gp_ht_map_'s insert related functions,
00039  * when the hash value is not stored.
00040  */
00041 
00042 PB_DS_CLASS_T_DEC
00043 inline typename PB_DS_CLASS_C_DEC::size_type
00044 PB_DS_CLASS_C_DEC::
00045 find_ins_pos(key_const_reference r_key, false_type)
00046 {
00047   size_type hash = ranged_probe_fn_base::operator()(r_key);
00048   size_type i;
00049 
00050   /* The insertion position is initted to a non-legal value to indicate
00051    *     that it has not been initted yet.
00052    */
00053   size_type ins_pos = m_num_e;
00054   resize_base::notify_insert_search_start();
00055   for (i = 0; i < m_num_e; ++i)
00056     {
00057       const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
00058       _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
00059       entry* const p_e = m_entries + pos;
00060       switch(p_e->m_stat)
00061         {
00062         case empty_entry_status:
00063       {
00064             resize_base::notify_insert_search_end();
00065         PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
00066         return (ins_pos == m_num_e) ? pos : ins_pos;
00067       }
00068       break;
00069         case erased_entry_status:
00070       if (ins_pos == m_num_e)
00071         ins_pos = pos;
00072       break;
00073         case valid_entry_status:
00074       if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
00075             {
00076           resize_base::notify_insert_search_end();
00077           PB_DS_CHECK_KEY_EXISTS(r_key)
00078                 return pos;
00079             }
00080       break;
00081         default:
00082       _GLIBCXX_DEBUG_ASSERT(0);
00083         };
00084 
00085       resize_base::notify_insert_search_collision();
00086     }
00087   resize_base::notify_insert_search_end();
00088   if (ins_pos == m_num_e)
00089     __throw_insert_error();
00090   return ins_pos;
00091 }
00092 
00093 PB_DS_CLASS_T_DEC
00094 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
00095 PB_DS_CLASS_C_DEC::
00096 insert_imp(const_reference r_val, false_type)
00097 {
00098   key_const_reference r_key = PB_DS_V2F(r_val);
00099   const size_type pos = find_ins_pos(r_key, 
00100                      traits_base::m_store_extra_indicator);
00101 
00102   if (m_entries[pos].m_stat == valid_entry_status)
00103     {
00104       PB_DS_CHECK_KEY_EXISTS(r_key)
00105       return std::make_pair(&(m_entries + pos)->m_value, false);
00106     }
00107 
00108   PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
00109   return std::make_pair(insert_new_imp(r_val, pos), true);
00110 }
00111