988499f434
* include/debug/unordered_map: Add initializer_list support.
* include/debug/safe_association.h: Likewise.
* include/debug/unordered_set: Likewise.
* include/debug/vector: Likewise.
* include/debug/deque: Likewise.
* include/debug/map.h: Likewise.
* include/debug/set.h: Likewise.
* include/debug/string: Likewise.
* include/debug/list: Likewise.
* include/debug/multimap.h: Likewise.
* include/tr1_impl/unordered_map: Likewise.
* include/tr1_impl/hashtable: Likewise.
* include/tr1_impl/unordered_set: Likewise.
* include/tr1_impl/regex: Likewise.
* include/std/valarray: Likewise.
* include/std/unordered_map: Likewise.
* include/std/unordered_set: Likewise.
* include/bits/stl_list.h: Likewise.
* include/bits/stl_map.h: Likewise.
* include/bits/stl_set.h: Likewise.
* include/bits/basic_string.h: Likewise.
* include/bits/basic_string.tcc: Likewise.
* include/bits/stl_multimap.h: Likewise.
* include/bits/stl_vector.h: Likewise.
* include/bits/stl_deque.h: Likewise.
* include/bits/stl_multiset.h: Likewise.
* include/bits/stl_bvector.h: Likewise.
* include/ext/vstring.h: Likewise.
* include/ext/rc_string_base.h: Likewise.
* include/ext/sso_string_base.h: Likewise.
* src/Makefile.am (w?string-inst): Build with -std=gnu++0x.
* src/Makefile.in: Likewise.
* config/abi/pre/gnu.ver: Add new w?string exports.
...
From-SVN: r138043
342 lines
12 KiB
C++
342 lines
12 KiB
C++
// TR1 unordered_map -*- 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_map
|
|
* 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 _Key, class _Tp,
|
|
class _Hash = hash<_Key>,
|
|
class _Pred = std::equal_to<_Key>,
|
|
class _Alloc = std::allocator<std::pair<const _Key, _Tp> >,
|
|
bool __cache_hash_code = false>
|
|
class __unordered_map
|
|
: public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc,
|
|
std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
|
|
_Hash, __detail::_Mod_range_hashing,
|
|
__detail::_Default_ranged_hash,
|
|
__detail::_Prime_rehash_policy,
|
|
__cache_hash_code, false, true>
|
|
{
|
|
typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc,
|
|
std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
|
|
_Hash, __detail::_Mod_range_hashing,
|
|
__detail::_Default_ranged_hash,
|
|
__detail::_Prime_rehash_policy,
|
|
__cache_hash_code, false, 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_map(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::_Select1st<std::pair<const _Key, _Tp> >(), __a)
|
|
{ }
|
|
|
|
template<typename _InputIterator>
|
|
__unordered_map(_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::_Select1st<std::pair<const _Key, _Tp> >(), __a)
|
|
{ }
|
|
|
|
#ifdef _GLIBCXX_INCLUDE_AS_CXX0X
|
|
__unordered_map(__unordered_map&& __x)
|
|
: _Base(std::forward<_Base>(__x)) { }
|
|
#endif
|
|
};
|
|
|
|
template<class _Key, class _Tp,
|
|
class _Hash = hash<_Key>,
|
|
class _Pred = std::equal_to<_Key>,
|
|
class _Alloc = std::allocator<std::pair<const _Key, _Tp> >,
|
|
bool __cache_hash_code = false>
|
|
class __unordered_multimap
|
|
: public _Hashtable<_Key, std::pair<const _Key, _Tp>,
|
|
_Alloc,
|
|
std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
|
|
_Hash, __detail::_Mod_range_hashing,
|
|
__detail::_Default_ranged_hash,
|
|
__detail::_Prime_rehash_policy,
|
|
__cache_hash_code, false, false>
|
|
{
|
|
typedef _Hashtable<_Key, std::pair<const _Key, _Tp>,
|
|
_Alloc,
|
|
std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
|
|
_Hash, __detail::_Mod_range_hashing,
|
|
__detail::_Default_ranged_hash,
|
|
__detail::_Prime_rehash_policy,
|
|
__cache_hash_code, false, 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_multimap(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::_Select1st<std::pair<const _Key, _Tp> >(), __a)
|
|
{ }
|
|
|
|
|
|
template<typename _InputIterator>
|
|
__unordered_multimap(_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::_Select1st<std::pair<const _Key, _Tp> >(), __a)
|
|
{ }
|
|
|
|
#ifdef _GLIBCXX_INCLUDE_AS_CXX0X
|
|
__unordered_multimap(__unordered_multimap&& __x)
|
|
: _Base(std::forward<_Base>(__x)) { }
|
|
#endif
|
|
};
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
|
|
bool __cache_hash_code>
|
|
inline void
|
|
swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
|
|
_Alloc, __cache_hash_code>& __x,
|
|
__unordered_map<_Key, _Tp, _Hash, _Pred,
|
|
_Alloc, __cache_hash_code>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
|
|
bool __cache_hash_code>
|
|
inline void
|
|
swap(__unordered_multimap<_Key, _Tp, _Hash, _Pred,
|
|
_Alloc, __cache_hash_code>& __x,
|
|
__unordered_multimap<_Key, _Tp, _Hash, _Pred,
|
|
_Alloc, __cache_hash_code>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
|
|
/// class unordered_map
|
|
template<class _Key, class _Tp,
|
|
class _Hash = hash<_Key>,
|
|
class _Pred = std::equal_to<_Key>,
|
|
class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
|
|
class unordered_map
|
|
: public __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>
|
|
{
|
|
typedef __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc> _Base;
|
|
|
|
public:
|
|
typedef typename _Base::value_type value_type;
|
|
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_map(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_map(_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_map(unordered_map&& __x)
|
|
: _Base(std::forward<_Base>(__x)) { }
|
|
|
|
unordered_map(initializer_list<value_type> __l,
|
|
size_type __n = 10,
|
|
const hasher& __hf = hasher(),
|
|
const key_equal& __eql = key_equal(),
|
|
const allocator_type& __a = allocator_type())
|
|
: _Base(__l.begin(), __l.end(), __n, __hf, __eql, __a)
|
|
{ }
|
|
|
|
unordered_map&
|
|
operator=(unordered_map&& __x)
|
|
{
|
|
// NB: DR 675.
|
|
this->clear();
|
|
this->swap(__x);
|
|
return *this;
|
|
}
|
|
|
|
unordered_map&
|
|
operator=(initializer_list<value_type> __l)
|
|
{
|
|
this->clear();
|
|
this->insert(__l.begin(), __l.end());
|
|
return *this;
|
|
}
|
|
#endif
|
|
};
|
|
|
|
/// class unordered_multimap
|
|
template<class _Key, class _Tp,
|
|
class _Hash = hash<_Key>,
|
|
class _Pred = std::equal_to<_Key>,
|
|
class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
|
|
class unordered_multimap
|
|
: public __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>
|
|
{
|
|
typedef __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc> _Base;
|
|
|
|
public:
|
|
typedef typename _Base::value_type value_type;
|
|
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_multimap(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_multimap(_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_multimap(unordered_multimap&& __x)
|
|
: _Base(std::forward<_Base>(__x)) { }
|
|
|
|
unordered_multimap(initializer_list<value_type> __l,
|
|
size_type __n = 10,
|
|
const hasher& __hf = hasher(),
|
|
const key_equal& __eql = key_equal(),
|
|
const allocator_type& __a = allocator_type())
|
|
: _Base(__l.begin(), __l.end(), __n, __hf, __eql, __a)
|
|
{ }
|
|
|
|
unordered_multimap&
|
|
operator=(unordered_multimap&& __x)
|
|
{
|
|
// NB: DR 675.
|
|
this->clear();
|
|
this->swap(__x);
|
|
return *this;
|
|
}
|
|
|
|
unordered_multimap&
|
|
operator=(initializer_list<value_type> __l)
|
|
{
|
|
this->clear();
|
|
this->insert(__l.begin(), __l.end());
|
|
return *this;
|
|
}
|
|
#endif
|
|
};
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
|
|
inline void
|
|
swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
|
|
inline void
|
|
swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
#ifdef _GLIBCXX_INCLUDE_AS_CXX0X
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
|
|
inline void
|
|
swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&& __x,
|
|
unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
|
|
inline void
|
|
swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
|
|
inline void
|
|
swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&& __x,
|
|
unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
|
|
inline void
|
|
swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&& __y)
|
|
{ __x.swap(__y); }
|
|
#endif
|
|
|
|
_GLIBCXX_END_NAMESPACE_TR1
|
|
}
|