Subversion Repositories scarts

// -*- C++ -*-

// Copyright (C) 2005 Free Software Foundation, Inc.

//

// This file is part of the GNU ISO C++ Library.  This library is free

// software; you can redistribute it and/or modify it under the

// terms of the GNU General Public License as published by the

// Free Software Foundation; either version 2, or (at your option)

// any later version.

// This library is distributed in the hope that it will be useful,

// but WITHOUT ANY WARRANTY; without even the implied warranty of

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along

// with this library; see the file COPYING.  If not, write to the Free

// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,

// USA.

// As a special exception, you may use this file as part of a free software

// library without restriction.  Specifically, if other files instantiate

// templates or use macros or inline functions from this file, or you compile

// this file and link it with other files to produce an executable, this

// file does not by itself cause the resulting executable to be covered by

// the GNU General Public License.  This exception does not however

// invalidate any other reasons why the executable file might be covered by

// the GNU General Public License.

// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.

// Permission to use, copy, modify, sell, and distribute this software

// is hereby granted without fee, provided that the above copyright

// notice appears in all copies, and that both that copyright notice and

// this permission notice appear in supporting documentation. None of

// the above authors, nor IBM Haifa Research Laboratories, make any

// representation about the suitability of this software for any

// purpose. It is provided "as is" without express or implied warranty.

/**

 * @file erase_store_hash_fn_imps.hpp

 * Contains implementations of gp_ht_map_'s erase related functions, when the hash

 *      value is stored.

 */

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::size_type

PB_ASSOC_CLASS_C_DEC::

erase(const_key_reference r_key, int_to_type<true>)

{

  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)

    PB_ASSOC_DBG_ONLY(assert_valid();)

    return (erase_in_pos_imp(r_key, 0));

}

PB_ASSOC_CLASS_T_DEC

inline typename PB_ASSOC_CLASS_C_DEC::size_type

PB_ASSOC_CLASS_C_DEC::

erase_in_pos_imp(const_key_reference r_key, const comp_hash& /*r_pos_hash_pair*/)

{

  const comp_hash pos_hash_pair =

    my_ranged_probe_fn_base::operator()(r_key);

  for (size_type i = 0; i < m_num_e; ++i)

    {

      const size_type pos = my_ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);

      entry* const p_e = m_a_entries + pos;

      switch(p_e->m_stat)

        {

        case EMPTY_ENTRY_STATUS:

          {

            my_resize_base::notify_erase_search_end();

            PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(

                                                                          r_key));

            return (0);

          }

          break;

        case VALID_ENTRY_STATUS:

          if (my_hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second))

            {

              my_resize_base::notify_erase_search_end();

              erase_entry(p_e);

              do_resize_if_needed_no_throw();

              return (1);

            }

          break;

        case ERASED_ENTRY_STATUS:

          break;

        default:

          PB_ASSOC_DBG_ASSERT(0);

        };

      my_resize_base::notify_erase_search_collision();

    }

  my_resize_base::notify_erase_search_end();

  return (0);

}