30 #ifndef _GLIBCXX_DEBUG_SET_H
31 #define _GLIBCXX_DEBUG_SET_H 1
37 namespace std _GLIBCXX_VISIBILITY(default)
42 template<
typename _Key,
typename _Compare = std::less<_Key>,
43 typename _Allocator = std::allocator<_Key> >
45 :
public _GLIBCXX_STD_C::set<_Key,_Compare,_Allocator>,
48 typedef _GLIBCXX_STD_C::set<_Key, _Compare, _Allocator>
_Base;
56 typedef _Key key_type;
57 typedef _Key value_type;
58 typedef _Compare key_compare;
59 typedef _Compare value_compare;
60 typedef _Allocator allocator_type;
61 typedef typename _Base::reference reference;
62 typedef typename _Base::const_reference const_reference;
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;
77 explicit set(
const _Compare& __comp = _Compare(),
78 const _Allocator& __a = _Allocator())
79 : _Base(__comp, __a) { }
81 template<
typename _InputIterator>
82 set(_InputIterator __first, _InputIterator __last,
83 const _Compare& __comp = _Compare(),
84 const _Allocator& __a = _Allocator())
91 : _Base(__x), _Safe_base() { }
94 : _Base(__x), _Safe_base() { }
96 #ifdef __GXX_EXPERIMENTAL_CXX0X__
101 set(initializer_list<value_type> __l,
102 const _Compare& __comp = _Compare(),
103 const allocator_type& __a = allocator_type())
104 : _Base(__l, __comp, __a), _Safe_base() { }
110 operator=(
const set& __x)
112 *
static_cast<_Base*
>(
this) = __x;
113 this->_M_invalidate_all();
117 #ifdef __GXX_EXPERIMENTAL_CXX0X__
129 operator=(initializer_list<value_type> __l)
137 using _Base::get_allocator;
142 {
return iterator(_Base::begin(),
this); }
146 {
return const_iterator(_Base::begin(),
this); }
150 {
return iterator(_Base::end(),
this); }
154 {
return const_iterator(_Base::end(),
this); }
158 {
return reverse_iterator(end()); }
160 const_reverse_iterator
162 {
return const_reverse_iterator(end()); }
166 {
return reverse_iterator(begin()); }
168 const_reverse_iterator
170 {
return const_reverse_iterator(begin()); }
172 #ifdef __GXX_EXPERIMENTAL_CXX0X__
175 {
return const_iterator(_Base::begin(),
this); }
179 {
return const_iterator(_Base::end(),
this); }
181 const_reverse_iterator
183 {
return const_reverse_iterator(end()); }
185 const_reverse_iterator
187 {
return const_reverse_iterator(begin()); }
193 using _Base::max_size;
197 insert(
const value_type& __x)
204 #ifdef __GXX_EXPERIMENTAL_CXX0X__
206 insert(value_type&& __x)
217 insert(const_iterator __position,
const value_type& __x)
220 return iterator(_Base::insert(__position.
base(), __x),
this);
223 #ifdef __GXX_EXPERIMENTAL_CXX0X__
225 insert(const_iterator __position, value_type&& __x)
228 return iterator(_Base::insert(__position.
base(),
std::move(__x)),
233 template <
typename _InputIterator>
235 insert(_InputIterator __first, _InputIterator __last)
237 __glibcxx_check_valid_range(__first, __last);
242 #ifdef __GXX_EXPERIMENTAL_CXX0X__
244 insert(initializer_list<value_type> __l)
245 { _Base::insert(__l); }
248 #ifdef __GXX_EXPERIMENTAL_CXX0X__
250 erase(const_iterator __position)
254 return iterator(_Base::erase(__position.
base()),
this);
258 erase(iterator __position)
262 _Base::erase(__position.
base());
267 erase(
const key_type& __x)
269 _Base_iterator __victim = _Base::find(__x);
270 if (__victim == _Base::end())
275 _Base::erase(__victim);
280 #ifdef __GXX_EXPERIMENTAL_CXX0X__
282 erase(const_iterator __first, const_iterator __last)
287 for (_Base_const_iterator __victim = __first.
base();
288 __victim != __last.
base(); ++__victim)
291 _M_message(__gnu_debug::__msg_valid_range)
292 ._M_iterator(__first,
"first")
293 ._M_iterator(__last,
"last"));
296 return iterator(_Base::erase(__first.
base(), __last.
base()),
this);
300 erase(iterator __first, iterator __last)
305 for (_Base_iterator __victim = __first.
base();
306 __victim != __last.
base(); ++__victim)
309 _M_message(__gnu_debug::__msg_valid_range)
310 ._M_iterator(__first,
"first")
311 ._M_iterator(__last,
"last"));
314 _Base::erase(__first.
base(), __last.
base());
328 this->_M_invalidate_all();
333 using _Base::key_comp;
334 using _Base::value_comp;
338 find(
const key_type& __x)
339 {
return iterator(_Base::find(__x),
this); }
344 find(
const key_type& __x)
const
345 {
return const_iterator(_Base::find(__x),
this); }
350 lower_bound(
const key_type& __x)
351 {
return iterator(_Base::lower_bound(__x),
this); }
356 lower_bound(
const key_type& __x)
const
357 {
return const_iterator(_Base::lower_bound(__x),
this); }
360 upper_bound(
const key_type& __x)
361 {
return iterator(_Base::upper_bound(__x),
this); }
366 upper_bound(
const key_type& __x)
const
367 {
return const_iterator(_Base::upper_bound(__x),
this); }
370 equal_range(
const key_type& __x)
373 _Base::equal_range(__x);
375 iterator(__res.
second,
this));
381 equal_range(
const key_type& __x)
const
384 _Base::equal_range(__x);
386 const_iterator(__res.
second,
this));
390 _M_base() {
return *
this; }
393 _M_base()
const {
return *
this; }
404 template<
typename _Key,
typename _Compare,
typename _Allocator>
408 {
return __lhs._M_base() == __rhs._M_base(); }
410 template<
typename _Key,
typename _Compare,
typename _Allocator>
414 {
return __lhs._M_base() != __rhs._M_base(); }
416 template<
typename _Key,
typename _Compare,
typename _Allocator>
418 operator<(const set<_Key, _Compare, _Allocator>& __lhs,
419 const set<_Key, _Compare, _Allocator>& __rhs)
420 {
return __lhs._M_base() < __rhs._M_base(); }
422 template<
typename _Key,
typename _Compare,
typename _Allocator>
424 operator<=(const set<_Key, _Compare, _Allocator>& __lhs,
425 const set<_Key, _Compare, _Allocator>& __rhs)
426 {
return __lhs._M_base() <= __rhs._M_base(); }
428 template<
typename _Key,
typename _Compare,
typename _Allocator>
430 operator>=(
const set<_Key, _Compare, _Allocator>& __lhs,
431 const set<_Key, _Compare, _Allocator>& __rhs)
432 {
return __lhs._M_base() >= __rhs._M_base(); }
434 template<
typename _Key,
typename _Compare,
typename _Allocator>
436 operator>(
const set<_Key, _Compare, _Allocator>& __lhs,
437 const set<_Key, _Compare, _Allocator>& __rhs)
438 {
return __lhs._M_base() > __rhs._M_base(); }
440 template<
typename _Key,
typename _Compare,
typename _Allocator>
442 swap(set<_Key, _Compare, _Allocator>& __x,
443 set<_Key, _Compare, _Allocator>& __y)
444 {
return __x.swap(__y); }
_Iterator base() const
Return the underlying iterator.
Class std::set with safety/checking/debug instrumentation.
#define _GLIBCXX_DEBUG_VERIFY(_Condition, _ErrorMessage)
#define __glibcxx_check_erase(_Position)
void _M_invalidate_if(_Predicate __pred)
Base class for constructing a safe sequence type that tracks iterators that reference it...
#define __glibcxx_check_erase_range(_First, _Last)
bool operator>(const basic_string< _CharT, _Traits, _Alloc > &__lhs, const basic_string< _CharT, _Traits, _Alloc > &__rhs)
Test if string follows string.
pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)
A convenience wrapper for creating a pair from two objects.
_T2 second
first is a copy of the first object
A standard container made up of unique keys, which can be retrieved in logarithmic time...
ISO C++ entities toplevel namespace is std.
std::remove_reference< _Tp >::type && move(_Tp &&__t)
Move a value.
_Siter_base< _Iterator >::iterator_type __base(_Iterator __it)
bool operator>=(const basic_string< _CharT, _Traits, _Alloc > &__lhs, const basic_string< _CharT, _Traits, _Alloc > &__rhs)
Test if string doesn't precede string.
void _M_swap(_Safe_sequence_base &__x)
Struct holding two objects of arbitrary type.
_T1 first
second_type is the second bound type
#define __glibcxx_check_insert(_Position)