29 #ifndef _GLIBCXX_PROFILE_LIST
30 #define _GLIBCXX_PROFILE_LIST 1
36 namespace std _GLIBCXX_VISIBILITY(default)
40 template<
typename _List>
45 {
return *
static_cast<_List*
>(
this); }
48 __gnu_profile::__list2slist_info* _M_list2slist_info;
51 _List_profile() _GLIBCXX_NOEXCEPT
52 { _M_profile_construct(); }
55 _M_profile_construct() _GLIBCXX_NOEXCEPT
57 _M_list2slist_info = __profcxx_list2slist_construct();
58 _M_list2vector_info = __profcxx_list2vector_construct();
62 _M_profile_destruct() _GLIBCXX_NOEXCEPT
64 __profcxx_list2vector_destruct(_M_list2vector_info);
65 _M_list2vector_info = 0;
66 __profcxx_list2slist_destruct(_M_list2slist_info);
67 _M_list2slist_info = 0;
71 _M_swap(_List_profile& __other)
73 std::swap(_M_list2slist_info, __other._M_list2slist_info);
74 std::swap(_M_list2vector_info, __other._M_list2vector_info);
77 #if __cplusplus >= 201103L
78 _List_profile(
const _List_profile&) noexcept
80 _List_profile(_List_profile&& __other) noexcept
85 operator=(
const _List_profile&) noexcept
87 _M_profile_destruct();
88 _M_profile_construct();
92 operator=(_List_profile&& __other) noexcept
95 __other._M_profile_destruct();
96 __other._M_profile_construct();
101 { _M_profile_destruct(); }
105 template<
typename _Tp,
typename _Allocator = std::allocator<_Tp> >
107 :
public _GLIBCXX_STD_C::list<_Tp, _Allocator>,
108 public _List_profile<list<_Tp, _Allocator> >
110 typedef _GLIBCXX_STD_C::list<_Tp, _Allocator>
_Base;
113 typedef typename _Base::reference reference;
114 typedef typename _Base::const_reference const_reference;
116 typedef __iterator_tracker<typename _Base::iterator, list>
118 typedef __iterator_tracker<typename _Base::const_iterator, list>
121 typedef typename _Base::size_type size_type;
122 typedef typename _Base::difference_type difference_type;
124 typedef _Tp value_type;
125 typedef _Allocator allocator_type;
126 typedef typename _Base::pointer pointer;
127 typedef typename _Base::const_pointer const_pointer;
133 #if __cplusplus < 201103L
146 const allocator_type& __a = allocator_type())
147 :
_Base(__l, __a) { }
151 list(
const _Allocator& __a) _GLIBCXX_NOEXCEPT
154 #if __cplusplus >= 201103L
159 list(size_type __n,
const _Tp& __value,
160 const _Allocator& __a = _Allocator())
161 :
_Base(__n, __value, __a) { }
164 list(size_type __n,
const _Tp& __value = _Tp(),
165 const _Allocator& __a = _Allocator())
166 :
_Base(__n, __value, __a) { }
169 #if __cplusplus >= 201103L
170 template<
typename _InputIterator,
171 typename = std::_RequireInputIter<_InputIterator>>
173 template<
class _InputIterator>
175 list(_InputIterator __first, _InputIterator __last,
176 const _Allocator& __a = _Allocator())
177 :
_Base(__first, __last, __a) { }
179 list(
const _Base& __x)
182 #if __cplusplus < 201103L
184 operator=(
const list& __x)
186 this->_M_profile_destruct();
188 this->_M_profile_construct();
193 operator=(
const list&) =
default;
196 operator=(list&&) =
default;
201 this->_M_profile_destruct();
203 this->_M_profile_construct();
210 begin() _GLIBCXX_NOEXCEPT
211 {
return iterator(_Base::begin(),
this); }
214 begin()
const _GLIBCXX_NOEXCEPT
215 {
return const_iterator(_Base::begin(),
this); }
218 end() _GLIBCXX_NOEXCEPT
220 __profcxx_list2slist_rewind(this->_M_list2slist_info);
221 return iterator(_Base::end(),
this);
225 end()
const _GLIBCXX_NOEXCEPT
227 __profcxx_list2slist_rewind(this->_M_list2slist_info);
228 return const_iterator(_Base::end(),
this);
232 rbegin() _GLIBCXX_NOEXCEPT
234 __profcxx_list2slist_rewind(this->_M_list2slist_info);
239 rbegin()
const _GLIBCXX_NOEXCEPT
241 __profcxx_list2slist_rewind(this->_M_list2slist_info);
246 rend() _GLIBCXX_NOEXCEPT
250 rend()
const _GLIBCXX_NOEXCEPT
253 #if __cplusplus >= 201103L
255 cbegin()
const noexcept
256 {
return const_iterator(_Base::cbegin(),
this); }
259 cend()
const noexcept
260 {
return const_iterator(_Base::cend(),
this); }
263 crbegin()
const noexcept
267 crend()
const noexcept
273 back() _GLIBCXX_NOEXCEPT
275 __profcxx_list2slist_rewind(this->_M_list2slist_info);
276 return _Base::back();
280 back()
const _GLIBCXX_NOEXCEPT
282 __profcxx_list2slist_rewind(this->_M_list2slist_info);
283 return _Base::back();
288 push_front(
const value_type& __x)
290 __profcxx_list2vector_invalid_operator(this->_M_list2vector_info);
291 __profcxx_list2slist_operation(this->_M_list2slist_info);
292 _Base::push_front(__x);
296 pop_front() _GLIBCXX_NOEXCEPT
298 __profcxx_list2slist_operation(this->_M_list2slist_info);
303 pop_back() _GLIBCXX_NOEXCEPT
306 __profcxx_list2slist_rewind(this->_M_list2slist_info);
309 #if __cplusplus >= 201103L
310 template<
typename... _Args>
312 emplace(const_iterator __position, _Args&&... __args)
314 return iterator(_Base::emplace(__position.base(),
315 std::forward<_Args>(__args)...),
321 #if __cplusplus >= 201103L
322 insert(const_iterator __pos,
const _Tp& __x)
324 insert(iterator __pos,
const _Tp& __x)
327 _M_profile_insert(__pos, this->size());
328 return iterator(_Base::insert(__pos.base(), __x),
this);
331 #if __cplusplus >= 201103L
333 insert(const_iterator __pos, _Tp&& __x)
335 _M_profile_insert(__pos, this->size());
336 return iterator(_Base::emplace(__pos.base(), std::move(__x)),
343 _M_profile_insert(__pos, this->size());
344 return iterator(_Base::insert(__pos.base(), __l),
this);
348 #if __cplusplus >= 201103L
350 insert(const_iterator __pos, size_type __n,
const _Tp& __x)
352 _M_profile_insert(__pos, this->size());
353 return iterator(_Base::insert(__pos.base(), __n, __x),
this);
357 insert(iterator __pos, size_type __n,
const _Tp& __x)
359 _M_profile_insert(__pos, this->size());
360 _Base::insert(__pos.base(), __n, __x);
364 #if __cplusplus >= 201103L
365 template<
typename _InputIterator,
366 typename = std::_RequireInputIter<_InputIterator>>
368 insert(const_iterator __pos, _InputIterator __first,
369 _InputIterator __last)
371 _M_profile_insert(__pos, this->size());
372 return iterator(_Base::insert(__pos.base(), __first, __last),
376 template<
class _InputIterator>
378 insert(iterator __pos, _InputIterator __first,
379 _InputIterator __last)
381 _M_profile_insert(__pos, this->size());
382 _Base::insert(__pos.base(), __first, __last);
387 #if __cplusplus >= 201103L
388 erase(const_iterator __pos) noexcept
390 erase(iterator __pos)
392 {
return iterator(_Base::erase(__pos.base()),
this); }
395 #if __cplusplus >= 201103L
396 erase(const_iterator __pos, const_iterator __last) noexcept
398 erase(iterator __pos, iterator __last)
403 return iterator(_Base::erase(__pos.base(), __last.base()),
this);
408 #if __cplusplus >= 201103L
409 noexcept( noexcept(declval<_Base>().swap(__x)) )
417 clear() _GLIBCXX_NOEXCEPT
419 this->_M_profile_destruct();
421 this->_M_profile_construct();
426 #if __cplusplus >= 201103L
427 splice(const_iterator __pos, list&& __x) noexcept
429 splice(iterator __pos, list& __x)
431 { this->splice(__pos, _GLIBCXX_MOVE(__x), __x.begin(), __x.end()); }
433 #if __cplusplus >= 201103L
435 splice(const_iterator __pos, list& __x) noexcept
436 { this->splice(__pos, std::move(__x)); }
439 splice(const_iterator __pos, list& __x, const_iterator __i)
440 { this->splice(__pos, std::move(__x), __i); }
444 #if __cplusplus >= 201103L
445 splice(const_iterator __pos, list&& __x, const_iterator __i) noexcept
447 splice(iterator __pos, list& __x, iterator __i)
454 _Base::splice(__pos.base(), _GLIBCXX_MOVE(__x._M_base()),
459 #if __cplusplus >= 201103L
460 splice(const_iterator __pos, list&& __x, const_iterator __first,
461 const_iterator __last) noexcept
463 splice(iterator __pos, list& __x, iterator __first,
467 _Base::splice(__pos.base(), _GLIBCXX_MOVE(__x._M_base()),
468 __first.base(), __last.base());
471 #if __cplusplus >= 201103L
473 splice(const_iterator __pos, list& __x,
474 const_iterator __first, const_iterator __last) noexcept
475 { this->splice(__pos, std::move(__x), __first, __last); }
479 remove(
const _Tp& __value)
481 for (iterator __x = begin(); __x != end(); )
490 template<
class _Predicate>
492 remove_if(_Predicate __pred)
494 for (iterator __x = begin(); __x != end(); )
496 __profcxx_list2slist_operation(this->_M_list2slist_info);
507 iterator __first = begin();
508 iterator __last = end();
509 if (__first == __last)
511 iterator __next = __first;
512 while (++__next != __last)
514 __profcxx_list2slist_operation(this->_M_list2slist_info);
515 if (*__first == *__next)
523 template<
class _BinaryPredicate>
525 unique(_BinaryPredicate __binary_pred)
527 iterator __first = begin();
528 iterator __last = end();
529 if (__first == __last)
531 iterator __next = __first;
532 while (++__next != __last)
534 __profcxx_list2slist_operation(this->_M_list2slist_info);
535 if (__binary_pred(*__first, *__next))
544 #if __cplusplus >= 201103L
549 { _Base::merge(_GLIBCXX_MOVE(__x._M_base())); }
551 #if __cplusplus >= 201103L
554 { this->merge(std::move(__x)); }
557 template<
class _Compare>
559 #if __cplusplus >= 201103L
560 merge(list&& __x, _Compare __comp)
562 merge(list& __x, _Compare __comp)
564 { _Base::merge(_GLIBCXX_MOVE(__x._M_base()), __comp); }
566 #if __cplusplus >= 201103L
567 template<
typename _Compare>
569 merge(list& __x, _Compare __comp)
570 { this->merge(std::move(__x), __comp); }
574 _M_base() _GLIBCXX_NOEXCEPT {
return *
this; }
577 _M_base()
const _GLIBCXX_NOEXCEPT {
return *
this; }
579 void _M_profile_iterate(
int __rewind = 0)
const
581 __profcxx_list2slist_operation(this->_M_list2slist_info);
582 __profcxx_list2vector_iterate(this->_M_list2vector_info, __rewind);
584 __profcxx_list2slist_rewind(this->_M_list2slist_info);
589 _M_profile_insert(const_iterator __pos, size_type __size)
591 size_type __shift = 0;
592 typename _Base::const_iterator __it = __pos.base();
593 for (; __it != _Base::end(); ++__it)
595 __profcxx_list2slist_rewind(this->_M_list2slist_info);
596 __profcxx_list2slist_operation(this->_M_list2slist_info);
597 __profcxx_list2vector_insert(this->_M_list2vector_info, __shift, __size);
601 template<
typename _Tp,
typename _Alloc>
605 {
return __lhs._M_base() == __rhs._M_base(); }
607 template<
typename _Tp,
typename _Alloc>
611 {
return __lhs._M_base() != __rhs._M_base(); }
613 template<
typename _Tp,
typename _Alloc>
615 operator<(const list<_Tp, _Alloc>& __lhs,
616 const list<_Tp, _Alloc>& __rhs)
617 {
return __lhs._M_base() < __rhs._M_base(); }
619 template<
typename _Tp,
typename _Alloc>
621 operator<=(const list<_Tp, _Alloc>& __lhs,
622 const list<_Tp, _Alloc>& __rhs)
623 {
return __lhs._M_base() <= __rhs._M_base(); }
625 template<
typename _Tp,
typename _Alloc>
627 operator>=(
const list<_Tp, _Alloc>& __lhs,
628 const list<_Tp, _Alloc>& __rhs)
629 {
return __lhs._M_base() >= __rhs._M_base(); }
631 template<
typename _Tp,
typename _Alloc>
633 operator>(
const list<_Tp, _Alloc>& __lhs,
634 const list<_Tp, _Alloc>& __rhs)
635 {
return __lhs._M_base() > __rhs._M_base(); }
637 template<
typename _Tp,
typename _Alloc>
639 swap(list<_Tp, _Alloc>& __lhs, list<_Tp, _Alloc>& __rhs)
640 { __lhs.swap(__rhs); }
Sequential helper functions. This file is a GNU profile extension to the Standard C++ Library...
A list-to-vector instrumentation line in the object table.
A standard container with linear time access to elements, and fixed time insertion/deletion at any po...
List wrapper with performance instrumentation.