29 #ifndef _GLIBCXX_DEBUG_DEQUE 30 #define _GLIBCXX_DEBUG_DEQUE 1 32 #pragma GCC system_header 39 namespace std _GLIBCXX_VISIBILITY(default)
44 template<
typename _Tp,
typename _Allocator = std::allocator<_Tp> >
47 deque<_Tp, _Allocator>, _Allocator,
48 __gnu_debug::_Safe_sequence>,
49 public _GLIBCXX_STD_C::deque<_Tp, _Allocator>
51 typedef _GLIBCXX_STD_C::deque<_Tp, _Allocator>
_Base;
60 typedef typename _Base::reference reference;
61 typedef typename _Base::const_reference const_reference;
68 typedef typename _Base::size_type size_type;
69 typedef typename _Base::difference_type difference_type;
71 typedef _Tp value_type;
72 typedef _Allocator allocator_type;
73 typedef typename _Base::pointer pointer;
74 typedef typename _Base::const_pointer const_pointer;
80 #if __cplusplus < 201103L 84 deque(
const deque& __x)
90 deque(
const deque&) =
default;
91 deque(deque&&) =
default;
93 deque(
const deque& __d,
const _Allocator& __a)
96 deque(deque&& __d,
const _Allocator& __a)
97 : _Safe(std::move(__d)), _Base(std::move(__d), __a) { }
100 const allocator_type& __a = allocator_type())
101 : _Base(__l, __a) { }
107 deque(
const _Allocator& __a)
110 #if __cplusplus >= 201103L 112 deque(size_type __n,
const _Allocator& __a = _Allocator())
113 : _Base(__n, __a) { }
115 deque(size_type __n,
const _Tp& __value,
116 const _Allocator& __a = _Allocator())
117 : _Base(__n, __value, __a) { }
120 deque(size_type __n,
const _Tp& __value = _Tp(),
121 const _Allocator& __a = _Allocator())
122 : _Base(__n, __value, __a) { }
125 #if __cplusplus >= 201103L 126 template<
class _InputIterator,
127 typename = std::_RequireInputIter<_InputIterator>>
129 template<
class _InputIterator>
131 deque(_InputIterator __first, _InputIterator __last,
132 const _Allocator& __a = _Allocator())
133 : _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
135 __gnu_debug::__base(__last), __a)
138 deque(
const _Base& __x)
141 #if __cplusplus < 201103L 143 operator=(
const deque& __x)
145 this->_M_safe() = __x;
151 operator=(
const deque&) =
default;
154 operator=(deque&&) =
default;
165 #if __cplusplus >= 201103L 166 template<
class _InputIterator,
167 typename = std::_RequireInputIter<_InputIterator>>
169 template<
class _InputIterator>
172 assign(_InputIterator __first, _InputIterator __last)
175 __glibcxx_check_valid_range2(__first, __last, __dist);
176 if (__dist.
second >= __gnu_debug::__dp_sign)
177 _Base::assign(__gnu_debug::__unsafe(__first),
178 __gnu_debug::__unsafe(__last));
180 _Base::assign(__first, __last);
186 assign(size_type __n,
const _Tp& __t)
188 _Base::assign(__n, __t);
192 #if __cplusplus >= 201103L 201 using _Base::get_allocator;
205 begin() _GLIBCXX_NOEXCEPT
206 {
return iterator(_Base::begin(),
this); }
209 begin()
const _GLIBCXX_NOEXCEPT
210 {
return const_iterator(_Base::begin(),
this); }
213 end() _GLIBCXX_NOEXCEPT
214 {
return iterator(_Base::end(),
this); }
217 end()
const _GLIBCXX_NOEXCEPT
218 {
return const_iterator(_Base::end(),
this); }
221 rbegin() _GLIBCXX_NOEXCEPT
222 {
return reverse_iterator(end()); }
224 const_reverse_iterator
225 rbegin()
const _GLIBCXX_NOEXCEPT
226 {
return const_reverse_iterator(end()); }
229 rend() _GLIBCXX_NOEXCEPT
230 {
return reverse_iterator(begin()); }
232 const_reverse_iterator
233 rend()
const _GLIBCXX_NOEXCEPT
234 {
return const_reverse_iterator(begin()); }
236 #if __cplusplus >= 201103L 238 cbegin()
const noexcept
239 {
return const_iterator(_Base::begin(),
this); }
242 cend()
const noexcept
243 {
return const_iterator(_Base::end(),
this); }
245 const_reverse_iterator
246 crbegin()
const noexcept
247 {
return const_reverse_iterator(end()); }
249 const_reverse_iterator
250 crend()
const noexcept
251 {
return const_reverse_iterator(begin()); }
256 _M_invalidate_after_nth(difference_type __n)
265 using _Base::max_size;
267 #if __cplusplus >= 201103L 269 resize(size_type __sz)
271 bool __invalidate_all = __sz > this->size();
272 if (__sz < this->size())
273 this->_M_invalidate_after_nth(__sz);
277 if (__invalidate_all)
282 resize(size_type __sz,
const _Tp& __c)
284 bool __invalidate_all = __sz > this->size();
285 if (__sz < this->size())
286 this->_M_invalidate_after_nth(__sz);
288 _Base::resize(__sz, __c);
290 if (__invalidate_all)
295 resize(size_type __sz, _Tp __c = _Tp())
297 bool __invalidate_all = __sz > this->size();
298 if (__sz < this->size())
299 this->_M_invalidate_after_nth(__sz);
301 _Base::resize(__sz, __c);
303 if (__invalidate_all)
308 #if __cplusplus >= 201103L 310 shrink_to_fit() noexcept
312 if (_Base::_M_shrink_to_fit())
321 operator[](size_type __n) _GLIBCXX_NOEXCEPT
323 __glibcxx_check_subscript(__n);
324 return _M_base()[__n];
328 operator[](size_type __n)
const _GLIBCXX_NOEXCEPT
330 __glibcxx_check_subscript(__n);
331 return _M_base()[__n];
337 front() _GLIBCXX_NOEXCEPT
339 __glibcxx_check_nonempty();
340 return _Base::front();
344 front()
const _GLIBCXX_NOEXCEPT
346 __glibcxx_check_nonempty();
347 return _Base::front();
351 back() _GLIBCXX_NOEXCEPT
353 __glibcxx_check_nonempty();
354 return _Base::back();
358 back()
const _GLIBCXX_NOEXCEPT
360 __glibcxx_check_nonempty();
361 return _Base::back();
366 push_front(
const _Tp& __x)
368 _Base::push_front(__x);
373 push_back(
const _Tp& __x)
375 _Base::push_back(__x);
379 #if __cplusplus >= 201103L 381 push_front(_Tp&& __x)
382 { emplace_front(std::move(__x)); }
386 { emplace_back(std::move(__x)); }
388 template<
typename... _Args>
389 #if __cplusplus > 201402L 394 emplace_front(_Args&&... __args)
396 _Base::emplace_front(std::forward<_Args>(__args)...);
398 #if __cplusplus > 201402L 403 template<
typename... _Args>
404 #if __cplusplus > 201402L 409 emplace_back(_Args&&... __args)
411 _Base::emplace_back(std::forward<_Args>(__args)...);
413 #if __cplusplus > 201402L 418 template<
typename... _Args>
420 emplace(const_iterator __position, _Args&&... __args)
423 _Base_iterator __res = _Base::emplace(__position.
base(),
424 std::forward<_Args>(__args)...);
426 return iterator(__res,
this);
431 #if __cplusplus >= 201103L 432 insert(const_iterator __position,
const _Tp& __x)
434 insert(iterator __position,
const _Tp& __x)
438 _Base_iterator __res = _Base::insert(__position.
base(), __x);
440 return iterator(__res,
this);
443 #if __cplusplus >= 201103L 445 insert(const_iterator __position, _Tp&& __x)
446 {
return emplace(__position, std::move(__x)); }
452 _Base_iterator __res = _Base::insert(__position.
base(), __l);
454 return iterator(__res,
this);
458 #if __cplusplus >= 201103L 460 insert(const_iterator __position, size_type __n,
const _Tp& __x)
463 _Base_iterator __res = _Base::insert(__position.
base(), __n, __x);
465 return iterator(__res,
this);
469 insert(iterator __position, size_type __n,
const _Tp& __x)
472 _Base::insert(__position.
base(), __n, __x);
477 #if __cplusplus >= 201103L 478 template<
class _InputIterator,
479 typename = std::_RequireInputIter<_InputIterator>>
481 insert(const_iterator __position,
482 _InputIterator __first, _InputIterator __last)
486 _Base_iterator __res;
487 if (__dist.
second >= __gnu_debug::__dp_sign)
488 __res = _Base::insert(__position.
base(),
489 __gnu_debug::__unsafe(__first),
490 __gnu_debug::__unsafe(__last));
492 __res = _Base::insert(__position.
base(), __first, __last);
495 return iterator(__res,
this);
498 template<
class _InputIterator>
500 insert(iterator __position,
501 _InputIterator __first, _InputIterator __last)
506 if (__dist.
second >= __gnu_debug::__dp_sign)
507 _Base::insert(__position.
base(),
508 __gnu_debug::__unsafe(__first),
509 __gnu_debug::__unsafe(__last));
511 _Base::insert(__position.
base(), __first, __last);
518 pop_front() _GLIBCXX_NOEXCEPT
520 __glibcxx_check_nonempty();
526 pop_back() _GLIBCXX_NOEXCEPT
528 __glibcxx_check_nonempty();
534 #if __cplusplus >= 201103L 535 erase(const_iterator __position)
537 erase(iterator __position)
541 #if __cplusplus >= 201103L 542 _Base_const_iterator __victim = __position.
base();
544 _Base_iterator __victim = __position.
base();
546 if (__victim == _Base::begin() || __victim == _Base::end() - 1)
549 return iterator(_Base::erase(__victim),
this);
553 _Base_iterator __res = _Base::erase(__victim);
555 return iterator(__res,
this);
560 #if __cplusplus >= 201103L 561 erase(const_iterator __first, const_iterator __last)
563 erase(iterator __first, iterator __last)
570 if (__first.
base() == __last.
base())
571 #
if __cplusplus >= 201103L
572 return iterator(__first.
base()._M_const_cast(),
this);
576 else if (__first.
base() == _Base::begin()
577 || __last.
base() == _Base::end())
580 for (_Base_const_iterator __position = __first.
base();
581 __position != __last.
base(); ++__position)
587 return iterator(_Base::erase(__first.
base(), __last.
base()),
593 __throw_exception_again;
598 _Base_iterator __res = _Base::erase(__first.
base(),
601 return iterator(__res,
this);
607 _GLIBCXX_NOEXCEPT_IF( noexcept(declval<_Base&>().swap(__x)) )
614 clear() _GLIBCXX_NOEXCEPT
621 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
624 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
627 template<
typename _Tp,
typename _Alloc>
631 {
return __lhs._M_base() == __rhs._M_base(); }
633 template<
typename _Tp,
typename _Alloc>
637 {
return __lhs._M_base() != __rhs._M_base(); }
639 template<
typename _Tp,
typename _Alloc>
641 operator<(const deque<_Tp, _Alloc>& __lhs,
643 {
return __lhs._M_base() < __rhs._M_base(); }
645 template<
typename _Tp,
typename _Alloc>
647 operator<=(const deque<_Tp, _Alloc>& __lhs,
649 {
return __lhs._M_base() <= __rhs._M_base(); }
651 template<
typename _Tp,
typename _Alloc>
655 {
return __lhs._M_base() >= __rhs._M_base(); }
657 template<
typename _Tp,
typename _Alloc>
661 {
return __lhs._M_base() > __rhs._M_base(); }
663 template<
typename _Tp,
typename _Alloc>
666 _GLIBCXX_NOEXCEPT_IF(noexcept(__lhs.swap(__rhs)))
667 { __lhs.swap(__rhs); }
_Iterator & base() noexcept
Return the underlying iterator.
_T2 second
first is a copy of the first object
ISO C++ entities toplevel namespace is std.
#define __glibcxx_check_insert(_Position)
void _M_detach_singular()
Class std::deque with safety/checking/debug instrumentation.
Struct holding two objects of arbitrary type.
void _M_revalidate_singular()
Base class for constructing a safe sequence type that tracks iterators that reference it...
void _M_invalidate_if(_Predicate __pred)
void _M_invalidate_all() const
Safe class dealing with some allocator dependent operations.
#define __glibcxx_check_insert_range(_Position, _First, _Last, _Dist)
#define __glibcxx_check_erase(_Position)
#define __glibcxx_check_erase_range(_First, _Last)