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 #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 /// Class std::unordered_map with safety/checking/debug instrumentation.
48 template<typename _Key, typename _Tp,
49 typename _Hash = std::hash<_Key>,
50 typename _Pred = std::equal_to<_Key>,
51 typename _Alloc = std::allocator<_Key> >
53 : public _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>,
54 public __gnu_debug::_Safe_sequence<unordered_map<_Key, _Tp, _Hash,
57 typedef _GLIBCXX_STD_D::unordered_map<_Key, _Tp, _Hash,
59 typedef __gnu_debug::_Safe_sequence<unordered_map> _Safe_base;
62 typedef typename _Base::size_type size_type;
63 typedef typename _Base::hasher hasher;
64 typedef typename _Base::key_equal key_equal;
65 typedef typename _Base::allocator_type allocator_type;
67 typedef typename _Base::key_type key_type;
68 typedef typename _Base::value_type value_type;
70 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,
71 unordered_map> iterator;
72 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
73 unordered_map> const_iterator;
76 unordered_map(size_type __n = 10,
77 const hasher& __hf = hasher(),
78 const key_equal& __eql = key_equal(),
79 const allocator_type& __a = allocator_type())
80 : _Base(__n, __hf, __eql, __a) { }
82 template<typename _InputIterator>
83 unordered_map(_InputIterator __f, _InputIterator __l,
85 const hasher& __hf = hasher(),
86 const key_equal& __eql = key_equal(),
87 const allocator_type& __a = allocator_type())
88 : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,
89 __hf, __eql, __a), _Safe_base() { }
91 unordered_map(const unordered_map& __x)
92 : _Base(__x), _Safe_base() { }
94 unordered_map(const _Base& __x)
95 : _Base(__x), _Safe_base() { }
97 unordered_map(unordered_map&& __x)
98 : _Base(std::forward<unordered_map>(__x)), _Safe_base() { }
100 unordered_map(initializer_list<value_type> __l,
102 const hasher& __hf = hasher(),
103 const key_equal& __eql = key_equal(),
104 const allocator_type& __a = allocator_type())
105 : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }
108 operator=(const unordered_map& __x)
110 *static_cast<_Base*>(this) = __x;
111 this->_M_invalidate_all();
116 operator=(unordered_map&& __x)
126 operator=(initializer_list<value_type> __l)
134 swap(unordered_map& __x)
137 _Safe_base::_M_swap(__x);
144 this->_M_invalidate_all();
149 { return iterator(_Base::begin(), this); }
153 { return const_iterator(_Base::begin(), this); }
157 { return iterator(_Base::end(), this); }
161 { return const_iterator(_Base::end(), this); }
165 { return const_iterator(_Base::begin(), this); }
169 { return const_iterator(_Base::end(), this); }
177 std::pair<iterator, bool>
178 insert(const value_type& __obj)
180 typedef std::pair<typename _Base::iterator, bool> __pair_type;
181 __pair_type __res = _Base::insert(__obj);
182 return std::make_pair(iterator(__res.first, this), __res.second);
186 insert(iterator, const value_type& __obj)
188 typedef std::pair<typename _Base::iterator, bool> __pair_type;
189 __pair_type __res = _Base::insert(__obj);
190 return iterator(__res.first, this);
194 insert(const_iterator, const value_type& __obj)
196 typedef std::pair<typename _Base::iterator, bool> __pair_type;
197 __pair_type __res = _Base::insert(__obj);
198 return const_iterator(__res.first, this);
202 insert(std::initializer_list<value_type> __l)
203 { _Base::insert(__l); }
205 template<typename _InputIterator>
207 insert(_InputIterator __first, _InputIterator __last)
209 __glibcxx_check_valid_range(__first, __last);
210 _Base::insert(__first, __last);
214 find(const key_type& __key)
215 { return iterator(_Base::find(__key), this); }
218 find(const key_type& __key) const
219 { return const_iterator(_Base::find(__key), this); }
221 std::pair<iterator, iterator>
222 equal_range(const key_type& __key)
224 typedef typename _Base::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(iterator(__res.first, this),
228 iterator(__res.second, this));
231 std::pair<const_iterator, const_iterator>
232 equal_range(const key_type& __key) const
234 typedef typename _Base::const_iterator _Base_iterator;
235 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
236 __pair_type __res = _Base::equal_range(__key);
237 return std::make_pair(const_iterator(__res.first, this),
238 const_iterator(__res.second, this));
242 erase(const key_type& __key)
245 iterator __victim(_Base::find(__key), this);
246 if (__victim != end())
248 this->erase(__victim);
257 __glibcxx_check_erase(__it);
258 __it._M_invalidate();
259 return iterator(_Base::erase(__it.base()), this);
263 erase(const_iterator __it)
265 __glibcxx_check_erase(__it);
266 __it._M_invalidate();
267 return const_iterator(_Base::erase(__it.base()), this);
271 erase(iterator __first, iterator __last)
273 __glibcxx_check_erase_range(__first, __last);
274 for (iterator __tmp = __first; __tmp != __last;)
276 iterator __victim = __tmp++;
277 __victim._M_invalidate();
279 return iterator(_Base::erase(__first.base(),
280 __last.base()), this);
284 erase(const_iterator __first, const_iterator __last)
286 __glibcxx_check_erase_range(__first, __last);
287 for (const_iterator __tmp = __first; __tmp != __last;)
289 const_iterator __victim = __tmp++;
290 __victim._M_invalidate();
292 return const_iterator(_Base::erase(__first.base(),
293 __last.base()), this);
297 _M_base() { return *this; }
300 _M_base() const { return *this; }
306 typedef typename _Base::const_iterator _Base_const_iterator;
307 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
308 this->_M_invalidate_if(_Not_equal(_M_base().end()));
312 template<typename _Key, typename _Tp, typename _Hash,
313 typename _Pred, typename _Alloc>
315 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
316 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
320 /// Class std::unordered_multimap with safety/checking/debug instrumentation.
321 template<typename _Key, typename _Tp,
322 typename _Hash = std::hash<_Key>,
323 typename _Pred = std::equal_to<_Key>,
324 typename _Alloc = std::allocator<_Key> >
325 class unordered_multimap
326 : public _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash,
328 public __gnu_debug::_Safe_sequence<unordered_multimap<_Key, _Tp, _Hash,
331 typedef _GLIBCXX_STD_D::unordered_multimap<_Key, _Tp, _Hash,
332 _Pred, _Alloc> _Base;
333 typedef __gnu_debug::_Safe_sequence<unordered_multimap> _Safe_base;
336 typedef typename _Base::size_type size_type;
337 typedef typename _Base::hasher hasher;
338 typedef typename _Base::key_equal key_equal;
339 typedef typename _Base::allocator_type allocator_type;
341 typedef typename _Base::key_type key_type;
342 typedef typename _Base::value_type value_type;
344 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,
345 unordered_multimap> iterator;
346 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,
347 unordered_multimap> const_iterator;
350 unordered_multimap(size_type __n = 10,
351 const hasher& __hf = hasher(),
352 const key_equal& __eql = key_equal(),
353 const allocator_type& __a = allocator_type())
354 : _Base(__n, __hf, __eql, __a) { }
356 template<typename _InputIterator>
357 unordered_multimap(_InputIterator __f, _InputIterator __l,
359 const hasher& __hf = hasher(),
360 const key_equal& __eql = key_equal(),
361 const allocator_type& __a = allocator_type())
362 : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,
363 __hf, __eql, __a), _Safe_base() { }
365 unordered_multimap(const unordered_multimap& __x)
366 : _Base(__x), _Safe_base() { }
368 unordered_multimap(const _Base& __x)
369 : _Base(__x), _Safe_base() { }
371 unordered_multimap(unordered_multimap&& __x)
372 : _Base(std::forward<unordered_multimap>(__x)), _Safe_base() { }
374 unordered_multimap(initializer_list<value_type> __l,
376 const hasher& __hf = hasher(),
377 const key_equal& __eql = key_equal(),
378 const allocator_type& __a = allocator_type())
379 : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }
382 operator=(const unordered_multimap& __x)
384 *static_cast<_Base*>(this) = __x;
385 this->_M_invalidate_all();
390 operator=(unordered_multimap&& __x)
400 operator=(initializer_list<value_type> __l)
408 swap(unordered_multimap& __x)
411 _Safe_base::_M_swap(__x);
418 this->_M_invalidate_all();
423 { return iterator(_Base::begin(), this); }
427 { return const_iterator(_Base::begin(), this); }
431 { return iterator(_Base::end(), this); }
435 { return const_iterator(_Base::end(), this); }
439 { return const_iterator(_Base::begin(), this); }
443 { return const_iterator(_Base::end(), this); }
452 insert(const value_type& __obj)
453 { return iterator(_Base::insert(__obj), this); }
456 insert(iterator, const value_type& __obj)
457 { return iterator(_Base::insert(__obj), this); }
460 insert(const_iterator, const value_type& __obj)
461 { return const_iterator(_Base::insert(__obj), this); }
464 insert(std::initializer_list<value_type> __l)
465 { _Base::insert(__l); }
467 template<typename _InputIterator>
469 insert(_InputIterator __first, _InputIterator __last)
471 __glibcxx_check_valid_range(__first, __last);
472 _Base::insert(__first, __last);
476 find(const key_type& __key)
477 { return iterator(_Base::find(__key), this); }
480 find(const key_type& __key) const
481 { return const_iterator(_Base::find(__key), this); }
483 std::pair<iterator, iterator>
484 equal_range(const key_type& __key)
486 typedef typename _Base::iterator _Base_iterator;
487 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
488 __pair_type __res = _Base::equal_range(__key);
489 return std::make_pair(iterator(__res.first, this),
490 iterator(__res.second, this));
493 std::pair<const_iterator, const_iterator>
494 equal_range(const key_type& __key) const
496 typedef typename _Base::const_iterator _Base_iterator;
497 typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;
498 __pair_type __res = _Base::equal_range(__key);
499 return std::make_pair(const_iterator(__res.first, this),
500 const_iterator(__res.second, this));
504 erase(const key_type& __key)
507 iterator __victim(_Base::find(__key), this);
508 if (__victim != end())
510 this->erase(__victim);
519 __glibcxx_check_erase(__it);
520 __it._M_invalidate();
521 return iterator(_Base::erase(__it.base()), this);
525 erase(const_iterator __it)
527 __glibcxx_check_erase(__it);
528 __it._M_invalidate();
529 return const_iterator(_Base::erase(__it.base()), this);
533 erase(iterator __first, iterator __last)
535 __glibcxx_check_erase_range(__first, __last);
536 for (iterator __tmp = __first; __tmp != __last;)
538 iterator __victim = __tmp++;
539 __victim._M_invalidate();
541 return iterator(_Base::erase(__first.base(),
542 __last.base()), this);
546 erase(const_iterator __first, const_iterator __last)
548 __glibcxx_check_erase_range(__first, __last);
549 for (const_iterator __tmp = __first; __tmp != __last;)
551 const_iterator __victim = __tmp++;
552 __victim._M_invalidate();
554 return const_iterator(_Base::erase(__first.base(),
555 __last.base()), this);
559 _M_base() { return *this; }
562 _M_base() const { return *this; }
568 typedef typename _Base::const_iterator _Base_const_iterator;
569 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
570 this->_M_invalidate_if(_Not_equal(_M_base().end()));
574 template<typename _Key, typename _Tp, typename _Hash,
575 typename _Pred, typename _Alloc>
577 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
578 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
581 } // namespace __debug