204-C++hashtable

#include<vector>

#include"yhp_alloc.h"
#include"yhp_construct.h"
#include"yhp_iterator.h"
#include"yhp_hash_fun.h"
#include"yhp_functional.h"
#ifndef YHP_HASHTABLE_H
#define YHP_HASHTABLE_H

namespace yhp
{
	template <class _ForwardIter, class _Tp, class _Distance>
_ForwardIter __lower_bound(_ForwardIter __first, _ForwardIter __last,
                           const _Tp& __val, _Distance*) 
{
	_Distance __len = 0;
	//distance(__first, __last, __len);
	__len = yhp::distance(__first,__last);
	
	_Distance __half;
	_ForwardIter __middle;
	
	while (__len > 0) 
	{
		__half = __len >> 1;
		__middle = __first;
		yhp::advance(__middle, __half);
		if (*__middle < __val) 
		{
			__first = __middle;
			++__first;
			__len = __len - __half - 1;
		}
		else
		{
			__len = __half;
		}
	}
	return __first;
}
//ower_bound( )和upper_bound( )都是利用二分查找的方法在一个排好序的数组中进行查找的。
//在从小到大的排序数组中，lower_bound( begin,end,num)：
//从数组的begin位置到end-1位置二分查找第一个大于或等于num的数字，
//找到返回该数字的地址，不存在则返回end。
//通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。
//
template <class _ForwardIter, class _Tp>
inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last,
                                   const _Tp& __val) {
  //return __lower_bound(__first, __last, __val,__DISTANCE_TYPE(__first));
  return __lower_bound(__first,__last,__val,yhp::difference_type(__first));
}

template <class _ForwardIter, class _Tp, class _Compare, class _Distance>
_ForwardIter __lower_bound(_ForwardIter __first, _ForwardIter __last,
                              const _Tp& __val, _Compare __comp, _Distance*)
{
	_Distance __len = 0;
	//distance(__first, __last, __len);
	__len = yhp::distance(__first,__last,__len);
	_Distance __half;
	_ForwardIter __middle;
	
	while (__len > 0)
	{
		__half = __len >> 1;
		__middle = __first;
		yhp::advance(__middle, __half);
		if (__comp(*__middle, __val)) 
		{
			__first = __middle;
			++__first;
			__len = __len - __half - 1;
		}
		else
		{
			__len = __half;
		}
	}
	return __first;
}

template <class _ForwardIter, class _Tp, class _Compare>
inline _ForwardIter lower_bound(_ForwardIter __first, _ForwardIter __last,
                                const _Tp& __val, _Compare __comp)
{
	//return __lower_bound(__first, __last, __val, __comp, __DISTANCE_TYPE(__first));
	return __lower_bound(__first,__last,_val,_comp,yhp::difference_type(__first));
}

	//--------------------------------------------------------------
template <class _Val>
struct _Hashtable_node
{
  _Hashtable_node* _M_next;
  _Val _M_val;
};  

template <class _Val, class _Key, class _HashFcn,
          class _ExtractKey, class _EqualKey, class _Alloc = alloc>
class hashtable;

template <class _Val, class _Key, class _HashFcn,
          class _ExtractKey, class _EqualKey, class _Alloc>
struct _Hashtable_iterator;

template <class _Val, class _Key, class _HashFcn,
          class _ExtractKey, class _EqualKey, class _Alloc>
struct _Hashtable_const_iterator;

template <class _Val, class _Key, class _HashFcn,
          class _ExtractKey, class _EqualKey, class _Alloc>
struct _Hashtable_iterator : public yhp::_Forit<_Val,int> 
{
	typedef hashtable<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>  _Hashtable;
	typedef _Hashtable_iterator<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>     iterator;
	typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn,  _ExtractKey, _EqualKey, _Alloc> const_iterator;
	typedef _Hashtable_node<_Val> _Node;
	
	typedef forward_iterator_tag iterator_category;
	typedef _Val value_type;
	//typedef ptrdiff_t difference_type;
	typedef int     difference_type;
	//typedef size_t  size_type;
	typedef unsigned int size_type;
	typedef _Val&        reference;
	typedef _Val*        pointer;

	
	_Node*        _M_cur;
	
	_Hashtable*   _M_ht;

	
	_Hashtable_iterator(_Node* __n, _Hashtable* __tab)  : _M_cur(__n), _M_ht(__tab) {}
	_Hashtable_iterator() {}
	reference operator*() const { return _M_cur->_M_val; }
	//#ifndef __SGI_STL_NO_ARROW_OPERATOR
	pointer operator->() const { return &(operator*()); }
	//pointer operator->() const { return &**this;}
	//#endif /* __SGI_STL_NO_ARROW_OPERATOR */

	iterator& operator++();
	iterator operator++(int);

	//iterator & operator--();
	///iterator operator--(int);

	bool operator==(const iterator& __it) const
	{
		return _M_cur == __it._M_cur;
	}
	bool operator!=(const iterator& __it) const
	{
		return _M_cur != __it._M_cur; 
	}
};


template <class _Val, class _Key, class _HashFcn,
          class _ExtractKey, class _EqualKey, class _Alloc>
struct _Hashtable_const_iterator : public yhp::_Forit<_Val,int> 
{
	typedef hashtable<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>      _Hashtable;
	typedef _Hashtable_iterator<_Val,_Key,_HashFcn,  _ExtractKey,_EqualKey,_Alloc> iterator;
	typedef _Hashtable_const_iterator<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc> const_iterator;
	typedef _Hashtable_node<_Val> _Node;
	
	typedef forward_iterator_tag iterator_category;

	typedef _Val value_type;
	//typedef ptrdiff_t difference_type;
	typedef int      difference_type;
	//typedef size_t size_type;
	typedef unsigned int size_type;
	typedef const _Val&  reference;
	typedef const _Val*  pointer;

	
	const _Node* _M_cur;
	const _Hashtable* _M_ht;
	
	_Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab): _M_cur(__n), _M_ht(__tab) {}
	_Hashtable_const_iterator() {}
	
	_Hashtable_const_iterator(const iterator& __it) 
		: _M_cur(__it._M_cur), _M_ht(__it._M_ht) {}
	
	reference operator*() const { return _M_cur->_M_val; }
//#ifndef __SGI_STL_NO_ARROW_OPERATOR
	pointer operator->() const { return &(operator*()); }
//#endif /* __SGI_STL_NO_ARROW_OPERATOR */
	const_iterator& operator++();
	const_iterator operator++(int);
	bool operator==(const const_iterator& __it) const 
	{ return _M_cur == __it._M_cur; }
	bool operator!=(const const_iterator& __it) const 
	{ return _M_cur != __it._M_cur; }
};

// Note: assumes long is at least 32 bits.
static const int __stl_num_primes =28;
static const unsigned long __stl_prime_list[__stl_num_primes] =
{
	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
};

inline unsigned long __stl_next_prime(unsigned long __n)
{
	const unsigned long* __first = __stl_prime_list;
	const unsigned long* __last = __stl_prime_list + __stl_num_primes;
	const unsigned long* pos = lower_bound(__first, __last, __n);
	return pos == __last ? *(__last - 1) : *pos;
}

// Forward declaration of operator==.

template <class _Val, class _Key, class _HF, class _Ex, class _Eq, class _All>
class hashtable;

template <class _Val, class _Key, class _HF, class _Ex, class _Eq, class _All>
bool operator==(const hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>& __ht1,
                const hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>& __ht2);


//hashtable
template <class _Val, class _Key, class _HashFcn,
          class _ExtractKey, class _EqualKey, class _Alloc>
class hashtable 
{
public:
	typedef _Key        key_type;
	typedef _Val        value_type;
	typedef _HashFcn    hasher;
	typedef _EqualKey   key_equal;

	
	//typedef size_t            size_type;
	typedef unsigned int        size_type;
	//typedef ptrdiff_t         difference_type;
	typedef int                 difference_type;
	typedef value_type*         pointer;
	typedef const value_type*   const_pointer;
	typedef value_type&         reference;
	typedef const value_type&   const_reference;
	
	
	hasher hash_funct() const { return _M_hash; }
	key_equal key_eq() const { return _M_equals; }
	
private:
	typedef _Hashtable_node<_Val> _Node;

public:
	typedef _Alloc   allocator_type;
	allocator_type get_allocator() const { return allocator_type(); }
private:
	typedef yhp::simple_alloc<_Node, _Alloc>  _M_node_allocator_type;

	_Node* _M_get_node() { return _M_node_allocator_type::allocate(1); }
	
	void _M_put_node(_Node* __p) { _M_node_allocator_type::deallocate(__p, 1); }

# define __HASH_ALLOC_INIT(__a)

private:
	hasher                _M_hash;
	key_equal             _M_equals;
	_ExtractKey           _M_get_key;
	//std::vector<_Node*,_Alloc> _M_buckets;
	std::vector<_Node*>   _M_buckets;
	size_type             _M_num_elements;

public:
	typedef _Hashtable_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>     iterator;
	
	typedef _Hashtable_const_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>  const_iterator;
	
	friend struct _Hashtable_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>;
	friend struct  _Hashtable_const_iterator<_Val,_Key,_HashFcn,_ExtractKey,_EqualKey,_Alloc>;

public:
	hashtable(size_type __n,
		const _HashFcn&    __hf,
		const _EqualKey&   __eql,
		const _ExtractKey& __ext,
		const allocator_type& __a = allocator_type())
		: __HASH_ALLOC_INIT(__a)
		_M_hash(__hf),
		_M_equals(__eql),
		_M_get_key(__ext),
		//_M_buckets(__a),
		_M_num_elements(0)
	{
		_M_initialize_buckets(__n);  //1
	}
	hashtable(size_type __n,
		const _HashFcn&    __hf,
		const _EqualKey&   __eql,
		const allocator_type& __a = allocator_type())
		: __HASH_ALLOC_INIT(__a)
		_M_hash(__hf),
		_M_equals(__eql),
		_M_get_key(_ExtractKey()),
		//_M_buckets(__a),
		_M_num_elements(0)
	{
		_M_initialize_buckets(__n);
	}

	  hashtable(const hashtable& __ht)
		  : __HASH_ALLOC_INIT(__ht.get_allocator())
		  _M_hash(__ht._M_hash),
		  _M_equals(__ht._M_equals),
		  _M_get_key(__ht._M_get_key),
		  //_M_buckets(__ht.get_allocator()),
		  _M_num_elements(0)
	  {
		  _M_copy_from(__ht);
	  }

	  hashtable& operator= (const hashtable& __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; }
	  size_type max_size() const { return size_type(-1); }
	  bool empty() const { return size() == 0; }

	  void swap(hashtable& __ht)
	  {
		 swap(_M_hash, __ht._M_hash);
		 swap(_M_equals, __ht._M_equals);
		 swap(_M_get_key, __ht._M_get_key);
		  _M_buckets.swap(__ht._M_buckets);
		 swap(_M_num_elements, __ht._M_num_elements);
	  }
	  iterator begin()
	  { 
		  for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
		  {
			  if (_M_buckets[__n])
			  {
				  return iterator(_M_buckets[__n], this);
			  }
		  }
		  return end();
	  }
	  iterator end() { return iterator(0, this); }

	  const_iterator begin() const
	  {
		  for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
		  {
			  if (_M_buckets[__n])
			  {
				  return const_iterator(_M_buckets[__n], this);
			  }
		  }
		  return end();
	  }
	  const_iterator end() const { return const_iterator(0, this); }

	  friend bool operator==(const hashtable&, const hashtable&);


 public:
	 size_type bucket_count() const 
	 { 
		 return _M_buckets.size(); 
	 }
	 size_type max_bucket_count() const  
	 { 
		 return __stl_prime_list[__stl_num_primes - 1]; 
	 }
	 
	 size_type elems_in_bucket(size_type __bucket) const
	 {
		 size_type __result = 0;
		 for (_Node* __cur = _M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
		 {
			 __result += 1;
		 }
		 return __result;
	 }
	 // 安插新值；節點鍵值不允許重複，若重複則安插無效。
     // 注意，傳回值是個pair，第一元素是個迭代器，指向新增節點，
     // 第二元素表示安插成功與否。
	 // hash_map; // hash_multimap;
	 yhp::pair<iterator, bool> insert_unique(const value_type& __obj)
	 {
		 resize(_M_num_elements + 1);    //2
		 return insert_unique_noresize(__obj);  //3
	 }

	 
	 iterator insert_equal(const value_type& __obj)
	 {
		 resize(_M_num_elements + 1);
		 return insert_equal_noresize(__obj); //4
	 }
//-----------------------------------------------------------------------------
	 template <class _InputIterator>
	 void insert_unique(_InputIterator __f, _InputIterator __l)
	 {
		// insert_unique(__f, __l, __ITERATOR_CATEGORY(__f));
		 insert_unique(__f,__l,yhp::iterator_category(__f));
	 }
	 
	 template <class _InputIterator>
	 void insert_equal(_InputIterator __f, _InputIterator __l)
	 {
		// insert_equal(__f, __l, __ITERATOR_CATEGORY(__f));
		 insert_equal(__f,__l,yhp::iterator_category(__f));
	 }
	 
	 template <class _InputIterator>
	 void insert_unique(_InputIterator __f, _InputIterator __l, input_iterator_tag)
	 {
		 for ( ; __f != __l; ++__f)
		 {
			 insert_unique(*__f);
		 }
	 }
	 
	 template <class _InputIterator>
	 void insert_equal(_InputIterator __f, _InputIterator __l,input_iterator_tag)
	 {
		 for ( ; __f != __l; ++__f)
		 {
			 insert_equal(*__f);
		 }
	 }
	 
	 template <class _ForwardIterator>
	 void insert_unique(_ForwardIterator __f, _ForwardIterator __l, forward_iterator_tag)
	 {
		 size_type __n = 0;
		 //distance(__f, __l, __n);
		 __n = yhp::distance(__f,__l);
		 resize(_M_num_elements + __n);
		 for ( ; __n > 0; --__n, ++__f)
		 {
			 insert_unique_noresize(*__f);
		 }
	 }
	 template <class _ForwardIterator>
	 void insert_equal(_ForwardIterator __f, _ForwardIterator __l,forward_iterator_tag)
	 {
		 size_type __n = 0;
		 //distance(__f, __l, __n);
		 __n = yhp::distance(__f,__l);
		 resize(_M_num_elements + __n);
		 for ( ; __n > 0; --__n, ++__f)
		 {
			 insert_equal_noresize(*__f);
		 }
	 }
  //--------------------------------------------------------------------------
	 
	 reference find_or_insert(const value_type& __obj)
	 {
		 resize(_M_num_elements + 1);
		 size_type __n = _M_bkt_num(__obj);
		 _Node* __first = _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 __cur->_M_val;
			 }
		 }
		 _Node* __tmp = _M_new_node(__obj);
		 __tmp->_M_next = __first;
		 _M_buckets[__n] = __tmp;
		 ++_M_num_elements;
		 return __tmp->_M_val;
	 }

	 iterator find(const key_type& __key) 
	 {
		 size_type __n = _M_bkt_num_key(__key);
		 _Node* __first;
		 for ( __first = _M_buckets[__n]; 
			 __first && !_M_equals(_M_get_key(__first->_M_val), __key); __first = __first->_M_next)
		 {}
		 return iterator(__first, this);
	 } 
	 
	 const_iterator find(const key_type& __key) const
	 {
		 size_type __n = _M_bkt_num_key(__key);
		 const _Node* __first;
		 for ( __first = _M_buckets[__n];
          __first && !_M_equals(_M_get_key(__first->_M_val), __key);
          __first = __first->_M_next)
		 {}
		 return const_iterator(__first, 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 = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
		 {
			 if (_M_equals(_M_get_key(__cur->_M_val), __key))
			 {
				 ++__result;
			 }
		 }
		 return __result;
	 }

	 //不需要重建的情况下插入
	 pair<iterator, bool> insert_unique_noresize(const value_type& __obj)
	 {
		 const size_type __n = _M_bkt_num(__obj);
		 _Node* __first = _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);
			 }
		 }
		 
		 _Node* __tmp = _M_new_node(__obj);
		 __tmp->_M_next = __first;
		 _M_buckets[__n] = __tmp;
		 ++_M_num_elements;
		 return pair<iterator, bool>(iterator(__tmp, this), true);
	 }

	 //不需要重建的情况下插入//允许相同元素存在
	 iterator insert_equal_noresize(const value_type& __obj)
	 {
		 const size_type __n = _M_bkt_num(__obj);
		 _Node* __first = _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;
				 return iterator(__tmp, this);
			 }
		 }

		 _Node* __tmp = _M_new_node(__obj);
		 __tmp->_M_next = __first;
		 _M_buckets[__n] = __tmp;
		 ++_M_num_elements;
		 return iterator(__tmp, this);
	 }
	 
	 
	 void 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)
			 {
				 //vector<_Node*, _All> __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
				 std::vector<_Node*> __tmp(__n, (_Node*)(0) );
				 //__STL_TRY {
				 try{
					 for (size_type __bucket = 0; __bucket < __old_n; ++__bucket) 
					 {
						 _Node* __first = _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 = __tmp[__new_bucket];
							 __tmp[__new_bucket] = __first;
							 __first = _M_buckets[__bucket];  
						}
					 }
					 _M_buckets.swap(__tmp);
				 }
//#ifdef __STL_USE_EXCEPTIONS
				 catch(...) 
				 {
					 for (size_type __bucket = 0; __bucket < __tmp.size(); ++__bucket) 
					 {
						 while (__tmp[__bucket]) 
						 {
							 _Node* __next = __tmp[__bucket]->_M_next;
							 _M_delete_node(__tmp[__bucket]);
							 __tmp[__bucket] = __next;
						 }
					 }
					 throw;
				 }
//#endif /* __STL_USE_EXCEPTIONS */
			 }
		 }
	 }

	  pair<iterator, iterator>  equal_range(const key_type& __key)
	  {
		  typedef pair<iterator, iterator> _Pii;
		  const size_type __n = _M_bkt_num_key(__key);
		  
		  for (_Node* __first = _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));
					  }
				  }
				  for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
				  {
					  if (_M_buckets[__m])
					  {
						  return _Pii(iterator(__first, this),iterator(_M_buckets[__m], this));
					  }
				  }
				  return _Pii(iterator(__first, this), end());
			  }
		  }
		  return _Pii(end(), end());
	  }

	  pair<const_iterator, const_iterator>  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 = _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));
					  }
				  }
				  for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m)
				  {
					  if (_M_buckets[__m])
					  {
						  return _Pii(const_iterator(__first, this),const_iterator(_M_buckets[__m], this));
					  }
				  }
				  return _Pii(const_iterator(__first, this), end());
			  }
		  }
		  return _Pii(end(), end());
	  }
	  
	   
	  void clear()
	  {
		  for (size_type __i = 0; __i < _M_buckets.size(); ++__i) 
		  {
			  _Node* __cur = _M_buckets[__i];
			  while (__cur != 0) 
			  {
				  _Node* __next = __cur->_M_next;
				  _M_delete_node(__cur);
				  __cur = __next;
			  }
			  _M_buckets[__i] = 0;
		  }
		  _M_num_elements = 0;
	  }
	  size_type erase(const key_type& __key)
	  {
		  const size_type __n = _M_bkt_num_key(__key);
		  _Node* __first = _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;
				  }
				  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;
			  }
		  }
		  return __erased;
	  }
	  void erase(iterator __first, iterator __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;
		  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);
			  }
		  }
	  }
	  void erase(const_iterator __first, const_iterator __last);
	 
	  void erase(const iterator& __it)
	  {
		  if (_Node* const __p = __it._M_cur)
		  {
			  const size_type __n = _M_bkt_num(__p->_M_val);
			  _Node* __cur = _M_buckets[__n];
			  if (__cur == __p) 
			  {
				  _M_buckets[__n] = __cur->_M_next;
				  _M_delete_node(__cur);
				  --_M_num_elements;
			  }
			  else
			  {
				  _Node* __next = __cur->_M_next;
				  while (__next) 
				  {
					  if (__next == __p) 
					  {
						  __cur->_M_next = __next->_M_next;
						  _M_delete_node(__next);
						  --_M_num_elements;
						  break;
					  }
					  else 
					  {
						  __cur = __next;
						  __next = __cur->_M_next;
					  }
				  }
			  }
		  }
	  }
	  void erase(const const_iterator& __it)
	  {
		  erase(iterator(const_cast<_Node*>(__it._M_cur),const_cast<hashtable*>(__it._M_ht)));
	  }
private:
	size_type _M_next_size(size_type __n) const
	{ 
		return __stl_next_prime(__n); 
	}
	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, (_Node*) 0);//??
		_M_num_elements = 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_get_node();
		__n->_M_next = 0;
		//__STL_TRY {
		//try
		{
			yhp::construct(&__n->_M_val, __obj);
			return __n;
		}
		//__STL_UNWIND(_M_put_node(__n));
	}
	
	void _M_delete_node(_Node* __n)
	{
		yhp::destroy(&__n->_M_val);
		_M_put_node(__n);
	}
	
	void _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
	{
		_Node* __cur = _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) 
			{
				__cur->_M_next = __next->_M_next;
				_M_delete_node(__next);
				__next = __cur->_M_next;
				--_M_num_elements;
			}
		}
	}
	void _M_erase_bucket(const size_type __n, _Node* __last)
	{
		_Node* __cur = _M_buckets[__n];
		while (__cur != __last) 
		{
			_Node* __next = __cur->_M_next;
			_M_delete_node(__cur);
			__cur = __next;
			_M_buckets[__n] = __cur;
			--_M_num_elements;
		}
	}
	void _M_copy_from(const hashtable& __ht)
	{
		_M_buckets.clear();
		_M_buckets.reserve(__ht._M_buckets.size());
		_M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
		//__STL_TRY
		{
			for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) 
			{
				if (const _Node* __cur = __ht._M_buckets[__i]) 
				{
					_Node* __copy = _M_new_node(__cur->_M_val);
					_M_buckets[__i] = __copy;
					for (_Node* __next = __cur->_M_next; __next; __cur = __next, __next = __cur->_M_next) 
					{
						__copy->_M_next = _M_new_node(__next->_M_val);
						__copy = __copy->_M_next;
					}
				}
			}
			_M_num_elements = __ht._M_num_elements;
		}
		//__STL_UNWIND(clear());
	}
};

template <class _Val, class _Key, class _HF, class _ExK, class _EqK, 
          class _All>
_Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>&
_Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>::operator++()
{
	const _Node* __old = _M_cur;
	_M_cur = _M_cur->_M_next;
	if (!_M_cur) 
	{
		size_type __bucket = _M_ht->_M_bkt_num(__old->_M_val);
		while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
		{
			_M_cur = _M_ht->_M_buckets[__bucket];
		}
	}
	return *this;
}

template <class _Val, class _Key, class _HF, class _ExK, class _EqK, 
          class _All>
inline _Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>
_Hashtable_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>::operator++(int)
{
	iterator __tmp = *this;
	++*this;
	return __tmp;
}

template <class _Val, class _Key, class _HF, class _ExK, class _EqK, 
          class _All>
_Hashtable_const_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>&
_Hashtable_const_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>::operator++()
{
	const _Node* __old = _M_cur;
	_M_cur = _M_cur->_M_next;
	if (!_M_cur) 
	{
		size_type __bucket = _M_ht->_M_bkt_num(__old->_M_val);
		while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
		{
			_M_cur = _M_ht->_M_buckets[__bucket];
		}
	}
	return *this;
}

template <class _Val, class _Key, class _HF, class _ExK, class _EqK, 
          class _All>
inline _Hashtable_const_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>
_Hashtable_const_iterator<_Val,_Key,_HF,_ExK,_EqK,_All>::operator++(int)
{
	const_iterator __tmp = *this;
	++*this;
	return __tmp;
}

}
#endif