1 // TR1 unordered_map -*- C++ -*-
3 // Copyright (C) 2007 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
30 /** @file tr1_impl/unordered_map
31 * This is an internal header file, included by other library headers.
32 * You should not attempt to use it directly.
37 _GLIBCXX_BEGIN_NAMESPACE_TR1
39 // XXX When we get typedef templates these class definitions
40 // will be unnecessary.
41 template<class _Key, class _Tp,
42 class _Hash = hash<_Key>,
43 class _Pred = std::equal_to<_Key>,
44 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >,
45 bool __cache_hash_code = false>
47 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc,
48 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
49 _Hash, __detail::_Mod_range_hashing,
50 __detail::_Default_ranged_hash,
51 __detail::_Prime_rehash_policy,
52 __cache_hash_code, false, true>
54 typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc,
55 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
56 _Hash, __detail::_Mod_range_hashing,
57 __detail::_Default_ranged_hash,
58 __detail::_Prime_rehash_policy,
59 __cache_hash_code, false, true>
63 typedef typename _Base::size_type size_type;
64 typedef typename _Base::hasher hasher;
65 typedef typename _Base::key_equal key_equal;
66 typedef typename _Base::allocator_type allocator_type;
69 __unordered_map(size_type __n = 10,
70 const hasher& __hf = hasher(),
71 const key_equal& __eql = key_equal(),
72 const allocator_type& __a = allocator_type())
73 : _Base(__n, __hf, __detail::_Mod_range_hashing(),
74 __detail::_Default_ranged_hash(),
75 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
78 template<typename _InputIterator>
79 __unordered_map(_InputIterator __f, _InputIterator __l,
81 const hasher& __hf = hasher(),
82 const key_equal& __eql = key_equal(),
83 const allocator_type& __a = allocator_type())
84 : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(),
85 __detail::_Default_ranged_hash(),
86 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
89 #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
90 __unordered_map(__unordered_map&& __x)
91 : _Base(std::forward<_Base>(__x)) { }
95 template<class _Key, class _Tp,
96 class _Hash = hash<_Key>,
97 class _Pred = std::equal_to<_Key>,
98 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >,
99 bool __cache_hash_code = false>
100 class __unordered_multimap
101 : public _Hashtable<_Key, std::pair<const _Key, _Tp>,
103 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
104 _Hash, __detail::_Mod_range_hashing,
105 __detail::_Default_ranged_hash,
106 __detail::_Prime_rehash_policy,
107 __cache_hash_code, false, false>
109 typedef _Hashtable<_Key, std::pair<const _Key, _Tp>,
111 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
112 _Hash, __detail::_Mod_range_hashing,
113 __detail::_Default_ranged_hash,
114 __detail::_Prime_rehash_policy,
115 __cache_hash_code, false, false>
119 typedef typename _Base::size_type size_type;
120 typedef typename _Base::hasher hasher;
121 typedef typename _Base::key_equal key_equal;
122 typedef typename _Base::allocator_type allocator_type;
125 __unordered_multimap(size_type __n = 10,
126 const hasher& __hf = hasher(),
127 const key_equal& __eql = key_equal(),
128 const allocator_type& __a = allocator_type())
129 : _Base(__n, __hf, __detail::_Mod_range_hashing(),
130 __detail::_Default_ranged_hash(),
131 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
135 template<typename _InputIterator>
136 __unordered_multimap(_InputIterator __f, _InputIterator __l,
137 typename _Base::size_type __n = 0,
138 const hasher& __hf = hasher(),
139 const key_equal& __eql = key_equal(),
140 const allocator_type& __a = allocator_type())
141 : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(),
142 __detail::_Default_ranged_hash(),
143 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
146 #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
147 __unordered_multimap(__unordered_multimap&& __x)
148 : _Base(std::forward<_Base>(__x)) { }
152 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
153 bool __cache_hash_code>
155 swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
156 _Alloc, __cache_hash_code>& __x,
157 __unordered_map<_Key, _Tp, _Hash, _Pred,
158 _Alloc, __cache_hash_code>& __y)
161 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
162 bool __cache_hash_code>
164 swap(__unordered_multimap<_Key, _Tp, _Hash, _Pred,
165 _Alloc, __cache_hash_code>& __x,
166 __unordered_multimap<_Key, _Tp, _Hash, _Pred,
167 _Alloc, __cache_hash_code>& __y)
171 /// class unordered_map
172 template<class _Key, class _Tp,
173 class _Hash = hash<_Key>,
174 class _Pred = std::equal_to<_Key>,
175 class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
177 : public __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>
179 typedef __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc> _Base;
182 typedef typename _Base::size_type size_type;
183 typedef typename _Base::hasher hasher;
184 typedef typename _Base::key_equal key_equal;
185 typedef typename _Base::allocator_type allocator_type;
188 unordered_map(size_type __n = 10,
189 const hasher& __hf = hasher(),
190 const key_equal& __eql = key_equal(),
191 const allocator_type& __a = allocator_type())
192 : _Base(__n, __hf, __eql, __a)
195 template<typename _InputIterator>
196 unordered_map(_InputIterator __f, _InputIterator __l,
198 const hasher& __hf = hasher(),
199 const key_equal& __eql = key_equal(),
200 const allocator_type& __a = allocator_type())
201 : _Base(__f, __l, __n, __hf, __eql, __a)
204 #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
205 unordered_map(unordered_map&& __x)
206 : _Base(std::forward<_Base>(__x)) { }
209 operator=(unordered_map&& __x)
219 /// class unordered_multimap
220 template<class _Key, class _Tp,
221 class _Hash = hash<_Key>,
222 class _Pred = std::equal_to<_Key>,
223 class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
224 class unordered_multimap
225 : public __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>
227 typedef __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc> _Base;
230 typedef typename _Base::size_type size_type;
231 typedef typename _Base::hasher hasher;
232 typedef typename _Base::key_equal key_equal;
233 typedef typename _Base::allocator_type allocator_type;
236 unordered_multimap(size_type __n = 10,
237 const hasher& __hf = hasher(),
238 const key_equal& __eql = key_equal(),
239 const allocator_type& __a = allocator_type())
240 : _Base(__n, __hf, __eql, __a)
244 template<typename _InputIterator>
245 unordered_multimap(_InputIterator __f, _InputIterator __l,
246 typename _Base::size_type __n = 0,
247 const hasher& __hf = hasher(),
248 const key_equal& __eql = key_equal(),
249 const allocator_type& __a = allocator_type())
250 : _Base(__f, __l, __n, __hf, __eql, __a)
253 #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
254 unordered_multimap(unordered_multimap&& __x)
255 : _Base(std::forward<_Base>(__x)) { }
258 operator=(unordered_multimap&& __x)
268 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
270 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
271 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
274 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
276 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
277 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
280 #ifdef _GLIBCXX_INCLUDE_AS_CXX0X
281 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
283 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&& __x,
284 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
287 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
289 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
290 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&& __y)
293 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
295 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&& __x,
296 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
299 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc>
301 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
302 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&& __y)
306 _GLIBCXX_END_NAMESPACE_TR1