1 // List implementation -*- C++ -*-
3 // Copyright (C) 2001-2017 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
28 * Hewlett-Packard Company
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
39 * Copyright (c) 1996,1997
40 * Silicon Graphics Computer Systems, Inc.
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
51 /** @file bits/stl_list.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{list}
59 #include <bits/concept_check.h>
60 #include <ext/alloc_traits.h>
61 #if __cplusplus >= 201103L
62 #include <initializer_list>
63 #include <bits/allocated_ptr.h>
64 #include <ext/aligned_buffer.h>
67 namespace std
_GLIBCXX_VISIBILITY(default)
71 _GLIBCXX_BEGIN_NAMESPACE_VERSION
73 // Supporting structures are split into common and templated
74 // types; the latter publicly inherits from the former in an
75 // effort to reduce code duplication. This results in some
76 // "needless" static_cast'ing later on, but it's all safe
79 /// Common part of a node in the %list.
80 struct _List_node_base
82 _List_node_base
* _M_next
;
83 _List_node_base
* _M_prev
;
86 swap(_List_node_base
& __x
, _List_node_base
& __y
) _GLIBCXX_USE_NOEXCEPT
;
89 _M_transfer(_List_node_base
* const __first
,
90 _List_node_base
* const __last
) _GLIBCXX_USE_NOEXCEPT
;
93 _M_reverse() _GLIBCXX_USE_NOEXCEPT
;
96 _M_hook(_List_node_base
* const __position
) _GLIBCXX_USE_NOEXCEPT
;
99 _M_unhook() _GLIBCXX_USE_NOEXCEPT
;
102 _GLIBCXX_END_NAMESPACE_VERSION
103 } // namespace detail
105 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
107 /// An actual node in the %list.
108 template<typename _Tp
>
109 struct _List_node
: public __detail::_List_node_base
111 #if __cplusplus >= 201103L
112 __gnu_cxx::__aligned_membuf
<_Tp
> _M_storage
;
113 _Tp
* _M_valptr() { return _M_storage
._M_ptr(); }
114 _Tp
const* _M_valptr() const { return _M_storage
._M_ptr(); }
117 _Tp
* _M_valptr() { return std::__addressof(_M_data
); }
118 _Tp
const* _M_valptr() const { return std::__addressof(_M_data
); }
123 * @brief A list::iterator.
125 * All the functions are op overloads.
127 template<typename _Tp
>
128 struct _List_iterator
130 typedef _List_iterator
<_Tp
> _Self
;
131 typedef _List_node
<_Tp
> _Node
;
133 typedef ptrdiff_t difference_type
;
134 typedef std::bidirectional_iterator_tag iterator_category
;
135 typedef _Tp value_type
;
136 typedef _Tp
* pointer
;
137 typedef _Tp
& reference
;
139 _List_iterator() _GLIBCXX_NOEXCEPT
143 _List_iterator(__detail::_List_node_base
* __x
) _GLIBCXX_NOEXCEPT
147 _M_const_cast() const _GLIBCXX_NOEXCEPT
150 // Must downcast from _List_node_base to _List_node to get to value.
152 operator*() const _GLIBCXX_NOEXCEPT
153 { return *static_cast<_Node
*>(_M_node
)->_M_valptr(); }
156 operator->() const _GLIBCXX_NOEXCEPT
157 { return static_cast<_Node
*>(_M_node
)->_M_valptr(); }
160 operator++() _GLIBCXX_NOEXCEPT
162 _M_node
= _M_node
->_M_next
;
167 operator++(int) _GLIBCXX_NOEXCEPT
170 _M_node
= _M_node
->_M_next
;
175 operator--() _GLIBCXX_NOEXCEPT
177 _M_node
= _M_node
->_M_prev
;
182 operator--(int) _GLIBCXX_NOEXCEPT
185 _M_node
= _M_node
->_M_prev
;
190 operator==(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
191 { return _M_node
== __x
._M_node
; }
194 operator!=(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
195 { return _M_node
!= __x
._M_node
; }
197 // The only member points to the %list element.
198 __detail::_List_node_base
* _M_node
;
202 * @brief A list::const_iterator.
204 * All the functions are op overloads.
206 template<typename _Tp
>
207 struct _List_const_iterator
209 typedef _List_const_iterator
<_Tp
> _Self
;
210 typedef const _List_node
<_Tp
> _Node
;
211 typedef _List_iterator
<_Tp
> iterator
;
213 typedef ptrdiff_t difference_type
;
214 typedef std::bidirectional_iterator_tag iterator_category
;
215 typedef _Tp value_type
;
216 typedef const _Tp
* pointer
;
217 typedef const _Tp
& reference
;
219 _List_const_iterator() _GLIBCXX_NOEXCEPT
223 _List_const_iterator(const __detail::_List_node_base
* __x
)
227 _List_const_iterator(const iterator
& __x
) _GLIBCXX_NOEXCEPT
228 : _M_node(__x
._M_node
) { }
231 _M_const_cast() const _GLIBCXX_NOEXCEPT
232 { return iterator(const_cast<__detail::_List_node_base
*>(_M_node
)); }
234 // Must downcast from List_node_base to _List_node to get to value.
236 operator*() const _GLIBCXX_NOEXCEPT
237 { return *static_cast<_Node
*>(_M_node
)->_M_valptr(); }
240 operator->() const _GLIBCXX_NOEXCEPT
241 { return static_cast<_Node
*>(_M_node
)->_M_valptr(); }
244 operator++() _GLIBCXX_NOEXCEPT
246 _M_node
= _M_node
->_M_next
;
251 operator++(int) _GLIBCXX_NOEXCEPT
254 _M_node
= _M_node
->_M_next
;
259 operator--() _GLIBCXX_NOEXCEPT
261 _M_node
= _M_node
->_M_prev
;
266 operator--(int) _GLIBCXX_NOEXCEPT
269 _M_node
= _M_node
->_M_prev
;
274 operator==(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
275 { return _M_node
== __x
._M_node
; }
278 operator!=(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
279 { return _M_node
!= __x
._M_node
; }
281 // The only member points to the %list element.
282 const __detail::_List_node_base
* _M_node
;
285 template<typename _Val
>
287 operator==(const _List_iterator
<_Val
>& __x
,
288 const _List_const_iterator
<_Val
>& __y
) _GLIBCXX_NOEXCEPT
289 { return __x
._M_node
== __y
._M_node
; }
291 template<typename _Val
>
293 operator!=(const _List_iterator
<_Val
>& __x
,
294 const _List_const_iterator
<_Val
>& __y
) _GLIBCXX_NOEXCEPT
295 { return __x
._M_node
!= __y
._M_node
; }
297 _GLIBCXX_BEGIN_NAMESPACE_CXX11
298 /// See bits/stl_deque.h's _Deque_base for an explanation.
299 template<typename _Tp
, typename _Alloc
>
303 typedef typename
__gnu_cxx::__alloc_traits
<_Alloc
>::template
304 rebind
<_Tp
>::other _Tp_alloc_type
;
305 typedef __gnu_cxx::__alloc_traits
<_Tp_alloc_type
> _Tp_alloc_traits
;
306 typedef typename
_Tp_alloc_traits::template
307 rebind
<_List_node
<_Tp
> >::other _Node_alloc_type
;
308 typedef __gnu_cxx::__alloc_traits
<_Node_alloc_type
> _Node_alloc_traits
;
311 _S_distance(const __detail::_List_node_base
* __first
,
312 const __detail::_List_node_base
* __last
)
315 while (__first
!= __last
)
317 __first
= __first
->_M_next
;
324 : public _Node_alloc_type
326 #if _GLIBCXX_USE_CXX11_ABI
327 _List_node
<size_t> _M_node
;
329 __detail::_List_node_base _M_node
;
332 _List_impl() _GLIBCXX_NOEXCEPT
333 : _Node_alloc_type(), _M_node()
336 _List_impl(const _Node_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
337 : _Node_alloc_type(__a
), _M_node()
340 #if __cplusplus >= 201103L
341 _List_impl(_Node_alloc_type
&& __a
) noexcept
342 : _Node_alloc_type(std::move(__a
)), _M_node()
349 #if _GLIBCXX_USE_CXX11_ABI
350 size_t _M_get_size() const { return *_M_impl
._M_node
._M_valptr(); }
352 void _M_set_size(size_t __n
) { *_M_impl
._M_node
._M_valptr() = __n
; }
354 void _M_inc_size(size_t __n
) { *_M_impl
._M_node
._M_valptr() += __n
; }
356 void _M_dec_size(size_t __n
) { *_M_impl
._M_node
._M_valptr() -= __n
; }
359 _M_distance(const __detail::_List_node_base
* __first
,
360 const __detail::_List_node_base
* __last
) const
361 { return _S_distance(__first
, __last
); }
363 // return the stored size
364 size_t _M_node_count() const { return *_M_impl
._M_node
._M_valptr(); }
366 // dummy implementations used when the size is not stored
367 size_t _M_get_size() const { return 0; }
368 void _M_set_size(size_t) { }
369 void _M_inc_size(size_t) { }
370 void _M_dec_size(size_t) { }
371 size_t _M_distance(const void*, const void*) const { return 0; }
373 // count the number of nodes
374 size_t _M_node_count() const
376 return _S_distance(_M_impl
._M_node
._M_next
,
377 std::__addressof(_M_impl
._M_node
));
381 typename
_Node_alloc_traits::pointer
383 { return _Node_alloc_traits::allocate(_M_impl
, 1); }
386 _M_put_node(typename
_Node_alloc_traits::pointer __p
) _GLIBCXX_NOEXCEPT
387 { _Node_alloc_traits::deallocate(_M_impl
, __p
, 1); }
390 typedef _Alloc allocator_type
;
393 _M_get_Node_allocator() _GLIBCXX_NOEXCEPT
396 const _Node_alloc_type
&
397 _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT
404 _List_base(const _Node_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
408 #if __cplusplus >= 201103L
409 _List_base(_List_base
&& __x
) noexcept
410 : _M_impl(std::move(__x
._M_get_Node_allocator()))
411 { _M_move_nodes(std::move(__x
)); }
413 _List_base(_List_base
&& __x
, _Node_alloc_type
&& __a
)
414 : _M_impl(std::move(__a
))
416 if (__x
._M_get_Node_allocator() == _M_get_Node_allocator())
417 _M_move_nodes(std::move(__x
));
419 _M_init(); // Caller must move individual elements.
423 _M_move_nodes(_List_base
&& __x
)
425 auto* const __xnode
= std::__addressof(__x
._M_impl
._M_node
);
426 if (__xnode
->_M_next
== __xnode
)
430 auto* const __node
= std::__addressof(_M_impl
._M_node
);
431 __node
->_M_next
= __xnode
->_M_next
;
432 __node
->_M_prev
= __xnode
->_M_prev
;
433 __node
->_M_next
->_M_prev
= __node
->_M_prev
->_M_next
= __node
;
434 _M_set_size(__x
._M_get_size());
440 // This is what actually destroys the list.
441 ~_List_base() _GLIBCXX_NOEXCEPT
445 _M_clear() _GLIBCXX_NOEXCEPT
;
448 _M_init() _GLIBCXX_NOEXCEPT
450 this->_M_impl
._M_node
._M_next
= &this->_M_impl
._M_node
;
451 this->_M_impl
._M_node
._M_prev
= &this->_M_impl
._M_node
;
457 * @brief A standard container with linear time access to elements,
458 * and fixed time insertion/deletion at any point in the sequence.
462 * @tparam _Tp Type of element.
463 * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.
465 * Meets the requirements of a <a href="tables.html#65">container</a>, a
466 * <a href="tables.html#66">reversible container</a>, and a
467 * <a href="tables.html#67">sequence</a>, including the
468 * <a href="tables.html#68">optional sequence requirements</a> with the
469 * %exception of @c at and @c operator[].
471 * This is a @e doubly @e linked %list. Traversal up and down the
472 * %list requires linear time, but adding and removing elements (or
473 * @e nodes) is done in constant time, regardless of where the
474 * change takes place. Unlike std::vector and std::deque,
475 * random-access iterators are not provided, so subscripting ( @c
476 * [] ) access is not allowed. For algorithms which only need
477 * sequential access, this lack makes no difference.
479 * Also unlike the other standard containers, std::list provides
480 * specialized algorithms %unique to linked lists, such as
481 * splicing, sorting, and in-place reversal.
483 * A couple points on memory allocation for list<Tp>:
485 * First, we never actually allocate a Tp, we allocate
486 * List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure
487 * that after elements from %list<X,Alloc1> are spliced into
488 * %list<X,Alloc2>, destroying the memory of the second %list is a
489 * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.
491 * Second, a %list conceptually represented as
493 * A <---> B <---> C <---> D
495 * is actually circular; a link exists between A and D. The %list
496 * class holds (as its only data member) a private list::iterator
497 * pointing to @e D, not to @e A! To get to the head of the %list,
498 * we start at the tail and move forward by one. When this member
499 * iterator's next/previous pointers refer to itself, the %list is
502 template<typename _Tp
, typename _Alloc
= std::allocator
<_Tp
> >
503 class list
: protected _List_base
<_Tp
, _Alloc
>
505 #ifdef _GLIBCXX_CONCEPT_CHECKS
506 // concept requirements
507 typedef typename
_Alloc::value_type _Alloc_value_type
;
508 # if __cplusplus < 201103L
509 __glibcxx_class_requires(_Tp
, _SGIAssignableConcept
)
511 __glibcxx_class_requires2(_Tp
, _Alloc_value_type
, _SameTypeConcept
)
514 typedef _List_base
<_Tp
, _Alloc
> _Base
;
515 typedef typename
_Base::_Tp_alloc_type _Tp_alloc_type
;
516 typedef typename
_Base::_Tp_alloc_traits _Tp_alloc_traits
;
517 typedef typename
_Base::_Node_alloc_type _Node_alloc_type
;
518 typedef typename
_Base::_Node_alloc_traits _Node_alloc_traits
;
521 typedef _Tp value_type
;
522 typedef typename
_Tp_alloc_traits::pointer pointer
;
523 typedef typename
_Tp_alloc_traits::const_pointer const_pointer
;
524 typedef typename
_Tp_alloc_traits::reference reference
;
525 typedef typename
_Tp_alloc_traits::const_reference const_reference
;
526 typedef _List_iterator
<_Tp
> iterator
;
527 typedef _List_const_iterator
<_Tp
> const_iterator
;
528 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
529 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
530 typedef size_t size_type
;
531 typedef ptrdiff_t difference_type
;
532 typedef _Alloc allocator_type
;
535 // Note that pointers-to-_Node's can be ctor-converted to
537 typedef _List_node
<_Tp
> _Node
;
539 using _Base::_M_impl
;
540 using _Base::_M_put_node
;
541 using _Base::_M_get_node
;
542 using _Base::_M_get_Node_allocator
;
545 * @param __args An instance of user data.
547 * Allocates space for a new node and constructs a copy of
550 #if __cplusplus < 201103L
552 _M_create_node(const value_type
& __x
)
554 _Node
* __p
= this->_M_get_node();
557 _Tp_alloc_type
__alloc(_M_get_Node_allocator());
558 __alloc
.construct(__p
->_M_valptr(), __x
);
563 __throw_exception_again
;
568 template<typename
... _Args
>
570 _M_create_node(_Args
&&... __args
)
572 auto __p
= this->_M_get_node();
573 auto& __alloc
= _M_get_Node_allocator();
574 __allocated_ptr
<_Node_alloc_type
> __guard
{__alloc
, __p
};
575 _Node_alloc_traits::construct(__alloc
, __p
->_M_valptr(),
576 std::forward
<_Args
>(__args
)...);
583 // [23.2.2.1] construct/copy/destroy
584 // (assign() and get_allocator() are also listed in this section)
587 * @brief Creates a %list with no elements.
590 #if __cplusplus >= 201103L
591 noexcept(is_nothrow_default_constructible
<_Node_alloc_type
>::value
)
596 * @brief Creates a %list with no elements.
597 * @param __a An allocator object.
600 list(const allocator_type
& __a
) _GLIBCXX_NOEXCEPT
601 : _Base(_Node_alloc_type(__a
)) { }
603 #if __cplusplus >= 201103L
605 * @brief Creates a %list with default constructed elements.
606 * @param __n The number of elements to initially create.
607 * @param __a An allocator object.
609 * This constructor fills the %list with @a __n default
610 * constructed elements.
613 list(size_type __n
, const allocator_type
& __a
= allocator_type())
614 : _Base(_Node_alloc_type(__a
))
615 { _M_default_initialize(__n
); }
618 * @brief Creates a %list with copies of an exemplar element.
619 * @param __n The number of elements to initially create.
620 * @param __value An element to copy.
621 * @param __a An allocator object.
623 * This constructor fills the %list with @a __n copies of @a __value.
625 list(size_type __n
, const value_type
& __value
,
626 const allocator_type
& __a
= allocator_type())
627 : _Base(_Node_alloc_type(__a
))
628 { _M_fill_initialize(__n
, __value
); }
631 * @brief Creates a %list with copies of an exemplar element.
632 * @param __n The number of elements to initially create.
633 * @param __value An element to copy.
634 * @param __a An allocator object.
636 * This constructor fills the %list with @a __n copies of @a __value.
639 list(size_type __n
, const value_type
& __value
= value_type(),
640 const allocator_type
& __a
= allocator_type())
641 : _Base(_Node_alloc_type(__a
))
642 { _M_fill_initialize(__n
, __value
); }
646 * @brief %List copy constructor.
647 * @param __x A %list of identical element and allocator types.
649 * The newly-created %list uses a copy of the allocation object used
650 * by @a __x (unless the allocator traits dictate a different object).
652 list(const list
& __x
)
653 : _Base(_Node_alloc_traits::
654 _S_select_on_copy(__x
._M_get_Node_allocator()))
655 { _M_initialize_dispatch(__x
.begin(), __x
.end(), __false_type()); }
657 #if __cplusplus >= 201103L
659 * @brief %List move constructor.
660 * @param __x A %list of identical element and allocator types.
662 * The newly-created %list contains the exact contents of @a __x.
663 * The contents of @a __x are a valid, but unspecified %list.
665 list(list
&& __x
) noexcept
666 : _Base(std::move(__x
)) { }
669 * @brief Builds a %list from an initializer_list
670 * @param __l An initializer_list of value_type.
671 * @param __a An allocator object.
673 * Create a %list consisting of copies of the elements in the
674 * initializer_list @a __l. This is linear in __l.size().
676 list(initializer_list
<value_type
> __l
,
677 const allocator_type
& __a
= allocator_type())
678 : _Base(_Node_alloc_type(__a
))
679 { _M_initialize_dispatch(__l
.begin(), __l
.end(), __false_type()); }
681 list(const list
& __x
, const allocator_type
& __a
)
682 : _Base(_Node_alloc_type(__a
))
683 { _M_initialize_dispatch(__x
.begin(), __x
.end(), __false_type()); }
685 list(list
&& __x
, const allocator_type
& __a
)
686 noexcept(_Node_alloc_traits::_S_always_equal())
687 : _Base(std::move(__x
), _Node_alloc_type(__a
))
689 // If __x is not empty it means its allocator is not equal to __a,
690 // so we need to move from each element individually.
691 insert(begin(), std::__make_move_if_noexcept_iterator(__x
.begin()),
692 std::__make_move_if_noexcept_iterator(__x
.end()));
697 * @brief Builds a %list from a range.
698 * @param __first An input iterator.
699 * @param __last An input iterator.
700 * @param __a An allocator object.
702 * Create a %list consisting of copies of the elements from
703 * [@a __first,@a __last). This is linear in N (where N is
704 * distance(@a __first,@a __last)).
706 #if __cplusplus >= 201103L
707 template<typename _InputIterator
,
708 typename
= std::_RequireInputIter
<_InputIterator
>>
709 list(_InputIterator __first
, _InputIterator __last
,
710 const allocator_type
& __a
= allocator_type())
711 : _Base(_Node_alloc_type(__a
))
712 { _M_initialize_dispatch(__first
, __last
, __false_type()); }
714 template<typename _InputIterator
>
715 list(_InputIterator __first
, _InputIterator __last
,
716 const allocator_type
& __a
= allocator_type())
717 : _Base(_Node_alloc_type(__a
))
719 // Check whether it's an integral type. If so, it's not an iterator.
720 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
721 _M_initialize_dispatch(__first
, __last
, _Integral());
725 #if __cplusplus >= 201103L
727 * No explicit dtor needed as the _Base dtor takes care of
728 * things. The _Base dtor only erases the elements, and note
729 * that if the elements themselves are pointers, the pointed-to
730 * memory is not touched in any way. Managing the pointer is
731 * the user's responsibility.
737 * @brief %List assignment operator.
738 * @param __x A %list of identical element and allocator types.
740 * All the elements of @a __x are copied.
742 * Whether the allocator is copied depends on the allocator traits.
745 operator=(const list
& __x
);
747 #if __cplusplus >= 201103L
749 * @brief %List move assignment operator.
750 * @param __x A %list of identical element and allocator types.
752 * The contents of @a __x are moved into this %list (without copying).
754 * Afterwards @a __x is a valid, but unspecified %list
756 * Whether the allocator is moved depends on the allocator traits.
759 operator=(list
&& __x
)
760 noexcept(_Node_alloc_traits::_S_nothrow_move())
762 constexpr bool __move_storage
=
763 _Node_alloc_traits::_S_propagate_on_move_assign()
764 || _Node_alloc_traits::_S_always_equal();
765 _M_move_assign(std::move(__x
), __bool_constant
<__move_storage
>());
770 * @brief %List initializer list assignment operator.
771 * @param __l An initializer_list of value_type.
773 * Replace the contents of the %list with copies of the elements
774 * in the initializer_list @a __l. This is linear in l.size().
777 operator=(initializer_list
<value_type
> __l
)
779 this->assign(__l
.begin(), __l
.end());
785 * @brief Assigns a given value to a %list.
786 * @param __n Number of elements to be assigned.
787 * @param __val Value to be assigned.
789 * This function fills a %list with @a __n copies of the given
790 * value. Note that the assignment completely changes the %list
791 * and that the resulting %list's size is the same as the number
792 * of elements assigned.
795 assign(size_type __n
, const value_type
& __val
)
796 { _M_fill_assign(__n
, __val
); }
799 * @brief Assigns a range to a %list.
800 * @param __first An input iterator.
801 * @param __last An input iterator.
803 * This function fills a %list with copies of the elements in the
804 * range [@a __first,@a __last).
806 * Note that the assignment completely changes the %list and
807 * that the resulting %list's size is the same as the number of
810 #if __cplusplus >= 201103L
811 template<typename _InputIterator
,
812 typename
= std::_RequireInputIter
<_InputIterator
>>
814 assign(_InputIterator __first
, _InputIterator __last
)
815 { _M_assign_dispatch(__first
, __last
, __false_type()); }
817 template<typename _InputIterator
>
819 assign(_InputIterator __first
, _InputIterator __last
)
821 // Check whether it's an integral type. If so, it's not an iterator.
822 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
823 _M_assign_dispatch(__first
, __last
, _Integral());
827 #if __cplusplus >= 201103L
829 * @brief Assigns an initializer_list to a %list.
830 * @param __l An initializer_list of value_type.
832 * Replace the contents of the %list with copies of the elements
833 * in the initializer_list @a __l. This is linear in __l.size().
836 assign(initializer_list
<value_type
> __l
)
837 { this->_M_assign_dispatch(__l
.begin(), __l
.end(), __false_type()); }
840 /// Get a copy of the memory allocation object.
842 get_allocator() const _GLIBCXX_NOEXCEPT
843 { return allocator_type(_Base::_M_get_Node_allocator()); }
847 * Returns a read/write iterator that points to the first element in the
848 * %list. Iteration is done in ordinary element order.
851 begin() _GLIBCXX_NOEXCEPT
852 { return iterator(this->_M_impl
._M_node
._M_next
); }
855 * Returns a read-only (constant) iterator that points to the
856 * first element in the %list. Iteration is done in ordinary
860 begin() const _GLIBCXX_NOEXCEPT
861 { return const_iterator(this->_M_impl
._M_node
._M_next
); }
864 * Returns a read/write iterator that points one past the last
865 * element in the %list. Iteration is done in ordinary element
869 end() _GLIBCXX_NOEXCEPT
870 { return iterator(&this->_M_impl
._M_node
); }
873 * Returns a read-only (constant) iterator that points one past
874 * the last element in the %list. Iteration is done in ordinary
878 end() const _GLIBCXX_NOEXCEPT
879 { return const_iterator(&this->_M_impl
._M_node
); }
882 * Returns a read/write reverse iterator that points to the last
883 * element in the %list. Iteration is done in reverse element
887 rbegin() _GLIBCXX_NOEXCEPT
888 { return reverse_iterator(end()); }
891 * Returns a read-only (constant) reverse iterator that points to
892 * the last element in the %list. Iteration is done in reverse
895 const_reverse_iterator
896 rbegin() const _GLIBCXX_NOEXCEPT
897 { return const_reverse_iterator(end()); }
900 * Returns a read/write reverse iterator that points to one
901 * before the first element in the %list. Iteration is done in
902 * reverse element order.
905 rend() _GLIBCXX_NOEXCEPT
906 { return reverse_iterator(begin()); }
909 * Returns a read-only (constant) reverse iterator that points to one
910 * before the first element in the %list. Iteration is done in reverse
913 const_reverse_iterator
914 rend() const _GLIBCXX_NOEXCEPT
915 { return const_reverse_iterator(begin()); }
917 #if __cplusplus >= 201103L
919 * Returns a read-only (constant) iterator that points to the
920 * first element in the %list. Iteration is done in ordinary
924 cbegin() const noexcept
925 { return const_iterator(this->_M_impl
._M_node
._M_next
); }
928 * Returns a read-only (constant) iterator that points one past
929 * the last element in the %list. Iteration is done in ordinary
933 cend() const noexcept
934 { return const_iterator(&this->_M_impl
._M_node
); }
937 * Returns a read-only (constant) reverse iterator that points to
938 * the last element in the %list. Iteration is done in reverse
941 const_reverse_iterator
942 crbegin() const noexcept
943 { return const_reverse_iterator(end()); }
946 * Returns a read-only (constant) reverse iterator that points to one
947 * before the first element in the %list. Iteration is done in reverse
950 const_reverse_iterator
951 crend() const noexcept
952 { return const_reverse_iterator(begin()); }
955 // [23.2.2.2] capacity
957 * Returns true if the %list is empty. (Thus begin() would equal
961 empty() const _GLIBCXX_NOEXCEPT
962 { return this->_M_impl
._M_node
._M_next
== &this->_M_impl
._M_node
; }
964 /** Returns the number of elements in the %list. */
966 size() const _GLIBCXX_NOEXCEPT
967 { return this->_M_node_count(); }
969 /** Returns the size() of the largest possible %list. */
971 max_size() const _GLIBCXX_NOEXCEPT
972 { return _Node_alloc_traits::max_size(_M_get_Node_allocator()); }
974 #if __cplusplus >= 201103L
976 * @brief Resizes the %list to the specified number of elements.
977 * @param __new_size Number of elements the %list should contain.
979 * This function will %resize the %list to the specified number
980 * of elements. If the number is smaller than the %list's
981 * current size the %list is truncated, otherwise default
982 * constructed elements are appended.
985 resize(size_type __new_size
);
988 * @brief Resizes the %list to the specified number of elements.
989 * @param __new_size Number of elements the %list should contain.
990 * @param __x Data with which new elements should be populated.
992 * This function will %resize the %list to the specified number
993 * of elements. If the number is smaller than the %list's
994 * current size the %list is truncated, otherwise the %list is
995 * extended and new elements are populated with given data.
998 resize(size_type __new_size
, const value_type
& __x
);
1001 * @brief Resizes the %list to the specified number of elements.
1002 * @param __new_size Number of elements the %list should contain.
1003 * @param __x Data with which new elements should be populated.
1005 * This function will %resize the %list to the specified number
1006 * of elements. If the number is smaller than the %list's
1007 * current size the %list is truncated, otherwise the %list is
1008 * extended and new elements are populated with given data.
1011 resize(size_type __new_size
, value_type __x
= value_type());
1016 * Returns a read/write reference to the data at the first
1017 * element of the %list.
1020 front() _GLIBCXX_NOEXCEPT
1021 { return *begin(); }
1024 * Returns a read-only (constant) reference to the data at the first
1025 * element of the %list.
1028 front() const _GLIBCXX_NOEXCEPT
1029 { return *begin(); }
1032 * Returns a read/write reference to the data at the last element
1036 back() _GLIBCXX_NOEXCEPT
1038 iterator __tmp
= end();
1044 * Returns a read-only (constant) reference to the data at the last
1045 * element of the %list.
1048 back() const _GLIBCXX_NOEXCEPT
1050 const_iterator __tmp
= end();
1055 // [23.2.2.3] modifiers
1057 * @brief Add data to the front of the %list.
1058 * @param __x Data to be added.
1060 * This is a typical stack operation. The function creates an
1061 * element at the front of the %list and assigns the given data
1062 * to it. Due to the nature of a %list this operation can be
1063 * done in constant time, and does not invalidate iterators and
1067 push_front(const value_type
& __x
)
1068 { this->_M_insert(begin(), __x
); }
1070 #if __cplusplus >= 201103L
1072 push_front(value_type
&& __x
)
1073 { this->_M_insert(begin(), std::move(__x
)); }
1075 template<typename
... _Args
>
1076 #if __cplusplus > 201402L
1081 emplace_front(_Args
&&... __args
)
1083 this->_M_insert(begin(), std::forward
<_Args
>(__args
)...);
1084 #if __cplusplus > 201402L
1091 * @brief Removes first element.
1093 * This is a typical stack operation. It shrinks the %list by
1094 * one. Due to the nature of a %list this operation can be done
1095 * in constant time, and only invalidates iterators/references to
1096 * the element being removed.
1098 * Note that no data is returned, and if the first element's data
1099 * is needed, it should be retrieved before pop_front() is
1103 pop_front() _GLIBCXX_NOEXCEPT
1104 { this->_M_erase(begin()); }
1107 * @brief Add data to the end of the %list.
1108 * @param __x Data to be added.
1110 * This is a typical stack operation. The function creates an
1111 * element at the end of the %list and assigns the given data to
1112 * it. Due to the nature of a %list this operation can be done
1113 * in constant time, and does not invalidate iterators and
1117 push_back(const value_type
& __x
)
1118 { this->_M_insert(end(), __x
); }
1120 #if __cplusplus >= 201103L
1122 push_back(value_type
&& __x
)
1123 { this->_M_insert(end(), std::move(__x
)); }
1125 template<typename
... _Args
>
1126 #if __cplusplus > 201402L
1131 emplace_back(_Args
&&... __args
)
1133 this->_M_insert(end(), std::forward
<_Args
>(__args
)...);
1134 #if __cplusplus > 201402L
1141 * @brief Removes last element.
1143 * This is a typical stack operation. It shrinks the %list by
1144 * one. Due to the nature of a %list this operation can be done
1145 * in constant time, and only invalidates iterators/references to
1146 * the element being removed.
1148 * Note that no data is returned, and if the last element's data
1149 * is needed, it should be retrieved before pop_back() is called.
1152 pop_back() _GLIBCXX_NOEXCEPT
1153 { this->_M_erase(iterator(this->_M_impl
._M_node
._M_prev
)); }
1155 #if __cplusplus >= 201103L
1157 * @brief Constructs object in %list before specified iterator.
1158 * @param __position A const_iterator into the %list.
1159 * @param __args Arguments.
1160 * @return An iterator that points to the inserted data.
1162 * This function will insert an object of type T constructed
1163 * with T(std::forward<Args>(args)...) before the specified
1164 * location. Due to the nature of a %list this operation can
1165 * be done in constant time, and does not invalidate iterators
1168 template<typename
... _Args
>
1170 emplace(const_iterator __position
, _Args
&&... __args
);
1173 * @brief Inserts given value into %list before specified iterator.
1174 * @param __position A const_iterator into the %list.
1175 * @param __x Data to be inserted.
1176 * @return An iterator that points to the inserted data.
1178 * This function will insert a copy of the given value before
1179 * the specified location. Due to the nature of a %list this
1180 * operation can be done in constant time, and does not
1181 * invalidate iterators and references.
1184 insert(const_iterator __position
, const value_type
& __x
);
1187 * @brief Inserts given value into %list before specified iterator.
1188 * @param __position An iterator into the %list.
1189 * @param __x Data to be inserted.
1190 * @return An iterator that points to the inserted data.
1192 * This function will insert a copy of the given value before
1193 * the specified location. Due to the nature of a %list this
1194 * operation can be done in constant time, and does not
1195 * invalidate iterators and references.
1198 insert(iterator __position
, const value_type
& __x
);
1201 #if __cplusplus >= 201103L
1203 * @brief Inserts given rvalue into %list before specified iterator.
1204 * @param __position A const_iterator into the %list.
1205 * @param __x Data to be inserted.
1206 * @return An iterator that points to the inserted data.
1208 * This function will insert a copy of the given rvalue before
1209 * the specified location. Due to the nature of a %list this
1210 * operation can be done in constant time, and does not
1211 * invalidate iterators and references.
1214 insert(const_iterator __position
, value_type
&& __x
)
1215 { return emplace(__position
, std::move(__x
)); }
1218 * @brief Inserts the contents of an initializer_list into %list
1219 * before specified const_iterator.
1220 * @param __p A const_iterator into the %list.
1221 * @param __l An initializer_list of value_type.
1222 * @return An iterator pointing to the first element inserted
1225 * This function will insert copies of the data in the
1226 * initializer_list @a l into the %list before the location
1227 * specified by @a p.
1229 * This operation is linear in the number of elements inserted and
1230 * does not invalidate iterators and references.
1233 insert(const_iterator __p
, initializer_list
<value_type
> __l
)
1234 { return this->insert(__p
, __l
.begin(), __l
.end()); }
1237 #if __cplusplus >= 201103L
1239 * @brief Inserts a number of copies of given data into the %list.
1240 * @param __position A const_iterator into the %list.
1241 * @param __n Number of elements to be inserted.
1242 * @param __x Data to be inserted.
1243 * @return An iterator pointing to the first element inserted
1246 * This function will insert a specified number of copies of the
1247 * given data before the location specified by @a position.
1249 * This operation is linear in the number of elements inserted and
1250 * does not invalidate iterators and references.
1253 insert(const_iterator __position
, size_type __n
, const value_type
& __x
);
1256 * @brief Inserts a number of copies of given data into the %list.
1257 * @param __position An iterator into the %list.
1258 * @param __n Number of elements to be inserted.
1259 * @param __x Data to be inserted.
1261 * This function will insert a specified number of copies of the
1262 * given data before the location specified by @a position.
1264 * This operation is linear in the number of elements inserted and
1265 * does not invalidate iterators and references.
1268 insert(iterator __position
, size_type __n
, const value_type
& __x
)
1270 list
__tmp(__n
, __x
, get_allocator());
1271 splice(__position
, __tmp
);
1275 #if __cplusplus >= 201103L
1277 * @brief Inserts a range into the %list.
1278 * @param __position A const_iterator into the %list.
1279 * @param __first An input iterator.
1280 * @param __last An input iterator.
1281 * @return An iterator pointing to the first element inserted
1284 * This function will insert copies of the data in the range [@a
1285 * first,@a last) into the %list before the location specified by
1288 * This operation is linear in the number of elements inserted and
1289 * does not invalidate iterators and references.
1291 template<typename _InputIterator
,
1292 typename
= std::_RequireInputIter
<_InputIterator
>>
1294 insert(const_iterator __position
, _InputIterator __first
,
1295 _InputIterator __last
);
1298 * @brief Inserts a range into the %list.
1299 * @param __position An iterator into the %list.
1300 * @param __first An input iterator.
1301 * @param __last An input iterator.
1303 * This function will insert copies of the data in the range [@a
1304 * first,@a last) into the %list before the location specified by
1307 * This operation is linear in the number of elements inserted and
1308 * does not invalidate iterators and references.
1310 template<typename _InputIterator
>
1312 insert(iterator __position
, _InputIterator __first
,
1313 _InputIterator __last
)
1315 list
__tmp(__first
, __last
, get_allocator());
1316 splice(__position
, __tmp
);
1321 * @brief Remove element at given position.
1322 * @param __position Iterator pointing to element to be erased.
1323 * @return An iterator pointing to the next element (or end()).
1325 * This function will erase the element at the given position and thus
1326 * shorten the %list by one.
1328 * Due to the nature of a %list this operation can be done in
1329 * constant time, and only invalidates iterators/references to
1330 * the element being removed. The user is also cautioned that
1331 * this function only erases the element, and that if the element
1332 * is itself a pointer, the pointed-to memory is not touched in
1333 * any way. Managing the pointer is the user's responsibility.
1336 #if __cplusplus >= 201103L
1337 erase(const_iterator __position
) noexcept
;
1339 erase(iterator __position
);
1343 * @brief Remove a range of elements.
1344 * @param __first Iterator pointing to the first element to be erased.
1345 * @param __last Iterator pointing to one past the last element to be
1347 * @return An iterator pointing to the element pointed to by @a last
1348 * prior to erasing (or end()).
1350 * This function will erase the elements in the range @a
1351 * [first,last) and shorten the %list accordingly.
1353 * This operation is linear time in the size of the range and only
1354 * invalidates iterators/references to the element being removed.
1355 * The user is also cautioned that this function only erases the
1356 * elements, and that if the elements themselves are pointers, the
1357 * pointed-to memory is not touched in any way. Managing the pointer
1358 * is the user's responsibility.
1361 #if __cplusplus >= 201103L
1362 erase(const_iterator __first
, const_iterator __last
) noexcept
1364 erase(iterator __first
, iterator __last
)
1367 while (__first
!= __last
)
1368 __first
= erase(__first
);
1369 return __last
._M_const_cast();
1373 * @brief Swaps data with another %list.
1374 * @param __x A %list of the same element and allocator types.
1376 * This exchanges the elements between two lists in constant
1377 * time. Note that the global std::swap() function is
1378 * specialized such that std::swap(l1,l2) will feed to this
1381 * Whether the allocators are swapped depends on the allocator traits.
1384 swap(list
& __x
) _GLIBCXX_NOEXCEPT
1386 __detail::_List_node_base::swap(this->_M_impl
._M_node
,
1387 __x
._M_impl
._M_node
);
1389 size_t __xsize
= __x
._M_get_size();
1390 __x
._M_set_size(this->_M_get_size());
1391 this->_M_set_size(__xsize
);
1393 _Node_alloc_traits::_S_on_swap(this->_M_get_Node_allocator(),
1394 __x
._M_get_Node_allocator());
1398 * Erases all the elements. Note that this function only erases
1399 * the elements, and that if the elements themselves are
1400 * pointers, the pointed-to memory is not touched in any way.
1401 * Managing the pointer is the user's responsibility.
1404 clear() _GLIBCXX_NOEXCEPT
1410 // [23.2.2.4] list operations
1412 * @brief Insert contents of another %list.
1413 * @param __position Iterator referencing the element to insert before.
1414 * @param __x Source list.
1416 * The elements of @a __x are inserted in constant time in front of
1417 * the element referenced by @a __position. @a __x becomes an empty
1420 * Requires this != @a __x.
1423 #if __cplusplus >= 201103L
1424 splice(const_iterator __position
, list
&& __x
) noexcept
1426 splice(iterator __position
, list
& __x
)
1431 _M_check_equal_allocators(__x
);
1433 this->_M_transfer(__position
._M_const_cast(),
1434 __x
.begin(), __x
.end());
1436 this->_M_inc_size(__x
._M_get_size());
1441 #if __cplusplus >= 201103L
1443 splice(const_iterator __position
, list
& __x
) noexcept
1444 { splice(__position
, std::move(__x
)); }
1447 #if __cplusplus >= 201103L
1449 * @brief Insert element from another %list.
1450 * @param __position Const_iterator referencing the element to
1452 * @param __x Source list.
1453 * @param __i Const_iterator referencing the element to move.
1455 * Removes the element in list @a __x referenced by @a __i and
1456 * inserts it into the current list before @a __position.
1459 splice(const_iterator __position
, list
&& __x
, const_iterator __i
) noexcept
1462 * @brief Insert element from another %list.
1463 * @param __position Iterator referencing the element to insert before.
1464 * @param __x Source list.
1465 * @param __i Iterator referencing the element to move.
1467 * Removes the element in list @a __x referenced by @a __i and
1468 * inserts it into the current list before @a __position.
1471 splice(iterator __position
, list
& __x
, iterator __i
)
1474 iterator __j
= __i
._M_const_cast();
1476 if (__position
== __i
|| __position
== __j
)
1479 if (this != std::__addressof(__x
))
1480 _M_check_equal_allocators(__x
);
1482 this->_M_transfer(__position
._M_const_cast(),
1483 __i
._M_const_cast(), __j
);
1485 this->_M_inc_size(1);
1489 #if __cplusplus >= 201103L
1491 * @brief Insert element from another %list.
1492 * @param __position Const_iterator referencing the element to
1494 * @param __x Source list.
1495 * @param __i Const_iterator referencing the element to move.
1497 * Removes the element in list @a __x referenced by @a __i and
1498 * inserts it into the current list before @a __position.
1501 splice(const_iterator __position
, list
& __x
, const_iterator __i
) noexcept
1502 { splice(__position
, std::move(__x
), __i
); }
1505 #if __cplusplus >= 201103L
1507 * @brief Insert range from another %list.
1508 * @param __position Const_iterator referencing the element to
1510 * @param __x Source list.
1511 * @param __first Const_iterator referencing the start of range in x.
1512 * @param __last Const_iterator referencing the end of range in x.
1514 * Removes elements in the range [__first,__last) and inserts them
1515 * before @a __position in constant time.
1517 * Undefined if @a __position is in [__first,__last).
1520 splice(const_iterator __position
, list
&& __x
, const_iterator __first
,
1521 const_iterator __last
) noexcept
1524 * @brief Insert range from another %list.
1525 * @param __position Iterator referencing the element to insert before.
1526 * @param __x Source list.
1527 * @param __first Iterator referencing the start of range in x.
1528 * @param __last Iterator referencing the end of range in x.
1530 * Removes elements in the range [__first,__last) and inserts them
1531 * before @a __position in constant time.
1533 * Undefined if @a __position is in [__first,__last).
1536 splice(iterator __position
, list
& __x
, iterator __first
,
1540 if (__first
!= __last
)
1542 if (this != std::__addressof(__x
))
1543 _M_check_equal_allocators(__x
);
1545 size_t __n
= this->_M_distance(__first
._M_node
, __last
._M_node
);
1546 this->_M_inc_size(__n
);
1547 __x
._M_dec_size(__n
);
1549 this->_M_transfer(__position
._M_const_cast(),
1550 __first
._M_const_cast(),
1551 __last
._M_const_cast());
1555 #if __cplusplus >= 201103L
1557 * @brief Insert range from another %list.
1558 * @param __position Const_iterator referencing the element to
1560 * @param __x Source list.
1561 * @param __first Const_iterator referencing the start of range in x.
1562 * @param __last Const_iterator referencing the end of range in x.
1564 * Removes elements in the range [__first,__last) and inserts them
1565 * before @a __position in constant time.
1567 * Undefined if @a __position is in [__first,__last).
1570 splice(const_iterator __position
, list
& __x
, const_iterator __first
,
1571 const_iterator __last
) noexcept
1572 { splice(__position
, std::move(__x
), __first
, __last
); }
1576 * @brief Remove all elements equal to value.
1577 * @param __value The value to remove.
1579 * Removes every element in the list equal to @a value.
1580 * Remaining elements stay in list order. Note that this
1581 * function only erases the elements, and that if the elements
1582 * themselves are pointers, the pointed-to memory is not
1583 * touched in any way. Managing the pointer is the user's
1587 remove(const _Tp
& __value
);
1590 * @brief Remove all elements satisfying a predicate.
1591 * @tparam _Predicate Unary predicate function or object.
1593 * Removes every element in the list for which the predicate
1594 * returns true. Remaining elements stay in list order. Note
1595 * that this function only erases the elements, and that if the
1596 * elements themselves are pointers, the pointed-to memory is
1597 * not touched in any way. Managing the pointer is the user's
1600 template<typename _Predicate
>
1602 remove_if(_Predicate
);
1605 * @brief Remove consecutive duplicate elements.
1607 * For each consecutive set of elements with the same value,
1608 * remove all but the first one. Remaining elements stay in
1609 * list order. Note that this function only erases the
1610 * elements, and that if the elements themselves are pointers,
1611 * the pointed-to memory is not touched in any way. Managing
1612 * the pointer is the user's responsibility.
1618 * @brief Remove consecutive elements satisfying a predicate.
1619 * @tparam _BinaryPredicate Binary predicate function or object.
1621 * For each consecutive set of elements [first,last) that
1622 * satisfy predicate(first,i) where i is an iterator in
1623 * [first,last), remove all but the first one. Remaining
1624 * elements stay in list order. Note that this function only
1625 * erases the elements, and that if the elements themselves are
1626 * pointers, the pointed-to memory is not touched in any way.
1627 * Managing the pointer is the user's responsibility.
1629 template<typename _BinaryPredicate
>
1631 unique(_BinaryPredicate
);
1634 * @brief Merge sorted lists.
1635 * @param __x Sorted list to merge.
1637 * Assumes that both @a __x and this list are sorted according to
1638 * operator<(). Merges elements of @a __x into this list in
1639 * sorted order, leaving @a __x empty when complete. Elements in
1640 * this list precede elements in @a __x that are equal.
1642 #if __cplusplus >= 201103L
1648 { merge(std::move(__x
)); }
1655 * @brief Merge sorted lists according to comparison function.
1656 * @tparam _StrictWeakOrdering Comparison function defining
1658 * @param __x Sorted list to merge.
1659 * @param __comp Comparison functor.
1661 * Assumes that both @a __x and this list are sorted according to
1662 * StrictWeakOrdering. Merges elements of @a __x into this list
1663 * in sorted order, leaving @a __x empty when complete. Elements
1664 * in this list precede elements in @a __x that are equivalent
1665 * according to StrictWeakOrdering().
1667 #if __cplusplus >= 201103L
1668 template<typename _StrictWeakOrdering
>
1670 merge(list
&& __x
, _StrictWeakOrdering __comp
);
1672 template<typename _StrictWeakOrdering
>
1674 merge(list
& __x
, _StrictWeakOrdering __comp
)
1675 { merge(std::move(__x
), __comp
); }
1677 template<typename _StrictWeakOrdering
>
1679 merge(list
& __x
, _StrictWeakOrdering __comp
);
1683 * @brief Reverse the elements in list.
1685 * Reverse the order of elements in the list in linear time.
1688 reverse() _GLIBCXX_NOEXCEPT
1689 { this->_M_impl
._M_node
._M_reverse(); }
1692 * @brief Sort the elements.
1694 * Sorts the elements of this list in NlogN time. Equivalent
1695 * elements remain in list order.
1701 * @brief Sort the elements according to comparison function.
1703 * Sorts the elements of this list in NlogN time. Equivalent
1704 * elements remain in list order.
1706 template<typename _StrictWeakOrdering
>
1708 sort(_StrictWeakOrdering
);
1711 // Internal constructor functions follow.
1713 // Called by the range constructor to implement [23.1.1]/9
1715 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1716 // 438. Ambiguity in the "do the right thing" clause
1717 template<typename _Integer
>
1719 _M_initialize_dispatch(_Integer __n
, _Integer __x
, __true_type
)
1720 { _M_fill_initialize(static_cast<size_type
>(__n
), __x
); }
1722 // Called by the range constructor to implement [23.1.1]/9
1723 template<typename _InputIterator
>
1725 _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
1728 for (; __first
!= __last
; ++__first
)
1729 #if __cplusplus >= 201103L
1730 emplace_back(*__first
);
1732 push_back(*__first
);
1736 // Called by list(n,v,a), and the range constructor when it turns out
1737 // to be the same thing.
1739 _M_fill_initialize(size_type __n
, const value_type
& __x
)
1745 #if __cplusplus >= 201103L
1746 // Called by list(n).
1748 _M_default_initialize(size_type __n
)
1754 // Called by resize(sz).
1756 _M_default_append(size_type __n
);
1759 // Internal assign functions follow.
1761 // Called by the range assign to implement [23.1.1]/9
1763 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1764 // 438. Ambiguity in the "do the right thing" clause
1765 template<typename _Integer
>
1767 _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
1768 { _M_fill_assign(__n
, __val
); }
1770 // Called by the range assign to implement [23.1.1]/9
1771 template<typename _InputIterator
>
1773 _M_assign_dispatch(_InputIterator __first
, _InputIterator __last
,
1776 // Called by assign(n,t), and the range assign when it turns out
1777 // to be the same thing.
1779 _M_fill_assign(size_type __n
, const value_type
& __val
);
1782 // Moves the elements from [first,last) before position.
1784 _M_transfer(iterator __position
, iterator __first
, iterator __last
)
1785 { __position
._M_node
->_M_transfer(__first
._M_node
, __last
._M_node
); }
1787 // Inserts new element at position given and with value given.
1788 #if __cplusplus < 201103L
1790 _M_insert(iterator __position
, const value_type
& __x
)
1792 _Node
* __tmp
= _M_create_node(__x
);
1793 __tmp
->_M_hook(__position
._M_node
);
1794 this->_M_inc_size(1);
1797 template<typename
... _Args
>
1799 _M_insert(iterator __position
, _Args
&&... __args
)
1801 _Node
* __tmp
= _M_create_node(std::forward
<_Args
>(__args
)...);
1802 __tmp
->_M_hook(__position
._M_node
);
1803 this->_M_inc_size(1);
1807 // Erases element at position given.
1809 _M_erase(iterator __position
) _GLIBCXX_NOEXCEPT
1811 this->_M_dec_size(1);
1812 __position
._M_node
->_M_unhook();
1813 _Node
* __n
= static_cast<_Node
*>(__position
._M_node
);
1814 #if __cplusplus >= 201103L
1815 _Node_alloc_traits::destroy(_M_get_Node_allocator(), __n
->_M_valptr());
1817 _Tp_alloc_type(_M_get_Node_allocator()).destroy(__n
->_M_valptr());
1823 // To implement the splice (and merge) bits of N1599.
1825 _M_check_equal_allocators(list
& __x
) _GLIBCXX_NOEXCEPT
1827 if (std::__alloc_neq
<typename
_Base::_Node_alloc_type
>::
1828 _S_do_it(_M_get_Node_allocator(), __x
._M_get_Node_allocator()))
1832 // Used to implement resize.
1834 _M_resize_pos(size_type
& __new_size
) const;
1836 #if __cplusplus >= 201103L
1838 _M_move_assign(list
&& __x
, true_type
) noexcept
1845 this->_M_impl
._M_node
._M_next
= __x
._M_impl
._M_node
._M_next
;
1846 this->_M_impl
._M_node
._M_next
->_M_prev
= &this->_M_impl
._M_node
;
1847 this->_M_impl
._M_node
._M_prev
= __x
._M_impl
._M_node
._M_prev
;
1848 this->_M_impl
._M_node
._M_prev
->_M_next
= &this->_M_impl
._M_node
;
1849 this->_M_set_size(__x
._M_get_size());
1852 std::__alloc_on_move(this->_M_get_Node_allocator(),
1853 __x
._M_get_Node_allocator());
1857 _M_move_assign(list
&& __x
, false_type
)
1859 if (__x
._M_get_Node_allocator() == this->_M_get_Node_allocator())
1860 _M_move_assign(std::move(__x
), true_type
{});
1862 // The rvalue's allocator cannot be moved, or is not equal,
1863 // so we need to individually move each element.
1864 _M_assign_dispatch(std::__make_move_if_noexcept_iterator(__x
.begin()),
1865 std::__make_move_if_noexcept_iterator(__x
.end()),
1870 _GLIBCXX_END_NAMESPACE_CXX11
1873 * @brief List equality comparison.
1874 * @param __x A %list.
1875 * @param __y A %list of the same type as @a __x.
1876 * @return True iff the size and elements of the lists are equal.
1878 * This is an equivalence relation. It is linear in the size of
1879 * the lists. Lists are considered equivalent if their sizes are
1880 * equal, and if corresponding elements compare equal.
1882 template<typename _Tp
, typename _Alloc
>
1884 operator==(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1886 #if _GLIBCXX_USE_CXX11_ABI
1887 if (__x
.size() != __y
.size())
1891 typedef typename list
<_Tp
, _Alloc
>::const_iterator const_iterator
;
1892 const_iterator __end1
= __x
.end();
1893 const_iterator __end2
= __y
.end();
1895 const_iterator __i1
= __x
.begin();
1896 const_iterator __i2
= __y
.begin();
1897 while (__i1
!= __end1
&& __i2
!= __end2
&& *__i1
== *__i2
)
1902 return __i1
== __end1
&& __i2
== __end2
;
1906 * @brief List ordering relation.
1907 * @param __x A %list.
1908 * @param __y A %list of the same type as @a __x.
1909 * @return True iff @a __x is lexicographically less than @a __y.
1911 * This is a total ordering relation. It is linear in the size of the
1912 * lists. The elements must be comparable with @c <.
1914 * See std::lexicographical_compare() for how the determination is made.
1916 template<typename _Tp
, typename _Alloc
>
1918 operator<(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1919 { return std::lexicographical_compare(__x
.begin(), __x
.end(),
1920 __y
.begin(), __y
.end()); }
1922 /// Based on operator==
1923 template<typename _Tp
, typename _Alloc
>
1925 operator!=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1926 { return !(__x
== __y
); }
1928 /// Based on operator<
1929 template<typename _Tp
, typename _Alloc
>
1931 operator>(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1932 { return __y
< __x
; }
1934 /// Based on operator<
1935 template<typename _Tp
, typename _Alloc
>
1937 operator<=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1938 { return !(__y
< __x
); }
1940 /// Based on operator<
1941 template<typename _Tp
, typename _Alloc
>
1943 operator>=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1944 { return !(__x
< __y
); }
1946 /// See std::list::swap().
1947 template<typename _Tp
, typename _Alloc
>
1949 swap(list
<_Tp
, _Alloc
>& __x
, list
<_Tp
, _Alloc
>& __y
)
1950 _GLIBCXX_NOEXCEPT_IF(noexcept(__x
.swap(__y
)))
1953 _GLIBCXX_END_NAMESPACE_CONTAINER
1955 #if _GLIBCXX_USE_CXX11_ABI
1956 _GLIBCXX_BEGIN_NAMESPACE_VERSION
1958 // Detect when distance is used to compute the size of the whole list.
1959 template<typename _Tp
>
1961 __distance(_GLIBCXX_STD_C::_List_iterator
<_Tp
> __first
,
1962 _GLIBCXX_STD_C::_List_iterator
<_Tp
> __last
,
1963 input_iterator_tag __tag
)
1965 typedef _GLIBCXX_STD_C::_List_const_iterator
<_Tp
> _CIter
;
1966 return std::__distance(_CIter(__first
), _CIter(__last
), __tag
);
1969 template<typename _Tp
>
1971 __distance(_GLIBCXX_STD_C::_List_const_iterator
<_Tp
> __first
,
1972 _GLIBCXX_STD_C::_List_const_iterator
<_Tp
> __last
,
1975 typedef _GLIBCXX_STD_C::_List_node
<size_t> _Sentinel
;
1976 _GLIBCXX_STD_C::_List_const_iterator
<_Tp
> __beyond
= __last
;
1978 bool __whole
= __first
== __beyond
;
1979 if (__builtin_constant_p (__whole
) && __whole
)
1980 return *static_cast<const _Sentinel
*>(__last
._M_node
)->_M_valptr();
1983 while (__first
!= __last
)
1991 _GLIBCXX_END_NAMESPACE_VERSION
1995 #endif /* _STL_LIST_H */