1 // Debugging map implementation -*- C++ -*-
3 // Copyright (C) 2003, 2004
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 2, 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 // You should have received a copy of the GNU General Public License along
18 // with this library; see the file COPYING. If not, write to the Free
19 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
22 // As a special exception, you may use this file as part of a free software
23 // library without restriction. Specifically, if other files instantiate
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
26 // file does not by itself cause the resulting executable to be covered by
27 // the GNU General Public License. This exception does not however
28 // invalidate any other reasons why the executable file might be covered by
29 // the GNU General Public License.
31 #ifndef _GLIBCXX_DEBUG_MAP_H
32 #define _GLIBCXX_DEBUG_MAP_H 1
34 #include <debug/safe_sequence.h>
35 #include <debug/safe_iterator.h>
38 namespace __gnu_debug_def
40 template<typename _Key
, typename _Tp
, typename _Compare
= std::less
<_Key
>,
41 typename _Allocator
= std::allocator
<std::pair
<const _Key
, _Tp
> > >
43 : public _GLIBCXX_STD::map
<_Key
, _Tp
, _Compare
, _Allocator
>,
44 public __gnu_debug::_Safe_sequence
<map
<_Key
, _Tp
, _Compare
, _Allocator
> >
46 typedef _GLIBCXX_STD::map
<_Key
, _Tp
, _Compare
, _Allocator
> _Base
;
47 typedef __gnu_debug::_Safe_sequence
<map
> _Safe_base
;
51 typedef _Key key_type
;
52 typedef _Tp mapped_type
;
53 typedef std::pair
<const _Key
, _Tp
> value_type
;
54 typedef _Compare key_compare
;
55 typedef _Allocator allocator_type
;
56 typedef typename
_Allocator::reference reference
;
57 typedef typename
_Allocator::const_reference const_reference
;
59 typedef __gnu_debug::_Safe_iterator
<typename
_Base::iterator
, map
>
61 typedef __gnu_debug::_Safe_iterator
<typename
_Base::const_iterator
, map
>
64 typedef typename
_Base::size_type size_type
;
65 typedef typename
_Base::difference_type difference_type
;
66 typedef typename
_Allocator::pointer pointer
;
67 typedef typename
_Allocator::const_pointer const_pointer
;
68 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
69 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
71 using _Base::value_compare
;
73 // 23.3.1.1 construct/copy/destroy:
74 explicit map(const _Compare
& __comp
= _Compare(),
75 const _Allocator
& __a
= _Allocator())
76 : _Base(__comp
, __a
) { }
78 template<typename _InputIterator
>
79 map(_InputIterator __first
, _InputIterator __last
,
80 const _Compare
& __comp
= _Compare(),
81 const _Allocator
& __a
= _Allocator())
82 : _Base(__gnu_debug::__check_valid_range(__first
, __last
), __last
,
83 __comp
, __a
), _Safe_base() { }
85 map(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __x
)
86 : _Base(__x
), _Safe_base() { }
88 map(const _Base
& __x
) : _Base(__x
), _Safe_base() { }
92 map
<_Key
,_Tp
,_Compare
,_Allocator
>&
93 operator=(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __x
)
95 *static_cast<_Base
*>(this) = __x
;
96 this->_M_invalidate_all();
100 // _GLIBCXX_RESOLVE_LIB_DEFECTS
101 // 133. map missing get_allocator()
102 using _Base::get_allocator
;
107 { return iterator(_Base::begin(), this); }
111 { return const_iterator(_Base::begin(), this); }
115 { return iterator(_Base::end(), this); }
119 { return const_iterator(_Base::end(), this); }
123 { return reverse_iterator(end()); }
125 const_reverse_iterator
127 { return const_reverse_iterator(end()); }
131 { return reverse_iterator(begin()); }
133 const_reverse_iterator
135 { return const_reverse_iterator(begin()); }
140 using _Base::max_size
;
142 // 23.3.1.2 element access:
143 using _Base::operator[];
146 std::pair
<iterator
, bool>
147 insert(const value_type
& __x
)
149 typedef typename
_Base::iterator _Base_iterator
;
150 std::pair
<_Base_iterator
, bool> __res
= _Base::insert(__x
);
151 return std::pair
<iterator
, bool>(iterator(__res
.first
, this),
156 insert(iterator __position
, const value_type
& __x
)
158 __glibcxx_check_insert(__position
);
159 return iterator(_Base::insert(__position
.base(), __x
), this);
162 template<typename _InputIterator
>
164 insert(_InputIterator __first
, _InputIterator __last
)
166 __glibcxx_check_valid_range(__first
, __last
);
167 _Base::insert(__first
, __last
);
171 erase(iterator __position
)
173 __glibcxx_check_erase(__position
);
174 __position
._M_invalidate();
175 _Base::erase(__position
.base());
179 erase(const key_type
& __x
)
181 iterator __victim
= find(__x
);
182 if (__victim
== end())
186 __victim
._M_invalidate();
187 _Base::erase(__victim
.base());
193 erase(iterator __first
, iterator __last
)
195 // _GLIBCXX_RESOLVE_LIB_DEFECTS
196 // 151. can't currently clear() empty container
197 __glibcxx_check_erase_range(__first
, __last
);
198 while (__first
!= __last
)
199 this->erase(__first
++);
203 swap(map
<_Key
,_Tp
,_Compare
,_Allocator
>& __x
)
211 { this->erase(begin(), end()); }
214 using _Base::key_comp
;
215 using _Base::value_comp
;
217 // 23.3.1.3 map operations:
219 find(const key_type
& __x
)
220 { return iterator(_Base::find(__x
), this); }
223 find(const key_type
& __x
) const
224 { return const_iterator(_Base::find(__x
), this); }
229 lower_bound(const key_type
& __x
)
230 { return iterator(_Base::lower_bound(__x
), this); }
233 lower_bound(const key_type
& __x
) const
234 { return const_iterator(_Base::lower_bound(__x
), this); }
237 upper_bound(const key_type
& __x
)
238 { return iterator(_Base::upper_bound(__x
), this); }
241 upper_bound(const key_type
& __x
) const
242 { return const_iterator(_Base::upper_bound(__x
), this); }
244 std::pair
<iterator
,iterator
>
245 equal_range(const key_type
& __x
)
247 typedef typename
_Base::iterator _Base_iterator
;
248 std::pair
<_Base_iterator
, _Base_iterator
> __res
=
249 _Base::equal_range(__x
);
250 return std::make_pair(iterator(__res
.first
, this),
251 iterator(__res
.second
, this));
254 std::pair
<const_iterator
,const_iterator
>
255 equal_range(const key_type
& __x
) const
257 typedef typename
_Base::const_iterator _Base_const_iterator
;
258 std::pair
<_Base_const_iterator
, _Base_const_iterator
> __res
=
259 _Base::equal_range(__x
);
260 return std::make_pair(const_iterator(__res
.first
, this),
261 const_iterator(__res
.second
, this));
265 _M_base() { return *this; }
268 _M_base() const { return *this; }
274 typedef typename
_Base::const_iterator _Base_const_iterator
;
275 typedef __gnu_debug::_Not_equal_to
<_Base_const_iterator
> _Not_equal
;
276 this->_M_invalidate_if(_Not_equal(_M_base().end()));
280 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
282 operator==(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
283 const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
284 { return __lhs
._M_base() == __rhs
._M_base(); }
286 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
288 operator!=(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
289 const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
290 { return __lhs
._M_base() != __rhs
._M_base(); }
292 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
294 operator<(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
295 const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
296 { return __lhs
._M_base() < __rhs
._M_base(); }
298 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
300 operator<=(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
301 const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
302 { return __lhs
._M_base() <= __rhs
._M_base(); }
304 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
306 operator>=(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
307 const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
308 { return __lhs
._M_base() >= __rhs
._M_base(); }
310 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
312 operator>(const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
313 const map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
314 { return __lhs
._M_base() > __rhs
._M_base(); }
316 template<typename _Key
,typename _Tp
,typename _Compare
,typename _Allocator
>
318 swap(map
<_Key
,_Tp
,_Compare
,_Allocator
>& __lhs
,
319 map
<_Key
,_Tp
,_Compare
,_Allocator
>& __rhs
)
320 { __lhs
.swap(__rhs
); }
321 } // namespace __gnu_debug_def