williamr@2: /*
williamr@2:  *
williamr@2:  * Copyright (c) 1994
williamr@2:  * Hewlett-Packard Company
williamr@2:  *
williamr@2:  * Copyright (c) 1996,1997
williamr@2:  * Silicon Graphics Computer Systems, Inc.
williamr@2:  *
williamr@2:  * Copyright (c) 1997
williamr@2:  * Moscow Center for SPARC Technology
williamr@2:  *
williamr@2:  * Copyright (c) 1999 
williamr@2:  * Boris Fomitchev
williamr@2:  *
williamr@2:  * This material is provided "as is", with absolutely no warranty expressed
williamr@2:  * or implied. Any use is at your own risk.
williamr@2:  *
williamr@2:  * Permission to use or copy this software for any purpose is hereby granted 
williamr@2:  * without fee, provided the above notices are retained on all copies.
williamr@2:  * Permission to modify the code and to distribute modified code is granted,
williamr@2:  * provided the above notices are retained, and a notice that the code was
williamr@2:  * modified is included with the above copyright notice.
williamr@2:  *
williamr@2:  */
williamr@2: 
williamr@2: /* NOTE: This is an internal header file, included by other STL headers.
williamr@2:  *   You should not attempt to use it directly.
williamr@2:  */
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_HASH_SET_H
williamr@2: #define _STLP_INTERNAL_HASH_SET_H
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_HASHTABLE_H
williamr@2: # include <stl/_hashtable.h>
williamr@2: #endif
williamr@2: 
williamr@2: # define  hash_set      __WORKAROUND_RENAME(hash_set)
williamr@2: # define  hash_multiset __WORKAROUND_RENAME(hash_multiset)
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE
williamr@2: 
williamr@2: template <class _Value, __DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
williamr@2:           __DFL_TMPL_PARAM(_EqualKey,equal_to<_Value>),
williamr@2:           _STLP_DEFAULT_ALLOCATOR_SELECT(_Value) >
williamr@2: class hash_set
williamr@2: {
williamr@2: private:
williamr@2:   typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, 
williamr@2:                     _EqualKey, _Alloc> _Ht;
williamr@2:   typedef hash_set<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
williamr@2:   typedef typename _Ht::iterator _ht_iterator;
williamr@2: public:
williamr@2:   typedef typename _Ht::key_type key_type;
williamr@2:   typedef typename _Ht::value_type value_type;
williamr@2:   typedef typename _Ht::hasher hasher;
williamr@2:   typedef typename _Ht::key_equal key_equal;
williamr@2: 
williamr@2:   typedef typename _Ht::size_type size_type;
williamr@2:   typedef typename _Ht::difference_type difference_type;
williamr@2:   typedef typename _Ht::pointer         pointer;
williamr@2:   typedef typename _Ht::const_pointer   const_pointer;
williamr@2:   typedef typename _Ht::reference       reference;
williamr@2:   typedef typename _Ht::const_reference const_reference;
williamr@2: 
williamr@2:   // SunPro bug
williamr@2:   typedef typename _Ht::const_iterator const_iterator;
williamr@2:   typedef const_iterator iterator;
williamr@2: 
williamr@2:   typedef typename _Ht::allocator_type allocator_type;
williamr@2: 
williamr@2:   hasher hash_funct() const { return _M_ht.hash_funct(); }
williamr@2:   key_equal key_eq() const { return _M_ht.key_eq(); }
williamr@2:   allocator_type get_allocator() const { return _M_ht.get_allocator(); }
williamr@2: 
williamr@2: private:
williamr@2:   _Ht _M_ht;
williamr@2: 
williamr@2: public:
williamr@2:   hash_set()
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2: 
williamr@2: # ifdef _STLP_USE_TRAP_LEAVE
williamr@2:   hash_set(const _Self& __o) :
williamr@2:     _M_ht(__o.size())
williamr@2:   {
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:     _M_ht = __o._M_ht; 
williamr@2:     _STLP_POP_CLEANUP_ITEM    
williamr@2:   }
williamr@2: # else
williamr@2:   hash_set(const _Self& __o)
williamr@2:     : _M_ht(__o._M_ht) {
williamr@2:   }
williamr@2: # endif
williamr@2:   explicit hash_set(size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2:   hash_set(size_type __n, const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2:   hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
williamr@2:            const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   template <class _InputIterator>
williamr@2:   hash_set(_InputIterator __f, _InputIterator __l)
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   template <class _InputIterator>
williamr@2:   hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   template <class _InputIterator>
williamr@2:   hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
williamr@2:            const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS
williamr@2:   template <class _InputIterator>
williamr@2:   hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
williamr@2:            const hasher& __hf, const key_equal& __eql)
williamr@2:     : _M_ht(__n, __hf, __eql, allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: #  endif
williamr@2:   template <class _InputIterator>
williamr@2:   hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
williamr@2:            const hasher& __hf, const key_equal& __eql,
williamr@2:            const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { 
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:     _STLP_POP_CLEANUP_ITEM
williamr@2:   }
williamr@2: #else
williamr@2: 
williamr@2:   hash_set(const value_type* __f, const value_type* __l)
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_set(const value_type* __f, const value_type* __l, size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_set(const value_type* __f, const value_type* __l, size_type __n,
williamr@2:            const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type())
williamr@2:   { 
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:     _M_ht.insert_unique(__f, __l); 
williamr@2:     _STLP_POP_CLEANUP_ITEM
williamr@2:   }
williamr@2:   hash_set(const value_type* __f, const value_type* __l, size_type __n,
williamr@2:            const hasher& __hf, const key_equal& __eql,
williamr@2:            const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: 
williamr@2:   hash_set(const_iterator __f, const_iterator __l)
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_set(const_iterator __f, const_iterator __l, size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_set(const_iterator __f, const_iterator __l, size_type __n,
williamr@2:            const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_set(const_iterator __f, const_iterator __l, size_type __n,
williamr@2:            const hasher& __hf, const key_equal& __eql,
williamr@2:            const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_unique(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: #ifdef _STLP_USE_TRAP_LEAVE
williamr@2: public:
williamr@2:   static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2:   static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2: #endif
williamr@2: 
williamr@2: public:
williamr@2:   size_type size() const { return _M_ht.size(); }
williamr@2:   size_type max_size() const { return _M_ht.max_size(); }
williamr@2:   bool empty() const { return _M_ht.empty(); }
williamr@2:   void swap(_Self& __hs) { _M_ht.swap(__hs._M_ht); }
williamr@2: 
williamr@2:   iterator begin() const { return _M_ht.begin(); }
williamr@2:   iterator end() const { return _M_ht.end(); }
williamr@2: 
williamr@2: public:
williamr@2:   pair<iterator, bool> insert(const value_type& __obj)
williamr@2:     {
williamr@2:       pair<_ht_iterator, bool> __p = _M_ht.insert_unique(__obj);
williamr@2:       return pair<iterator,bool>(__REINTERPRET_CAST(const iterator&, __p.first), __p.second);
williamr@2:     }
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   template <class _InputIterator>
williamr@2:   void insert(_InputIterator __f, _InputIterator __l) 
williamr@2:     { _M_ht.insert_unique(__f,__l); }
williamr@2: #else
williamr@2:   void insert(const value_type* __f, const value_type* __l) {
williamr@2:     _M_ht.insert_unique(__f,__l);
williamr@2:   }
williamr@2:   void insert(const_iterator __f, const_iterator __l) 
williamr@2:     {_M_ht.insert_unique(__f, __l); }
williamr@2: 
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2:   pair<iterator, bool> insert_noresize(const value_type& __obj)
williamr@2:   {
williamr@2:     pair<_ht_iterator, bool> __p = 
williamr@2:       _M_ht.insert_unique_noresize(__obj);
williamr@2:     return pair<iterator, bool>(__p.first, __p.second);
williamr@2:   }
williamr@2: 
williamr@2: # if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS )
williamr@2:   template <class _KT>
williamr@2:   iterator find(const _KT& __key) const { return _M_ht.find(__key); }
williamr@2: # else
williamr@2:   iterator find(const key_type& __key) const { return _M_ht.find(__key); }
williamr@2: # endif
williamr@2:   size_type count(const key_type& __key) const { return _M_ht.count(__key); }
williamr@2:   
williamr@2:   pair<iterator, iterator> equal_range(const key_type& __key) const
williamr@2:     { return _M_ht.equal_range(__key); }
williamr@2: 
williamr@2:   size_type erase(const key_type& __key) {return _M_ht.erase(__key); }
williamr@2:   void erase(iterator __it) { _M_ht.erase(__it); }
williamr@2:   void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); }
williamr@2:   void clear() { _M_ht.clear(); }
williamr@2: 
williamr@2: public:
williamr@2:   void resize(size_type __hint) { _M_ht.resize(__hint); }
williamr@2:   size_type bucket_count() const { return _M_ht.bucket_count(); }
williamr@2:   size_type max_bucket_count() const { return _M_ht.max_bucket_count(); }
williamr@2:   size_type elems_in_bucket(size_type __n) const
williamr@2:     { return _M_ht.elems_in_bucket(__n); }
williamr@2: 
williamr@2:   static bool _STLP_CALL _M_equal (const _Self& __x, const _Self& __y) {
williamr@2:     return _Ht::_M_equal(__x._M_ht,__y._M_ht);
williamr@2:   }
williamr@2: 
williamr@2: };
williamr@2: 
williamr@2: template <class _Value, __DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
williamr@2:           __DFL_TMPL_PARAM(_EqualKey,equal_to<_Value>),
williamr@2:           _STLP_DEFAULT_ALLOCATOR_SELECT(_Value) >
williamr@2: class hash_multiset
williamr@2: {
williamr@2: private:
williamr@2:   typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, 
williamr@2:                     _EqualKey, _Alloc> _Ht;
williamr@2:   typedef hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
williamr@2: 
williamr@2: public:
williamr@2:   typedef typename _Ht::key_type key_type;
williamr@2:   typedef typename _Ht::value_type value_type;
williamr@2:   typedef typename _Ht::hasher hasher;
williamr@2:   typedef typename _Ht::key_equal key_equal;
williamr@2: 
williamr@2:   typedef typename _Ht::size_type size_type;
williamr@2:   typedef typename _Ht::difference_type difference_type;
williamr@2:   typedef typename _Ht::pointer       pointer;
williamr@2:   typedef typename _Ht::const_pointer const_pointer;
williamr@2:   typedef typename _Ht::reference reference;
williamr@2:   typedef typename _Ht::const_reference const_reference;
williamr@2: 
williamr@2:   typedef typename _Ht::const_iterator const_iterator;
williamr@2:   // SunPro bug
williamr@2:   typedef const_iterator iterator;
williamr@2: 
williamr@2:   typedef typename _Ht::allocator_type allocator_type;
williamr@2: 
williamr@2:   hasher hash_funct() const { return _M_ht.hash_funct(); }
williamr@2:   key_equal key_eq() const { return _M_ht.key_eq(); }
williamr@2:   allocator_type get_allocator() const { return _M_ht.get_allocator(); }
williamr@2: 
williamr@2: private:
williamr@2:   _Ht _M_ht;
williamr@2: 
williamr@2: public:
williamr@2:   hash_multiset()
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2: 
williamr@2: # ifdef _STLP_USE_TRAP_LEAVE
williamr@2:   hash_multiset(const _Self& __o) :
williamr@2:     _M_ht(__o.size())
williamr@2:   {
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:     _M_ht = __o._M_ht; 
williamr@2:     _STLP_POP_CLEANUP_ITEM
williamr@2:   }
williamr@2: # else
williamr@2:   hash_multiset(const _Self& __o)
williamr@2:     : _M_ht(__o._M_ht) {
williamr@2:   }
williamr@2: # endif
williamr@2: 
williamr@2:   explicit hash_multiset(size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2:   hash_multiset(size_type __n, const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2:   hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql)
williamr@2:     : _M_ht(__n, __hf, __eql, allocator_type()) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2:   hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql,
williamr@2:                 const allocator_type& __a)
williamr@2:     : _M_ht(__n, __hf, __eql, __a) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   template <class _InputIterator>
williamr@2:   hash_multiset(_InputIterator __f, _InputIterator __l)
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   template <class _InputIterator>
williamr@2:   hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   template <class _InputIterator>
williamr@2:   hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n,
williamr@2:                 const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: 
williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS
williamr@2:   template <class _InputIterator>
williamr@2:   hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n,
williamr@2:                 const hasher& __hf, const key_equal& __eql)
williamr@2:     : _M_ht(__n, __hf, __eql, allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: # endif
williamr@2:   template <class _InputIterator>
williamr@2:   hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n,
williamr@2:                 const hasher& __hf, const key_equal& __eql,
williamr@2:                 const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: #else
williamr@2: 
williamr@2:   hash_multiset(const value_type* __f, const value_type* __l)
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l);
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_multiset(const value_type* __f, const value_type* __l, size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_multiset(const value_type* __f, const value_type* __l, size_type __n,
williamr@2:                 const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_multiset(const value_type* __f, const value_type* __l, size_type __n,
williamr@2:                 const hasher& __hf, const key_equal& __eql,
williamr@2:                 const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: 
williamr@2:   hash_multiset(const_iterator __f, const_iterator __l)
williamr@2:     : _M_ht(100, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_multiset(const_iterator __f, const_iterator __l, size_type __n)
williamr@2:     : _M_ht(__n, hasher(), key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_multiset(const_iterator __f, const_iterator __l, size_type __n,
williamr@2:                 const hasher& __hf)
williamr@2:     : _M_ht(__n, __hf, key_equal(), allocator_type())
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   hash_multiset(const_iterator __f, const_iterator __l, size_type __n,
williamr@2:                 const hasher& __hf, const key_equal& __eql,
williamr@2:                 const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Self, this)
williamr@2:       _M_ht.insert_equal(__f, __l); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: #ifdef _STLP_USE_TRAP_LEAVE
williamr@2: public:
williamr@2:   static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2:   static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2: #endif
williamr@2: 
williamr@2: public:
williamr@2:   size_type size() const { return _M_ht.size(); }
williamr@2:   size_type max_size() const { return _M_ht.max_size(); }
williamr@2:   bool empty() const { return _M_ht.empty(); }
williamr@2:   void swap(_Self& hs) { _M_ht.swap(hs._M_ht); }
williamr@2: 
williamr@2:   iterator begin() const { return _M_ht.begin(); }
williamr@2:   iterator end() const { return _M_ht.end(); }
williamr@2: 
williamr@2: public:
williamr@2:   iterator insert(const value_type& __obj)
williamr@2:     { return _M_ht.insert_equal(__obj); }
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   template <class _InputIterator>
williamr@2:   void insert(_InputIterator __f, _InputIterator __l) 
williamr@2:     { _M_ht.insert_equal(__f,__l); }
williamr@2: #else
williamr@2:   void insert(const value_type* __f, const value_type* __l) {
williamr@2:     _M_ht.insert_equal(__f,__l);
williamr@2:   }
williamr@2:   void insert(const_iterator __f, const_iterator __l) 
williamr@2:     { _M_ht.insert_equal(__f, __l); }
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2:   iterator insert_noresize(const value_type& __obj)
williamr@2:     { return _M_ht.insert_equal_noresize(__obj); }    
williamr@2: 
williamr@2: # if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS )
williamr@2:   template <class _KT>
williamr@2:   iterator find(const _KT& __key) const { return _M_ht.find(__key); }
williamr@2: # else
williamr@2:   iterator find(const key_type& __key) const { return _M_ht.find(__key); }
williamr@2: # endif
williamr@2: 
williamr@2:   size_type count(const key_type& __key) const { return _M_ht.count(__key); }
williamr@2:   
williamr@2:   pair<iterator, iterator> equal_range(const key_type& __key) const
williamr@2:     { return _M_ht.equal_range(__key); }
williamr@2: 
williamr@2:   size_type erase(const key_type& __key) {return _M_ht.erase(__key); }
williamr@2:   void erase(iterator __it) { _M_ht.erase(__it); }
williamr@2:   void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); }
williamr@2:   void clear() { _M_ht.clear(); }
williamr@2: 
williamr@2: public:
williamr@2:   void resize(size_type __hint) { _M_ht.resize(__hint); }
williamr@2:   size_type bucket_count() const { return _M_ht.bucket_count(); }
williamr@2:   size_type max_bucket_count() const { return _M_ht.max_bucket_count(); }
williamr@2:   size_type elems_in_bucket(size_type __n) const
williamr@2:     { return _M_ht.elems_in_bucket(__n); }
williamr@2:   static bool _STLP_CALL _M_equal (const _Self& __x, const _Self& __y) {
williamr@2:     return _Ht::_M_equal(__x._M_ht,__y._M_ht);
williamr@2:   }
williamr@2: };
williamr@2: 
williamr@2: #define _STLP_TEMPLATE_HEADER template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
williamr@2: #define _STLP_TEMPLATE_CONTAINER hash_set<_Value,_HashFcn,_EqualKey,_Alloc>
williamr@2: 
williamr@2: #include <stl/_relops_hash_cont.h>
williamr@2: 
williamr@2: #undef _STLP_TEMPLATE_CONTAINER
williamr@2: #define _STLP_TEMPLATE_CONTAINER hash_multiset<_Value,_HashFcn,_EqualKey,_Alloc>
williamr@2: #include <stl/_relops_hash_cont.h>
williamr@2: 
williamr@2: #undef _STLP_TEMPLATE_CONTAINER
williamr@2: #undef _STLP_TEMPLATE_HEADER
williamr@2: 
williamr@2: // Specialization of insert_iterator so that it will work for hash_set
williamr@2: // and hash_multiset.
williamr@2: 
williamr@2: #ifdef _STLP_CLASS_PARTIAL_SPECIALIZATION
williamr@2: 
williamr@2: template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
williamr@2: class insert_iterator<hash_set<_Value, _HashFcn, _EqualKey, _Alloc> > {
williamr@2: protected:
williamr@2:   typedef hash_set<_Value, _HashFcn, _EqualKey, _Alloc> _Container;
williamr@2:   _Container* container;
williamr@2: public:
williamr@2:   typedef _Container          container_type;
williamr@2:   typedef output_iterator_tag iterator_category;
williamr@2:   typedef void                value_type;
williamr@2:   typedef void                difference_type;
williamr@2:   typedef void                pointer;
williamr@2:   typedef void                reference;
williamr@2: 
williamr@2:   insert_iterator(_Container& __x) : container(&__x) {}
williamr@2:   insert_iterator(_Container& __x, typename _Container::iterator)
williamr@2:     : container(&__x) {}
williamr@2:   insert_iterator<_Container>&
williamr@2:   operator=(const typename _Container::value_type& __val) { 
williamr@2:     container->insert(__val);
williamr@2:     return *this;
williamr@2:   }
williamr@2:   insert_iterator<_Container>& operator*() { return *this; }
williamr@2:   insert_iterator<_Container>& operator++() { return *this; }
williamr@2:   insert_iterator<_Container>& operator++(int) { return *this; }
williamr@2: };
williamr@2: 
williamr@2: template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
williamr@2: class insert_iterator<hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > {
williamr@2: protected:
williamr@2:   typedef hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> _Container;
williamr@2:   _Container* container;
williamr@2:   typename _Container::iterator iter;
williamr@2: public:
williamr@2:   typedef _Container          container_type;
williamr@2:   typedef output_iterator_tag iterator_category;
williamr@2:   typedef void                value_type;
williamr@2:   typedef void                difference_type;
williamr@2:   typedef void                pointer;
williamr@2:   typedef void                reference;
williamr@2: 
williamr@2:   insert_iterator(_Container& __x) : container(&__x) {}
williamr@2:   insert_iterator(_Container& __x, typename _Container::iterator)
williamr@2:     : container(&__x) {}
williamr@2:   insert_iterator<_Container>&
williamr@2:   operator=(const typename _Container::value_type& __val) { 
williamr@2:     container->insert(__val);
williamr@2:     return *this;
williamr@2:   }
williamr@2:   insert_iterator<_Container>& operator*() { return *this; }
williamr@2:   insert_iterator<_Container>& operator++() { return *this; }
williamr@2:   insert_iterator<_Container>& operator++(int) { return *this; }
williamr@2: };
williamr@2: 
williamr@2: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@2: // do a cleanup
williamr@2: #  undef hash_set
williamr@2: #  undef hash_multiset
williamr@2: 
williamr@2: // provide a uniform way to access full funclionality 
williamr@2: #  define __hash_set__       __FULL_NAME(hash_set)
williamr@2: #  define __hash_multiset__  __FULL_NAME(hash_multiset)
williamr@2: 
williamr@2: # if defined ( _STLP_USE_WRAPPER_FOR_ALLOC_PARAM )
williamr@2: #  include <stl/wrappers/_hash_set.h>
williamr@2: # endif /*  WRAPPER */
williamr@2: 
williamr@2: #endif /* _STLP_INTERNAL_HASH_SET_H */
williamr@2: 
williamr@2: // Local Variables:
williamr@2: // mode:C++
williamr@2: // End:
williamr@2: