bslstp_hashtable.h

Go to the documentation of this file.

/// @file bslstp_hashtable.h
///
/// The content of this file has been pre-processed for Doxygen.
///
 
 
// bslstp_hashtable.h                                                 -*-C++-*-
#ifndef INCLUDED_BSLSTP_HASHTABLE
#define INCLUDED_BSLSTP_HASHTABLE
 
/// @defgroup bslstp_hashtable bslstp_hashtable
/// @brief  Provide facilities for STLPort implementation.
/// @addtogroup bsl
/// @{
/// @addtogroup bslstp
/// @{
/// @addtogroup bslstp_hashtable
/// @{
///
/// <h1> Outline </h1>
/// * <a href="#bslstp_hashtable-purpose"> Purpose</a>
/// * <a href="#bslstp_hashtable-classes"> Classes </a>
/// * <a href="#bslstp_hashtable-description"> Description </a>
///
/// # Purpose {#bslstp_hashtable-purpose}
/// Provide facilities for STLPort implementation.
///
/// @deprecated  Do not use directly.
///
/// # Classes {#bslstp_hashtable-classes}
///
///
/// @see  bslstp_hashmap, bslstp_hashset
///
/// # Description {#bslstp_hashtable-description}
/// This component is for internal use only.
///
/// Note that the functions in this component are based on STLPort's
/// implementation, with copyright notice as follows:
/// @code
//*
/ *
/ * Copyright (c) 1994
/ * Hewlett-Packard Company
/ *
/ * Copyright (c) 1996,1997
/ * Silicon Graphics Computer Systems, Inc.
/ *
/ * Copyright (c) 1997
/ * Moscow Center for SPARC Technology
/ *
/ * Copyright (c) 1999
/ * Boris Fomitchev
/ *
/ * This material is provided "as is", with absolutely no warranty expressed
/ * or implied. Any use is at your own risk.
/ *
/ * Permission to use or copy this software for any purpose is hereby granted
/ * without fee, provided the above notices are retained on all copies.
/ * Permission to modify the code and to distribute modified code is granted,
/ * provided the above notices are retained, and a notice that the code was
/ * modified is included with the above copyright notice.
/ *
/ */
/// @endcode
///
/// /Usage
/// /-----
///  This component is for internal use only.
/// @}
/** @} */
/** @} */
 
/** @addtogroup bsl
 * @{
 */
/** @addtogroup bslstp
 * @{
 */
/** @addtogroup bslstp_hashtable
 * @{
 */
 
#ifdef BDE_OPENSOURCE_PUBLICATION // STP
#error "bslstp_hashtable is not for publication"
#endif
#include <bslstp_alloc.h>
#include <bslstp_iterator.h> // const and nonconst traits for iterator
#include <bslstp_util.h>
 
#include <bslma_constructionutil.h>
#include <bslma_destructionutil.h>
 
#include <bsls_exceptionutil.h>
#include <bsls_util.h>
 
#include <bslstl_hash.h>
#include <bslstl_iterator.h>
#include <bslstl_pair.h>
#include <bslstl_vector.h>
 
#include <algorithm>
#include <functional>
#include <iterator>
 
// Hashtable class, used to implement the hashed associative containers
// hash_set, hash_map, hash_multiset, and hash_multimap.
 
namespace bsl {
 
template <class _Val>
struct _Hashtable_node
{
  typedef _Hashtable_node<_Val> _Self;
  _Self* _M_next;
  _Val _M_val;
};
 
// some compilers require the names of template parameters to be the same
template <class _Val, class _Key, class _HF,
          class _ExK, class _EqK, class _All>
class hashtable;
 
template <class _Val, class _Key, class _HF,
          class _ExK, class _EqK, class _All>
struct _Hashtable_iterator
{
  typedef hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
          _Hashtable;
  typedef _Hashtable_node<_Val> _Node;
 
  _Node* _M_cur;
  _Hashtable* _M_ht;
 
  _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
    : _M_cur(__n), _M_ht(__tab) {}
  _Hashtable_iterator() {}
 
  _Node* _M_skip_to_next();
};
 
 
template <class _Val, class _Traits, class _Key, class _HF,
          class _ExK, class _EqK, class _All>
struct _Ht_iterator : public _Hashtable_iterator< _Val, _Key,_HF, _ExK,_EqK,_All>
{
 
  typedef _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All> _Base;
 
  //  typedef _Ht_iterator<_Val, _Nonconst_traits<_Val>,_Key,_HF,_ExK,_EqK,_All> iterator;
  //  typedef _Ht_iterator<_Val, _Const_traits<_Val>,_Key,_HF,_ExK,_EqK,_All> const_iterator;
  typedef _Ht_iterator<_Val, _Traits,_Key,_HF,_ExK,_EqK,_All> _Self;
 
  typedef hashtable<_Val,_Key,_HF,_ExK,_EqK,_All> _Hashtable;
  typedef _Hashtable_node<_Val> _Node;
 
  typedef _Val value_type;
  typedef std::forward_iterator_tag iterator_category;
  typedef ptrdiff_t difference_type;
  typedef size_t size_type;
  typedef typename _Traits::reference reference;
  typedef typename _Traits::pointer   pointer;
 
  _Ht_iterator(const _Node* __n, const _Hashtable* __tab) :
    _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>(const_cast<_Node*>(__n),
                                             const_cast<_Hashtable*>(__tab)) {}
  _Ht_iterator() {}
  _Ht_iterator(const _Ht_iterator<_Val, _Nonconst_traits<_Val>,_Key,_HF,_ExK,_EqK,_All>& __it) :
    _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>(__it) {}
 
  reference operator*() const {
      return this->_M_cur->_M_val;
  }
 
  pointer operator -> ( ) const { return & ( operator * ( ) ) ; }
 
  _Self& operator++() {
    _Node* __n = this->_M_cur->_M_next;
    this->_M_cur =  (__n !=0 ? __n : this->_M_skip_to_next());
    return *this;
  }
  inline
  _Self operator++(int) {
     _Self __tmp = *this;
    ++*this;
    return __tmp;
  }
};
 
template <class _Val, class _Traits, class _Traits1, class _Key, class _HF,
          class _ExK, class _EqK, class _All>
inline
bool operator==(
               const _Ht_iterator<_Val, _Traits,_Key,_HF,_ExK,_EqK,_All>& __x,
               const _Ht_iterator<_Val, _Traits1,_Key,_HF,_ExK,_EqK,_All>& __y)
{
  return __x._M_cur == __y._M_cur;
}
 
 
template <class _Val, class _Key, class _HF,
          class _ExK, class _EqK, class _All>
inline
bool operator!=(const _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>& __x,
                const _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>& __y) {
  return __x._M_cur != __y._M_cur;
}
 
#define BSLSTP_STL_NUM_PRIMES  31
 
template <class _Tp>
class _Stl_prime {
public:
  static const size_t _M_list[BSLSTP_STL_NUM_PRIMES];
};
 
typedef _Stl_prime<bool> _Stl_prime_type;
 
 
// Hashtables handle allocators a bit differently than other containers
//  do.  If we're using standard-conforming allocators, then a hashtable
//  unconditionally has a member variable to hold its allocator, even if
//  it so happens that all instances of the allocator type are identical.
// This is because, for hashtables, this extra storage is negligible.
//  Additionally, a base class wouldn't serve any other purposes; it
//  wouldn't, for example, simplify the exception-handling code.
template <class _Val, class _Key, class _HF,
          class _ExK, class _EqK, class _All>
class hashtable
{
  typedef hashtable<_Val, _Key, _HF, _ExK, _EqK, _All> _Self;
 
public:
  typedef _Key key_type;
  typedef _Val value_type;
  typedef _HF hasher;
  typedef _EqK key_equal;
 
  typedef size_t            size_type;
  typedef ptrdiff_t         difference_type;
  typedef value_type*       pointer;
  typedef const value_type* const_pointer;
  typedef value_type&       reference;
  typedef const value_type& const_reference;
  typedef std::forward_iterator_tag _Iterator_category;
 
  hasher hash_funct() const { return _M_hash; }
  key_equal key_eq() const { return _M_equals; }
 
private:
  typedef _Hashtable_node<_Val> _Node;
 
  struct QuickSwap;
  friend struct QuickSwap;
 
  /// Function object to quickly swap two trees with identical
  /// allocators and allocation modes.
  struct QuickSwap
  {
 
      /// Swap contents of `v1` and `v2`.  Undefined unless
      /// `v1.get_allocator() == v2.get_allocator()` and
      /// `v1.allocationHint() == v2.allocationHint()`.
      void operator()(_Self& v1, _Self& v2) const
      {
          ::std::swap(v1._M_hash,    v2._M_hash);
          ::std::swap(v1._M_equals,  v2._M_equals);
          ::std::swap(v1._M_get_key, v2._M_get_key);
          v1._M_buckets.swap(v2._M_buckets);
          ::std::swap(v1._M_num_elements._M_data,
                      v2._M_num_elements._M_data);
      }
  };
 
private:
  typedef typename _Alloc_traits<_Node, _All>::allocator_type _M_node_allocator_type;
  typedef typename _Alloc_traits<void*, _All>::allocator_type _M_node_ptr_allocator_type;
  typedef vector<void*, _M_node_ptr_allocator_type> _BucketVector;
public:
  typedef typename _Alloc_traits<_Val,_All>::allocator_type allocator_type;
  allocator_type get_allocator() const {
    //return _STLP_CONVERT_ALLOCATOR((const _M_node_allocator_type&)_M_num_elements, _Val).allocator();
    return (const _M_node_allocator_type&)(_M_num_elements.get_allocator());
  }
private:
  hasher                _M_hash;
  key_equal             _M_equals;
  _ExK                  _M_get_key;
  _BucketVector         _M_buckets;
  _STLP_alloc_proxy<size_type, _Node, _M_node_allocator_type>  _M_num_elements;
  const _Node* _M_get_bucket(size_t __n) const { return (_Node*)_M_buckets[__n]; }
 
public:
  typedef _Const_traits<_Val> __const_val_traits;
  typedef _Nonconst_traits<_Val> __nonconst_val_traits;
  typedef _Ht_iterator<_Val, __const_val_traits,_Key,_HF,_ExK,_EqK, _All> const_iterator;
  typedef _Ht_iterator<_Val, __nonconst_val_traits,_Key,_HF,_ExK,_EqK,_All> iterator;
  friend struct _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>;
  friend struct _Ht_iterator<_Val, _Nonconst_traits<_Val>,_Key,_HF,_ExK,_EqK,_All>;
  friend struct _Ht_iterator<_Val, _Const_traits<_Val>,_Key,_HF,_ExK,_EqK, _All>;
 
public:
  hashtable(size_type __n,
            const _HF&  __hf,
            const _EqK& __eql,
            const _ExK& __ext,
            const allocator_type& __a = allocator_type())
    :
      _M_hash(__hf),
      _M_equals(__eql),
      _M_get_key(__ext),
      _M_buckets(__a),
      _M_num_elements(__a, (size_type)0)
  {
    _M_initialize_buckets(__n);
  }
 
  hashtable(size_type __n,
            const _HF&    __hf,
            const _EqK&   __eql,
            const allocator_type& __a = allocator_type())
    :
      _M_hash(__hf),
      _M_equals(__eql),
      _M_get_key(_ExK()),
      _M_buckets(__a),
      _M_num_elements(__a, (size_type)0)
  {
    _M_initialize_buckets(__n);
  }
 
  /* TODO:
  typedef BloombergLP::bslstl::TraitsGroupStlUnorderedContainer<
    _Val,
    _HF,
    _EqK,
    _All> HashTableTypeTraits;
  BSLALG_DECLARE_NESTED_TRAITS(hashtable, HashTableTypeTraits);
  */
 
  hashtable(const _Self& __ht)
    :
      _M_hash(__ht._M_hash),
      _M_equals(__ht._M_equals),
      _M_get_key(__ht._M_get_key),
      _M_buckets(BloombergLP::bslstp::Util::copyContainerAllocator(__ht.get_allocator())),
      _M_num_elements(BloombergLP::bslstp::Util::copyContainerAllocator((const _M_node_allocator_type&)__ht._M_num_elements), (size_type)0)
  {
    _M_copy_from(__ht);
  }
 
  hashtable(const _Self& __ht, const allocator_type& __a)
    :
      _M_hash(__ht._M_hash),
      _M_equals(__ht._M_equals),
      _M_get_key(__ht._M_get_key),
      _M_buckets(__a),
      _M_num_elements(__a, (size_type)0)
  {
    _M_copy_from(__ht);
  }
 
  _Self& operator= (const _Self& __ht)
  {
    if (&__ht != this) {
      clear();
      _M_hash = __ht._M_hash;
      _M_equals = __ht._M_equals;
      _M_get_key = __ht._M_get_key;
      _M_copy_from(__ht);
    }
    return *this;
  }
 
  ~hashtable() { clear(); }
 
  size_type size() const { return _M_num_elements._M_data; }
  size_type max_size() const { return size_type(-1); }
  bool empty() const { return size() == 0; }
 
  void swap(_Self& __ht)
  {
    BloombergLP::bslstp::Util::swapContainers(*this, __ht, QuickSwap());
  }
 
  iterator begin()
  {
    for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
      if (_M_buckets[__n])
        return iterator((_Node*)_M_buckets[__n], this);               // RETURN
    return end();
  }
 
  iterator end() { return iterator((_Node*)0, this); }
 
  const_iterator begin() const
  {
    for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
      if (_M_buckets[__n])
        return const_iterator((_Node*)_M_buckets[__n], this);         // RETURN
    return end();
  }
 
  const_iterator end() const { return const_iterator((_Node*)0, this); }
 
  static bool  _M_equal (const hashtable<_Val, _Key, _HF, _ExK, _EqK, _All>&,
                         const hashtable<_Val, _Key, _HF, _ExK, _EqK, _All>&);
 
public:
 
  size_type bucket_count() const { return _M_buckets.size(); }
 
  size_type max_bucket_count() const
    { return _Stl_prime_type::_M_list[(int)BSLSTP_STL_NUM_PRIMES - 1]; }
 
  size_type elems_in_bucket(size_type __bucket) const
  {
    size_type __result = 0;
    for (_Node* __cur = (_Node*)_M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
      __result += 1;
    return __result;
  }
 
  pair<iterator, bool> insert_unique(const value_type& __obj)
  {
    resize(_M_num_elements._M_data + 1);
    return insert_unique_noresize(__obj);
  }
 
  iterator insert_equal(const value_type& __obj)
  {
    resize(_M_num_elements._M_data + 1);
    return insert_equal_noresize(__obj);
  }
 
  pair<iterator, bool> insert_unique_noresize(const value_type& __obj);
  iterator insert_equal_noresize(const value_type& __obj);
 
  template <class _InputIterator>
  void insert_unique(_InputIterator __f, _InputIterator __l)
  {
  // MODIFIED BY ARTHUR
  //  insert_unique(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator));
    insert_unique(__f, __l, typename bsl::iterator_traits<_InputIterator>::iterator_category());
  }
 
  template <class _InputIterator>
  void insert_equal(_InputIterator __f, _InputIterator __l)
  {
  // MODIFIED BY ARTHUR
  //  insert_equal(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator));
  // MODIFIEd BY BCHAPMAN
  //  insert_unique(__f, __l, typename bsl::iterator_traits<_InputIterator>::iterator_category());
    insert_equal(__f, __l, typename bsl::iterator_traits<_InputIterator>::iterator_category());
  }
 
  template <class _InputIterator>
  void insert_unique(_InputIterator __f, _InputIterator __l,
                     const std::input_iterator_tag &)
  {
    for ( ; __f != __l; ++__f)
      insert_unique(*__f);
  }
 
  template <class _InputIterator>
  void insert_equal(_InputIterator __f, _InputIterator __l,
                    const std::input_iterator_tag &)
  {
    for ( ; __f != __l; ++__f)
      insert_equal(*__f);
  }
 
  template <class _ForwardIterator>
  void insert_unique(_ForwardIterator __f, _ForwardIterator __l,
                     const std::forward_iterator_tag &)
  {
    size_type __n = bsl::distance(__f, __l);
    resize(_M_num_elements._M_data + __n);
    for ( ; __n > 0; --__n, ++__f)
      insert_unique_noresize(*__f);
  }
 
  template <class _ForwardIterator>
  void insert_equal(_ForwardIterator __f, _ForwardIterator __l,
                    const std::forward_iterator_tag &)
  {
    size_type __n = bsl::distance(__f, __l);
    resize(_M_num_elements._M_data + __n);
    for ( ; __n > 0; --__n, ++__f)
      insert_equal_noresize(*__f);
  }
 
 
  reference find_or_insert(const value_type& __obj);
 
private:
  _Node* _M_find(const key_type& __key) const
  {
    size_type __n = _M_hash(__key)% _M_buckets.size();
    _Node* __first;
    for ( __first = (_Node*)_M_buckets[__n];
          __first && !_M_equals(_M_get_key(__first->_M_val), __key);
          __first = __first->_M_next)
      {}
    return __first;
  }
 
public:
  template <class _KT>
  iterator find(const _KT& __key)
  {
    return iterator(_M_find(__key), this);
  }
 
  template <class _KT>
  const_iterator find(const _KT& __key) const
  {
    return const_iterator(_M_find(__key), this);
  }
 
  size_type count(const key_type& __key) const
  {
    const size_type __n = _M_bkt_num_key(__key);
    size_type __result = 0;
 
    for (const _Node* __cur = (_Node*)_M_buckets[__n]; __cur; __cur = __cur->_M_next)
      if (_M_equals(_M_get_key(__cur->_M_val), __key))
        ++__result;
    return __result;
  }
 
  pair<iterator, iterator>
  equal_range(const key_type& __key);
 
  pair<const_iterator, const_iterator>
  equal_range(const key_type& __key) const;
 
  size_type erase(const key_type& __key);
  //   void erase(const iterator& __it); `
  void erase(const const_iterator& __it) ;
 
  //  void erase(const const_iterator& __first, const const_iterator __last) {
  //     erase((const iterator&)__first, (const iterator&)__last);
  //  }
  void erase(const_iterator __first, const_iterator __last);
  void resize(size_type __num_elements_hint);
  void clear();
 
public:
  // this is for hash_map::operator[]
  reference _M_insert(const value_type& __obj);
 
private:
 
  size_type _M_next_size(size_type __n) const;
 
  void _M_initialize_buckets(size_type __n)
  {
    const size_type __n_buckets = _M_next_size(__n);
    _M_buckets.reserve(__n_buckets);
    _M_buckets.insert(_M_buckets.end(), __n_buckets, (void*) 0);
    _M_num_elements._M_data = 0;
  }
 
  size_type _M_bkt_num_key(const key_type& __key) const
  {
    return _M_bkt_num_key(__key, _M_buckets.size());
  }
 
  size_type _M_bkt_num(const value_type& __obj) const
  {
    return _M_bkt_num_key(_M_get_key(__obj));
  }
 
  size_type _M_bkt_num_key(const key_type& __key, size_t __n) const
  {
    return _M_hash(__key) % __n;
  }
 
  size_type _M_bkt_num(const value_type& __obj, size_t __n) const
  {
    return _M_bkt_num_key(_M_get_key(__obj), __n);
  }
 
  _Node* _M_new_node(const value_type& __obj)
  {
    _Node* __n = _M_num_elements.allocatorRef().allocate(1);
    __n->_M_next = 0;
    BSLS_TRY {
      BloombergLP::bslma::ConstructionUtil::construct(
                                             BSLS_UTIL_ADDRESSOF(__n->_M_val),
                                             _M_num_elements.get_allocator(),
                                             __obj);
    }
    BSLS_CATCH(...)
    {
        (_M_num_elements.allocatorRef().deallocate(__n, 1));
        BSLS_RETHROW;
    }
    return __n;
  }
 
  void _M_delete_node(_Node* __n)
  {
    BloombergLP::bslma::DestructionUtil::destroy(
                                             BSLS_UTIL_ADDRESSOF(__n->_M_val));
    _M_num_elements.allocatorRef().deallocate(__n, 1);
  }
 
  void _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
  void _M_erase_bucket(const size_type __n, _Node* __last);
 
  void _M_copy_from(const _Self& __ht);
};
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
inline
bool operator==(const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __hm1,
                const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __hm2)
{
  return hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_equal(__hm1, __hm2);
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
inline
bool operator!=(const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __hm1,
                const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __hm2) {
  return !(__hm1 == __hm2);
}
 
}  // close namespace bsl
 
// BEGIN FORMER CONTENTS OF bslstp_hashtable.c
/*
 *
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Copyright (c) 1997
 * Moscow Center for SPARC Technology
 *
 * Copyright (c) 1999
 * Boris Fomitchev
 *
 * This material is provided "as is", with absolutely no warranty expressed
 * or implied. Any use is at your own risk.
 *
 * Permission to use or copy this software for any purpose is hereby granted
 * without fee, provided the above notices are retained on all copies.
 * Permission to modify the code and to distribute modified code is granted,
 * provided the above notices are retained, and a notice that the code was
 * modified is included with the above copyright notice.
 *
 */
namespace bsl {
 
# define BSLSTP_STL_PRIME_LIST_BODY {                                        \
  5ul,          11ul,         23ul,                                 \
  53ul,         97ul,         193ul,       389ul,       769ul,      \
  1543ul,       3079ul,       6151ul,      12289ul,     24593ul,    \
  49157ul,      98317ul,      196613ul,    393241ul,    786433ul,   \
  1572869ul,    3145739ul,    6291469ul,   12582917ul,  25165843ul, \
  50331653ul,   100663319ul,  201326611ul, 402653189ul, 805306457ul,\
  1610612741ul, 3221225473ul, 4294967291ul                          \
}
 
template <class _Tp>
const size_t _Stl_prime<_Tp>::_M_list[BSLSTP_STL_NUM_PRIMES] = BSLSTP_STL_PRIME_LIST_BODY;
 
# undef BSLSTP_STL_PRIME_LIST_BODY
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK,
          class _All>
_Hashtable_node<_Val>*
_Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_skip_to_next() {
  size_t __bucket = _M_ht->_M_bkt_num(_M_cur->_M_val);
  size_t __h_sz;
  __h_sz = this->_M_ht->bucket_count();
 
  _Node* __i=0;
  while (__i==0 && ++__bucket < __h_sz)
    __i = (_Node*)_M_ht->_M_buckets[__bucket];
  return __i;
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK,
          class _All>
typename hashtable < _Val , _Key , _HF , _ExK , _EqK , _All > :: size_type
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_next_size(size_type __n) const    {
  const size_type* __first = (const size_type*)_Stl_prime_type::_M_list;
  const size_type* __last =  (const size_type*)_Stl_prime_type::_M_list + (int)BSLSTP_STL_NUM_PRIMES;
  // MODIFIED BY ARTHUR
  const size_type* pos = ::std::lower_bound(__first, __last, __n, ::std::less<size_type>());
  return (pos == __last ? *(__last - 1) : *pos);
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
bool
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_equal(
                          const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __ht1,
                          const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __ht2)
{
  //  typedef _Hashtable_node<_Val> _Node;
  if (__ht1.bucket_count() != __ht2.bucket_count())
    return false;                                                     // RETURN
  for (size_t __n = 0; __n < __ht1.bucket_count(); ++__n) {
    const _Node* __cur1 = __ht1._M_get_bucket(__n);
    const _Node* __cur2 = __ht2._M_get_bucket(__n);
    for ( ; __cur1 && __cur2 && __cur1->_M_val == __cur2->_M_val;
          __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next)
      {}
    if (__cur1 || __cur2)
      return false;                                                   // RETURN
  }
  return true;
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
pair< _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All> , bool>
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::insert_unique_noresize(const value_type& __obj)
{
  const size_type __n = _M_bkt_num(__obj);
  _Node* __first = (_Node*)_M_buckets[__n];
 
  for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
    if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj)))
      return pair<iterator, bool>(iterator(__cur, this), false);      // RETURN
 
  _Node* __tmp = _M_new_node(__obj);
  __tmp->_M_next = __first;
  _M_buckets[__n] = __tmp;
  ++_M_num_elements._M_data;
  return pair<iterator, bool>(iterator(__tmp, this), true);
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
typename hashtable < _Val , _Key , _HF , _ExK , _EqK , _All > :: iterator
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::insert_equal_noresize(const value_type& __obj)
{
  const size_type __n = _M_bkt_num(__obj);
  _Node* __first = (_Node*)_M_buckets[__n];
 
  for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
    if (_M_equals(_M_get_key(__cur->_M_val), _M_get_key(__obj))) {
      _Node* __tmp = _M_new_node(__obj);
      __tmp->_M_next = __cur->_M_next;
      __cur->_M_next = __tmp;
      ++_M_num_elements._M_data;
      return iterator(__tmp, this);                                   // RETURN
    }
 
  _Node* __tmp = _M_new_node(__obj);
  __tmp->_M_next = __first;
  _M_buckets[__n] = __tmp;
  ++_M_num_elements._M_data;
  return iterator(__tmp, this);
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
typename hashtable < _Val , _Key , _HF , _ExK , _EqK , _All > :: reference
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_insert(const value_type& __obj)
{
  resize(_M_num_elements._M_data + 1);
 
  size_type __n = _M_bkt_num(__obj);
  _Node* __first = (_Node*)_M_buckets[__n];
 
  _Node* __tmp = _M_new_node(__obj);
  __tmp->_M_next = __first;
  _M_buckets[__n] = __tmp;
  ++_M_num_elements._M_data;
  return __tmp->_M_val;
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
typename hashtable < _Val , _Key , _HF , _ExK , _EqK , _All > :: reference
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::find_or_insert(const value_type& __obj)
{
 
  _Node* __first = _M_find(_M_get_key(__obj));
  if (__first)
    return __first->_M_val;                                           // RETURN
  else
    return _M_insert(__obj);                                          // RETURN
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
pair< _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All>,
      _Ht_iterator<_Val, _Nonconst_traits<_Val>, _Key, _HF, _ExK, _EqK, _All> >
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::equal_range(const key_type& __key)
{
  typedef pair<iterator, iterator> _Pii;
  const size_type __n = _M_bkt_num_key(__key);
 
  for (_Node* __first = (_Node*)_M_buckets[__n]; __first; __first = __first->_M_next)
    if (_M_equals(_M_get_key(__first->_M_val), __key)) {
      for (_Node* __cur = __first->_M_next; __cur; __cur = __cur->_M_next)
        if (!_M_equals(_M_get_key(__cur->_M_val), __key))
          return _Pii(iterator(__first, this), iterator(__cur, this));
                                                                      // RETURN
      for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
        if (_M_buckets[__m])
          return _Pii(iterator(__first, this),
                     iterator((_Node*)_M_buckets[__m], this));        // RETURN
      return _Pii(iterator(__first, this), end());                    // RETURN
    }
  return _Pii(end(), end());
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
pair< _Ht_iterator<_Val, _Const_traits<_Val>, _Key, _HF, _ExK, _EqK, _All>,
     _Ht_iterator<_Val, _Const_traits<_Val>, _Key, _HF, _ExK, _EqK, _All> >
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::equal_range(const key_type& __key) const
{
  typedef pair<const_iterator, const_iterator> _Pii;
  const size_type __n = _M_bkt_num_key(__key);
 
  for (const _Node* __first = (_Node*)_M_buckets[__n] ;
       __first;
       __first = __first->_M_next) {
    if (_M_equals(_M_get_key(__first->_M_val), __key)) {
      for (const _Node* __cur = __first->_M_next;
           __cur;
           __cur = __cur->_M_next)
        if (!_M_equals(_M_get_key(__cur->_M_val), __key))
          return _Pii(const_iterator(__first, this),
                      const_iterator(__cur, this));                   // RETURN
      for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
        if (_M_buckets[__m])
          return _Pii(const_iterator(__first, this),
                      const_iterator((_Node*)_M_buckets[__m], this)); // RETURN
      return _Pii(const_iterator(__first, this), end());              // RETURN
    }
  }
  return _Pii(end(), end());
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
typename hashtable < _Val , _Key , _HF , _ExK , _EqK , _All > :: size_type
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::erase(const key_type& __key)
{
  const size_type __n = _M_bkt_num_key(__key);
  _Node* __first = (_Node*)_M_buckets[__n];
  size_type __erased = 0;
 
  if (__first) {
    _Node* __cur = __first;
    _Node* __next = __cur->_M_next;
    while (__next) {
      if (_M_equals(_M_get_key(__next->_M_val), __key)) {
        __cur->_M_next = __next->_M_next;
        _M_delete_node(__next);
        __next = __cur->_M_next;
        ++__erased;
        --_M_num_elements._M_data;
      }
      else {
        __cur = __next;
        __next = __cur->_M_next;
      }
    }
    if (_M_equals(_M_get_key(__first->_M_val), __key)) {
      _M_buckets[__n] = __first->_M_next;
      _M_delete_node(__first);
      ++__erased;
      --_M_num_elements._M_data;
    }
  }
  return __erased;
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::erase(const const_iterator& __it)
{
  // const iterator& __it = __REINTERPRET_CAST(const iterator&,_c_it);
  const _Node* __p = __it._M_cur;
  if (__p) {
    const size_type __n = _M_bkt_num(__p->_M_val);
    _Node* __cur = (_Node*)_M_buckets[__n];
 
    if (__cur == __p) {
      _M_buckets[__n] = __cur->_M_next;
      _M_delete_node(__cur);
      --_M_num_elements._M_data;
    }
    else {
      _Node* __next = __cur->_M_next;
      while (__next) {
        if (__next == __p) {
          __cur->_M_next = __next->_M_next;
          _M_delete_node(__next);
          --_M_num_elements._M_data;
          break;
        }
        else {
          __cur = __next;
          __next = __cur->_M_next;
        }
      }
    }
  }
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::erase(const_iterator _c_first, const_iterator _c_last)
{
  iterator& __first = (iterator&)_c_first;
  iterator& __last = (iterator&)_c_last;
  size_type __f_bucket = __first._M_cur ?
    _M_bkt_num(__first._M_cur->_M_val) : _M_buckets.size();
  size_type __l_bucket = __last._M_cur ?
    _M_bkt_num(__last._M_cur->_M_val) : _M_buckets.size();
  if (__first._M_cur == __last._M_cur)
    return;                                                           // RETURN
  else if (__f_bucket == __l_bucket)
    _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
  else {
    _M_erase_bucket(__f_bucket, __first._M_cur, 0);
    for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n)
      _M_erase_bucket(__n, 0);
    if (__l_bucket != _M_buckets.size())
      _M_erase_bucket(__l_bucket, __last._M_cur);
  }
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::resize(size_type __num_elements_hint)
{
  const size_type __old_n = _M_buckets.size();
  if (__num_elements_hint > __old_n) {
    const size_type __n = _M_next_size(__num_elements_hint);
    if (__n > __old_n) {
      _BucketVector __tmp(__n, (void*)(0),
                          _M_buckets.get_allocator());
      BSLS_TRY {
        for (size_type __bucket = 0; __bucket < __old_n; ++__bucket) {
          _Node* __first = (_Node*)_M_buckets[__bucket];
          while (__first) {
            size_type __new_bucket = _M_bkt_num(__first->_M_val, __n);
            _M_buckets[__bucket] = __first->_M_next;
            __first->_M_next = (_Node*)__tmp[__new_bucket];
            __tmp[__new_bucket] = __first;
            __first = (_Node*)_M_buckets[__bucket];
          }
        }
        _M_buckets.swap(__tmp);
      }
      BSLS_CATCH(...) {
        for (size_type __bucket = 0; __bucket < __tmp.size(); ++__bucket) {
          while (__tmp[__bucket]) {
            _Node* __next = ((_Node*)__tmp[__bucket])->_M_next;
            _M_delete_node((_Node*)__tmp[__bucket]);
            __tmp[__bucket] = __next;
          }
        }
        BSLS_RETHROW;
      }
    }
  }
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::_M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
{
  _Node* __cur = (_Node*)_M_buckets[__n];
  if (__cur == __first)
    _M_erase_bucket(__n, __last);
  else {
    _Node* __next;
    for (__next = __cur->_M_next;
         __next != __first;
         __cur = __next, __next = __cur->_M_next)
      ;
    while (__next != __last) {
      __cur->_M_next = __next->_M_next;
      _M_delete_node(__next);
      __next = __cur->_M_next;
      --_M_num_elements._M_data;
    }
  }
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::_M_erase_bucket(const size_type __n, _Node* __last)
{
  _Node* __cur = (_Node*)_M_buckets[__n];
  while (__cur && __cur != __last) {
    _Node* __next = __cur->_M_next;
    _M_delete_node(__cur);
    __cur = __next;
    _M_buckets[__n] = __cur;
    --_M_num_elements._M_data;
  }
}
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::clear()
{
  for (size_type __i = 0; __i < _M_buckets.size(); ++__i) {
    _Node* __cur = (_Node*)_M_buckets[__i];
    while (__cur != 0) {
      _Node* __next = __cur->_M_next;
      _M_delete_node(__cur);
      __cur = __next;
    }
    _M_buckets[__i] = 0;
  }
  _M_num_elements._M_data = 0;
}
 
 
template <class _Val, class _Key, class _HF, class _ExK, class _EqK, class _All>
void hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>
  ::_M_copy_from(const hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>& __ht)
{
  _M_buckets.clear();
  _M_buckets.reserve(__ht._M_buckets.size());
  _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (void*) 0);
  BSLS_TRY {
    for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) {
      const _Node* __cur = (_Node*)__ht._M_buckets[__i];
      if (__cur) {
        _Node* __xcopy = _M_new_node(__cur->_M_val);
        _M_buckets[__i] = __xcopy;
 
        for (_Node* __next = __cur->_M_next;
             __next;
             __cur = __next, __next = __cur->_M_next) {
          __xcopy->_M_next = _M_new_node(__next->_M_val);
          __xcopy = __xcopy->_M_next;
        }
      }
    }
    _M_num_elements._M_data = __ht._M_num_elements._M_data;
  }
  BSLS_CATCH(...) {
    clear();
    BSLS_RETHROW;
  }
}
 
}  // close namespace bsl
 
// Local Variables:
// mode:C++
// End:
// END FORMER CONTENTS OF bslstp_hashtable.c
 
#endif /* INCLUDED_BSLSTP_HASHTABLE */
 
// Local Variables:
// mode:C++
// End:
 
/** @} */
/** @} */
/** @} */