1 // Debugging map implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004, 2005, 2006, 2007, 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/>.
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 template<typename _Key
, typename _Tp
, typename _Compare
= std::less
<_Key
>,
42 typename _Allocator
= std::allocator
<std::pair
<const _Key
, _Tp
> > >
44 : public _GLIBCXX_STD_D::map
<_Key
, _Tp
, _Compare
, _Allocator
>,
45 public __gnu_debug::_Safe_sequence
<map
<_Key
, _Tp
, _Compare
, _Allocator
> >
47 typedef _GLIBCXX_STD_D::map
<_Key
, _Tp
, _Compare
, _Allocator
> _Base
;
48 typedef __gnu_debug::_Safe_sequence
<map
> _Safe_base
;
52 typedef _Key key_type
;
53 typedef _Tp mapped_type
;
54 typedef std::pair
<const _Key
, _Tp
> value_type
;
55 typedef _Compare key_compare
;
56 typedef _Allocator allocator_type
;
57 typedef typename
_Base::reference reference
;
58 typedef typename
_Base::const_reference const_reference
;
60 typedef __gnu_debug::_Safe_iterator
<typename
_Base::iterator
, map
>
62 typedef __gnu_debug::_Safe_iterator
<typename
_Base::const_iterator
, map
>
65 typedef typename
_Base::size_type size_type
;
66 typedef typename
_Base::difference_type difference_type
;
67 typedef typename
_Base::pointer pointer
;
68 typedef typename
_Base::const_pointer const_pointer
;
69 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
70 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
72 using _Base::value_compare
;
74 // 23.3.1.1 construct/copy/destroy:
75 explicit map(const _Compare
& __comp
= _Compare(),
76 const _Allocator
& __a
= _Allocator())
77 : _Base(__comp
, __a
) { }
79 template<typename _InputIterator
>
80 map(_InputIterator __first
, _InputIterator __last
,
81 const _Compare
& __comp
= _Compare(),
82 const _Allocator
& __a
= _Allocator())
83 : _Base(__gnu_debug::__check_valid_range(__first
, __last
), __last
,
84 __comp
, __a
), _Safe_base() { }
87 : _Base(__x
), _Safe_base() { }
90 : _Base(__x
), _Safe_base() { }
92 #ifdef __GXX_EXPERIMENTAL_CXX0X__
94 : _Base(std::forward
<map
>(__x
)), _Safe_base()
95 { this->_M_swap(__x
); }
97 map(initializer_list
<value_type
> __l
,
98 const _Compare
& __c
= _Compare(),
99 const allocator_type
& __a
= allocator_type())
100 : _Base(__l
, __c
, __a
), _Safe_base() { }
106 operator=(const map
& __x
)
108 *static_cast<_Base
*>(this) = __x
;
109 this->_M_invalidate_all();
113 #ifdef __GXX_EXPERIMENTAL_CXX0X__
124 operator=(initializer_list
<value_type
> __l
)
132 // _GLIBCXX_RESOLVE_LIB_DEFECTS
133 // 133. map missing get_allocator()
134 using _Base::get_allocator
;
139 { return iterator(_Base::begin(), this); }
143 { return const_iterator(_Base::begin(), this); }
147 { return iterator(_Base::end(), this); }
151 { return const_iterator(_Base::end(), this); }
155 { return reverse_iterator(end()); }
157 const_reverse_iterator
159 { return const_reverse_iterator(end()); }
163 { return reverse_iterator(begin()); }
165 const_reverse_iterator
167 { return const_reverse_iterator(begin()); }
169 #ifdef __GXX_EXPERIMENTAL_CXX0X__
172 { return const_iterator(_Base::begin(), this); }
176 { return const_iterator(_Base::end(), this); }
178 const_reverse_iterator
180 { return const_reverse_iterator(end()); }
182 const_reverse_iterator
184 { return const_reverse_iterator(begin()); }
190 using _Base::max_size
;
192 // 23.3.1.2 element access:
193 using _Base::operator[];
195 // _GLIBCXX_RESOLVE_LIB_DEFECTS
196 // DR 464. Suggestion for new member functions in standard containers.
200 std::pair
<iterator
, bool>
201 insert(const value_type
& __x
)
203 typedef typename
_Base::iterator _Base_iterator
;
204 std::pair
<_Base_iterator
, bool> __res
= _Base::insert(__x
);
205 return std::pair
<iterator
, bool>(iterator(__res
.first
, this),
209 #ifdef __GXX_EXPERIMENTAL_CXX0X__
211 insert(std::initializer_list
<value_type
> __list
)
212 { _Base::insert(__list
); }
216 insert(iterator __position
, const value_type
& __x
)
218 __glibcxx_check_insert(__position
);
219 return iterator(_Base::insert(__position
.base(), __x
), this);
222 template<typename _InputIterator
>
224 insert(_InputIterator __first
, _InputIterator __last
)
226 __glibcxx_check_valid_range(__first
, __last
);
227 _Base::insert(__first
, __last
);
231 erase(iterator __position
)
233 __glibcxx_check_erase(__position
);
234 __position
._M_invalidate();
235 _Base::erase(__position
.base());
239 erase(const key_type
& __x
)
241 iterator __victim
= find(__x
);
242 if (__victim
== end())
246 __victim
._M_invalidate();
247 _Base::erase(__victim
.base());
253 erase(iterator __first
, iterator __last
)
255 // _GLIBCXX_RESOLVE_LIB_DEFECTS
256 // 151. can't currently clear() empty container
257 __glibcxx_check_erase_range(__first
, __last
);
258 while (__first
!= __last
)
259 this->erase(__first
++);
263 #ifdef __GXX_EXPERIMENTAL_CXX0X__
275 { this->erase(begin(), end()); }
278 using _Base::key_comp
;
279 using _Base::value_comp
;
281 // 23.3.1.3 map operations:
283 find(const key_type
& __x
)
284 { return iterator(_Base::find(__x
), this); }
287 find(const key_type
& __x
) const
288 { return const_iterator(_Base::find(__x
), this); }
293 lower_bound(const key_type
& __x
)
294 { return iterator(_Base::lower_bound(__x
), this); }
297 lower_bound(const key_type
& __x
) const
298 { return const_iterator(_Base::lower_bound(__x
), this); }
301 upper_bound(const key_type
& __x
)
302 { return iterator(_Base::upper_bound(__x
), this); }
305 upper_bound(const key_type
& __x
) const
306 { return const_iterator(_Base::upper_bound(__x
), this); }
308 std::pair
<iterator
,iterator
>
309 equal_range(const key_type
& __x
)
311 typedef typename
_Base::iterator _Base_iterator
;
312 std::pair
<_Base_iterator
, _Base_iterator
> __res
=
313 _Base::equal_range(__x
);
314 return std::make_pair(iterator(__res
.first
, this),
315 iterator(__res
.second
, this));
318 std::pair
<const_iterator
,const_iterator
>
319 equal_range(const key_type
& __x
) const
321 typedef typename
_Base::const_iterator _Base_const_iterator
;
322 std::pair
<_Base_const_iterator
, _Base_const_iterator
> __res
=
323 _Base::equal_range(__x
);
324 return std::make_pair(const_iterator(__res
.first
, this),
325 const_iterator(__res
.second
, this));
329 _M_base() { return *this; }
332 _M_base() const { return *this; }
338 typedef typename
_Base::const_iterator _Base_const_iterator
;
339 typedef __gnu_debug::_Not_equal_to
<_Base_const_iterator
> _Not_equal
;
340 this->_M_invalidate_if(_Not_equal(_M_base().end()));
344 template<typename _Key
, typename _Tp
,
345 typename _Compare
, typename _Allocator
>
347 operator==(const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
348 const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
349 { return __lhs
._M_base() == __rhs
._M_base(); }
351 template<typename _Key
, typename _Tp
,
352 typename _Compare
, typename _Allocator
>
354 operator!=(const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
355 const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
356 { return __lhs
._M_base() != __rhs
._M_base(); }
358 template<typename _Key
, typename _Tp
,
359 typename _Compare
, typename _Allocator
>
361 operator<(const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
362 const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
363 { return __lhs
._M_base() < __rhs
._M_base(); }
365 template<typename _Key
, typename _Tp
,
366 typename _Compare
, typename _Allocator
>
368 operator<=(const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
369 const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
370 { return __lhs
._M_base() <= __rhs
._M_base(); }
372 template<typename _Key
, typename _Tp
,
373 typename _Compare
, typename _Allocator
>
375 operator>=(const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
376 const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
377 { return __lhs
._M_base() >= __rhs
._M_base(); }
379 template<typename _Key
, typename _Tp
,
380 typename _Compare
, typename _Allocator
>
382 operator>(const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
383 const map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
384 { return __lhs
._M_base() > __rhs
._M_base(); }
386 template<typename _Key
, typename _Tp
,
387 typename _Compare
, typename _Allocator
>
389 swap(map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
390 map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
391 { __lhs
.swap(__rhs
); }
393 #ifdef __GXX_EXPERIMENTAL_CXX0X__
394 template<typename _Key
, typename _Tp
,
395 typename _Compare
, typename _Allocator
>
397 swap(map
<_Key
, _Tp
, _Compare
, _Allocator
>&& __lhs
,
398 map
<_Key
, _Tp
, _Compare
, _Allocator
>& __rhs
)
399 { __lhs
.swap(__rhs
); }
401 template<typename _Key
, typename _Tp
,
402 typename _Compare
, typename _Allocator
>
404 swap(map
<_Key
, _Tp
, _Compare
, _Allocator
>& __lhs
,
405 map
<_Key
, _Tp
, _Compare
, _Allocator
>&& __rhs
)
406 { __lhs
.swap(__rhs
); }
409 } // namespace __debug