1// -*- C++ -*-
2
3// Copyright (C) 2005-2015 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 3, 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// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23// <http://www.gnu.org/licenses/>.
24
25// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
26
27// Permission to use, copy, modify, sell, and distribute this software
28// is hereby granted without fee, provided that the above copyright
29// notice appears in all copies, and that both that copyright notice
30// and this permission notice appear in supporting documentation. None
31// of the above authors, nor IBM Haifa Research Laboratories, make any
32// representation about the suitability of this software for any
33// purpose. It is provided "as is" without express or implied
34// warranty.
35
36/**
37 * @file cc_hash_table_map_/erase_store_hash_fn_imps.hpp
38 * Contains implementations of cc_ht_map_'s erase related functions,
39 * when the hash value is stored.
40 */
41
42PB_DS_CLASS_T_DEC
43inline bool
44PB_DS_CLASS_C_DEC::
45erase_in_pos_imp(key_const_reference r_key, const comp_hash& r_pos_hash_pair)
46{
47  PB_DS_ASSERT_VALID((*this))
48  entry_pointer p_e = m_entries[r_pos_hash_pair.first];
49  resize_base::notify_erase_search_start();
50  if (p_e == 0)
51    {
52      resize_base::notify_erase_search_end();
53      PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
54      PB_DS_ASSERT_VALID((*this))
55      return false;
56    }
57
58  if (hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), p_e->m_hash,
59				  r_key, r_pos_hash_pair.second))
60    {
61      resize_base::notify_erase_search_end();
62      PB_DS_CHECK_KEY_EXISTS(r_key)
63      erase_entry_pointer(m_entries[r_pos_hash_pair.first]);
64      do_resize_if_needed_no_throw();
65      PB_DS_ASSERT_VALID((*this))
66      return true;
67    }
68
69  while (true)
70    {
71      entry_pointer p_next_e = p_e->m_p_next;
72      if (p_next_e == 0)
73	{
74	  resize_base::notify_erase_search_end();
75	  PB_DS_CHECK_KEY_DOES_NOT_EXIST(r_key)
76	  PB_DS_ASSERT_VALID((*this))
77	  return false;
78	}
79
80      if (hash_eq_fn_base::operator()(PB_DS_V2F(p_next_e->m_value),
81				      p_next_e->m_hash, r_key,
82				      r_pos_hash_pair.second))
83	{
84	  resize_base::notify_erase_search_end();
85	  PB_DS_CHECK_KEY_EXISTS(r_key)
86	  erase_entry_pointer(p_e->m_p_next);
87	  do_resize_if_needed_no_throw();
88	  PB_DS_ASSERT_VALID((*this))
89	  return true;
90	}
91      resize_base::notify_erase_search_collision();
92      p_e = p_next_e;
93    }
94}
95