1 // Debugging set 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_SET_H
32 #define _GLIBCXX_DEBUG_SET_H 1
34 #include <debug/safe_sequence.h>
35 #include <debug/safe_iterator.h>
38 namespace __gnu_debug_def
40 template<typename _Key
, typename _Compare
= std::less
<_Key
>,
41 typename _Allocator
= std::allocator
<_Key
> >
43 : public _GLIBCXX_STD::set
<_Key
,_Compare
,_Allocator
>,
44 public __gnu_debug::_Safe_sequence
<set
<_Key
, _Compare
, _Allocator
> >
46 typedef _GLIBCXX_STD::set
<_Key
,_Compare
,_Allocator
> _Base
;
47 typedef __gnu_debug::_Safe_sequence
<set
> _Safe_base
;
51 typedef _Key key_type
;
52 typedef _Key value_type
;
53 typedef _Compare key_compare
;
54 typedef _Compare value_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
, set
>
61 typedef __gnu_debug::_Safe_iterator
<typename
_Base::const_iterator
, set
>
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 // 23.3.3.1 construct/copy/destroy:
72 explicit set(const _Compare
& __comp
= _Compare(),
73 const _Allocator
& __a
= _Allocator())
74 : _Base(__comp
, __a
) { }
76 template<typename _InputIterator
>
77 set(_InputIterator __first
, _InputIterator __last
,
78 const _Compare
& __comp
= _Compare(),
79 const _Allocator
& __a
= _Allocator())
80 : _Base(__gnu_debug::__check_valid_range(__first
, __last
), __last
,
83 set(const set
<_Key
,_Compare
,_Allocator
>& __x
)
84 : _Base(__x
), _Safe_base() { }
86 set(const _Base
& __x
) : _Base(__x
), _Safe_base() { }
90 set
<_Key
,_Compare
,_Allocator
>&
91 operator=(const set
<_Key
,_Compare
,_Allocator
>& __x
)
93 *static_cast<_Base
*>(this) = __x
;
94 this->_M_invalidate_all();
98 using _Base::get_allocator
;
103 { return iterator(_Base::begin(), this); }
107 { return const_iterator(_Base::begin(), this); }
111 { return iterator(_Base::end(), this); }
115 { return const_iterator(_Base::end(), this); }
119 { return reverse_iterator(end()); }
121 const_reverse_iterator
123 { return const_reverse_iterator(end()); }
127 { return reverse_iterator(begin()); }
129 const_reverse_iterator
131 { return const_reverse_iterator(begin()); }
136 using _Base::max_size
;
139 std::pair
<iterator
, bool>
140 insert(const value_type
& __x
)
142 typedef typename
_Base::iterator _Base_iterator
;
143 std::pair
<_Base_iterator
, bool> __res
= _Base::insert(__x
);
144 return std::pair
<iterator
, bool>(iterator(__res
.first
, this),
149 insert(iterator __position
, const value_type
& __x
)
151 __glibcxx_check_insert(__position
);
152 return iterator(_Base::insert(__position
.base(), __x
), this);
155 template <typename _InputIterator
>
157 insert(_InputIterator __first
, _InputIterator __last
)
159 __glibcxx_check_valid_range(__first
, __last
);
160 _Base::insert(__first
, __last
);
164 erase(iterator __position
)
166 __glibcxx_check_erase(__position
);
167 __position
._M_invalidate();
168 _Base::erase(__position
.base());
172 erase(const key_type
& __x
)
174 iterator __victim
= find(__x
);
175 if (__victim
== end())
179 __victim
._M_invalidate();
180 _Base::erase(__victim
.base());
186 erase(iterator __first
, iterator __last
)
188 // _GLIBCXX_RESOLVE_LIB_DEFECTS
189 // 151. can't currently clear() empty container
190 __glibcxx_check_erase_range(__first
, __last
);
192 while (__first
!= __last
)
193 this->erase(__first
++);
197 swap(set
<_Key
,_Compare
,_Allocator
>& __x
)
205 { this->erase(begin(), end()); }
208 using _Base::key_comp
;
209 using _Base::value_comp
;
213 find(const key_type
& __x
)
214 { return iterator(_Base::find(__x
), this); }
216 // _GLIBCXX_RESOLVE_LIB_DEFECTS
217 // 214. set::find() missing const overload
219 find(const key_type
& __x
) const
220 { return const_iterator(_Base::find(__x
), this); }
225 lower_bound(const key_type
& __x
)
226 { return iterator(_Base::lower_bound(__x
), this); }
228 // _GLIBCXX_RESOLVE_LIB_DEFECTS
229 // 214. set::find() missing const overload
231 lower_bound(const key_type
& __x
) const
232 { return const_iterator(_Base::lower_bound(__x
), this); }
235 upper_bound(const key_type
& __x
)
236 { return iterator(_Base::upper_bound(__x
), this); }
238 // _GLIBCXX_RESOLVE_LIB_DEFECTS
239 // 214. set::find() missing const overload
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 // _GLIBCXX_RESOLVE_LIB_DEFECTS
255 // 214. set::find() missing const overload
256 std::pair
<const_iterator
,const_iterator
>
257 equal_range(const key_type
& __x
) const
259 typedef typename
_Base::const_iterator _Base_iterator
;
260 std::pair
<_Base_iterator
, _Base_iterator
> __res
=
261 _Base::equal_range(__x
);
262 return std::make_pair(const_iterator(__res
.first
, this),
263 const_iterator(__res
.second
, this));
267 _M_base() { return *this; }
270 _M_base() const { return *this; }
276 typedef typename
_Base::const_iterator _Base_const_iterator
;
277 typedef __gnu_debug::_Not_equal_to
<_Base_const_iterator
> _Not_equal
;
278 this->_M_invalidate_if(_Not_equal(_M_base().end()));
282 template<typename _Key
, typename _Compare
, typename _Allocator
>
284 operator==(const set
<_Key
,_Compare
,_Allocator
>& __lhs
,
285 const set
<_Key
,_Compare
,_Allocator
>& __rhs
)
286 { return __lhs
._M_base() == __rhs
._M_base(); }
288 template<typename _Key
, typename _Compare
, typename _Allocator
>
290 operator!=(const set
<_Key
,_Compare
,_Allocator
>& __lhs
,
291 const set
<_Key
,_Compare
,_Allocator
>& __rhs
)
292 { return __lhs
._M_base() != __rhs
._M_base(); }
294 template<typename _Key
, typename _Compare
, typename _Allocator
>
296 operator<(const set
<_Key
,_Compare
,_Allocator
>& __lhs
,
297 const set
<_Key
,_Compare
,_Allocator
>& __rhs
)
298 { return __lhs
._M_base() < __rhs
._M_base(); }
300 template<typename _Key
, typename _Compare
, typename _Allocator
>
302 operator<=(const set
<_Key
,_Compare
,_Allocator
>& __lhs
,
303 const set
<_Key
,_Compare
,_Allocator
>& __rhs
)
304 { return __lhs
._M_base() <= __rhs
._M_base(); }
306 template<typename _Key
, typename _Compare
, typename _Allocator
>
308 operator>=(const set
<_Key
,_Compare
,_Allocator
>& __lhs
,
309 const set
<_Key
,_Compare
,_Allocator
>& __rhs
)
310 { return __lhs
._M_base() >= __rhs
._M_base(); }
312 template<typename _Key
, typename _Compare
, typename _Allocator
>
314 operator>(const set
<_Key
,_Compare
,_Allocator
>& __lhs
,
315 const set
<_Key
,_Compare
,_Allocator
>& __rhs
)
316 { return __lhs
._M_base() > __rhs
._M_base(); }
318 template<typename _Key
, typename _Compare
, typename _Allocator
>
320 swap(set
<_Key
,_Compare
,_Allocator
>& __x
,
321 set
<_Key
,_Compare
,_Allocator
>& __y
)
322 { return __x
.swap(__y
); }
323 } // namespace __gnu_debug_def