| /* |
| * Copyright (c) 1996 |
| * Silicon Graphics Computer Systems, Inc. |
| * |
| * Permission to use, copy, modify, distribute and sell this software |
| * and its documentation for any purpose is hereby granted without fee, |
| * provided that the above copyright notice appear in all copies and |
| * that both that copyright notice and this permission notice appear |
| * in supporting documentation. Silicon Graphics makes no |
| * representations about the suitability of this software for any |
| * purpose. It is provided "as is" without express or implied warranty. |
| * |
| * |
| * Copyright (c) 1994 |
| * Hewlett-Packard Company |
| * |
| * Permission to use, copy, modify, distribute and sell this software |
| * and its documentation for any purpose is hereby granted without fee, |
| * provided that the above copyright notice appear in all copies and |
| * that both that copyright notice and this permission notice appear |
| * in supporting documentation. Hewlett-Packard Company makes no |
| * representations about the suitability of this software for any |
| * purpose. It is provided "as is" without express or implied warranty. |
| * |
| */ |
| |
| /* NOTE: This is an internal header file, included by other STL headers. |
| * You should not attempt to use it directly. |
| */ |
| |
| #ifndef __SGI_STL_INTERNAL_HASH_SET_H |
| #define __SGI_STL_INTERNAL_HASH_SET_H |
| |
| __STL_BEGIN_NAMESPACE |
| |
| #if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32) |
| #pragma set woff 1174 |
| #pragma set woff 1375 |
| #endif |
| |
| #ifndef __STL_LIMITED_DEFAULT_TEMPLATES |
| template <class _Value, class _HashFcn = hash<_Value>, |
| class _EqualKey = equal_to<_Value>, |
| class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) > |
| #else |
| template <class _Value, class _HashFcn, class _EqualKey, |
| class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) > |
| #endif |
| class hash_set |
| { |
| private: |
| typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, |
| _EqualKey, _Alloc> _Ht; |
| _Ht _M_ht; |
| |
| public: |
| typedef typename _Ht::key_type key_type; |
| typedef typename _Ht::value_type value_type; |
| typedef typename _Ht::hasher hasher; |
| typedef typename _Ht::key_equal key_equal; |
| |
| typedef typename _Ht::size_type size_type; |
| typedef typename _Ht::difference_type difference_type; |
| typedef typename _Ht::const_pointer pointer; |
| typedef typename _Ht::const_pointer const_pointer; |
| typedef typename _Ht::const_reference reference; |
| typedef typename _Ht::const_reference const_reference; |
| |
| typedef typename _Ht::const_iterator iterator; |
| typedef typename _Ht::const_iterator const_iterator; |
| |
| typedef typename _Ht::allocator_type allocator_type; |
| |
| hasher hash_funct() const { return _M_ht.hash_funct(); } |
| key_equal key_eq() const { return _M_ht.key_eq(); } |
| allocator_type get_allocator() const { return _M_ht.get_allocator(); } |
| |
| public: |
| hash_set() |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) {} |
| explicit hash_set(size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} |
| hash_set(size_type __n, const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) {} |
| hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) {} |
| |
| #ifdef __STL_MEMBER_TEMPLATES |
| template <class _InputIterator> |
| hash_set(_InputIterator __f, _InputIterator __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| template <class _InputIterator> |
| hash_set(_InputIterator __f, _InputIterator __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| template <class _InputIterator> |
| hash_set(_InputIterator __f, _InputIterator __l, size_type __n, |
| const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| template <class _InputIterator> |
| hash_set(_InputIterator __f, _InputIterator __l, size_type __n, |
| const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) |
| { _M_ht.insert_unique(__f, __l); } |
| #else |
| |
| hash_set(const value_type* __f, const value_type* __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| hash_set(const value_type* __f, const value_type* __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| hash_set(const value_type* __f, const value_type* __l, size_type __n, |
| const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| hash_set(const value_type* __f, const value_type* __l, size_type __n, |
| const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) |
| { _M_ht.insert_unique(__f, __l); } |
| |
| hash_set(const_iterator __f, const_iterator __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| hash_set(const_iterator __f, const_iterator __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| hash_set(const_iterator __f, const_iterator __l, size_type __n, |
| const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) |
| { _M_ht.insert_unique(__f, __l); } |
| hash_set(const_iterator __f, const_iterator __l, size_type __n, |
| const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) |
| { _M_ht.insert_unique(__f, __l); } |
| #endif /*__STL_MEMBER_TEMPLATES */ |
| |
| public: |
| size_type size() const { return _M_ht.size(); } |
| size_type max_size() const { return _M_ht.max_size(); } |
| bool empty() const { return _M_ht.empty(); } |
| void swap(hash_set& __hs) { _M_ht.swap(__hs._M_ht); } |
| friend bool operator== __STL_NULL_TMPL_ARGS (const hash_set&, |
| const hash_set&); |
| |
| iterator begin() const { return _M_ht.begin(); } |
| iterator end() const { return _M_ht.end(); } |
| |
| public: |
| pair<iterator, bool> insert(const value_type& __obj) |
| { |
| pair<typename _Ht::iterator, bool> __p = _M_ht.insert_unique(__obj); |
| return pair<iterator,bool>(__p.first, __p.second); |
| } |
| #ifdef __STL_MEMBER_TEMPLATES |
| template <class _InputIterator> |
| void insert(_InputIterator __f, _InputIterator __l) |
| { _M_ht.insert_unique(__f,__l); } |
| #else |
| void insert(const value_type* __f, const value_type* __l) { |
| _M_ht.insert_unique(__f,__l); |
| } |
| void insert(const_iterator __f, const_iterator __l) |
| {_M_ht.insert_unique(__f, __l); } |
| #endif /*__STL_MEMBER_TEMPLATES */ |
| pair<iterator, bool> insert_noresize(const value_type& __obj) |
| { |
| pair<typename _Ht::iterator, bool> __p = |
| _M_ht.insert_unique_noresize(__obj); |
| return pair<iterator, bool>(__p.first, __p.second); |
| } |
| |
| iterator find(const key_type& __key) const { return _M_ht.find(__key); } |
| |
| size_type count(const key_type& __key) const { return _M_ht.count(__key); } |
| |
| pair<iterator, iterator> equal_range(const key_type& __key) const |
| { return _M_ht.equal_range(__key); } |
| |
| size_type erase(const key_type& __key) {return _M_ht.erase(__key); } |
| void erase(iterator __it) { _M_ht.erase(__it); } |
| void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } |
| void clear() { _M_ht.clear(); } |
| |
| public: |
| void resize(size_type __hint) { _M_ht.resize(__hint); } |
| size_type bucket_count() const { return _M_ht.bucket_count(); } |
| size_type max_bucket_count() const { return _M_ht.max_bucket_count(); } |
| size_type elems_in_bucket(size_type __n) const |
| { return _M_ht.elems_in_bucket(__n); } |
| }; |
| |
| template <class _Value, class _HashFcn, class _EqualKey, class _Alloc> |
| inline bool |
| operator==(const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs1, |
| const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs2) |
| { |
| return __hs1._M_ht == __hs2._M_ht; |
| } |
| |
| #ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER |
| |
| template <class _Val, class _HashFcn, class _EqualKey, class _Alloc> |
| inline void |
| swap(hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1, |
| hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2) |
| { |
| __hs1.swap(__hs2); |
| } |
| |
| #endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */ |
| |
| |
| #ifndef __STL_LIMITED_DEFAULT_TEMPLATES |
| template <class _Value, class _HashFcn = hash<_Value>, |
| class _EqualKey = equal_to<_Value>, |
| class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) > |
| #else |
| template <class _Value, class _HashFcn, class _EqualKey, |
| class _Alloc = __STL_DEFAULT_ALLOCATOR(_Value) > |
| #endif |
| class hash_multiset |
| { |
| private: |
| typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>, |
| _EqualKey, _Alloc> _Ht; |
| _Ht _M_ht; |
| |
| public: |
| typedef typename _Ht::key_type key_type; |
| typedef typename _Ht::value_type value_type; |
| typedef typename _Ht::hasher hasher; |
| typedef typename _Ht::key_equal key_equal; |
| |
| typedef typename _Ht::size_type size_type; |
| typedef typename _Ht::difference_type difference_type; |
| typedef typename _Ht::const_pointer pointer; |
| typedef typename _Ht::const_pointer const_pointer; |
| typedef typename _Ht::const_reference reference; |
| typedef typename _Ht::const_reference const_reference; |
| |
| typedef typename _Ht::const_iterator iterator; |
| typedef typename _Ht::const_iterator const_iterator; |
| |
| typedef typename _Ht::allocator_type allocator_type; |
| |
| hasher hash_funct() const { return _M_ht.hash_funct(); } |
| key_equal key_eq() const { return _M_ht.key_eq(); } |
| allocator_type get_allocator() const { return _M_ht.get_allocator(); } |
| |
| public: |
| hash_multiset() |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) {} |
| explicit hash_multiset(size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} |
| hash_multiset(size_type __n, const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) {} |
| hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) {} |
| |
| #ifdef __STL_MEMBER_TEMPLATES |
| template <class _InputIterator> |
| hash_multiset(_InputIterator __f, _InputIterator __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| template <class _InputIterator> |
| hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| template <class _InputIterator> |
| hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, |
| const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| template <class _InputIterator> |
| hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, |
| const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) |
| { _M_ht.insert_equal(__f, __l); } |
| #else |
| |
| hash_multiset(const value_type* __f, const value_type* __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| hash_multiset(const value_type* __f, const value_type* __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| hash_multiset(const value_type* __f, const value_type* __l, size_type __n, |
| const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| hash_multiset(const value_type* __f, const value_type* __l, size_type __n, |
| const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) |
| { _M_ht.insert_equal(__f, __l); } |
| |
| hash_multiset(const_iterator __f, const_iterator __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| hash_multiset(const_iterator __f, const_iterator __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| hash_multiset(const_iterator __f, const_iterator __l, size_type __n, |
| const hasher& __hf) |
| : _M_ht(__n, __hf, key_equal(), allocator_type()) |
| { _M_ht.insert_equal(__f, __l); } |
| hash_multiset(const_iterator __f, const_iterator __l, size_type __n, |
| const hasher& __hf, const key_equal& __eql, |
| const allocator_type& __a = allocator_type()) |
| : _M_ht(__n, __hf, __eql, __a) |
| { _M_ht.insert_equal(__f, __l); } |
| #endif /*__STL_MEMBER_TEMPLATES */ |
| |
| public: |
| size_type size() const { return _M_ht.size(); } |
| size_type max_size() const { return _M_ht.max_size(); } |
| bool empty() const { return _M_ht.empty(); } |
| void swap(hash_multiset& hs) { _M_ht.swap(hs._M_ht); } |
| friend bool operator== __STL_NULL_TMPL_ARGS (const hash_multiset&, |
| const hash_multiset&); |
| |
| iterator begin() const { return _M_ht.begin(); } |
| iterator end() const { return _M_ht.end(); } |
| |
| public: |
| iterator insert(const value_type& __obj) |
| { return _M_ht.insert_equal(__obj); } |
| #ifdef __STL_MEMBER_TEMPLATES |
| template <class _InputIterator> |
| void insert(_InputIterator __f, _InputIterator __l) |
| { _M_ht.insert_equal(__f,__l); } |
| #else |
| void insert(const value_type* __f, const value_type* __l) { |
| _M_ht.insert_equal(__f,__l); |
| } |
| void insert(const_iterator __f, const_iterator __l) |
| { _M_ht.insert_equal(__f, __l); } |
| #endif /*__STL_MEMBER_TEMPLATES */ |
| iterator insert_noresize(const value_type& __obj) |
| { return _M_ht.insert_equal_noresize(__obj); } |
| |
| iterator find(const key_type& __key) const { return _M_ht.find(__key); } |
| |
| size_type count(const key_type& __key) const { return _M_ht.count(__key); } |
| |
| pair<iterator, iterator> equal_range(const key_type& __key) const |
| { return _M_ht.equal_range(__key); } |
| |
| size_type erase(const key_type& __key) {return _M_ht.erase(__key); } |
| void erase(iterator __it) { _M_ht.erase(__it); } |
| void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } |
| void clear() { _M_ht.clear(); } |
| |
| public: |
| void resize(size_type __hint) { _M_ht.resize(__hint); } |
| size_type bucket_count() const { return _M_ht.bucket_count(); } |
| size_type max_bucket_count() const { return _M_ht.max_bucket_count(); } |
| size_type elems_in_bucket(size_type __n) const |
| { return _M_ht.elems_in_bucket(__n); } |
| }; |
| |
| template <class _Val, class _HashFcn, class _EqualKey, class _Alloc> |
| inline bool |
| operator==(const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1, |
| const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2) |
| { |
| return __hs1._M_ht == __hs2._M_ht; |
| } |
| |
| #ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER |
| |
| template <class _Val, class _HashFcn, class _EqualKey, class _Alloc> |
| inline void |
| swap(hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1, |
| hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2) { |
| __hs1.swap(__hs2); |
| } |
| |
| #endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */ |
| |
| #if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32) |
| #pragma reset woff 1174 |
| #pragma reset woff 1375 |
| #endif |
| |
| __STL_END_NAMESPACE |
| |
| #endif /* __SGI_STL_INTERNAL_HASH_SET_H */ |
| |
| // Local Variables: |
| // mode:C++ |
| // End: |