williamr@2: /*
williamr@2:  * Copyright (c) 2004
williamr@2:  * Francois Dumont
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_UNORDERED_SET_H
williamr@2: #define _STLP_INTERNAL_UNORDERED_SET_H
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_HASHTABLE_H
williamr@2: #  include <stl/_hashtable.h>
williamr@2: #endif
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE
williamr@2: 
williamr@2: //Specific iterator traits creation
williamr@2: _STLP_CREATE_HASH_ITERATOR_TRAITS(UnorderedSetTraitsT, Const_traits)
williamr@2: 
williamr@2: template <class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
williamr@2:           _STLP_DFL_TMPL_PARAM(_EqualKey,equal_to<_Value>),
williamr@2:           _STLP_DEFAULT_ALLOCATOR_SELECT(_Value) >
williamr@2: class unordered_set
williamr@2: #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
williamr@2:                : public __stlport_class<unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> >
williamr@2: #endif
williamr@2: {
williamr@2:   typedef unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
williamr@2:   //Specific iterator traits creation
williamr@2:   typedef _STLP_PRIV _UnorderedSetTraitsT<_Value> _UnorderedSetTraits;
williamr@2: public:
williamr@2:   typedef hashtable<_Value, _Value, _HashFcn,
williamr@2:                     _UnorderedSetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> _Ht;
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::iterator iterator;
williamr@2:   typedef typename _Ht::const_iterator const_iterator;
williamr@2:   typedef typename _Ht::local_iterator local_iterator;
williamr@2:   typedef typename _Ht::const_local_iterator const_local_iterator;
williamr@2: 
williamr@2:   typedef typename _Ht::allocator_type allocator_type;
williamr@2: 
williamr@2:   hasher hash_function() 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:   _STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
williamr@2: 
williamr@2: public:
williamr@2:   explicit unordered_set(size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                          const key_equal& __eql = key_equal(),
williamr@2:                          const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a) {}
williamr@2: 
williamr@2:   unordered_set(__move_source<_Self> src)
williamr@2:     : _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
williamr@2: 
williamr@2: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@2:   template <class _InputIterator>
williamr@2:   unordered_set(_InputIterator __f, _InputIterator __l,
williamr@2:                 size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                 const key_equal& __eql = key_equal(),
williamr@2:                 const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { _M_ht.insert_unique(__f, __l); }
williamr@2: #else
williamr@2:   unordered_set(const value_type* __f, const value_type* __l,
williamr@2:                 size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                 const key_equal& __eql = key_equal(),
williamr@2:                 const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { _M_ht.insert_unique(__f, __l); }
williamr@2: 
williamr@2:   unordered_set(const_iterator __f, const_iterator __l,
williamr@2:                 size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                 const key_equal& __eql = key_equal(),
williamr@2:                 const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { _M_ht.insert_unique(__f, __l); }
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   _Self& operator = (const _Self& __other)
williamr@2:   { _M_ht = __other._M_ht; return *this; }
williamr@2: 
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() { return _M_ht.begin(); }
williamr@2:   iterator end() { return _M_ht.end(); }
williamr@2:   const_iterator begin() const { return _M_ht.begin(); }
williamr@2:   const_iterator end() const { return _M_ht.end(); }
williamr@2: 
williamr@2:   pair<iterator, bool> insert(const value_type& __obj)
williamr@2:   { return _M_ht.insert_unique(__obj); }
williamr@2:   iterator insert(const_iterator /*__hint*/, const value_type& __obj)
williamr@2:   { return _M_ht.insert_unique(__obj); }
williamr@2: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@2:   template <class _InputIterator>
williamr@2:   void insert(_InputIterator __f, _InputIterator __l)
williamr@2: #else
williamr@2:   void insert(const_iterator __f, const_iterator __l)
williamr@2:   {_M_ht.insert_unique(__f, __l); }
williamr@2:   void insert(const value_type* __f, const value_type* __l)
williamr@2: #endif
williamr@2:   { _M_ht.insert_unique(__f,__l); }
williamr@2: 
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   iterator find(const _KT& __key) { return _M_ht.find(__key); }
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
williamr@2: 
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   size_type count(const _KT& __key) const { return _M_ht.count(__key); }
williamr@2: 
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   pair<iterator, iterator> equal_range(const _KT& __key)
williamr@2:   { return _M_ht.equal_range(__key); }
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   pair<const_iterator, const_iterator> equal_range(const _KT& __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(const_iterator __it) { _M_ht.erase(__it); }
williamr@2:   void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); }
williamr@2:   void clear() { _M_ht.clear(); }
williamr@2: 
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 bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
williamr@2:   local_iterator begin(size_type __n) { return _M_ht.begin(__n); }
williamr@2:   local_iterator end(size_type __n) { return _M_ht.end(__n); }
williamr@2:   const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); }
williamr@2:   const_local_iterator end(size_type __n) const { return _M_ht.end(__n); }
williamr@2: 
williamr@2:   float load_factor() const { return _M_ht.load_factor(); }
williamr@2:   float max_load_factor() const { return _M_ht.max_load_factor(); }
williamr@2:   void max_load_factor(float __val) { _M_ht.max_load_factor(__val); }
williamr@2:   void rehash(size_type __hint) { _M_ht.rehash(__hint); }
williamr@2: };
williamr@2: 
williamr@2: //Specific iterator traits creation
williamr@2: _STLP_CREATE_HASH_ITERATOR_TRAITS(UnorderedMultisetTraitsT, Const_traits)
williamr@2: 
williamr@2: template <class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
williamr@2:           _STLP_DFL_TMPL_PARAM(_EqualKey,equal_to<_Value>),
williamr@2:           _STLP_DEFAULT_ALLOCATOR_SELECT(_Value) >
williamr@2: class unordered_multiset
williamr@2: #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND)
williamr@2:                : public __stlport_class<unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> >
williamr@2: #endif
williamr@2: {
williamr@2:   typedef unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
williamr@2:   //Specific iterator traits creation
williamr@2:   typedef _STLP_PRIV _UnorderedMultisetTraitsT<_Value> _UnorderedMultisetTraits;
williamr@2: public:
williamr@2:   typedef hashtable<_Value, _Value, _HashFcn,
williamr@2:                     _UnorderedMultisetTraits, _STLP_PRIV _Identity<_Value>, _EqualKey, _Alloc> _Ht;
williamr@2: 
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::iterator iterator;
williamr@2:   typedef typename _Ht::const_iterator const_iterator;
williamr@2:   typedef typename _Ht::local_iterator local_iterator;
williamr@2:   typedef typename _Ht::const_local_iterator const_local_iterator;
williamr@2: 
williamr@2:   typedef typename _Ht::allocator_type allocator_type;
williamr@2: 
williamr@2:   hasher hash_function() 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:   _STLP_KEY_TYPE_FOR_CONT_EXT(key_type)
williamr@2: 
williamr@2: public:
williamr@2:   explicit unordered_multiset(size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                               const key_equal& __eql = key_equal(),
williamr@2:                               const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a) {}
williamr@2: 
williamr@2:   unordered_multiset(__move_source<_Self> src)
williamr@2:     : _M_ht(__move_source<_Ht>(src.get()._M_ht)) {}
williamr@2: 
williamr@2: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@2:   template <class _InputIterator>
williamr@2:   unordered_multiset(_InputIterator __f, _InputIterator __l,
williamr@2:                      size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                      const key_equal& __eql = key_equal(),
williamr@2:                      const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { _M_ht.insert_equal(__f, __l); }
williamr@2: #else
williamr@2:   unordered_multiset(const value_type* __f, const value_type* __l,
williamr@2:                      size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                      const key_equal& __eql = key_equal(),
williamr@2:                      const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { _M_ht.insert_equal(__f, __l); }
williamr@2: 
williamr@2:   unordered_multiset(const_iterator __f, const_iterator __l,
williamr@2:                      size_type __n = 100, const hasher& __hf = hasher(),
williamr@2:                      const key_equal& __eql = key_equal(),
williamr@2:                      const allocator_type& __a = allocator_type())
williamr@2:     : _M_ht(__n, __hf, __eql, __a)
williamr@2:   { _M_ht.insert_equal(__f, __l); }
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   _Self& operator = (const _Self& __other)
williamr@2:   { _M_ht = __other._M_ht; return *this; }
williamr@2: 
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() { return _M_ht.begin(); }
williamr@2:   iterator end() { return _M_ht.end(); }
williamr@2:   const_iterator begin() const { return _M_ht.begin(); }
williamr@2:   const_iterator end() const { return _M_ht.end(); }
williamr@2: 
williamr@2:   iterator insert(const value_type& __obj)
williamr@2:   { return _M_ht.insert_equal(__obj); }
williamr@2:   iterator insert(const_iterator /*__hint*/, const value_type& __obj)
williamr@2:   { return _M_ht.insert_equal(__obj); }
williamr@2: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@2:   template <class _InputIterator>
williamr@2:   void insert(_InputIterator __f, _InputIterator __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:   void insert(const_iterator __f, const_iterator __l)
williamr@2: #endif /*_STLP_MEMBER_TEMPLATES */
williamr@2:   { _M_ht.insert_equal(__f, __l); }
williamr@2: 
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   iterator find(const _KT& __key) { return _M_ht.find(__key); }
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
williamr@2: 
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   size_type count(const _KT& __key) const { return _M_ht.count(__key); }
williamr@2: 
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   pair<iterator, iterator> equal_range(const _KT& __key)
williamr@2:   { return _M_ht.equal_range(__key); }
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   pair<const_iterator, const_iterator> equal_range(const _KT& __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(const_iterator __it) { _M_ht.erase(__it); }
williamr@2:   void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); }
williamr@2:   void clear() { _M_ht.clear(); }
williamr@2: 
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 bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
williamr@2:   _STLP_TEMPLATE_FOR_CONT_EXT
williamr@2:   size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); }
williamr@2:   local_iterator begin(size_type __n) { return _M_ht.begin(__n); }
williamr@2:   local_iterator end(size_type __n) { return _M_ht.end(__n); }
williamr@2:   const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); }
williamr@2:   const_local_iterator end(size_type __n) const { return _M_ht.end(__n); }
williamr@2: 
williamr@2:   float load_factor() const { return _M_ht.load_factor(); }
williamr@2:   float max_load_factor() const { return _M_ht.max_load_factor(); }
williamr@2:   void max_load_factor(float __val) { _M_ht.max_load_factor(__val); }
williamr@2:   void rehash(size_type __hint) { _M_ht.rehash(__hint); }
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 unordered_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 unordered_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 unordered_set
williamr@2: // and unordered_multiset.
williamr@2: 
williamr@2: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@2: template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
williamr@2: struct __move_traits<unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> > :
williamr@2:   _STLP_PRIV __move_traits_aux<typename unordered_set<_Value, _HashFcn, _EqualKey, _Alloc>::_Ht>
williamr@2: {};
williamr@2: 
williamr@2: template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
williamr@2: struct __move_traits<unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > :
williamr@2:   _STLP_PRIV __move_traits_aux<typename unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc>::_Ht>
williamr@2: {};
williamr@2: 
williamr@2: template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
williamr@2: class insert_iterator<unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> > {
williamr@2: protected:
williamr@2:   typedef unordered_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<unordered_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > {
williamr@2: protected:
williamr@2:   typedef unordered_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: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: 
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@2: #endif /* _STLP_INTERNAL_UNORDERED_SET_H */
williamr@2: 
williamr@2: // Local Variables:
williamr@2: // mode:C++
williamr@2: // End:
williamr@2: