1 // Debugging unordered_map/unordered_multimap implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
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 #ifdef __GXX_EXPERIMENTAL_CXX0X__
34 # include <unordered_map>
36 # include <c++0x_warning.h>
39 #include <debug/safe_sequence.h>
40 #include <debug/safe_iterator.h>
41 #include <initializer_list>
47 template<typename _Key, typename _Tp,
48 typename _Hash = std::hash<_Key>,
49 typename _Pred = std::equal_to<_Key>,
50 typename _Alloc = std::allocator<_Key> >
52 : public _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>,
53 public __gnu_debug::_Safe_sequence<unordered_map<_Key, _Tp, _Hash,
56 typedef _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash,
58 typedef __gnu_debug::_Safe_sequence<unordered_map> _Safe_base;
61 typedef typename _Base::size_type size_type;
62 typedef typename _Base::hasher hasher;
63 typedef typename _Base::key_equal key_equal;
64 typedef typename _Base::allocator_type allocator_type;
66 typedef typename _Base::key_type key_type;
67 typedef typename _Base::value_type value_type;
69 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,
70 unordered_map> iterator;
71 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
72 unordered_map> const_iterator;
75 unordered_map(size_type __n = 10,
76 const hasher& __hf = hasher(),
77 const key_equal& __eql = key_equal(),
78 const allocator_type& __a = allocator_type())
79 : _Base(__n, __hf, __eql, __a) { }
81 template<typename _InputIterator>
82 unordered_map(_InputIterator __f, _InputIterator __l,
84 const hasher& __hf = hasher(),
85 const key_equal& __eql = key_equal(),
86 const allocator_type& __a = allocator_type())
87 : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,
88 __hf, __eql, __a), _Safe_base() { }
90 unordered_map(const unordered_map& __x)
91 : _Base(__x), _Safe_base() { }
93 unordered_map(const _Base& __x)
94 : _Base(__x), _Safe_base() { }
96 unordered_map(unordered_map&& __x)
97 : _Base(std::forward<unordered_map>(__x)), _Safe_base() { }
99 unordered_map(initializer_list<value_type> __l,
101 const hasher& __hf = hasher(),
102 const key_equal& __eql = key_equal(),
103 const allocator_type& __a = allocator_type())
104 : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }
107 operator=(const unordered_map& __x)
109 *static_cast<_Base*>(this) = __x;
110 this->_M_invalidate_all();
115 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(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(const_iterator, const value_type& __obj)
194 typedef std::pair<typename _Base::iterator, bool> __pair_type;
195 __pair_type __res = _Base::insert(__obj);
196 return const_iterator(__res.first, this);
200 insert(std::initializer_list<value_type> __l)
201 { _Base::insert(__l); }
203 template<typename _InputIterator>
205 insert(_InputIterator __first, _InputIterator __last)
207 __glibcxx_check_valid_range(__first, __last);
208 _Base::insert(__first, __last);
212 find(const key_type& __key)
213 { return iterator(_Base::find(__key), this); }
216 find(const key_type& __key) const
217 { return const_iterator(_Base::find(__key), this); }
219 std::pair<iterator, iterator>
220 equal_range(const key_type& __key)
222 typedef typename _Base::iterator _Base_iterator;
223 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
224 __pair_type __res = _Base::equal_range(__key);
225 return std::make_pair(iterator(__res.first, this),
226 iterator(__res.second, this));
229 std::pair<const_iterator, const_iterator>
230 equal_range(const key_type& __key) const
232 typedef typename _Base::const_iterator _Base_iterator;
233 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
234 __pair_type __res = _Base::equal_range(__key);
235 return std::make_pair(const_iterator(__res.first, this),
236 const_iterator(__res.second, this));
240 erase(const key_type& __key)
243 iterator __victim(_Base::find(__key), this);
244 if (__victim != end())
246 this->erase(__victim);
255 __glibcxx_check_erase(__it);
256 __it._M_invalidate();
257 return iterator(_Base::erase(__it.base()), this);
261 erase(const_iterator __it)
263 __glibcxx_check_erase(__it);
264 __it._M_invalidate();
265 return const_iterator(_Base::erase(__it.base()), this);
269 erase(iterator __first, iterator __last)
271 __glibcxx_check_erase_range(__first, __last);
272 for (iterator __tmp = __first; __tmp != __last;)
274 iterator __victim = __tmp++;
275 __victim._M_invalidate();
277 return iterator(_Base::erase(__first.base(),
278 __last.base()), this);
282 erase(const_iterator __first, const_iterator __last)
284 __glibcxx_check_erase_range(__first, __last);
285 for (const_iterator __tmp = __first; __tmp != __last;)
287 const_iterator __victim = __tmp++;
288 __victim._M_invalidate();
290 return const_iterator(_Base::erase(__first.base(),
291 __last.base()), this);
295 _M_base() { return *this; }
298 _M_base() const { return *this; }
304 typedef typename _Base::const_iterator _Base_const_iterator;
305 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
306 this->_M_invalidate_if(_Not_equal(_M_base().end()));
310 template<typename _Key, typename _Tp, typename _Hash,
311 typename _Pred, typename _Alloc>
313 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
314 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
318 template<typename _Key, typename _Tp,
319 typename _Hash = std::hash<_Key>,
320 typename _Pred = std::equal_to<_Key>,
321 typename _Alloc = std::allocator<_Key> >
322 class unordered_multimap
323 : public _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash,
325 public __gnu_debug::_Safe_sequence<unordered_multimap<_Key, _Tp, _Hash,
328 typedef _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash,
329 _Pred, _Alloc> _Base;
330 typedef __gnu_debug::_Safe_sequence<unordered_multimap> _Safe_base;
333 typedef typename _Base::size_type size_type;
334 typedef typename _Base::hasher hasher;
335 typedef typename _Base::key_equal key_equal;
336 typedef typename _Base::allocator_type allocator_type;
338 typedef typename _Base::key_type key_type;
339 typedef typename _Base::value_type value_type;
341 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,
342 unordered_multimap> iterator;
343 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
344 unordered_multimap> const_iterator;
347 unordered_multimap(size_type __n = 10,
348 const hasher& __hf = hasher(),
349 const key_equal& __eql = key_equal(),
350 const allocator_type& __a = allocator_type())
351 : _Base(__n, __hf, __eql, __a) { }
353 template<typename _InputIterator>
354 unordered_multimap(_InputIterator __f, _InputIterator __l,
356 const hasher& __hf = hasher(),
357 const key_equal& __eql = key_equal(),
358 const allocator_type& __a = allocator_type())
359 : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,
360 __hf, __eql, __a), _Safe_base() { }
362 unordered_multimap(const unordered_multimap& __x)
363 : _Base(__x), _Safe_base() { }
365 unordered_multimap(const _Base& __x)
366 : _Base(__x), _Safe_base() { }
368 unordered_multimap(unordered_multimap&& __x)
369 : _Base(std::forward<unordered_multimap>(__x)), _Safe_base() { }
371 unordered_multimap(initializer_list<value_type> __l,
373 const hasher& __hf = hasher(),
374 const key_equal& __eql = key_equal(),
375 const allocator_type& __a = allocator_type())
376 : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }
379 operator=(const unordered_multimap& __x)
381 *static_cast<_Base*>(this) = __x;
382 this->_M_invalidate_all();
387 operator=(unordered_multimap&& __x)
396 operator=(initializer_list<value_type> __l)
404 swap(unordered_multimap& __x)
407 _Safe_base::_M_swap(__x);
414 this->_M_invalidate_all();
419 { return iterator(_Base::begin(), this); }
423 { return const_iterator(_Base::begin(), this); }
427 { return iterator(_Base::end(), this); }
431 { return const_iterator(_Base::end(), this); }
435 { return const_iterator(_Base::begin(), this); }
439 { return const_iterator(_Base::end(), this); }
448 insert(const value_type& __obj)
449 { return iterator(_Base::insert(__obj), this); }
452 insert(iterator, const value_type& __obj)
453 { return iterator(_Base::insert(__obj), this); }
456 insert(const_iterator, const value_type& __obj)
457 { return const_iterator(_Base::insert(__obj), this); }
460 insert(std::initializer_list<value_type> __l)
461 { _Base::insert(__l); }
463 template<typename _InputIterator>
465 insert(_InputIterator __first, _InputIterator __last)
467 __glibcxx_check_valid_range(__first, __last);
468 _Base::insert(__first, __last);
472 find(const key_type& __key)
473 { return iterator(_Base::find(__key), this); }
476 find(const key_type& __key) const
477 { return const_iterator(_Base::find(__key), this); }
479 std::pair<iterator, iterator>
480 equal_range(const key_type& __key)
482 typedef typename _Base::iterator _Base_iterator;
483 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
484 __pair_type __res = _Base::equal_range(__key);
485 return std::make_pair(iterator(__res.first, this),
486 iterator(__res.second, this));
489 std::pair<const_iterator, const_iterator>
490 equal_range(const key_type& __key) const
492 typedef typename _Base::const_iterator _Base_iterator;
493 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
494 __pair_type __res = _Base::equal_range(__key);
495 return std::make_pair(const_iterator(__res.first, this),
496 const_iterator(__res.second, this));
500 erase(const key_type& __key)
503 iterator __victim(_Base::find(__key), this);
504 if (__victim != end())
506 this->erase(__victim);
515 __glibcxx_check_erase(__it);
516 __it._M_invalidate();
517 return iterator(_Base::erase(__it.base()), this);
521 erase(const_iterator __it)
523 __glibcxx_check_erase(__it);
524 __it._M_invalidate();
525 return const_iterator(_Base::erase(__it.base()), this);
529 erase(iterator __first, iterator __last)
531 __glibcxx_check_erase_range(__first, __last);
532 for (iterator __tmp = __first; __tmp != __last;)
534 iterator __victim = __tmp++;
535 __victim._M_invalidate();
537 return iterator(_Base::erase(__first.base(),
538 __last.base()), this);
542 erase(const_iterator __first, const_iterator __last)
544 __glibcxx_check_erase_range(__first, __last);
545 for (const_iterator __tmp = __first; __tmp != __last;)
547 const_iterator __victim = __tmp++;
548 __victim._M_invalidate();
550 return const_iterator(_Base::erase(__first.base(),
551 __last.base()), this);
555 _M_base() { return *this; }
558 _M_base() const { return *this; }
564 typedef typename _Base::const_iterator _Base_const_iterator;
565 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
566 this->_M_invalidate_if(_Not_equal(_M_base().end()));
570 template<typename _Key, typename _Tp, typename _Hash,
571 typename _Pred, typename _Alloc>
573 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
574 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
577 } // namespace __debug