| // TR1 unordered_set -*- C++ -*- |
| |
| // Copyright (C) 2007 Free Software Foundation, Inc. |
| // |
| // This file is part of the GNU ISO C++ Library. This library is free |
| // software; you can redistribute it and/or modify it under the |
| // terms of the GNU General Public License as published by the |
| // Free Software Foundation; either version 2, or (at your option) |
| // any later version. |
| |
| // This library is distributed in the hope that it will be useful, |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| // GNU General Public License for more details. |
| |
| // You should have received a copy of the GNU General Public License along |
| // with this library; see the file COPYING. If not, write to the Free |
| // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, |
| // USA. |
| |
| // As a special exception, you may use this file as part of a free software |
| // library without restriction. Specifically, if other files instantiate |
| // templates or use macros or inline functions from this file, or you compile |
| // this file and link it with other files to produce an executable, this |
| // file does not by itself cause the resulting executable to be covered by |
| // the GNU General Public License. This exception does not however |
| // invalidate any other reasons why the executable file might be covered by |
| // the GNU General Public License. |
| |
| /** @file tr1_impl/unordered_set |
| * This is an internal header file, included by other library headers. |
| * You should not attempt to use it directly. |
| */ |
| |
| namespace std |
| { |
| _GLIBCXX_BEGIN_NAMESPACE_TR1 |
| |
| // XXX When we get typedef templates these class definitions |
| // will be unnecessary. |
| template<class _Value, |
| class _Hash = hash<_Value>, |
| class _Pred = std::equal_to<_Value>, |
| class _Alloc = std::allocator<_Value>, |
| bool __cache_hash_code = false> |
| class __unordered_set |
| : public _Hashtable<_Value, _Value, _Alloc, |
| std::_Identity<_Value>, _Pred, |
| _Hash, __detail::_Mod_range_hashing, |
| __detail::_Default_ranged_hash, |
| __detail::_Prime_rehash_policy, |
| __cache_hash_code, true, true> |
| { |
| typedef _Hashtable<_Value, _Value, _Alloc, |
| std::_Identity<_Value>, _Pred, |
| _Hash, __detail::_Mod_range_hashing, |
| __detail::_Default_ranged_hash, |
| __detail::_Prime_rehash_policy, |
| __cache_hash_code, true, true> |
| _Base; |
| |
| public: |
| typedef typename _Base::size_type size_type; |
| typedef typename _Base::hasher hasher; |
| typedef typename _Base::key_equal key_equal; |
| typedef typename _Base::allocator_type allocator_type; |
| |
| explicit |
| __unordered_set(size_type __n = 10, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__n, __hf, __detail::_Mod_range_hashing(), |
| __detail::_Default_ranged_hash(), __eql, |
| std::_Identity<_Value>(), __a) |
| { } |
| |
| template<typename _InputIterator> |
| __unordered_set(_InputIterator __f, _InputIterator __l, |
| size_type __n = 10, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(), |
| __detail::_Default_ranged_hash(), __eql, |
| std::_Identity<_Value>(), __a) |
| { } |
| |
| #ifdef _GLIBCXX_INCLUDE_AS_CXX0X |
| __unordered_set(__unordered_set&& __x) |
| : _Base(std::forward<_Base>(__x)) { } |
| #endif |
| }; |
| |
| template<class _Value, |
| class _Hash = hash<_Value>, |
| class _Pred = std::equal_to<_Value>, |
| class _Alloc = std::allocator<_Value>, |
| bool __cache_hash_code = false> |
| class __unordered_multiset |
| : public _Hashtable<_Value, _Value, _Alloc, |
| std::_Identity<_Value>, _Pred, |
| _Hash, __detail::_Mod_range_hashing, |
| __detail::_Default_ranged_hash, |
| __detail::_Prime_rehash_policy, |
| __cache_hash_code, true, false> |
| { |
| typedef _Hashtable<_Value, _Value, _Alloc, |
| std::_Identity<_Value>, _Pred, |
| _Hash, __detail::_Mod_range_hashing, |
| __detail::_Default_ranged_hash, |
| __detail::_Prime_rehash_policy, |
| __cache_hash_code, true, false> |
| _Base; |
| |
| public: |
| typedef typename _Base::size_type size_type; |
| typedef typename _Base::hasher hasher; |
| typedef typename _Base::key_equal key_equal; |
| typedef typename _Base::allocator_type allocator_type; |
| |
| explicit |
| __unordered_multiset(size_type __n = 10, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__n, __hf, __detail::_Mod_range_hashing(), |
| __detail::_Default_ranged_hash(), __eql, |
| std::_Identity<_Value>(), __a) |
| { } |
| |
| |
| template<typename _InputIterator> |
| __unordered_multiset(_InputIterator __f, _InputIterator __l, |
| typename _Base::size_type __n = 0, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(), |
| __detail::_Default_ranged_hash(), __eql, |
| std::_Identity<_Value>(), __a) |
| { } |
| |
| #ifdef _GLIBCXX_INCLUDE_AS_CXX0X |
| __unordered_multiset(__unordered_multiset&& __x) |
| : _Base(std::forward<_Base>(__x)) { } |
| #endif |
| }; |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc, |
| bool __cache_hash_code> |
| inline void |
| swap(__unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __x, |
| __unordered_set<_Value, _Hash, _Pred, _Alloc, __cache_hash_code>& __y) |
| { __x.swap(__y); } |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc, |
| bool __cache_hash_code> |
| inline void |
| swap(__unordered_multiset<_Value, _Hash, _Pred, |
| _Alloc, __cache_hash_code>& __x, |
| __unordered_multiset<_Value, _Hash, _Pred, |
| _Alloc, __cache_hash_code>& __y) |
| { __x.swap(__y); } |
| |
| |
| /// class unordered_set |
| template<class _Value, |
| class _Hash = hash<_Value>, |
| class _Pred = std::equal_to<_Value>, |
| class _Alloc = std::allocator<_Value> > |
| class unordered_set |
| : public __unordered_set<_Value, _Hash, _Pred, _Alloc> |
| { |
| typedef __unordered_set<_Value, _Hash, _Pred, _Alloc> _Base; |
| |
| public: |
| typedef typename _Base::size_type size_type; |
| typedef typename _Base::hasher hasher; |
| typedef typename _Base::key_equal key_equal; |
| typedef typename _Base::allocator_type allocator_type; |
| |
| explicit |
| unordered_set(size_type __n = 10, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__n, __hf, __eql, __a) |
| { } |
| |
| template<typename _InputIterator> |
| unordered_set(_InputIterator __f, _InputIterator __l, |
| size_type __n = 10, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__f, __l, __n, __hf, __eql, __a) |
| { } |
| |
| #ifdef _GLIBCXX_INCLUDE_AS_CXX0X |
| unordered_set(unordered_set&& __x) |
| : _Base(std::forward<_Base>(__x)) { } |
| |
| unordered_set& |
| operator=(unordered_set&& __x) |
| { |
| // NB: DR 675. |
| this->clear(); |
| this->swap(__x); |
| return *this; |
| } |
| #endif |
| }; |
| |
| /// class unordered_multiset |
| template<class _Value, |
| class _Hash = hash<_Value>, |
| class _Pred = std::equal_to<_Value>, |
| class _Alloc = std::allocator<_Value> > |
| class unordered_multiset |
| : public __unordered_multiset<_Value, _Hash, _Pred, _Alloc> |
| { |
| typedef __unordered_multiset<_Value, _Hash, _Pred, _Alloc> _Base; |
| |
| public: |
| typedef typename _Base::size_type size_type; |
| typedef typename _Base::hasher hasher; |
| typedef typename _Base::key_equal key_equal; |
| typedef typename _Base::allocator_type allocator_type; |
| |
| explicit |
| unordered_multiset(size_type __n = 10, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__n, __hf, __eql, __a) |
| { } |
| |
| |
| template<typename _InputIterator> |
| unordered_multiset(_InputIterator __f, _InputIterator __l, |
| typename _Base::size_type __n = 0, |
| const hasher& __hf = hasher(), |
| const key_equal& __eql = key_equal(), |
| const allocator_type& __a = allocator_type()) |
| : _Base(__f, __l, __n, __hf, __eql, __a) |
| { } |
| |
| #ifdef _GLIBCXX_INCLUDE_AS_CXX0X |
| unordered_multiset(unordered_multiset&& __x) |
| : _Base(std::forward<_Base>(__x)) { } |
| |
| unordered_multiset& |
| operator=(unordered_multiset&& __x) |
| { |
| // NB: DR 675. |
| this->clear(); |
| this->swap(__x); |
| return *this; |
| } |
| #endif |
| }; |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc> |
| inline void |
| swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, |
| unordered_set<_Value, _Hash, _Pred, _Alloc>& __y) |
| { __x.swap(__y); } |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc> |
| inline void |
| swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x, |
| unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y) |
| { __x.swap(__y); } |
| |
| #ifdef _GLIBCXX_INCLUDE_AS_CXX0X |
| template<class _Value, class _Hash, class _Pred, class _Alloc> |
| inline void |
| swap(unordered_set<_Value, _Hash, _Pred, _Alloc>&& __x, |
| unordered_set<_Value, _Hash, _Pred, _Alloc>& __y) |
| { __x.swap(__y); } |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc> |
| inline void |
| swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, |
| unordered_set<_Value, _Hash, _Pred, _Alloc>&& __y) |
| { __x.swap(__y); } |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc> |
| inline void |
| swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>&& __x, |
| unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y) |
| { __x.swap(__y); } |
| |
| template<class _Value, class _Hash, class _Pred, class _Alloc> |
| inline void |
| swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x, |
| unordered_multiset<_Value, _Hash, _Pred, _Alloc>&& __y) |
| { __x.swap(__y); } |
| #endif |
| |
| _GLIBCXX_END_NAMESPACE_TR1 |
| } |