1 // Debugging unordered_map/unordered_multimap implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 // Free Software Foundation, Inc.
6 // This file is part of the GNU ISO C++ Library. This library is free
7 // software; you can redistribute it and/or modify it under the
8 // terms of the GNU General Public License as published by the
9 // Free Software Foundation; either version 3, or (at your option)
12 // This library is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // Under Section 7 of GPL version 3, you are granted additional
18 // permissions described in the GCC Runtime Library Exception, version
19 // 3.1, as published by the Free Software Foundation.
21 // You should have received a copy of the GNU General Public License and
22 // a copy of the GCC Runtime Library Exception along with this program;
23 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 // <http://www.gnu.org/licenses/>.
26 /** @file debug/unordered_map
27 * This file is a GNU debug extension to the Standard C++ Library.
30 #ifndef _GLIBCXX_DEBUG_UNORDERED_MAP
31 #define _GLIBCXX_DEBUG_UNORDERED_MAP 1
33 #ifndef __GXX_EXPERIMENTAL_CXX0X__
34 # include <bits/c++0x_warning.h>
36 # include <unordered_map>
38 #include <debug/safe_sequence.h>
39 #include <debug/safe_iterator.h>
45 /// Class std::unordered_map with safety/checking/debug instrumentation.
46 template<typename _Key, typename _Tp,
47 typename _Hash = std::hash<_Key>,
48 typename _Pred = std::equal_to<_Key>,
49 typename _Alloc = std::allocator<_Key> >
51 : public _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>,
52 public __gnu_debug::_Safe_sequence<unordered_map<_Key, _Tp, _Hash,
55 typedef _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash,
57 typedef __gnu_debug::_Safe_sequence<unordered_map> _Safe_base;
60 typedef typename _Base::size_type size_type;
61 typedef typename _Base::hasher hasher;
62 typedef typename _Base::key_equal key_equal;
63 typedef typename _Base::allocator_type allocator_type;
65 typedef typename _Base::key_type key_type;
66 typedef typename _Base::value_type value_type;
68 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,
69 unordered_map> iterator;
70 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
71 unordered_map> const_iterator;
74 unordered_map(size_type __n = 10,
75 const hasher& __hf = hasher(),
76 const key_equal& __eql = key_equal(),
77 const allocator_type& __a = allocator_type())
78 : _Base(__n, __hf, __eql, __a) { }
80 template<typename _InputIterator>
81 unordered_map(_InputIterator __f, _InputIterator __l,
83 const hasher& __hf = hasher(),
84 const key_equal& __eql = key_equal(),
85 const allocator_type& __a = allocator_type())
86 : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,
87 __hf, __eql, __a), _Safe_base() { }
89 unordered_map(const unordered_map& __x)
90 : _Base(__x), _Safe_base() { }
92 unordered_map(const _Base& __x)
93 : _Base(__x), _Safe_base() { }
95 unordered_map(unordered_map&& __x)
96 : _Base(std::forward<unordered_map>(__x)), _Safe_base() { }
98 unordered_map(initializer_list<value_type> __l,
100 const hasher& __hf = hasher(),
101 const key_equal& __eql = key_equal(),
102 const allocator_type& __a = allocator_type())
103 : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }
106 operator=(const unordered_map& __x)
108 *static_cast<_Base*>(this) = __x;
109 this->_M_invalidate_all();
114 operator=(unordered_map&& __x)
124 operator=(initializer_list<value_type> __l)
132 swap(unordered_map& __x)
135 _Safe_base::_M_swap(__x);
142 this->_M_invalidate_all();
147 { return iterator(_Base::begin(), this); }
151 { return const_iterator(_Base::begin(), this); }
155 { return iterator(_Base::end(), this); }
159 { return const_iterator(_Base::end(), this); }
163 { return const_iterator(_Base::begin(), this); }
167 { return const_iterator(_Base::end(), this); }
175 std::pair<iterator, bool>
176 insert(const value_type& __obj)
178 typedef std::pair<typename _Base::iterator, bool> __pair_type;
179 __pair_type __res = _Base::insert(__obj);
180 return std::make_pair(iterator(__res.first, this), __res.second);
184 insert(const_iterator, const value_type& __obj)
186 typedef std::pair<typename _Base::iterator, bool> __pair_type;
187 __pair_type __res = _Base::insert(__obj);
188 return iterator(__res.first, this);
192 insert(std::initializer_list<value_type> __l)
193 { _Base::insert(__l); }
195 template<typename _InputIterator>
197 insert(_InputIterator __first, _InputIterator __last)
199 __glibcxx_check_valid_range(__first, __last);
200 _Base::insert(__first, __last);
204 find(const key_type& __key)
205 { return iterator(_Base::find(__key), this); }
208 find(const key_type& __key) const
209 { return const_iterator(_Base::find(__key), this); }
211 std::pair<iterator, iterator>
212 equal_range(const key_type& __key)
214 typedef typename _Base::iterator _Base_iterator;
215 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
216 __pair_type __res = _Base::equal_range(__key);
217 return std::make_pair(iterator(__res.first, this),
218 iterator(__res.second, this));
221 std::pair<const_iterator, const_iterator>
222 equal_range(const key_type& __key) const
224 typedef typename _Base::const_iterator _Base_iterator;
225 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
226 __pair_type __res = _Base::equal_range(__key);
227 return std::make_pair(const_iterator(__res.first, this),
228 const_iterator(__res.second, this));
232 erase(const key_type& __key)
235 iterator __victim(_Base::find(__key), this);
236 if (__victim != end())
238 this->erase(__victim);
245 erase(const_iterator __it)
247 __glibcxx_check_erase(__it);
248 __it._M_invalidate();
249 return iterator(_Base::erase(__it.base()), this);
253 erase(const_iterator __first, const_iterator __last)
255 __glibcxx_check_erase_range(__first, __last);
256 for (const_iterator __tmp = __first; __tmp != __last;)
258 const_iterator __victim = __tmp++;
259 __victim._M_invalidate();
261 return iterator(_Base::erase(__first.base(),
262 __last.base()), this);
266 _M_base() { return *this; }
269 _M_base() const { return *this; }
275 typedef typename _Base::const_iterator _Base_const_iterator;
276 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
277 this->_M_invalidate_if(_Not_equal(_M_base().end()));
281 template<typename _Key, typename _Tp, typename _Hash,
282 typename _Pred, typename _Alloc>
284 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
285 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
288 template<typename _Key, typename _Tp, typename _Hash,
289 typename _Pred, typename _Alloc>
291 operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
292 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
293 { return __x._M_equal(__y); }
295 template<typename _Key, typename _Tp, typename _Hash,
296 typename _Pred, typename _Alloc>
298 operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
299 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
300 { return !(__x == __y); }
303 /// Class std::unordered_multimap with safety/checking/debug instrumentation.
304 template<typename _Key, typename _Tp,
305 typename _Hash = std::hash<_Key>,
306 typename _Pred = std::equal_to<_Key>,
307 typename _Alloc = std::allocator<_Key> >
308 class unordered_multimap
309 : public _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash,
311 public __gnu_debug::_Safe_sequence<unordered_multimap<_Key, _Tp, _Hash,
314 typedef _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash,
315 _Pred, _Alloc> _Base;
316 typedef __gnu_debug::_Safe_sequence<unordered_multimap> _Safe_base;
319 typedef typename _Base::size_type size_type;
320 typedef typename _Base::hasher hasher;
321 typedef typename _Base::key_equal key_equal;
322 typedef typename _Base::allocator_type allocator_type;
324 typedef typename _Base::key_type key_type;
325 typedef typename _Base::value_type value_type;
327 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,
328 unordered_multimap> iterator;
329 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
330 unordered_multimap> const_iterator;
333 unordered_multimap(size_type __n = 10,
334 const hasher& __hf = hasher(),
335 const key_equal& __eql = key_equal(),
336 const allocator_type& __a = allocator_type())
337 : _Base(__n, __hf, __eql, __a) { }
339 template<typename _InputIterator>
340 unordered_multimap(_InputIterator __f, _InputIterator __l,
342 const hasher& __hf = hasher(),
343 const key_equal& __eql = key_equal(),
344 const allocator_type& __a = allocator_type())
345 : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,
346 __hf, __eql, __a), _Safe_base() { }
348 unordered_multimap(const unordered_multimap& __x)
349 : _Base(__x), _Safe_base() { }
351 unordered_multimap(const _Base& __x)
352 : _Base(__x), _Safe_base() { }
354 unordered_multimap(unordered_multimap&& __x)
355 : _Base(std::forward<unordered_multimap>(__x)), _Safe_base() { }
357 unordered_multimap(initializer_list<value_type> __l,
359 const hasher& __hf = hasher(),
360 const key_equal& __eql = key_equal(),
361 const allocator_type& __a = allocator_type())
362 : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }
365 operator=(const unordered_multimap& __x)
367 *static_cast<_Base*>(this) = __x;
368 this->_M_invalidate_all();
373 operator=(unordered_multimap&& __x)
383 operator=(initializer_list<value_type> __l)
391 swap(unordered_multimap& __x)
394 _Safe_base::_M_swap(__x);
401 this->_M_invalidate_all();
406 { return iterator(_Base::begin(), this); }
410 { return const_iterator(_Base::begin(), this); }
414 { return iterator(_Base::end(), this); }
418 { return const_iterator(_Base::end(), this); }
422 { return const_iterator(_Base::begin(), this); }
426 { return const_iterator(_Base::end(), this); }
435 insert(const value_type& __obj)
436 { return iterator(_Base::insert(__obj), this); }
439 insert(const_iterator, const value_type& __obj)
440 { return iterator(_Base::insert(__obj), this); }
443 insert(std::initializer_list<value_type> __l)
444 { _Base::insert(__l); }
446 template<typename _InputIterator>
448 insert(_InputIterator __first, _InputIterator __last)
450 __glibcxx_check_valid_range(__first, __last);
451 _Base::insert(__first, __last);
455 find(const key_type& __key)
456 { return iterator(_Base::find(__key), this); }
459 find(const key_type& __key) const
460 { return const_iterator(_Base::find(__key), this); }
462 std::pair<iterator, iterator>
463 equal_range(const key_type& __key)
465 typedef typename _Base::iterator _Base_iterator;
466 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
467 __pair_type __res = _Base::equal_range(__key);
468 return std::make_pair(iterator(__res.first, this),
469 iterator(__res.second, this));
472 std::pair<const_iterator, const_iterator>
473 equal_range(const key_type& __key) const
475 typedef typename _Base::const_iterator _Base_iterator;
476 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
477 __pair_type __res = _Base::equal_range(__key);
478 return std::make_pair(const_iterator(__res.first, this),
479 const_iterator(__res.second, this));
483 erase(const key_type& __key)
486 iterator __victim(_Base::find(__key), this);
487 if (__victim != end())
489 this->erase(__victim);
496 erase(const_iterator __it)
498 __glibcxx_check_erase(__it);
499 __it._M_invalidate();
500 return iterator(_Base::erase(__it.base()), this);
504 erase(const_iterator __first, const_iterator __last)
506 __glibcxx_check_erase_range(__first, __last);
507 for (const_iterator __tmp = __first; __tmp != __last;)
509 const_iterator __victim = __tmp++;
510 __victim._M_invalidate();
512 return iterator(_Base::erase(__first.base(),
513 __last.base()), this);
517 _M_base() { return *this; }
520 _M_base() const { return *this; }
526 typedef typename _Base::const_iterator _Base_const_iterator;
527 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
528 this->_M_invalidate_if(_Not_equal(_M_base().end()));
532 template<typename _Key, typename _Tp, typename _Hash,
533 typename _Pred, typename _Alloc>
535 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
536 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
539 template<typename _Key, typename _Tp, typename _Hash,
540 typename _Pred, typename _Alloc>
542 operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
543 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
544 { return __x._M_equal(__y); }
546 template<typename _Key, typename _Tp, typename _Hash,
547 typename _Pred, typename _Alloc>
549 operator!=(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
550 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
551 { return !(__x == __y); }
553 } // namespace __debug
556 #endif // __GXX_EXPERIMENTAL_CXX0X__