29 #ifndef _GLIBCXX_DEBUG_SET_H
30 #define _GLIBCXX_DEBUG_SET_H 1
36 namespace std _GLIBCXX_VISIBILITY(default)
41 template<
typename _Key,
typename _Compare = std::less<_Key>,
42 typename _Allocator = std::allocator<_Key> >
44 :
public _GLIBCXX_STD_C::set<_Key,_Compare,_Allocator>,
47 typedef _GLIBCXX_STD_C::set<_Key, _Compare, _Allocator>
_Base;
54 typedef _Key key_type;
55 typedef _Key value_type;
56 typedef _Compare key_compare;
57 typedef _Compare value_compare;
58 typedef _Allocator allocator_type;
59 typedef typename _Base::reference reference;
60 typedef typename _Base::const_reference const_reference;
67 typedef typename _Base::size_type size_type;
68 typedef typename _Base::difference_type difference_type;
69 typedef typename _Base::pointer pointer;
70 typedef typename _Base::const_pointer const_pointer;
75 explicit set(
const _Compare& __comp = _Compare(),
76 const _Allocator& __a = _Allocator())
77 : _Base(__comp, __a) { }
79 template<
typename _InputIterator>
80 set(_InputIterator __first, _InputIterator __last,
81 const _Compare& __comp = _Compare(),
82 const _Allocator& __a = _Allocator())
94 #if __cplusplus >= 201103L
96 noexcept(is_nothrow_copy_constructible<_Compare>::value)
100 set(initializer_list<value_type> __l,
101 const _Compare& __comp = _Compare(),
102 const allocator_type& __a = allocator_type())
103 : _Base(__l, __comp, __a) { }
106 ~
set() _GLIBCXX_NOEXCEPT { }
109 operator=(
const set& __x)
111 *
static_cast<_Base*
>(
this) = __x;
112 this->_M_invalidate_all();
116 #if __cplusplus >= 201103L
122 __glibcxx_check_self_move_assign(__x);
129 operator=(initializer_list<value_type> __l)
137 using _Base::get_allocator;
141 begin() _GLIBCXX_NOEXCEPT
142 {
return iterator(_Base::begin(),
this); }
145 begin()
const _GLIBCXX_NOEXCEPT
146 {
return const_iterator(_Base::begin(),
this); }
149 end() _GLIBCXX_NOEXCEPT
150 {
return iterator(_Base::end(),
this); }
153 end()
const _GLIBCXX_NOEXCEPT
154 {
return const_iterator(_Base::end(),
this); }
157 rbegin() _GLIBCXX_NOEXCEPT
158 {
return reverse_iterator(end()); }
160 const_reverse_iterator
161 rbegin()
const _GLIBCXX_NOEXCEPT
162 {
return const_reverse_iterator(end()); }
165 rend() _GLIBCXX_NOEXCEPT
166 {
return reverse_iterator(begin()); }
168 const_reverse_iterator
169 rend()
const _GLIBCXX_NOEXCEPT
170 {
return const_reverse_iterator(begin()); }
172 #if __cplusplus >= 201103L
174 cbegin()
const noexcept
175 {
return const_iterator(_Base::begin(),
this); }
178 cend()
const noexcept
179 {
return const_iterator(_Base::end(),
this); }
181 const_reverse_iterator
182 crbegin()
const noexcept
183 {
return const_reverse_iterator(end()); }
185 const_reverse_iterator
186 crend()
const noexcept
187 {
return const_reverse_iterator(begin()); }
193 using _Base::max_size;
196 #if __cplusplus >= 201103L
197 template<
typename... _Args>
199 emplace(_Args&&... __args)
201 auto __res = _Base::emplace(std::forward<_Args>(__args)...);
206 template<
typename... _Args>
208 emplace_hint(const_iterator __pos, _Args&&... __args)
211 return iterator(_Base::emplace_hint(__pos.
base(),
212 std::forward<_Args>(__args)...),
218 insert(
const value_type& __x)
225 #if __cplusplus >= 201103L
227 insert(value_type&& __x)
237 insert(const_iterator __position,
const value_type& __x)
240 return iterator(_Base::insert(__position.
base(), __x),
this);
243 #if __cplusplus >= 201103L
245 insert(const_iterator __position, value_type&& __x)
248 return iterator(_Base::insert(__position.
base(),
std::move(__x)),
253 template <
typename _InputIterator>
255 insert(_InputIterator __first, _InputIterator __last)
257 __glibcxx_check_valid_range(__first, __last);
262 #if __cplusplus >= 201103L
264 insert(initializer_list<value_type> __l)
265 { _Base::insert(__l); }
268 #if __cplusplus >= 201103L
270 erase(const_iterator __position)
274 return iterator(_Base::erase(__position.
base()),
this);
278 erase(iterator __position)
282 _Base::erase(__position.
base());
287 erase(
const key_type& __x)
289 _Base_iterator __victim = _Base::find(__x);
290 if (__victim == _Base::end())
295 _Base::erase(__victim);
300 #if __cplusplus >= 201103L
302 erase(const_iterator __first, const_iterator __last)
307 for (_Base_const_iterator __victim = __first.
base();
308 __victim != __last.
base(); ++__victim)
310 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
311 _M_message(__gnu_debug::__msg_valid_range)
312 ._M_iterator(__first,
"first")
313 ._M_iterator(__last,
"last"));
316 return iterator(_Base::erase(__first.
base(), __last.
base()),
this);
320 erase(iterator __first, iterator __last)
325 for (_Base_iterator __victim = __first.
base();
326 __victim != __last.
base(); ++__victim)
328 _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
329 _M_message(__gnu_debug::__msg_valid_range)
330 ._M_iterator(__first,
"first")
331 ._M_iterator(__last,
"last"));
334 _Base::erase(__first.
base(), __last.
base());
346 clear() _GLIBCXX_NOEXCEPT
348 this->_M_invalidate_all();
353 using _Base::key_comp;
354 using _Base::value_comp;
358 find(
const key_type& __x)
359 {
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); }
376 lower_bound(
const key_type& __x)
const
377 {
return const_iterator(_Base::lower_bound(__x),
this); }
380 upper_bound(
const key_type& __x)
381 {
return iterator(_Base::upper_bound(__x),
this); }
386 upper_bound(
const key_type& __x)
const
387 {
return const_iterator(_Base::upper_bound(__x),
this); }
390 equal_range(
const key_type& __x)
393 _Base::equal_range(__x);
395 iterator(__res.
second,
this));
401 equal_range(
const key_type& __x)
const
404 _Base::equal_range(__x);
406 const_iterator(__res.
second,
this));
410 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
413 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
424 template<
typename _Key,
typename _Compare,
typename _Allocator>
428 {
return __lhs._M_base() == __rhs._M_base(); }
430 template<
typename _Key,
typename _Compare,
typename _Allocator>
434 {
return __lhs._M_base() != __rhs._M_base(); }
436 template<
typename _Key,
typename _Compare,
typename _Allocator>
438 operator<(const set<_Key, _Compare, _Allocator>& __lhs,
439 const set<_Key, _Compare, _Allocator>& __rhs)
440 {
return __lhs._M_base() < __rhs._M_base(); }
442 template<
typename _Key,
typename _Compare,
typename _Allocator>
444 operator<=(const set<_Key, _Compare, _Allocator>& __lhs,
445 const set<_Key, _Compare, _Allocator>& __rhs)
446 {
return __lhs._M_base() <= __rhs._M_base(); }
448 template<
typename _Key,
typename _Compare,
typename _Allocator>
450 operator>=(
const set<_Key, _Compare, _Allocator>& __lhs,
451 const set<_Key, _Compare, _Allocator>& __rhs)
452 {
return __lhs._M_base() >= __rhs._M_base(); }
454 template<
typename _Key,
typename _Compare,
typename _Allocator>
456 operator>(
const set<_Key, _Compare, _Allocator>& __lhs,
457 const set<_Key, _Compare, _Allocator>& __rhs)
458 {
return __lhs._M_base() > __rhs._M_base(); }
460 template<
typename _Key,
typename _Compare,
typename _Allocator>
462 swap(set<_Key, _Compare, _Allocator>& __x,
463 set<_Key, _Compare, _Allocator>& __y)
464 {
return __x.swap(__y); }
_Siter_base< _Iterator >::iterator_type __base(_Iterator __it)
#define __glibcxx_check_insert(_Position)
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
Base class for constructing a safe sequence type that tracks iterators that reference 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_invalidate_if(_Predicate __pred)
constexpr 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.
ISO C++ entities toplevel namespace is std.
void _M_swap(_Safe_sequence_base &__x)
_T1 first
second_type is the second bound type
#define __glibcxx_check_erase(_Position)
Class std::set with safety/checking/debug instrumentation.
void swap(_Tp &, _Tp &) noexcept(__and_< is_nothrow_move_constructible< _Tp >, is_nothrow_move_assignable< _Tp >>::value)
Swaps two values.
A standard container made up of unique keys, which can be retrieved in logarithmic time...
_Iterator base() const
Return the underlying iterator.
#define __glibcxx_check_erase_range(_First, _Last)
Struct holding two objects of arbitrary type.
_T2 second
first is a copy of the first object
bool operator>(const basic_string< _CharT, _Traits, _Alloc > &__lhs, const basic_string< _CharT, _Traits, _Alloc > &__rhs)
Test if string follows string.