libstdc++
gp_hash_table_map_/insert_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_store_hash_fn_imps.hpp
00038  * Contains implementations of gp_ht_map_'s find related functions,
00039  * when the hash value is stored.
00040  */
00041 
00042 PB_DS_CLASS_T_DEC
00043 inline typename PB_DS_CLASS_C_DEC::comp_hash
00044 PB_DS_CLASS_C_DEC::
00045 find_ins_pos(key_const_reference r_key, true_type)
00046 {
00047   PB_DS_ASSERT_VALID((*this))
00048   comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
00049 
00050   size_type i;
00051 
00052   /* The insertion position is initted to a non-legal value to indicate
00053    *     that it has not been initted yet.
00054    */
00055   size_type ins_pos = m_num_e;
00056   resize_base::notify_insert_search_start();
00057   for (i = 0; i < m_num_e; ++i)
00058     {
00059       const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
00060 
00061       entry* const p_e = m_entries + pos;
00062       switch(p_e->m_stat)
00063         {
00064         case empty_entry_status:
00065       {
00066             resize_base::notify_insert_search_end();
00067         PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
00068 
00069         return ((ins_pos == m_num_e) ?
00070              std::make_pair(pos, pos_hash_pair.second) :
00071              std::make_pair(ins_pos, pos_hash_pair.second));
00072       }
00073       break;
00074         case erased_entry_status:
00075       if (ins_pos == m_num_e)
00076         ins_pos = pos;
00077       break;
00078         case valid_entry_status:
00079       if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
00080                       r_key, pos_hash_pair.second))
00081             {
00082           resize_base::notify_insert_search_end();
00083           PB_DS_CHECK_KEY_EXISTS(r_key)
00084               return std::make_pair(pos, pos_hash_pair.second);
00085             }
00086       break;
00087         default:
00088       _GLIBCXX_DEBUG_ASSERT(0);
00089         };
00090       resize_base::notify_insert_search_collision();
00091     }
00092   resize_base::notify_insert_search_end();
00093   if (ins_pos == m_num_e)
00094     __throw_insert_error();
00095   return std::make_pair(ins_pos, pos_hash_pair.second);
00096 }
00097 
00098 PB_DS_CLASS_T_DEC
00099 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
00100 PB_DS_CLASS_C_DEC::
00101 insert_imp(const_reference r_val, true_type)
00102 {
00103   key_const_reference r_key = PB_DS_V2F(r_val);
00104   comp_hash pos_hash_pair = find_ins_pos(r_key, 
00105                      traits_base::m_store_extra_indicator);
00106 
00107   _GLIBCXX_DEBUG_ASSERT(pos_hash_pair.first < m_num_e);
00108   entry_pointer p_e =& m_entries[pos_hash_pair.first];
00109   if (p_e->m_stat == valid_entry_status)
00110     {
00111       PB_DS_CHECK_KEY_EXISTS(r_key)
00112       return std::make_pair(&p_e->m_value, false);
00113     }
00114 
00115   PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
00116   return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
00117 }
00118