1 // List implementation -*- C++ -*-
3 // Copyright (C) 2001-2014 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 #if __cplusplus >= 201103L
61 #include <initializer_list>
64 namespace std
_GLIBCXX_VISIBILITY(default)
68 _GLIBCXX_BEGIN_NAMESPACE_VERSION
70 // Supporting structures are split into common and templated
71 // types; the latter publicly inherits from the former in an
72 // effort to reduce code duplication. This results in some
73 // "needless" static_cast'ing later on, but it's all safe
76 /// Common part of a node in the %list.
77 struct _List_node_base
79 _List_node_base
* _M_next
;
80 _List_node_base
* _M_prev
;
83 swap(_List_node_base
& __x
, _List_node_base
& __y
) _GLIBCXX_USE_NOEXCEPT
;
86 _M_transfer(_List_node_base
* const __first
,
87 _List_node_base
* const __last
) _GLIBCXX_USE_NOEXCEPT
;
90 _M_reverse() _GLIBCXX_USE_NOEXCEPT
;
93 _M_hook(_List_node_base
* const __position
) _GLIBCXX_USE_NOEXCEPT
;
96 _M_unhook() _GLIBCXX_USE_NOEXCEPT
;
99 _GLIBCXX_END_NAMESPACE_VERSION
100 } // namespace detail
102 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
104 /// An actual node in the %list.
105 template<typename _Tp
>
106 struct _List_node
: public __detail::_List_node_base
111 #if __cplusplus >= 201103L
112 template<typename
... _Args
>
113 _List_node(_Args
&&... __args
)
114 : __detail::_List_node_base(), _M_data(std::forward
<_Args
>(__args
)...)
120 * @brief A list::iterator.
122 * All the functions are op overloads.
124 template<typename _Tp
>
125 struct _List_iterator
127 typedef _List_iterator
<_Tp
> _Self
;
128 typedef _List_node
<_Tp
> _Node
;
130 typedef ptrdiff_t difference_type
;
131 typedef std::bidirectional_iterator_tag iterator_category
;
132 typedef _Tp value_type
;
133 typedef _Tp
* pointer
;
134 typedef _Tp
& reference
;
136 _List_iterator() _GLIBCXX_NOEXCEPT
140 _List_iterator(__detail::_List_node_base
* __x
) _GLIBCXX_NOEXCEPT
144 _M_const_cast() const _GLIBCXX_NOEXCEPT
147 // Must downcast from _List_node_base to _List_node to get to _M_data.
149 operator*() const _GLIBCXX_NOEXCEPT
150 { return static_cast<_Node
*>(_M_node
)->_M_data
; }
153 operator->() const _GLIBCXX_NOEXCEPT
154 { return std::__addressof(static_cast<_Node
*>(_M_node
)->_M_data
); }
157 operator++() _GLIBCXX_NOEXCEPT
159 _M_node
= _M_node
->_M_next
;
164 operator++(int) _GLIBCXX_NOEXCEPT
167 _M_node
= _M_node
->_M_next
;
172 operator--() _GLIBCXX_NOEXCEPT
174 _M_node
= _M_node
->_M_prev
;
179 operator--(int) _GLIBCXX_NOEXCEPT
182 _M_node
= _M_node
->_M_prev
;
187 operator==(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
188 { return _M_node
== __x
._M_node
; }
191 operator!=(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
192 { return _M_node
!= __x
._M_node
; }
194 // The only member points to the %list element.
195 __detail::_List_node_base
* _M_node
;
199 * @brief A list::const_iterator.
201 * All the functions are op overloads.
203 template<typename _Tp
>
204 struct _List_const_iterator
206 typedef _List_const_iterator
<_Tp
> _Self
;
207 typedef const _List_node
<_Tp
> _Node
;
208 typedef _List_iterator
<_Tp
> iterator
;
210 typedef ptrdiff_t difference_type
;
211 typedef std::bidirectional_iterator_tag iterator_category
;
212 typedef _Tp value_type
;
213 typedef const _Tp
* pointer
;
214 typedef const _Tp
& reference
;
216 _List_const_iterator() _GLIBCXX_NOEXCEPT
220 _List_const_iterator(const __detail::_List_node_base
* __x
)
224 _List_const_iterator(const iterator
& __x
) _GLIBCXX_NOEXCEPT
225 : _M_node(__x
._M_node
) { }
228 _M_const_cast() const _GLIBCXX_NOEXCEPT
229 { return iterator(const_cast<__detail::_List_node_base
*>(_M_node
)); }
231 // Must downcast from List_node_base to _List_node to get to
234 operator*() const _GLIBCXX_NOEXCEPT
235 { return static_cast<_Node
*>(_M_node
)->_M_data
; }
238 operator->() const _GLIBCXX_NOEXCEPT
239 { return std::__addressof(static_cast<_Node
*>(_M_node
)->_M_data
); }
242 operator++() _GLIBCXX_NOEXCEPT
244 _M_node
= _M_node
->_M_next
;
249 operator++(int) _GLIBCXX_NOEXCEPT
252 _M_node
= _M_node
->_M_next
;
257 operator--() _GLIBCXX_NOEXCEPT
259 _M_node
= _M_node
->_M_prev
;
264 operator--(int) _GLIBCXX_NOEXCEPT
267 _M_node
= _M_node
->_M_prev
;
272 operator==(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
273 { return _M_node
== __x
._M_node
; }
276 operator!=(const _Self
& __x
) const _GLIBCXX_NOEXCEPT
277 { return _M_node
!= __x
._M_node
; }
279 // The only member points to the %list element.
280 const __detail::_List_node_base
* _M_node
;
283 template<typename _Val
>
285 operator==(const _List_iterator
<_Val
>& __x
,
286 const _List_const_iterator
<_Val
>& __y
) _GLIBCXX_NOEXCEPT
287 { return __x
._M_node
== __y
._M_node
; }
289 template<typename _Val
>
291 operator!=(const _List_iterator
<_Val
>& __x
,
292 const _List_const_iterator
<_Val
>& __y
) _GLIBCXX_NOEXCEPT
293 { return __x
._M_node
!= __y
._M_node
; }
295 _GLIBCXX_BEGIN_NAMESPACE_CXX11
296 /// See bits/stl_deque.h's _Deque_base for an explanation.
297 template<typename _Tp
, typename _Alloc
>
302 // The stored instance is not actually of "allocator_type"'s
303 // type. Instead we rebind the type to
304 // Allocator<List_node<Tp>>, which according to [20.1.5]/4
305 // should probably be the same. List_node<Tp> is not the same
306 // size as Tp (it's two pointers larger), and specializations on
307 // Tp may go unused because List_node<Tp> is being bound
310 // We put this to the test in the constructors and in
311 // get_allocator, where we use conversions between
312 // allocator_type and _Node_alloc_type. The conversion is
313 // required by table 32 in [20.1.5].
314 typedef typename
_Alloc::template rebind
<_List_node
<_Tp
> >::other
317 typedef typename
_Alloc::template rebind
<_Tp
>::other _Tp_alloc_type
;
320 _S_distance(const __detail::_List_node_base
* __first
,
321 const __detail::_List_node_base
* __last
)
324 while (__first
!= __last
)
326 __first
= __first
->_M_next
;
333 : public _Node_alloc_type
335 #if _GLIBCXX_USE_CXX11_ABI
336 _List_node
<size_t> _M_node
;
338 __detail::_List_node_base _M_node
;
342 : _Node_alloc_type(), _M_node()
345 _List_impl(const _Node_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
346 : _Node_alloc_type(__a
), _M_node()
349 #if __cplusplus >= 201103L
350 _List_impl(_Node_alloc_type
&& __a
) _GLIBCXX_NOEXCEPT
351 : _Node_alloc_type(std::move(__a
)), _M_node()
358 #if _GLIBCXX_USE_CXX11_ABI
359 size_t _M_get_size() const { return _M_impl
._M_node
._M_data
; }
361 void _M_set_size(size_t __n
) { _M_impl
._M_node
._M_data
= __n
; }
363 void _M_inc_size(size_t __n
) { _M_impl
._M_node
._M_data
+= __n
; }
365 void _M_dec_size(size_t __n
) { _M_impl
._M_node
._M_data
-= __n
; }
368 _M_distance(const __detail::_List_node_base
* __first
,
369 const __detail::_List_node_base
* __last
) const
370 { return _S_distance(__first
, __last
); }
372 // return the stored size
373 size_t _M_node_count() const { return _M_impl
._M_node
._M_data
; }
375 // dummy implementations used when the size is not stored
376 size_t _M_get_size() const { return 0; }
377 void _M_set_size(size_t) { }
378 void _M_inc_size(size_t) { }
379 void _M_dec_size(size_t) { }
380 size_t _M_distance(const void*, const void*) const { return 0; }
382 // count the number of nodes
383 size_t _M_node_count() const
385 return _S_distance(_M_impl
._M_node
._M_next
,
386 std::__addressof(_M_impl
._M_node
));
392 { return _M_impl
._Node_alloc_type::allocate(1); }
395 _M_put_node(_List_node
<_Tp
>* __p
) _GLIBCXX_NOEXCEPT
396 { _M_impl
._Node_alloc_type::deallocate(__p
, 1); }
399 typedef _Alloc allocator_type
;
402 _M_get_Node_allocator() _GLIBCXX_NOEXCEPT
403 { return *static_cast<_Node_alloc_type
*>(&_M_impl
); }
405 const _Node_alloc_type
&
406 _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT
407 { return *static_cast<const _Node_alloc_type
*>(&_M_impl
); }
410 _M_get_Tp_allocator() const _GLIBCXX_NOEXCEPT
411 { return _Tp_alloc_type(_M_get_Node_allocator()); }
414 get_allocator() const _GLIBCXX_NOEXCEPT
415 { return allocator_type(_M_get_Node_allocator()); }
421 _List_base(const _Node_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
425 #if __cplusplus >= 201103L
426 _List_base(_List_base
&& __x
) noexcept
427 : _M_impl(std::move(__x
._M_get_Node_allocator()))
429 auto* const __xnode
= std::__addressof(__x
._M_impl
._M_node
);
430 if (__xnode
->_M_next
== __xnode
)
434 auto* const __node
= std::__addressof(_M_impl
._M_node
);
435 __node
->_M_next
= __xnode
->_M_next
;
436 __node
->_M_prev
= __xnode
->_M_prev
;
437 __node
->_M_next
->_M_prev
= __node
->_M_prev
->_M_next
= __node
;
438 _M_set_size(__x
._M_get_size());
444 // This is what actually destroys the list.
445 ~_List_base() _GLIBCXX_NOEXCEPT
449 _M_clear() _GLIBCXX_NOEXCEPT
;
452 _M_init() _GLIBCXX_NOEXCEPT
454 this->_M_impl
._M_node
._M_next
= &this->_M_impl
._M_node
;
455 this->_M_impl
._M_node
._M_prev
= &this->_M_impl
._M_node
;
461 * @brief A standard container with linear time access to elements,
462 * and fixed time insertion/deletion at any point in the sequence.
466 * @tparam _Tp Type of element.
467 * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.
469 * Meets the requirements of a <a href="tables.html#65">container</a>, a
470 * <a href="tables.html#66">reversible container</a>, and a
471 * <a href="tables.html#67">sequence</a>, including the
472 * <a href="tables.html#68">optional sequence requirements</a> with the
473 * %exception of @c at and @c operator[].
475 * This is a @e doubly @e linked %list. Traversal up and down the
476 * %list requires linear time, but adding and removing elements (or
477 * @e nodes) is done in constant time, regardless of where the
478 * change takes place. Unlike std::vector and std::deque,
479 * random-access iterators are not provided, so subscripting ( @c
480 * [] ) access is not allowed. For algorithms which only need
481 * sequential access, this lack makes no difference.
483 * Also unlike the other standard containers, std::list provides
484 * specialized algorithms %unique to linked lists, such as
485 * splicing, sorting, and in-place reversal.
487 * A couple points on memory allocation for list<Tp>:
489 * First, we never actually allocate a Tp, we allocate
490 * List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure
491 * that after elements from %list<X,Alloc1> are spliced into
492 * %list<X,Alloc2>, destroying the memory of the second %list is a
493 * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.
495 * Second, a %list conceptually represented as
497 * A <---> B <---> C <---> D
499 * is actually circular; a link exists between A and D. The %list
500 * class holds (as its only data member) a private list::iterator
501 * pointing to @e D, not to @e A! To get to the head of the %list,
502 * we start at the tail and move forward by one. When this member
503 * iterator's next/previous pointers refer to itself, the %list is
506 template<typename _Tp
, typename _Alloc
= std::allocator
<_Tp
> >
507 class list
: protected _List_base
<_Tp
, _Alloc
>
509 // concept requirements
510 typedef typename
_Alloc::value_type _Alloc_value_type
;
511 __glibcxx_class_requires(_Tp
, _SGIAssignableConcept
)
512 __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::_Node_alloc_type _Node_alloc_type
;
519 typedef _Tp value_type
;
520 typedef typename
_Tp_alloc_type::pointer pointer
;
521 typedef typename
_Tp_alloc_type::const_pointer const_pointer
;
522 typedef typename
_Tp_alloc_type::reference reference
;
523 typedef typename
_Tp_alloc_type::const_reference const_reference
;
524 typedef _List_iterator
<_Tp
> iterator
;
525 typedef _List_const_iterator
<_Tp
> const_iterator
;
526 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
527 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
528 typedef size_t size_type
;
529 typedef ptrdiff_t difference_type
;
530 typedef _Alloc allocator_type
;
533 // Note that pointers-to-_Node's can be ctor-converted to
535 typedef _List_node
<_Tp
> _Node
;
537 using _Base::_M_impl
;
538 using _Base::_M_put_node
;
539 using _Base::_M_get_node
;
540 using _Base::_M_get_Tp_allocator
;
541 using _Base::_M_get_Node_allocator
;
544 * @param __args An instance of user data.
546 * Allocates space for a new node and constructs a copy of
549 #if __cplusplus < 201103L
551 _M_create_node(const value_type
& __x
)
553 _Node
* __p
= this->_M_get_node();
556 _M_get_Tp_allocator().construct
557 (std::__addressof(__p
->_M_data
), __x
);
562 __throw_exception_again
;
567 template<typename
... _Args
>
569 _M_create_node(_Args
&&... __args
)
571 _Node
* __p
= this->_M_get_node();
574 _M_get_Node_allocator().construct(__p
,
575 std::forward
<_Args
>(__args
)...);
580 __throw_exception_again
;
587 // [23.2.2.1] construct/copy/destroy
588 // (assign() and get_allocator() are also listed in this section)
591 * @brief Creates a %list with no elements.
594 #if __cplusplus >= 201103L
595 noexcept(is_nothrow_default_constructible
<_Node_alloc_type
>::value
)
600 * @brief Creates a %list with no elements.
601 * @param __a An allocator object.
604 list(const allocator_type
& __a
) _GLIBCXX_NOEXCEPT
605 : _Base(_Node_alloc_type(__a
)) { }
607 #if __cplusplus >= 201103L
609 * @brief Creates a %list with default constructed elements.
610 * @param __n The number of elements to initially create.
612 * This constructor fills the %list with @a __n default
613 * constructed elements.
618 { _M_default_initialize(__n
); }
621 * @brief Creates a %list with copies of an exemplar element.
622 * @param __n The number of elements to initially create.
623 * @param __value An element to copy.
624 * @param __a An allocator object.
626 * This constructor fills the %list with @a __n copies of @a __value.
628 list(size_type __n
, const value_type
& __value
,
629 const allocator_type
& __a
= allocator_type())
630 : _Base(_Node_alloc_type(__a
))
631 { _M_fill_initialize(__n
, __value
); }
634 * @brief Creates a %list with copies of an exemplar element.
635 * @param __n The number of elements to initially create.
636 * @param __value An element to copy.
637 * @param __a An allocator object.
639 * This constructor fills the %list with @a __n copies of @a __value.
642 list(size_type __n
, const value_type
& __value
= value_type(),
643 const allocator_type
& __a
= allocator_type())
644 : _Base(_Node_alloc_type(__a
))
645 { _M_fill_initialize(__n
, __value
); }
649 * @brief %List copy constructor.
650 * @param __x A %list of identical element and allocator types.
652 * The newly-created %list uses a copy of the allocation object used
655 list(const list
& __x
)
656 : _Base(__x
._M_get_Node_allocator())
657 { _M_initialize_dispatch(__x
.begin(), __x
.end(), __false_type()); }
659 #if __cplusplus >= 201103L
661 * @brief %List move constructor.
662 * @param __x A %list of identical element and allocator types.
664 * The newly-created %list contains the exact contents of @a __x.
665 * The contents of @a __x are a valid, but unspecified %list.
667 list(list
&& __x
) noexcept
668 : _Base(std::move(__x
)) { }
671 * @brief Builds a %list from an initializer_list
672 * @param __l An initializer_list of value_type.
673 * @param __a An allocator object.
675 * Create a %list consisting of copies of the elements in the
676 * initializer_list @a __l. This is linear in __l.size().
678 list(initializer_list
<value_type
> __l
,
679 const allocator_type
& __a
= allocator_type())
680 : _Base(_Node_alloc_type(__a
))
681 { _M_initialize_dispatch(__l
.begin(), __l
.end(), __false_type()); }
685 * @brief Builds a %list from a range.
686 * @param __first An input iterator.
687 * @param __last An input iterator.
688 * @param __a An allocator object.
690 * Create a %list consisting of copies of the elements from
691 * [@a __first,@a __last). This is linear in N (where N is
692 * distance(@a __first,@a __last)).
694 #if __cplusplus >= 201103L
695 template<typename _InputIterator
,
696 typename
= std::_RequireInputIter
<_InputIterator
>>
697 list(_InputIterator __first
, _InputIterator __last
,
698 const allocator_type
& __a
= allocator_type())
699 : _Base(_Node_alloc_type(__a
))
700 { _M_initialize_dispatch(__first
, __last
, __false_type()); }
702 template<typename _InputIterator
>
703 list(_InputIterator __first
, _InputIterator __last
,
704 const allocator_type
& __a
= allocator_type())
705 : _Base(_Node_alloc_type(__a
))
707 // Check whether it's an integral type. If so, it's not an iterator.
708 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
709 _M_initialize_dispatch(__first
, __last
, _Integral());
714 * No explicit dtor needed as the _Base dtor takes care of
715 * things. The _Base dtor only erases the elements, and note
716 * that if the elements themselves are pointers, the pointed-to
717 * memory is not touched in any way. Managing the pointer is
718 * the user's responsibility.
722 * @brief %List assignment operator.
723 * @param __x A %list of identical element and allocator types.
725 * All the elements of @a __x are copied, but unlike the copy
726 * constructor, the allocator object is not copied.
729 operator=(const list
& __x
);
731 #if __cplusplus >= 201103L
733 * @brief %List move assignment operator.
734 * @param __x A %list of identical element and allocator types.
736 * The contents of @a __x are moved into this %list (without copying).
737 * @a __x is a valid, but unspecified %list
740 operator=(list
&& __x
)
750 * @brief %List initializer list assignment operator.
751 * @param __l An initializer_list of value_type.
753 * Replace the contents of the %list with copies of the elements
754 * in the initializer_list @a __l. This is linear in l.size().
757 operator=(initializer_list
<value_type
> __l
)
759 this->assign(__l
.begin(), __l
.end());
765 * @brief Assigns a given value to a %list.
766 * @param __n Number of elements to be assigned.
767 * @param __val Value to be assigned.
769 * This function fills a %list with @a __n copies of the given
770 * value. Note that the assignment completely changes the %list
771 * and that the resulting %list's size is the same as the number
772 * of elements assigned. Old data may be lost.
775 assign(size_type __n
, const value_type
& __val
)
776 { _M_fill_assign(__n
, __val
); }
779 * @brief Assigns a range to a %list.
780 * @param __first An input iterator.
781 * @param __last An input iterator.
783 * This function fills a %list with copies of the elements in the
784 * range [@a __first,@a __last).
786 * Note that the assignment completely changes the %list and
787 * that the resulting %list's size is the same as the number of
788 * elements assigned. Old data may be lost.
790 #if __cplusplus >= 201103L
791 template<typename _InputIterator
,
792 typename
= std::_RequireInputIter
<_InputIterator
>>
794 assign(_InputIterator __first
, _InputIterator __last
)
795 { _M_assign_dispatch(__first
, __last
, __false_type()); }
797 template<typename _InputIterator
>
799 assign(_InputIterator __first
, _InputIterator __last
)
801 // Check whether it's an integral type. If so, it's not an iterator.
802 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
803 _M_assign_dispatch(__first
, __last
, _Integral());
807 #if __cplusplus >= 201103L
809 * @brief Assigns an initializer_list to a %list.
810 * @param __l An initializer_list of value_type.
812 * Replace the contents of the %list with copies of the elements
813 * in the initializer_list @a __l. This is linear in __l.size().
816 assign(initializer_list
<value_type
> __l
)
817 { this->assign(__l
.begin(), __l
.end()); }
820 /// Get a copy of the memory allocation object.
822 get_allocator() const _GLIBCXX_NOEXCEPT
823 { return _Base::get_allocator(); }
827 * Returns a read/write iterator that points to the first element in the
828 * %list. Iteration is done in ordinary element order.
831 begin() _GLIBCXX_NOEXCEPT
832 { return iterator(this->_M_impl
._M_node
._M_next
); }
835 * Returns a read-only (constant) iterator that points to the
836 * first element in the %list. Iteration is done in ordinary
840 begin() const _GLIBCXX_NOEXCEPT
841 { return const_iterator(this->_M_impl
._M_node
._M_next
); }
844 * Returns a read/write iterator that points one past the last
845 * element in the %list. Iteration is done in ordinary element
849 end() _GLIBCXX_NOEXCEPT
850 { return iterator(&this->_M_impl
._M_node
); }
853 * Returns a read-only (constant) iterator that points one past
854 * the last element in the %list. Iteration is done in ordinary
858 end() const _GLIBCXX_NOEXCEPT
859 { return const_iterator(&this->_M_impl
._M_node
); }
862 * Returns a read/write reverse iterator that points to the last
863 * element in the %list. Iteration is done in reverse element
867 rbegin() _GLIBCXX_NOEXCEPT
868 { return reverse_iterator(end()); }
871 * Returns a read-only (constant) reverse iterator that points to
872 * the last element in the %list. Iteration is done in reverse
875 const_reverse_iterator
876 rbegin() const _GLIBCXX_NOEXCEPT
877 { return const_reverse_iterator(end()); }
880 * Returns a read/write reverse iterator that points to one
881 * before the first element in the %list. Iteration is done in
882 * reverse element order.
885 rend() _GLIBCXX_NOEXCEPT
886 { return reverse_iterator(begin()); }
889 * Returns a read-only (constant) reverse iterator that points to one
890 * before the first element in the %list. Iteration is done in reverse
893 const_reverse_iterator
894 rend() const _GLIBCXX_NOEXCEPT
895 { return const_reverse_iterator(begin()); }
897 #if __cplusplus >= 201103L
899 * Returns a read-only (constant) iterator that points to the
900 * first element in the %list. Iteration is done in ordinary
904 cbegin() const noexcept
905 { return const_iterator(this->_M_impl
._M_node
._M_next
); }
908 * Returns a read-only (constant) iterator that points one past
909 * the last element in the %list. Iteration is done in ordinary
913 cend() const noexcept
914 { return const_iterator(&this->_M_impl
._M_node
); }
917 * Returns a read-only (constant) reverse iterator that points to
918 * the last element in the %list. Iteration is done in reverse
921 const_reverse_iterator
922 crbegin() const noexcept
923 { return const_reverse_iterator(end()); }
926 * Returns a read-only (constant) reverse iterator that points to one
927 * before the first element in the %list. Iteration is done in reverse
930 const_reverse_iterator
931 crend() const noexcept
932 { return const_reverse_iterator(begin()); }
935 // [23.2.2.2] capacity
937 * Returns true if the %list is empty. (Thus begin() would equal
941 empty() const _GLIBCXX_NOEXCEPT
942 { return this->_M_impl
._M_node
._M_next
== &this->_M_impl
._M_node
; }
944 /** Returns the number of elements in the %list. */
946 size() const _GLIBCXX_NOEXCEPT
947 { return this->_M_node_count(); }
949 /** Returns the size() of the largest possible %list. */
951 max_size() const _GLIBCXX_NOEXCEPT
952 { return _M_get_Node_allocator().max_size(); }
954 #if __cplusplus >= 201103L
956 * @brief Resizes the %list to the specified number of elements.
957 * @param __new_size Number of elements the %list should contain.
959 * This function will %resize the %list to the specified number
960 * of elements. If the number is smaller than the %list's
961 * current size the %list is truncated, otherwise default
962 * constructed elements are appended.
965 resize(size_type __new_size
);
968 * @brief Resizes the %list to the specified number of elements.
969 * @param __new_size Number of elements the %list should contain.
970 * @param __x Data with which new elements should be populated.
972 * This function will %resize the %list to the specified number
973 * of elements. If the number is smaller than the %list's
974 * current size the %list is truncated, otherwise the %list is
975 * extended and new elements are populated with given data.
978 resize(size_type __new_size
, const value_type
& __x
);
981 * @brief Resizes the %list to the specified number of elements.
982 * @param __new_size Number of elements the %list should contain.
983 * @param __x Data with which new elements should be populated.
985 * This function will %resize the %list to the specified number
986 * of elements. If the number is smaller than the %list's
987 * current size the %list is truncated, otherwise the %list is
988 * extended and new elements are populated with given data.
991 resize(size_type __new_size
, value_type __x
= value_type());
996 * Returns a read/write reference to the data at the first
997 * element of the %list.
1000 front() _GLIBCXX_NOEXCEPT
1001 { return *begin(); }
1004 * Returns a read-only (constant) reference to the data at the first
1005 * element of the %list.
1008 front() const _GLIBCXX_NOEXCEPT
1009 { return *begin(); }
1012 * Returns a read/write reference to the data at the last element
1016 back() _GLIBCXX_NOEXCEPT
1018 iterator __tmp
= end();
1024 * Returns a read-only (constant) reference to the data at the last
1025 * element of the %list.
1028 back() const _GLIBCXX_NOEXCEPT
1030 const_iterator __tmp
= end();
1035 // [23.2.2.3] modifiers
1037 * @brief Add data to the front of the %list.
1038 * @param __x Data to be added.
1040 * This is a typical stack operation. The function creates an
1041 * element at the front of the %list and assigns the given data
1042 * to it. Due to the nature of a %list this operation can be
1043 * done in constant time, and does not invalidate iterators and
1047 push_front(const value_type
& __x
)
1048 { this->_M_insert(begin(), __x
); }
1050 #if __cplusplus >= 201103L
1052 push_front(value_type
&& __x
)
1053 { this->_M_insert(begin(), std::move(__x
)); }
1055 template<typename
... _Args
>
1057 emplace_front(_Args
&&... __args
)
1058 { this->_M_insert(begin(), std::forward
<_Args
>(__args
)...); }
1062 * @brief Removes first element.
1064 * This is a typical stack operation. It shrinks the %list by
1065 * one. Due to the nature of a %list this operation can be done
1066 * in constant time, and only invalidates iterators/references to
1067 * the element being removed.
1069 * Note that no data is returned, and if the first element's data
1070 * is needed, it should be retrieved before pop_front() is
1074 pop_front() _GLIBCXX_NOEXCEPT
1075 { this->_M_erase(begin()); }
1078 * @brief Add data to the end of the %list.
1079 * @param __x Data to be added.
1081 * This is a typical stack operation. The function creates an
1082 * element at the end of the %list and assigns the given data to
1083 * it. Due to the nature of a %list this operation can be done
1084 * in constant time, and does not invalidate iterators and
1088 push_back(const value_type
& __x
)
1089 { this->_M_insert(end(), __x
); }
1091 #if __cplusplus >= 201103L
1093 push_back(value_type
&& __x
)
1094 { this->_M_insert(end(), std::move(__x
)); }
1096 template<typename
... _Args
>
1098 emplace_back(_Args
&&... __args
)
1099 { this->_M_insert(end(), std::forward
<_Args
>(__args
)...); }
1103 * @brief Removes last element.
1105 * This is a typical stack operation. It shrinks the %list by
1106 * one. Due to the nature of a %list this operation can be done
1107 * in constant time, and only invalidates iterators/references to
1108 * the element being removed.
1110 * Note that no data is returned, and if the last element's data
1111 * is needed, it should be retrieved before pop_back() is called.
1114 pop_back() _GLIBCXX_NOEXCEPT
1115 { this->_M_erase(iterator(this->_M_impl
._M_node
._M_prev
)); }
1117 #if __cplusplus >= 201103L
1119 * @brief Constructs object in %list before specified iterator.
1120 * @param __position A const_iterator into the %list.
1121 * @param __args Arguments.
1122 * @return An iterator that points to the inserted data.
1124 * This function will insert an object of type T constructed
1125 * with T(std::forward<Args>(args)...) before the specified
1126 * location. Due to the nature of a %list this operation can
1127 * be done in constant time, and does not invalidate iterators
1130 template<typename
... _Args
>
1132 emplace(const_iterator __position
, _Args
&&... __args
);
1135 * @brief Inserts given value into %list before specified iterator.
1136 * @param __position A const_iterator into the %list.
1137 * @param __x Data to be inserted.
1138 * @return An iterator that points to the inserted data.
1140 * This function will insert a copy of the given value before
1141 * the specified location. Due to the nature of a %list this
1142 * operation can be done in constant time, and does not
1143 * invalidate iterators and references.
1146 insert(const_iterator __position
, const value_type
& __x
);
1149 * @brief Inserts given value into %list before specified iterator.
1150 * @param __position An iterator into the %list.
1151 * @param __x Data to be inserted.
1152 * @return An iterator that points to the inserted data.
1154 * This function will insert a copy of the given value before
1155 * the specified location. Due to the nature of a %list this
1156 * operation can be done in constant time, and does not
1157 * invalidate iterators and references.
1160 insert(iterator __position
, const value_type
& __x
);
1163 #if __cplusplus >= 201103L
1165 * @brief Inserts given rvalue into %list before specified iterator.
1166 * @param __position A const_iterator into the %list.
1167 * @param __x Data to be inserted.
1168 * @return An iterator that points to the inserted data.
1170 * This function will insert a copy of the given rvalue before
1171 * the specified location. Due to the nature of a %list this
1172 * operation can be done in constant time, and does not
1173 * invalidate iterators and references.
1176 insert(const_iterator __position
, value_type
&& __x
)
1177 { return emplace(__position
, std::move(__x
)); }
1180 * @brief Inserts the contents of an initializer_list into %list
1181 * before specified const_iterator.
1182 * @param __p A const_iterator into the %list.
1183 * @param __l An initializer_list of value_type.
1184 * @return An iterator pointing to the first element inserted
1187 * This function will insert copies of the data in the
1188 * initializer_list @a l into the %list before the location
1189 * specified by @a p.
1191 * This operation is linear in the number of elements inserted and
1192 * does not invalidate iterators and references.
1195 insert(const_iterator __p
, initializer_list
<value_type
> __l
)
1196 { return this->insert(__p
, __l
.begin(), __l
.end()); }
1199 #if __cplusplus >= 201103L
1201 * @brief Inserts a number of copies of given data into the %list.
1202 * @param __position A const_iterator into the %list.
1203 * @param __n Number of elements to be inserted.
1204 * @param __x Data to be inserted.
1205 * @return An iterator pointing to the first element inserted
1208 * This function will insert a specified number of copies of the
1209 * given data before the location specified by @a position.
1211 * This operation is linear in the number of elements inserted and
1212 * does not invalidate iterators and references.
1215 insert(const_iterator __position
, size_type __n
, const value_type
& __x
);
1218 * @brief Inserts a number of copies of given data into the %list.
1219 * @param __position An iterator into the %list.
1220 * @param __n Number of elements to be inserted.
1221 * @param __x Data to be inserted.
1223 * This function will insert a specified number of copies of the
1224 * given data before the location specified by @a position.
1226 * This operation is linear in the number of elements inserted and
1227 * does not invalidate iterators and references.
1230 insert(iterator __position
, size_type __n
, const value_type
& __x
)
1232 list
__tmp(__n
, __x
, get_allocator());
1233 splice(__position
, __tmp
);
1237 #if __cplusplus >= 201103L
1239 * @brief Inserts a range into the %list.
1240 * @param __position A const_iterator into the %list.
1241 * @param __first An input iterator.
1242 * @param __last An input iterator.
1243 * @return An iterator pointing to the first element inserted
1246 * This function will insert copies of the data in the range [@a
1247 * first,@a last) into the %list before the location specified by
1250 * This operation is linear in the number of elements inserted and
1251 * does not invalidate iterators and references.
1253 template<typename _InputIterator
,
1254 typename
= std::_RequireInputIter
<_InputIterator
>>
1256 insert(const_iterator __position
, _InputIterator __first
,
1257 _InputIterator __last
);
1260 * @brief Inserts a range into the %list.
1261 * @param __position An iterator into the %list.
1262 * @param __first An input iterator.
1263 * @param __last An input iterator.
1265 * This function will insert copies of the data in the range [@a
1266 * first,@a last) into the %list before the location specified by
1269 * This operation is linear in the number of elements inserted and
1270 * does not invalidate iterators and references.
1272 template<typename _InputIterator
>
1274 insert(iterator __position
, _InputIterator __first
,
1275 _InputIterator __last
)
1277 list
__tmp(__first
, __last
, get_allocator());
1278 splice(__position
, __tmp
);
1283 * @brief Remove element at given position.
1284 * @param __position Iterator pointing to element to be erased.
1285 * @return An iterator pointing to the next element (or end()).
1287 * This function will erase the element at the given position and thus
1288 * shorten the %list by one.
1290 * Due to the nature of a %list this operation can be done in
1291 * constant time, and only invalidates iterators/references to
1292 * the element being removed. The user is also cautioned that
1293 * this function only erases the element, and that if the element
1294 * is itself a pointer, the pointed-to memory is not touched in
1295 * any way. Managing the pointer is the user's responsibility.
1298 #if __cplusplus >= 201103L
1299 erase(const_iterator __position
) noexcept
;
1301 erase(iterator __position
);
1305 * @brief Remove a range of elements.
1306 * @param __first Iterator pointing to the first element to be erased.
1307 * @param __last Iterator pointing to one past the last element to be
1309 * @return An iterator pointing to the element pointed to by @a last
1310 * prior to erasing (or end()).
1312 * This function will erase the elements in the range @a
1313 * [first,last) and shorten the %list accordingly.
1315 * This operation is linear time in the size of the range and only
1316 * invalidates iterators/references to the element being removed.
1317 * The user is also cautioned that this function only erases the
1318 * elements, and that if the elements themselves are pointers, the
1319 * pointed-to memory is not touched in any way. Managing the pointer
1320 * is the user's responsibility.
1323 #if __cplusplus >= 201103L
1324 erase(const_iterator __first
, const_iterator __last
) noexcept
1326 erase(iterator __first
, iterator __last
)
1329 while (__first
!= __last
)
1330 __first
= erase(__first
);
1331 return __last
._M_const_cast();
1335 * @brief Swaps data with another %list.
1336 * @param __x A %list of the same element and allocator types.
1338 * This exchanges the elements between two lists in constant
1339 * time. Note that the global std::swap() function is
1340 * specialized such that std::swap(l1,l2) will feed to this
1346 __detail::_List_node_base::swap(this->_M_impl
._M_node
,
1347 __x
._M_impl
._M_node
);
1349 size_t __xsize
= __x
._M_get_size();
1350 __x
._M_set_size(this->_M_get_size());
1351 this->_M_set_size(__xsize
);
1353 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1354 // 431. Swapping containers with unequal allocators.
1355 std::__alloc_swap
<typename
_Base::_Node_alloc_type
>::
1356 _S_do_it(_M_get_Node_allocator(), __x
._M_get_Node_allocator());
1360 * Erases all the elements. Note that this function only erases
1361 * the elements, and that if the elements themselves are
1362 * pointers, the pointed-to memory is not touched in any way.
1363 * Managing the pointer is the user's responsibility.
1366 clear() _GLIBCXX_NOEXCEPT
1372 // [23.2.2.4] list operations
1374 * @brief Insert contents of another %list.
1375 * @param __position Iterator referencing the element to insert before.
1376 * @param __x Source list.
1378 * The elements of @a __x are inserted in constant time in front of
1379 * the element referenced by @a __position. @a __x becomes an empty
1382 * Requires this != @a __x.
1385 #if __cplusplus >= 201103L
1386 splice(const_iterator __position
, list
&& __x
) noexcept
1388 splice(iterator __position
, list
& __x
)
1393 _M_check_equal_allocators(__x
);
1395 this->_M_transfer(__position
._M_const_cast(),
1396 __x
.begin(), __x
.end());
1398 this->_M_inc_size(__x
._M_get_size());
1403 #if __cplusplus >= 201103L
1405 splice(const_iterator __position
, list
& __x
) noexcept
1406 { splice(__position
, std::move(__x
)); }
1409 #if __cplusplus >= 201103L
1411 * @brief Insert element from another %list.
1412 * @param __position Const_iterator referencing the element to
1414 * @param __x Source list.
1415 * @param __i Const_iterator referencing the element to move.
1417 * Removes the element in list @a __x referenced by @a __i and
1418 * inserts it into the current list before @a __position.
1421 splice(const_iterator __position
, list
&& __x
, const_iterator __i
) noexcept
1424 * @brief Insert element from another %list.
1425 * @param __position Iterator referencing the element to insert before.
1426 * @param __x Source list.
1427 * @param __i Iterator referencing the element to move.
1429 * Removes the element in list @a __x referenced by @a __i and
1430 * inserts it into the current list before @a __position.
1433 splice(iterator __position
, list
& __x
, iterator __i
)
1436 iterator __j
= __i
._M_const_cast();
1438 if (__position
== __i
|| __position
== __j
)
1442 _M_check_equal_allocators(__x
);
1444 this->_M_transfer(__position
._M_const_cast(),
1445 __i
._M_const_cast(), __j
);
1447 this->_M_inc_size(1);
1451 #if __cplusplus >= 201103L
1453 * @brief Insert element from another %list.
1454 * @param __position Const_iterator referencing the element to
1456 * @param __x Source list.
1457 * @param __i Const_iterator referencing the element to move.
1459 * Removes the element in list @a __x referenced by @a __i and
1460 * inserts it into the current list before @a __position.
1463 splice(const_iterator __position
, list
& __x
, const_iterator __i
) noexcept
1464 { splice(__position
, std::move(__x
), __i
); }
1467 #if __cplusplus >= 201103L
1469 * @brief Insert range from another %list.
1470 * @param __position Const_iterator referencing the element to
1472 * @param __x Source list.
1473 * @param __first Const_iterator referencing the start of range in x.
1474 * @param __last Const_iterator referencing the end of range in x.
1476 * Removes elements in the range [__first,__last) and inserts them
1477 * before @a __position in constant time.
1479 * Undefined if @a __position is in [__first,__last).
1482 splice(const_iterator __position
, list
&& __x
, const_iterator __first
,
1483 const_iterator __last
) noexcept
1486 * @brief Insert range from another %list.
1487 * @param __position Iterator referencing the element to insert before.
1488 * @param __x Source list.
1489 * @param __first Iterator referencing the start of range in x.
1490 * @param __last Iterator referencing the end of range in x.
1492 * Removes elements in the range [__first,__last) and inserts them
1493 * before @a __position in constant time.
1495 * Undefined if @a __position is in [__first,__last).
1498 splice(iterator __position
, list
& __x
, iterator __first
,
1502 if (__first
!= __last
)
1505 _M_check_equal_allocators(__x
);
1507 size_t __n
= this->_M_distance(__first
._M_node
, __last
._M_node
);
1508 this->_M_inc_size(__n
);
1509 __x
._M_dec_size(__n
);
1511 this->_M_transfer(__position
._M_const_cast(),
1512 __first
._M_const_cast(),
1513 __last
._M_const_cast());
1517 #if __cplusplus >= 201103L
1519 * @brief Insert range from another %list.
1520 * @param __position Const_iterator referencing the element to
1522 * @param __x Source list.
1523 * @param __first Const_iterator referencing the start of range in x.
1524 * @param __last Const_iterator referencing the end of range in x.
1526 * Removes elements in the range [__first,__last) and inserts them
1527 * before @a __position in constant time.
1529 * Undefined if @a __position is in [__first,__last).
1532 splice(const_iterator __position
, list
& __x
, const_iterator __first
,
1533 const_iterator __last
) noexcept
1534 { splice(__position
, std::move(__x
), __first
, __last
); }
1538 * @brief Remove all elements equal to value.
1539 * @param __value The value to remove.
1541 * Removes every element in the list equal to @a value.
1542 * Remaining elements stay in list order. Note that this
1543 * function only erases the elements, and that if the elements
1544 * themselves are pointers, the pointed-to memory is not
1545 * touched in any way. Managing the pointer is the user's
1549 remove(const _Tp
& __value
);
1552 * @brief Remove all elements satisfying a predicate.
1553 * @tparam _Predicate Unary predicate function or object.
1555 * Removes every element in the list for which the predicate
1556 * returns true. Remaining elements stay in list order. Note
1557 * that this function only erases the elements, and that if the
1558 * elements themselves are pointers, the pointed-to memory is
1559 * not touched in any way. Managing the pointer is the user's
1562 template<typename _Predicate
>
1564 remove_if(_Predicate
);
1567 * @brief Remove consecutive duplicate elements.
1569 * For each consecutive set of elements with the same value,
1570 * remove all but the first one. Remaining elements stay in
1571 * list order. Note that this function only erases the
1572 * elements, and that if the elements themselves are pointers,
1573 * the pointed-to memory is not touched in any way. Managing
1574 * the pointer is the user's responsibility.
1580 * @brief Remove consecutive elements satisfying a predicate.
1581 * @tparam _BinaryPredicate Binary predicate function or object.
1583 * For each consecutive set of elements [first,last) that
1584 * satisfy predicate(first,i) where i is an iterator in
1585 * [first,last), remove all but the first one. Remaining
1586 * elements stay in list order. Note that this function only
1587 * erases the elements, and that if the elements themselves are
1588 * pointers, the pointed-to memory is not touched in any way.
1589 * Managing the pointer is the user's responsibility.
1591 template<typename _BinaryPredicate
>
1593 unique(_BinaryPredicate
);
1596 * @brief Merge sorted lists.
1597 * @param __x Sorted list to merge.
1599 * Assumes that both @a __x and this list are sorted according to
1600 * operator<(). Merges elements of @a __x into this list in
1601 * sorted order, leaving @a __x empty when complete. Elements in
1602 * this list precede elements in @a __x that are equal.
1604 #if __cplusplus >= 201103L
1610 { merge(std::move(__x
)); }
1617 * @brief Merge sorted lists according to comparison function.
1618 * @tparam _StrictWeakOrdering Comparison function defining
1620 * @param __x Sorted list to merge.
1621 * @param __comp Comparison functor.
1623 * Assumes that both @a __x and this list are sorted according to
1624 * StrictWeakOrdering. Merges elements of @a __x into this list
1625 * in sorted order, leaving @a __x empty when complete. Elements
1626 * in this list precede elements in @a __x that are equivalent
1627 * according to StrictWeakOrdering().
1629 #if __cplusplus >= 201103L
1630 template<typename _StrictWeakOrdering
>
1632 merge(list
&& __x
, _StrictWeakOrdering __comp
);
1634 template<typename _StrictWeakOrdering
>
1636 merge(list
& __x
, _StrictWeakOrdering __comp
)
1637 { merge(std::move(__x
), __comp
); }
1639 template<typename _StrictWeakOrdering
>
1641 merge(list
& __x
, _StrictWeakOrdering __comp
);
1645 * @brief Reverse the elements in list.
1647 * Reverse the order of elements in the list in linear time.
1650 reverse() _GLIBCXX_NOEXCEPT
1651 { this->_M_impl
._M_node
._M_reverse(); }
1654 * @brief Sort the elements.
1656 * Sorts the elements of this list in NlogN time. Equivalent
1657 * elements remain in list order.
1663 * @brief Sort the elements according to comparison function.
1665 * Sorts the elements of this list in NlogN time. Equivalent
1666 * elements remain in list order.
1668 template<typename _StrictWeakOrdering
>
1670 sort(_StrictWeakOrdering
);
1673 // Internal constructor functions follow.
1675 // Called by the range constructor to implement [23.1.1]/9
1677 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1678 // 438. Ambiguity in the "do the right thing" clause
1679 template<typename _Integer
>
1681 _M_initialize_dispatch(_Integer __n
, _Integer __x
, __true_type
)
1682 { _M_fill_initialize(static_cast<size_type
>(__n
), __x
); }
1684 // Called by the range constructor to implement [23.1.1]/9
1685 template<typename _InputIterator
>
1687 _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
1690 for (; __first
!= __last
; ++__first
)
1691 #if __cplusplus >= 201103L
1692 emplace_back(*__first
);
1694 push_back(*__first
);
1698 // Called by list(n,v,a), and the range constructor when it turns out
1699 // to be the same thing.
1701 _M_fill_initialize(size_type __n
, const value_type
& __x
)
1707 #if __cplusplus >= 201103L
1708 // Called by list(n).
1710 _M_default_initialize(size_type __n
)
1716 // Called by resize(sz).
1718 _M_default_append(size_type __n
);
1721 // Internal assign functions follow.
1723 // Called by the range assign to implement [23.1.1]/9
1725 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1726 // 438. Ambiguity in the "do the right thing" clause
1727 template<typename _Integer
>
1729 _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
1730 { _M_fill_assign(__n
, __val
); }
1732 // Called by the range assign to implement [23.1.1]/9
1733 template<typename _InputIterator
>
1735 _M_assign_dispatch(_InputIterator __first
, _InputIterator __last
,
1738 // Called by assign(n,t), and the range assign when it turns out
1739 // to be the same thing.
1741 _M_fill_assign(size_type __n
, const value_type
& __val
);
1744 // Moves the elements from [first,last) before position.
1746 _M_transfer(iterator __position
, iterator __first
, iterator __last
)
1747 { __position
._M_node
->_M_transfer(__first
._M_node
, __last
._M_node
); }
1749 // Inserts new element at position given and with value given.
1750 #if __cplusplus < 201103L
1752 _M_insert(iterator __position
, const value_type
& __x
)
1754 _Node
* __tmp
= _M_create_node(__x
);
1755 __tmp
->_M_hook(__position
._M_node
);
1756 this->_M_inc_size(1);
1759 template<typename
... _Args
>
1761 _M_insert(iterator __position
, _Args
&&... __args
)
1763 _Node
* __tmp
= _M_create_node(std::forward
<_Args
>(__args
)...);
1764 __tmp
->_M_hook(__position
._M_node
);
1765 this->_M_inc_size(1);
1769 // Erases element at position given.
1771 _M_erase(iterator __position
) _GLIBCXX_NOEXCEPT
1773 this->_M_dec_size(1);
1774 __position
._M_node
->_M_unhook();
1775 _Node
* __n
= static_cast<_Node
*>(__position
._M_node
);
1776 #if __cplusplus >= 201103L
1777 _M_get_Node_allocator().destroy(__n
);
1779 _M_get_Tp_allocator().destroy(std::__addressof(__n
->_M_data
));
1784 // To implement the splice (and merge) bits of N1599.
1786 _M_check_equal_allocators(list
& __x
) _GLIBCXX_NOEXCEPT
1788 if (std::__alloc_neq
<typename
_Base::_Node_alloc_type
>::
1789 _S_do_it(_M_get_Node_allocator(), __x
._M_get_Node_allocator()))
1793 _GLIBCXX_END_NAMESPACE_CXX11
1796 * @brief List equality comparison.
1797 * @param __x A %list.
1798 * @param __y A %list of the same type as @a __x.
1799 * @return True iff the size and elements of the lists are equal.
1801 * This is an equivalence relation. It is linear in the size of
1802 * the lists. Lists are considered equivalent if their sizes are
1803 * equal, and if corresponding elements compare equal.
1805 template<typename _Tp
, typename _Alloc
>
1807 operator==(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1809 typedef typename list
<_Tp
, _Alloc
>::const_iterator const_iterator
;
1810 const_iterator __end1
= __x
.end();
1811 const_iterator __end2
= __y
.end();
1813 const_iterator __i1
= __x
.begin();
1814 const_iterator __i2
= __y
.begin();
1815 while (__i1
!= __end1
&& __i2
!= __end2
&& *__i1
== *__i2
)
1820 return __i1
== __end1
&& __i2
== __end2
;
1824 * @brief List ordering relation.
1825 * @param __x A %list.
1826 * @param __y A %list of the same type as @a __x.
1827 * @return True iff @a __x is lexicographically less than @a __y.
1829 * This is a total ordering relation. It is linear in the size of the
1830 * lists. The elements must be comparable with @c <.
1832 * See std::lexicographical_compare() for how the determination is made.
1834 template<typename _Tp
, typename _Alloc
>
1836 operator<(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1837 { return std::lexicographical_compare(__x
.begin(), __x
.end(),
1838 __y
.begin(), __y
.end()); }
1840 /// Based on operator==
1841 template<typename _Tp
, typename _Alloc
>
1843 operator!=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1844 { return !(__x
== __y
); }
1846 /// Based on operator<
1847 template<typename _Tp
, typename _Alloc
>
1849 operator>(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1850 { return __y
< __x
; }
1852 /// Based on operator<
1853 template<typename _Tp
, typename _Alloc
>
1855 operator<=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1856 { return !(__y
< __x
); }
1858 /// Based on operator<
1859 template<typename _Tp
, typename _Alloc
>
1861 operator>=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1862 { return !(__x
< __y
); }
1864 /// See std::list::swap().
1865 template<typename _Tp
, typename _Alloc
>
1867 swap(list
<_Tp
, _Alloc
>& __x
, list
<_Tp
, _Alloc
>& __y
)
1870 _GLIBCXX_END_NAMESPACE_CONTAINER
1873 #endif /* _STL_LIST_H */