1 // Debugging map implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007, 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/>.
27 * This file is a GNU debug extension to the Standard C++ Library.
30 #ifndef _GLIBCXX_DEBUG_MAP_H
31 #define _GLIBCXX_DEBUG_MAP_H 1
33 #include <debug/safe_sequence.h>
34 #include <debug/safe_iterator.h>
41 /// Class std::map with safety/checking/debug instrumentation.
42 template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
43 typename _Allocator = std::allocator<std::pair<const _Key, _Tp> > >
45 : public _GLIBCXX_STD_D::map<_Key, _Tp, _Compare, _Allocator>,
46 public __gnu_debug::_Safe_sequence<map<_Key, _Tp, _Compare, _Allocator> >
48 typedef _GLIBCXX_STD_D::map<_Key, _Tp, _Compare, _Allocator> _Base;
49 typedef __gnu_debug::_Safe_sequence<map> _Safe_base;
51 typedef typename _Base::const_iterator _Base_const_iterator;
52 typedef typename _Base::iterator _Base_iterator;
53 typedef __gnu_debug::_Equal_to<_Base_const_iterator> _Equal;
56 typedef _Key key_type;
57 typedef _Tp mapped_type;
58 typedef std::pair<const _Key, _Tp> value_type;
59 typedef _Compare key_compare;
60 typedef _Allocator allocator_type;
61 typedef typename _Base::reference reference;
62 typedef typename _Base::const_reference const_reference;
64 typedef __gnu_debug::_Safe_iterator<typename _Base::iterator, map>
66 typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator, map>
69 typedef typename _Base::size_type size_type;
70 typedef typename _Base::difference_type difference_type;
71 typedef typename _Base::pointer pointer;
72 typedef typename _Base::const_pointer const_pointer;
73 typedef std::reverse_iterator<iterator> reverse_iterator;
74 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
76 using _Base::value_compare;
78 // 23.3.1.1 construct/copy/destroy:
79 explicit map(const _Compare& __comp = _Compare(),
80 const _Allocator& __a = _Allocator())
81 : _Base(__comp, __a) { }
83 template<typename _InputIterator>
84 map(_InputIterator __first, _InputIterator __last,
85 const _Compare& __comp = _Compare(),
86 const _Allocator& __a = _Allocator())
87 : _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
89 __gnu_debug::__base(__last),
90 __comp, __a), _Safe_base() { }
93 : _Base(__x), _Safe_base() { }
96 : _Base(__x), _Safe_base() { }
98 #ifdef __GXX_EXPERIMENTAL_CXX0X__
100 : _Base(std::move(__x)), _Safe_base()
101 { this->_M_swap(__x); }
103 map(initializer_list<value_type> __l,
104 const _Compare& __c = _Compare(),
105 const allocator_type& __a = allocator_type())
106 : _Base(__l, __c, __a), _Safe_base() { }
112 operator=(const map& __x)
114 *static_cast<_Base*>(this) = __x;
115 this->_M_invalidate_all();
119 #ifdef __GXX_EXPERIMENTAL_CXX0X__
131 operator=(initializer_list<value_type> __l)
139 // _GLIBCXX_RESOLVE_LIB_DEFECTS
140 // 133. map missing get_allocator()
141 using _Base::get_allocator;
146 { return iterator(_Base::begin(), this); }
150 { return const_iterator(_Base::begin(), this); }
154 { return iterator(_Base::end(), this); }
158 { return const_iterator(_Base::end(), this); }
162 { return reverse_iterator(end()); }
164 const_reverse_iterator
166 { return const_reverse_iterator(end()); }
170 { return reverse_iterator(begin()); }
172 const_reverse_iterator
174 { return const_reverse_iterator(begin()); }
176 #ifdef __GXX_EXPERIMENTAL_CXX0X__
179 { return const_iterator(_Base::begin(), this); }
183 { return const_iterator(_Base::end(), this); }
185 const_reverse_iterator
187 { return const_reverse_iterator(end()); }
189 const_reverse_iterator
191 { return const_reverse_iterator(begin()); }
197 using _Base::max_size;
199 // 23.3.1.2 element access:
200 using _Base::operator[];
202 // _GLIBCXX_RESOLVE_LIB_DEFECTS
203 // DR 464. Suggestion for new member functions in standard containers.
207 std::pair<iterator, bool>
208 insert(const value_type& __x)
210 typedef typename _Base::iterator _Base_iterator;
211 std::pair<_Base_iterator, bool> __res = _Base::insert(__x);
212 return std::pair<iterator, bool>(iterator(__res.first, this),
216 #ifdef __GXX_EXPERIMENTAL_CXX0X__
217 template<typename _Pair, typename = typename
218 std::enable_if<std::is_convertible<_Pair,
219 value_type>::value>::type>
220 std::pair<iterator, bool>
223 typedef typename _Base::iterator _Base_iterator;
224 std::pair<_Base_iterator, bool> __res
225 = _Base::insert(std::forward<_Pair>(__x));
226 return std::pair<iterator, bool>(iterator(__res.first, this),
231 #ifdef __GXX_EXPERIMENTAL_CXX0X__
233 insert(std::initializer_list<value_type> __list)
234 { _Base::insert(__list); }
238 #ifdef __GXX_EXPERIMENTAL_CXX0X__
239 insert(const_iterator __position, const value_type& __x)
241 insert(iterator __position, const value_type& __x)
244 __glibcxx_check_insert(__position);
245 return iterator(_Base::insert(__position.base(), __x), this);
248 #ifdef __GXX_EXPERIMENTAL_CXX0X__
249 template<typename _Pair, typename = typename
250 std::enable_if<std::is_convertible<_Pair,
251 value_type>::value>::type>
253 insert(const_iterator __position, _Pair&& __x)
255 __glibcxx_check_insert(__position);
256 return iterator(_Base::insert(__position.base(),
257 std::forward<_Pair>(__x)), this);
261 template<typename _InputIterator>
263 insert(_InputIterator __first, _InputIterator __last)
265 __glibcxx_check_valid_range(__first, __last);
266 _Base::insert(__gnu_debug::__base(__first),
267 __gnu_debug::__base(__last));
270 #ifdef __GXX_EXPERIMENTAL_CXX0X__
272 erase(const_iterator __position)
274 __glibcxx_check_erase(__position);
275 this->_M_invalidate_if(_Equal(__position.base()));
276 return iterator(_Base::erase(__position.base()), this);
280 erase(iterator __position)
282 __glibcxx_check_erase(__position);
283 this->_M_invalidate_if(_Equal(__position.base()));
284 _Base::erase(__position.base());
289 erase(const key_type& __x)
291 _Base_iterator __victim = _Base::find(__x);
292 if (__victim == _Base::end())
296 this->_M_invalidate_if(_Equal(__victim));
297 _Base::erase(__victim);
302 #ifdef __GXX_EXPERIMENTAL_CXX0X__
304 erase(const_iterator __first, const_iterator __last)
306 // _GLIBCXX_RESOLVE_LIB_DEFECTS
307 // 151. can't currently clear() empty container
308 __glibcxx_check_erase_range(__first, __last);
309 for (_Base_const_iterator __victim = __first.base();
310 __victim != __last.base(); ++__victim)
312 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
313 _M_message(__gnu_debug::__msg_valid_range)
314 ._M_iterator(__first, "first")
315 ._M_iterator(__last, "last"));
316 this->_M_invalidate_if(_Equal(__victim));
318 return iterator(_Base::erase(__first.base(), __last.base()), this);
322 erase(iterator __first, iterator __last)
324 // _GLIBCXX_RESOLVE_LIB_DEFECTS
325 // 151. can't currently clear() empty container
326 __glibcxx_check_erase_range(__first, __last);
327 for (_Base_iterator __victim = __first.base();
328 __victim != __last.base(); ++__victim)
330 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
331 _M_message(__gnu_debug::__msg_valid_range)
332 ._M_iterator(__first, "first")
333 ._M_iterator(__last, "last"));
334 this->_M_invalidate_if(_Equal(__victim));
336 _Base::erase(__first.base(), __last.base());
350 this->_M_invalidate_all();
355 using _Base::key_comp;
356 using _Base::value_comp;
358 // 23.3.1.3 map operations:
360 find(const key_type& __x)
361 { return iterator(_Base::find(__x), this); }
364 find(const key_type& __x) const
365 { return const_iterator(_Base::find(__x), this); }
370 lower_bound(const key_type& __x)
371 { return iterator(_Base::lower_bound(__x), this); }
374 lower_bound(const key_type& __x) const
375 { return const_iterator(_Base::lower_bound(__x), this); }
378 upper_bound(const key_type& __x)
379 { return iterator(_Base::upper_bound(__x), this); }
382 upper_bound(const key_type& __x) const
383 { return const_iterator(_Base::upper_bound(__x), this); }
385 std::pair<iterator,iterator>
386 equal_range(const key_type& __x)
388 typedef typename _Base::iterator _Base_iterator;
389 std::pair<_Base_iterator, _Base_iterator> __res =
390 _Base::equal_range(__x);
391 return std::make_pair(iterator(__res.first, this),
392 iterator(__res.second, this));
395 std::pair<const_iterator,const_iterator>
396 equal_range(const key_type& __x) const
398 typedef typename _Base::const_iterator _Base_const_iterator;
399 std::pair<_Base_const_iterator, _Base_const_iterator> __res =
400 _Base::equal_range(__x);
401 return std::make_pair(const_iterator(__res.first, this),
402 const_iterator(__res.second, this));
406 _M_base() { return *this; }
409 _M_base() const { return *this; }
415 typedef typename _Base::const_iterator _Base_const_iterator;
416 typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
417 this->_M_invalidate_if(_Not_equal(_M_base().end()));
421 template<typename _Key, typename _Tp,
422 typename _Compare, typename _Allocator>
424 operator==(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
425 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
426 { return __lhs._M_base() == __rhs._M_base(); }
428 template<typename _Key, typename _Tp,
429 typename _Compare, typename _Allocator>
431 operator!=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
432 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
433 { return __lhs._M_base() != __rhs._M_base(); }
435 template<typename _Key, typename _Tp,
436 typename _Compare, typename _Allocator>
438 operator<(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
439 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
440 { return __lhs._M_base() < __rhs._M_base(); }
442 template<typename _Key, typename _Tp,
443 typename _Compare, typename _Allocator>
445 operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
446 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
447 { return __lhs._M_base() <= __rhs._M_base(); }
449 template<typename _Key, typename _Tp,
450 typename _Compare, typename _Allocator>
452 operator>=(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
453 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
454 { return __lhs._M_base() >= __rhs._M_base(); }
456 template<typename _Key, typename _Tp,
457 typename _Compare, typename _Allocator>
459 operator>(const map<_Key, _Tp, _Compare, _Allocator>& __lhs,
460 const map<_Key, _Tp, _Compare, _Allocator>& __rhs)
461 { return __lhs._M_base() > __rhs._M_base(); }
463 template<typename _Key, typename _Tp,
464 typename _Compare, typename _Allocator>
466 swap(map<_Key, _Tp, _Compare, _Allocator>& __lhs,
467 map<_Key, _Tp, _Compare, _Allocator>& __rhs)
468 { __lhs.swap(__rhs); }
470 } // namespace __debug