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
; }
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 : public _Node_alloc_type
322 __detail::_List_node_base _M_node
;
325 : _Node_alloc_type(), _M_node()
328 _List_impl(const _Node_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
329 : _Node_alloc_type(__a
), _M_node()
332 #if __cplusplus >= 201103L
333 _List_impl(_Node_alloc_type
&& __a
) _GLIBCXX_NOEXCEPT
334 : _Node_alloc_type(std::move(__a
)), _M_node()
343 { return _M_impl
._Node_alloc_type::allocate(1); }
346 _M_put_node(_List_node
<_Tp
>* __p
) _GLIBCXX_NOEXCEPT
347 { _M_impl
._Node_alloc_type::deallocate(__p
, 1); }
350 typedef _Alloc allocator_type
;
353 _M_get_Node_allocator() _GLIBCXX_NOEXCEPT
354 { return *static_cast<_Node_alloc_type
*>(&_M_impl
); }
356 const _Node_alloc_type
&
357 _M_get_Node_allocator() const _GLIBCXX_NOEXCEPT
358 { return *static_cast<const _Node_alloc_type
*>(&_M_impl
); }
361 _M_get_Tp_allocator() const _GLIBCXX_NOEXCEPT
362 { return _Tp_alloc_type(_M_get_Node_allocator()); }
365 get_allocator() const _GLIBCXX_NOEXCEPT
366 { return allocator_type(_M_get_Node_allocator()); }
372 _List_base(const _Node_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
376 #if __cplusplus >= 201103L
377 _List_base(_List_base
&& __x
) noexcept
378 : _M_impl(std::move(__x
._M_get_Node_allocator()))
381 __detail::_List_node_base::swap(_M_impl
._M_node
, __x
._M_impl
._M_node
);
385 // This is what actually destroys the list.
386 ~_List_base() _GLIBCXX_NOEXCEPT
390 _M_clear() _GLIBCXX_NOEXCEPT
;
393 _M_init() _GLIBCXX_NOEXCEPT
395 this->_M_impl
._M_node
._M_next
= &this->_M_impl
._M_node
;
396 this->_M_impl
._M_node
._M_prev
= &this->_M_impl
._M_node
;
401 * @brief A standard container with linear time access to elements,
402 * and fixed time insertion/deletion at any point in the sequence.
406 * @tparam _Tp Type of element.
407 * @tparam _Alloc Allocator type, defaults to allocator<_Tp>.
409 * Meets the requirements of a <a href="tables.html#65">container</a>, a
410 * <a href="tables.html#66">reversible container</a>, and a
411 * <a href="tables.html#67">sequence</a>, including the
412 * <a href="tables.html#68">optional sequence requirements</a> with the
413 * %exception of @c at and @c operator[].
415 * This is a @e doubly @e linked %list. Traversal up and down the
416 * %list requires linear time, but adding and removing elements (or
417 * @e nodes) is done in constant time, regardless of where the
418 * change takes place. Unlike std::vector and std::deque,
419 * random-access iterators are not provided, so subscripting ( @c
420 * [] ) access is not allowed. For algorithms which only need
421 * sequential access, this lack makes no difference.
423 * Also unlike the other standard containers, std::list provides
424 * specialized algorithms %unique to linked lists, such as
425 * splicing, sorting, and in-place reversal.
427 * A couple points on memory allocation for list<Tp>:
429 * First, we never actually allocate a Tp, we allocate
430 * List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure
431 * that after elements from %list<X,Alloc1> are spliced into
432 * %list<X,Alloc2>, destroying the memory of the second %list is a
433 * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.
435 * Second, a %list conceptually represented as
437 * A <---> B <---> C <---> D
439 * is actually circular; a link exists between A and D. The %list
440 * class holds (as its only data member) a private list::iterator
441 * pointing to @e D, not to @e A! To get to the head of the %list,
442 * we start at the tail and move forward by one. When this member
443 * iterator's next/previous pointers refer to itself, the %list is
446 template<typename _Tp
, typename _Alloc
= std::allocator
<_Tp
> >
447 class list
: protected _List_base
<_Tp
, _Alloc
>
449 // concept requirements
450 typedef typename
_Alloc::value_type _Alloc_value_type
;
451 __glibcxx_class_requires(_Tp
, _SGIAssignableConcept
)
452 __glibcxx_class_requires2(_Tp
, _Alloc_value_type
, _SameTypeConcept
)
454 typedef _List_base
<_Tp
, _Alloc
> _Base
;
455 typedef typename
_Base::_Tp_alloc_type _Tp_alloc_type
;
456 typedef typename
_Base::_Node_alloc_type _Node_alloc_type
;
459 typedef _Tp value_type
;
460 typedef typename
_Tp_alloc_type::pointer pointer
;
461 typedef typename
_Tp_alloc_type::const_pointer const_pointer
;
462 typedef typename
_Tp_alloc_type::reference reference
;
463 typedef typename
_Tp_alloc_type::const_reference const_reference
;
464 typedef _List_iterator
<_Tp
> iterator
;
465 typedef _List_const_iterator
<_Tp
> const_iterator
;
466 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
467 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
468 typedef size_t size_type
;
469 typedef ptrdiff_t difference_type
;
470 typedef _Alloc allocator_type
;
473 // Note that pointers-to-_Node's can be ctor-converted to
475 typedef _List_node
<_Tp
> _Node
;
477 using _Base::_M_impl
;
478 using _Base::_M_put_node
;
479 using _Base::_M_get_node
;
480 using _Base::_M_get_Tp_allocator
;
481 using _Base::_M_get_Node_allocator
;
484 * @param __args An instance of user data.
486 * Allocates space for a new node and constructs a copy of
489 #if __cplusplus < 201103L
491 _M_create_node(const value_type
& __x
)
493 _Node
* __p
= this->_M_get_node();
496 _M_get_Tp_allocator().construct
497 (std::__addressof(__p
->_M_data
), __x
);
502 __throw_exception_again
;
507 template<typename
... _Args
>
509 _M_create_node(_Args
&&... __args
)
511 _Node
* __p
= this->_M_get_node();
514 _M_get_Node_allocator().construct(__p
,
515 std::forward
<_Args
>(__args
)...);
520 __throw_exception_again
;
527 // [23.2.2.1] construct/copy/destroy
528 // (assign() and get_allocator() are also listed in this section)
531 * @brief Creates a %list with no elements.
534 #if __cplusplus >= 201103L
535 noexcept(is_nothrow_default_constructible
<_Node_alloc_type
>::value
)
540 * @brief Creates a %list with no elements.
541 * @param __a An allocator object.
544 list(const allocator_type
& __a
) _GLIBCXX_NOEXCEPT
545 : _Base(_Node_alloc_type(__a
)) { }
547 #if __cplusplus >= 201103L
549 * @brief Creates a %list with default constructed elements.
550 * @param __n The number of elements to initially create.
552 * This constructor fills the %list with @a __n default
553 * constructed elements.
558 { _M_default_initialize(__n
); }
561 * @brief Creates a %list with copies of an exemplar element.
562 * @param __n The number of elements to initially create.
563 * @param __value An element to copy.
564 * @param __a An allocator object.
566 * This constructor fills the %list with @a __n copies of @a __value.
568 list(size_type __n
, const value_type
& __value
,
569 const allocator_type
& __a
= allocator_type())
570 : _Base(_Node_alloc_type(__a
))
571 { _M_fill_initialize(__n
, __value
); }
574 * @brief Creates a %list with copies of an exemplar element.
575 * @param __n The number of elements to initially create.
576 * @param __value An element to copy.
577 * @param __a An allocator object.
579 * This constructor fills the %list with @a __n copies of @a __value.
582 list(size_type __n
, const value_type
& __value
= value_type(),
583 const allocator_type
& __a
= allocator_type())
584 : _Base(_Node_alloc_type(__a
))
585 { _M_fill_initialize(__n
, __value
); }
589 * @brief %List copy constructor.
590 * @param __x A %list of identical element and allocator types.
592 * The newly-created %list uses a copy of the allocation object used
595 list(const list
& __x
)
596 : _Base(__x
._M_get_Node_allocator())
597 { _M_initialize_dispatch(__x
.begin(), __x
.end(), __false_type()); }
599 #if __cplusplus >= 201103L
601 * @brief %List move constructor.
602 * @param __x A %list of identical element and allocator types.
604 * The newly-created %list contains the exact contents of @a __x.
605 * The contents of @a __x are a valid, but unspecified %list.
607 list(list
&& __x
) noexcept
608 : _Base(std::move(__x
)) { }
611 * @brief Builds a %list from an initializer_list
612 * @param __l An initializer_list of value_type.
613 * @param __a An allocator object.
615 * Create a %list consisting of copies of the elements in the
616 * initializer_list @a __l. This is linear in __l.size().
618 list(initializer_list
<value_type
> __l
,
619 const allocator_type
& __a
= allocator_type())
620 : _Base(_Node_alloc_type(__a
))
621 { _M_initialize_dispatch(__l
.begin(), __l
.end(), __false_type()); }
625 * @brief Builds a %list from a range.
626 * @param __first An input iterator.
627 * @param __last An input iterator.
628 * @param __a An allocator object.
630 * Create a %list consisting of copies of the elements from
631 * [@a __first,@a __last). This is linear in N (where N is
632 * distance(@a __first,@a __last)).
634 #if __cplusplus >= 201103L
635 template<typename _InputIterator
,
636 typename
= std::_RequireInputIter
<_InputIterator
>>
637 list(_InputIterator __first
, _InputIterator __last
,
638 const allocator_type
& __a
= allocator_type())
639 : _Base(_Node_alloc_type(__a
))
640 { _M_initialize_dispatch(__first
, __last
, __false_type()); }
642 template<typename _InputIterator
>
643 list(_InputIterator __first
, _InputIterator __last
,
644 const allocator_type
& __a
= allocator_type())
645 : _Base(_Node_alloc_type(__a
))
647 // Check whether it's an integral type. If so, it's not an iterator.
648 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
649 _M_initialize_dispatch(__first
, __last
, _Integral());
654 * No explicit dtor needed as the _Base dtor takes care of
655 * things. The _Base dtor only erases the elements, and note
656 * that if the elements themselves are pointers, the pointed-to
657 * memory is not touched in any way. Managing the pointer is
658 * the user's responsibility.
662 * @brief %List assignment operator.
663 * @param __x A %list of identical element and allocator types.
665 * All the elements of @a __x are copied, but unlike the copy
666 * constructor, the allocator object is not copied.
669 operator=(const list
& __x
);
671 #if __cplusplus >= 201103L
673 * @brief %List move assignment operator.
674 * @param __x A %list of identical element and allocator types.
676 * The contents of @a __x are moved into this %list (without copying).
677 * @a __x is a valid, but unspecified %list
680 operator=(list
&& __x
)
690 * @brief %List initializer list assignment operator.
691 * @param __l An initializer_list of value_type.
693 * Replace the contents of the %list with copies of the elements
694 * in the initializer_list @a __l. This is linear in l.size().
697 operator=(initializer_list
<value_type
> __l
)
699 this->assign(__l
.begin(), __l
.end());
705 * @brief Assigns a given value to a %list.
706 * @param __n Number of elements to be assigned.
707 * @param __val Value to be assigned.
709 * This function fills a %list with @a __n copies of the given
710 * value. Note that the assignment completely changes the %list
711 * and that the resulting %list's size is the same as the number
712 * of elements assigned. Old data may be lost.
715 assign(size_type __n
, const value_type
& __val
)
716 { _M_fill_assign(__n
, __val
); }
719 * @brief Assigns a range to a %list.
720 * @param __first An input iterator.
721 * @param __last An input iterator.
723 * This function fills a %list with copies of the elements in the
724 * range [@a __first,@a __last).
726 * Note that the assignment completely changes the %list and
727 * that the resulting %list's size is the same as the number of
728 * elements assigned. Old data may be lost.
730 #if __cplusplus >= 201103L
731 template<typename _InputIterator
,
732 typename
= std::_RequireInputIter
<_InputIterator
>>
734 assign(_InputIterator __first
, _InputIterator __last
)
735 { _M_assign_dispatch(__first
, __last
, __false_type()); }
737 template<typename _InputIterator
>
739 assign(_InputIterator __first
, _InputIterator __last
)
741 // Check whether it's an integral type. If so, it's not an iterator.
742 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
743 _M_assign_dispatch(__first
, __last
, _Integral());
747 #if __cplusplus >= 201103L
749 * @brief Assigns an initializer_list to a %list.
750 * @param __l An initializer_list of value_type.
752 * Replace the contents of the %list with copies of the elements
753 * in the initializer_list @a __l. This is linear in __l.size().
756 assign(initializer_list
<value_type
> __l
)
757 { this->assign(__l
.begin(), __l
.end()); }
760 /// Get a copy of the memory allocation object.
762 get_allocator() const _GLIBCXX_NOEXCEPT
763 { return _Base::get_allocator(); }
767 * Returns a read/write iterator that points to the first element in the
768 * %list. Iteration is done in ordinary element order.
771 begin() _GLIBCXX_NOEXCEPT
772 { return iterator(this->_M_impl
._M_node
._M_next
); }
775 * Returns a read-only (constant) iterator that points to the
776 * first element in the %list. Iteration is done in ordinary
780 begin() const _GLIBCXX_NOEXCEPT
781 { return const_iterator(this->_M_impl
._M_node
._M_next
); }
784 * Returns a read/write iterator that points one past the last
785 * element in the %list. Iteration is done in ordinary element
789 end() _GLIBCXX_NOEXCEPT
790 { return iterator(&this->_M_impl
._M_node
); }
793 * Returns a read-only (constant) iterator that points one past
794 * the last element in the %list. Iteration is done in ordinary
798 end() const _GLIBCXX_NOEXCEPT
799 { return const_iterator(&this->_M_impl
._M_node
); }
802 * Returns a read/write reverse iterator that points to the last
803 * element in the %list. Iteration is done in reverse element
807 rbegin() _GLIBCXX_NOEXCEPT
808 { return reverse_iterator(end()); }
811 * Returns a read-only (constant) reverse iterator that points to
812 * the last element in the %list. Iteration is done in reverse
815 const_reverse_iterator
816 rbegin() const _GLIBCXX_NOEXCEPT
817 { return const_reverse_iterator(end()); }
820 * Returns a read/write reverse iterator that points to one
821 * before the first element in the %list. Iteration is done in
822 * reverse element order.
825 rend() _GLIBCXX_NOEXCEPT
826 { return reverse_iterator(begin()); }
829 * Returns a read-only (constant) reverse iterator that points to one
830 * before the first element in the %list. Iteration is done in reverse
833 const_reverse_iterator
834 rend() const _GLIBCXX_NOEXCEPT
835 { return const_reverse_iterator(begin()); }
837 #if __cplusplus >= 201103L
839 * Returns a read-only (constant) iterator that points to the
840 * first element in the %list. Iteration is done in ordinary
844 cbegin() const noexcept
845 { return const_iterator(this->_M_impl
._M_node
._M_next
); }
848 * Returns a read-only (constant) iterator that points one past
849 * the last element in the %list. Iteration is done in ordinary
853 cend() const noexcept
854 { return const_iterator(&this->_M_impl
._M_node
); }
857 * Returns a read-only (constant) reverse iterator that points to
858 * the last element in the %list. Iteration is done in reverse
861 const_reverse_iterator
862 crbegin() const noexcept
863 { return const_reverse_iterator(end()); }
866 * Returns a read-only (constant) reverse iterator that points to one
867 * before the first element in the %list. Iteration is done in reverse
870 const_reverse_iterator
871 crend() const noexcept
872 { return const_reverse_iterator(begin()); }
875 // [23.2.2.2] capacity
877 * Returns true if the %list is empty. (Thus begin() would equal
881 empty() const _GLIBCXX_NOEXCEPT
882 { return this->_M_impl
._M_node
._M_next
== &this->_M_impl
._M_node
; }
884 /** Returns the number of elements in the %list. */
886 size() const _GLIBCXX_NOEXCEPT
887 { return std::distance(begin(), end()); }
889 /** Returns the size() of the largest possible %list. */
891 max_size() const _GLIBCXX_NOEXCEPT
892 { return _M_get_Node_allocator().max_size(); }
894 #if __cplusplus >= 201103L
896 * @brief Resizes the %list to the specified number of elements.
897 * @param __new_size Number of elements the %list should contain.
899 * This function will %resize the %list to the specified number
900 * of elements. If the number is smaller than the %list's
901 * current size the %list is truncated, otherwise default
902 * constructed elements are appended.
905 resize(size_type __new_size
);
908 * @brief Resizes the %list to the specified number of elements.
909 * @param __new_size Number of elements the %list should contain.
910 * @param __x Data with which new elements should be populated.
912 * This function will %resize the %list to the specified number
913 * of elements. If the number is smaller than the %list's
914 * current size the %list is truncated, otherwise the %list is
915 * extended and new elements are populated with given data.
918 resize(size_type __new_size
, const value_type
& __x
);
921 * @brief Resizes the %list to the specified number of elements.
922 * @param __new_size Number of elements the %list should contain.
923 * @param __x Data with which new elements should be populated.
925 * This function will %resize the %list to the specified number
926 * of elements. If the number is smaller than the %list's
927 * current size the %list is truncated, otherwise the %list is
928 * extended and new elements are populated with given data.
931 resize(size_type __new_size
, value_type __x
= value_type());
936 * Returns a read/write reference to the data at the first
937 * element of the %list.
940 front() _GLIBCXX_NOEXCEPT
944 * Returns a read-only (constant) reference to the data at the first
945 * element of the %list.
948 front() const _GLIBCXX_NOEXCEPT
952 * Returns a read/write reference to the data at the last element
956 back() _GLIBCXX_NOEXCEPT
958 iterator __tmp
= end();
964 * Returns a read-only (constant) reference to the data at the last
965 * element of the %list.
968 back() const _GLIBCXX_NOEXCEPT
970 const_iterator __tmp
= end();
975 // [23.2.2.3] modifiers
977 * @brief Add data to the front of the %list.
978 * @param __x Data to be added.
980 * This is a typical stack operation. The function creates an
981 * element at the front of the %list and assigns the given data
982 * to it. Due to the nature of a %list this operation can be
983 * done in constant time, and does not invalidate iterators and
987 push_front(const value_type
& __x
)
988 { this->_M_insert(begin(), __x
); }
990 #if __cplusplus >= 201103L
992 push_front(value_type
&& __x
)
993 { this->_M_insert(begin(), std::move(__x
)); }
995 template<typename
... _Args
>
997 emplace_front(_Args
&&... __args
)
998 { this->_M_insert(begin(), std::forward
<_Args
>(__args
)...); }
1002 * @brief Removes first element.
1004 * This is a typical stack operation. It shrinks the %list by
1005 * one. Due to the nature of a %list this operation can be done
1006 * in constant time, and only invalidates iterators/references to
1007 * the element being removed.
1009 * Note that no data is returned, and if the first element's data
1010 * is needed, it should be retrieved before pop_front() is
1014 pop_front() _GLIBCXX_NOEXCEPT
1015 { this->_M_erase(begin()); }
1018 * @brief Add data to the end of the %list.
1019 * @param __x Data to be added.
1021 * This is a typical stack operation. The function creates an
1022 * element at the end of the %list and assigns the given data to
1023 * it. Due to the nature of a %list this operation can be done
1024 * in constant time, and does not invalidate iterators and
1028 push_back(const value_type
& __x
)
1029 { this->_M_insert(end(), __x
); }
1031 #if __cplusplus >= 201103L
1033 push_back(value_type
&& __x
)
1034 { this->_M_insert(end(), std::move(__x
)); }
1036 template<typename
... _Args
>
1038 emplace_back(_Args
&&... __args
)
1039 { this->_M_insert(end(), std::forward
<_Args
>(__args
)...); }
1043 * @brief Removes last element.
1045 * This is a typical stack operation. It shrinks the %list by
1046 * one. Due to the nature of a %list this operation can be done
1047 * in constant time, and only invalidates iterators/references to
1048 * the element being removed.
1050 * Note that no data is returned, and if the last element's data
1051 * is needed, it should be retrieved before pop_back() is called.
1054 pop_back() _GLIBCXX_NOEXCEPT
1055 { this->_M_erase(iterator(this->_M_impl
._M_node
._M_prev
)); }
1057 #if __cplusplus >= 201103L
1059 * @brief Constructs object in %list before specified iterator.
1060 * @param __position A const_iterator into the %list.
1061 * @param __args Arguments.
1062 * @return An iterator that points to the inserted data.
1064 * This function will insert an object of type T constructed
1065 * with T(std::forward<Args>(args)...) before the specified
1066 * location. Due to the nature of a %list this operation can
1067 * be done in constant time, and does not invalidate iterators
1070 template<typename
... _Args
>
1072 emplace(const_iterator __position
, _Args
&&... __args
);
1075 * @brief Inserts given value into %list before specified iterator.
1076 * @param __position A const_iterator into the %list.
1077 * @param __x Data to be inserted.
1078 * @return An iterator that points to the inserted data.
1080 * This function will insert a copy of the given value before
1081 * the specified location. Due to the nature of a %list this
1082 * operation can be done in constant time, and does not
1083 * invalidate iterators and references.
1086 insert(const_iterator __position
, const value_type
& __x
);
1089 * @brief Inserts given value into %list before specified iterator.
1090 * @param __position An iterator into the %list.
1091 * @param __x Data to be inserted.
1092 * @return An iterator that points to the inserted data.
1094 * This function will insert a copy of the given value before
1095 * the specified location. Due to the nature of a %list this
1096 * operation can be done in constant time, and does not
1097 * invalidate iterators and references.
1100 insert(iterator __position
, const value_type
& __x
);
1103 #if __cplusplus >= 201103L
1105 * @brief Inserts given rvalue into %list before specified iterator.
1106 * @param __position A const_iterator into the %list.
1107 * @param __x Data to be inserted.
1108 * @return An iterator that points to the inserted data.
1110 * This function will insert a copy of the given rvalue before
1111 * the specified location. Due to the nature of a %list this
1112 * operation can be done in constant time, and does not
1113 * invalidate iterators and references.
1116 insert(const_iterator __position
, value_type
&& __x
)
1117 { return emplace(__position
, std::move(__x
)); }
1120 * @brief Inserts the contents of an initializer_list into %list
1121 * before specified const_iterator.
1122 * @param __p A const_iterator into the %list.
1123 * @param __l An initializer_list of value_type.
1124 * @return An iterator pointing to the first element inserted
1127 * This function will insert copies of the data in the
1128 * initializer_list @a l into the %list before the location
1129 * specified by @a p.
1131 * This operation is linear in the number of elements inserted and
1132 * does not invalidate iterators and references.
1135 insert(const_iterator __p
, initializer_list
<value_type
> __l
)
1136 { return this->insert(__p
, __l
.begin(), __l
.end()); }
1139 #if __cplusplus >= 201103L
1141 * @brief Inserts a number of copies of given data into the %list.
1142 * @param __position A const_iterator into the %list.
1143 * @param __n Number of elements to be inserted.
1144 * @param __x Data to be inserted.
1145 * @return An iterator pointing to the first element inserted
1148 * This function will insert a specified number of copies of the
1149 * given data before the location specified by @a position.
1151 * This operation is linear in the number of elements inserted and
1152 * does not invalidate iterators and references.
1155 insert(const_iterator __position
, size_type __n
, const value_type
& __x
);
1158 * @brief Inserts a number of copies of given data into the %list.
1159 * @param __position An iterator into the %list.
1160 * @param __n Number of elements to be inserted.
1161 * @param __x Data to be inserted.
1163 * This function will insert a specified number of copies of the
1164 * given data before the location specified by @a position.
1166 * This operation is linear in the number of elements inserted and
1167 * does not invalidate iterators and references.
1170 insert(iterator __position
, size_type __n
, const value_type
& __x
)
1172 list
__tmp(__n
, __x
, get_allocator());
1173 splice(__position
, __tmp
);
1177 #if __cplusplus >= 201103L
1179 * @brief Inserts a range into the %list.
1180 * @param __position A const_iterator into the %list.
1181 * @param __first An input iterator.
1182 * @param __last An input iterator.
1183 * @return An iterator pointing to the first element inserted
1186 * This function will insert copies of the data in the range [@a
1187 * first,@a last) into the %list before the location specified by
1190 * This operation is linear in the number of elements inserted and
1191 * does not invalidate iterators and references.
1193 template<typename _InputIterator
,
1194 typename
= std::_RequireInputIter
<_InputIterator
>>
1196 insert(const_iterator __position
, _InputIterator __first
,
1197 _InputIterator __last
);
1200 * @brief Inserts a range into the %list.
1201 * @param __position An iterator into the %list.
1202 * @param __first An input iterator.
1203 * @param __last An input iterator.
1205 * This function will insert copies of the data in the range [@a
1206 * first,@a last) into the %list before the location specified by
1209 * This operation is linear in the number of elements inserted and
1210 * does not invalidate iterators and references.
1212 template<typename _InputIterator
>
1214 insert(iterator __position
, _InputIterator __first
,
1215 _InputIterator __last
)
1217 list
__tmp(__first
, __last
, get_allocator());
1218 splice(__position
, __tmp
);
1223 * @brief Remove element at given position.
1224 * @param __position Iterator pointing to element to be erased.
1225 * @return An iterator pointing to the next element (or end()).
1227 * This function will erase the element at the given position and thus
1228 * shorten the %list by one.
1230 * Due to the nature of a %list this operation can be done in
1231 * constant time, and only invalidates iterators/references to
1232 * the element being removed. The user is also cautioned that
1233 * this function only erases the element, and that if the element
1234 * is itself a pointer, the pointed-to memory is not touched in
1235 * any way. Managing the pointer is the user's responsibility.
1238 #if __cplusplus >= 201103L
1239 erase(const_iterator __position
) noexcept
;
1241 erase(iterator __position
);
1245 * @brief Remove a range of elements.
1246 * @param __first Iterator pointing to the first element to be erased.
1247 * @param __last Iterator pointing to one past the last element to be
1249 * @return An iterator pointing to the element pointed to by @a last
1250 * prior to erasing (or end()).
1252 * This function will erase the elements in the range @a
1253 * [first,last) and shorten the %list accordingly.
1255 * This operation is linear time in the size of the range and only
1256 * invalidates iterators/references to the element being removed.
1257 * The user is also cautioned that this function only erases the
1258 * elements, and that if the elements themselves are pointers, the
1259 * pointed-to memory is not touched in any way. Managing the pointer
1260 * is the user's responsibility.
1263 #if __cplusplus >= 201103L
1264 erase(const_iterator __first
, const_iterator __last
) noexcept
1266 erase(iterator __first
, iterator __last
)
1269 while (__first
!= __last
)
1270 __first
= erase(__first
);
1271 return __last
._M_const_cast();
1275 * @brief Swaps data with another %list.
1276 * @param __x A %list of the same element and allocator types.
1278 * This exchanges the elements between two lists in constant
1279 * time. Note that the global std::swap() function is
1280 * specialized such that std::swap(l1,l2) will feed to this
1286 __detail::_List_node_base::swap(this->_M_impl
._M_node
,
1287 __x
._M_impl
._M_node
);
1289 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1290 // 431. Swapping containers with unequal allocators.
1291 std::__alloc_swap
<typename
_Base::_Node_alloc_type
>::
1292 _S_do_it(_M_get_Node_allocator(), __x
._M_get_Node_allocator());
1296 * Erases all the elements. Note that this function only erases
1297 * the elements, and that if the elements themselves are
1298 * pointers, the pointed-to memory is not touched in any way.
1299 * Managing the pointer is the user's responsibility.
1302 clear() _GLIBCXX_NOEXCEPT
1308 // [23.2.2.4] list operations
1310 * @brief Insert contents of another %list.
1311 * @param __position Iterator referencing the element to insert before.
1312 * @param __x Source list.
1314 * The elements of @a __x are inserted in constant time in front of
1315 * the element referenced by @a __position. @a __x becomes an empty
1318 * Requires this != @a __x.
1321 #if __cplusplus >= 201103L
1322 splice(const_iterator __position
, list
&& __x
) noexcept
1324 splice(iterator __position
, list
& __x
)
1329 _M_check_equal_allocators(__x
);
1331 this->_M_transfer(__position
._M_const_cast(),
1332 __x
.begin(), __x
.end());
1336 #if __cplusplus >= 201103L
1338 splice(const_iterator __position
, list
& __x
) noexcept
1339 { splice(__position
, std::move(__x
)); }
1342 #if __cplusplus >= 201103L
1344 * @brief Insert element from another %list.
1345 * @param __position Const_iterator referencing the element to
1347 * @param __x Source list.
1348 * @param __i Const_iterator referencing the element to move.
1350 * Removes the element in list @a __x referenced by @a __i and
1351 * inserts it into the current list before @a __position.
1354 splice(const_iterator __position
, list
&& __x
, const_iterator __i
) noexcept
1357 * @brief Insert element from another %list.
1358 * @param __position Iterator referencing the element to insert before.
1359 * @param __x Source list.
1360 * @param __i Iterator referencing the element to move.
1362 * Removes the element in list @a __x referenced by @a __i and
1363 * inserts it into the current list before @a __position.
1366 splice(iterator __position
, list
& __x
, iterator __i
)
1369 iterator __j
= __i
._M_const_cast();
1371 if (__position
== __i
|| __position
== __j
)
1375 _M_check_equal_allocators(__x
);
1377 this->_M_transfer(__position
._M_const_cast(),
1378 __i
._M_const_cast(), __j
);
1381 #if __cplusplus >= 201103L
1383 * @brief Insert element from another %list.
1384 * @param __position Const_iterator referencing the element to
1386 * @param __x Source list.
1387 * @param __i Const_iterator referencing the element to move.
1389 * Removes the element in list @a __x referenced by @a __i and
1390 * inserts it into the current list before @a __position.
1393 splice(const_iterator __position
, list
& __x
, const_iterator __i
) noexcept
1394 { splice(__position
, std::move(__x
), __i
); }
1397 #if __cplusplus >= 201103L
1399 * @brief Insert range from another %list.
1400 * @param __position Const_iterator referencing the element to
1402 * @param __x Source list.
1403 * @param __first Const_iterator referencing the start of range in x.
1404 * @param __last Const_iterator referencing the end of range in x.
1406 * Removes elements in the range [__first,__last) and inserts them
1407 * before @a __position in constant time.
1409 * Undefined if @a __position is in [__first,__last).
1412 splice(const_iterator __position
, list
&& __x
, const_iterator __first
,
1413 const_iterator __last
) noexcept
1416 * @brief Insert range from another %list.
1417 * @param __position Iterator referencing the element to insert before.
1418 * @param __x Source list.
1419 * @param __first Iterator referencing the start of range in x.
1420 * @param __last Iterator referencing the end of range in x.
1422 * Removes elements in the range [__first,__last) and inserts them
1423 * before @a __position in constant time.
1425 * Undefined if @a __position is in [__first,__last).
1428 splice(iterator __position
, list
& __x
, iterator __first
,
1432 if (__first
!= __last
)
1435 _M_check_equal_allocators(__x
);
1437 this->_M_transfer(__position
._M_const_cast(),
1438 __first
._M_const_cast(),
1439 __last
._M_const_cast());
1443 #if __cplusplus >= 201103L
1445 * @brief Insert range from another %list.
1446 * @param __position Const_iterator referencing the element to
1448 * @param __x Source list.
1449 * @param __first Const_iterator referencing the start of range in x.
1450 * @param __last Const_iterator referencing the end of range in x.
1452 * Removes elements in the range [__first,__last) and inserts them
1453 * before @a __position in constant time.
1455 * Undefined if @a __position is in [__first,__last).
1458 splice(const_iterator __position
, list
& __x
, const_iterator __first
,
1459 const_iterator __last
) noexcept
1460 { splice(__position
, std::move(__x
), __first
, __last
); }
1464 * @brief Remove all elements equal to value.
1465 * @param __value The value to remove.
1467 * Removes every element in the list equal to @a value.
1468 * Remaining elements stay in list order. Note that this
1469 * function only erases the elements, and that if the elements
1470 * themselves are pointers, the pointed-to memory is not
1471 * touched in any way. Managing the pointer is the user's
1475 remove(const _Tp
& __value
);
1478 * @brief Remove all elements satisfying a predicate.
1479 * @tparam _Predicate Unary predicate function or object.
1481 * Removes every element in the list for which the predicate
1482 * returns true. Remaining elements stay in list order. Note
1483 * that this function only erases the elements, and that if the
1484 * elements themselves are pointers, the pointed-to memory is
1485 * not touched in any way. Managing the pointer is the user's
1488 template<typename _Predicate
>
1490 remove_if(_Predicate
);
1493 * @brief Remove consecutive duplicate elements.
1495 * For each consecutive set of elements with the same value,
1496 * remove all but the first one. Remaining elements stay in
1497 * list order. Note that this function only erases the
1498 * elements, and that if the elements themselves are pointers,
1499 * the pointed-to memory is not touched in any way. Managing
1500 * the pointer is the user's responsibility.
1506 * @brief Remove consecutive elements satisfying a predicate.
1507 * @tparam _BinaryPredicate Binary predicate function or object.
1509 * For each consecutive set of elements [first,last) that
1510 * satisfy predicate(first,i) where i is an iterator in
1511 * [first,last), remove all but the first one. Remaining
1512 * elements stay in list order. Note that this function only
1513 * erases the elements, and that if the elements themselves are
1514 * pointers, the pointed-to memory is not touched in any way.
1515 * Managing the pointer is the user's responsibility.
1517 template<typename _BinaryPredicate
>
1519 unique(_BinaryPredicate
);
1522 * @brief Merge sorted lists.
1523 * @param __x Sorted list to merge.
1525 * Assumes that both @a __x and this list are sorted according to
1526 * operator<(). Merges elements of @a __x into this list in
1527 * sorted order, leaving @a __x empty when complete. Elements in
1528 * this list precede elements in @a __x that are equal.
1530 #if __cplusplus >= 201103L
1536 { merge(std::move(__x
)); }
1543 * @brief Merge sorted lists according to comparison function.
1544 * @tparam _StrictWeakOrdering Comparison function defining
1546 * @param __x Sorted list to merge.
1547 * @param __comp Comparison functor.
1549 * Assumes that both @a __x and this list are sorted according to
1550 * StrictWeakOrdering. Merges elements of @a __x into this list
1551 * in sorted order, leaving @a __x empty when complete. Elements
1552 * in this list precede elements in @a __x that are equivalent
1553 * according to StrictWeakOrdering().
1555 #if __cplusplus >= 201103L
1556 template<typename _StrictWeakOrdering
>
1558 merge(list
&& __x
, _StrictWeakOrdering __comp
);
1560 template<typename _StrictWeakOrdering
>
1562 merge(list
& __x
, _StrictWeakOrdering __comp
)
1563 { merge(std::move(__x
), __comp
); }
1565 template<typename _StrictWeakOrdering
>
1567 merge(list
& __x
, _StrictWeakOrdering __comp
);
1571 * @brief Reverse the elements in list.
1573 * Reverse the order of elements in the list in linear time.
1576 reverse() _GLIBCXX_NOEXCEPT
1577 { this->_M_impl
._M_node
._M_reverse(); }
1580 * @brief Sort the elements.
1582 * Sorts the elements of this list in NlogN time. Equivalent
1583 * elements remain in list order.
1589 * @brief Sort the elements according to comparison function.
1591 * Sorts the elements of this list in NlogN time. Equivalent
1592 * elements remain in list order.
1594 template<typename _StrictWeakOrdering
>
1596 sort(_StrictWeakOrdering
);
1599 // Internal constructor functions follow.
1601 // Called by the range constructor to implement [23.1.1]/9
1603 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1604 // 438. Ambiguity in the "do the right thing" clause
1605 template<typename _Integer
>
1607 _M_initialize_dispatch(_Integer __n
, _Integer __x
, __true_type
)
1608 { _M_fill_initialize(static_cast<size_type
>(__n
), __x
); }
1610 // Called by the range constructor to implement [23.1.1]/9
1611 template<typename _InputIterator
>
1613 _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
1616 for (; __first
!= __last
; ++__first
)
1617 #if __cplusplus >= 201103L
1618 emplace_back(*__first
);
1620 push_back(*__first
);
1624 // Called by list(n,v,a), and the range constructor when it turns out
1625 // to be the same thing.
1627 _M_fill_initialize(size_type __n
, const value_type
& __x
)
1633 #if __cplusplus >= 201103L
1634 // Called by list(n).
1636 _M_default_initialize(size_type __n
)
1642 // Called by resize(sz).
1644 _M_default_append(size_type __n
);
1647 // Internal assign functions follow.
1649 // Called by the range assign to implement [23.1.1]/9
1651 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1652 // 438. Ambiguity in the "do the right thing" clause
1653 template<typename _Integer
>
1655 _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
1656 { _M_fill_assign(__n
, __val
); }
1658 // Called by the range assign to implement [23.1.1]/9
1659 template<typename _InputIterator
>
1661 _M_assign_dispatch(_InputIterator __first
, _InputIterator __last
,
1664 // Called by assign(n,t), and the range assign when it turns out
1665 // to be the same thing.
1667 _M_fill_assign(size_type __n
, const value_type
& __val
);
1670 // Moves the elements from [first,last) before position.
1672 _M_transfer(iterator __position
, iterator __first
, iterator __last
)
1673 { __position
._M_node
->_M_transfer(__first
._M_node
, __last
._M_node
); }
1675 // Inserts new element at position given and with value given.
1676 #if __cplusplus < 201103L
1678 _M_insert(iterator __position
, const value_type
& __x
)
1680 _Node
* __tmp
= _M_create_node(__x
);
1681 __tmp
->_M_hook(__position
._M_node
);
1684 template<typename
... _Args
>
1686 _M_insert(iterator __position
, _Args
&&... __args
)
1688 _Node
* __tmp
= _M_create_node(std::forward
<_Args
>(__args
)...);
1689 __tmp
->_M_hook(__position
._M_node
);
1693 // Erases element at position given.
1695 _M_erase(iterator __position
) _GLIBCXX_NOEXCEPT
1697 __position
._M_node
->_M_unhook();
1698 _Node
* __n
= static_cast<_Node
*>(__position
._M_node
);
1699 #if __cplusplus >= 201103L
1700 _M_get_Node_allocator().destroy(__n
);
1702 _M_get_Tp_allocator().destroy(std::__addressof(__n
->_M_data
));
1707 // To implement the splice (and merge) bits of N1599.
1709 _M_check_equal_allocators(list
& __x
) _GLIBCXX_NOEXCEPT
1711 if (std::__alloc_neq
<typename
_Base::_Node_alloc_type
>::
1712 _S_do_it(_M_get_Node_allocator(), __x
._M_get_Node_allocator()))
1718 * @brief List equality comparison.
1719 * @param __x A %list.
1720 * @param __y A %list of the same type as @a __x.
1721 * @return True iff the size and elements of the lists are equal.
1723 * This is an equivalence relation. It is linear in the size of
1724 * the lists. Lists are considered equivalent if their sizes are
1725 * equal, and if corresponding elements compare equal.
1727 template<typename _Tp
, typename _Alloc
>
1729 operator==(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1731 typedef typename list
<_Tp
, _Alloc
>::const_iterator const_iterator
;
1732 const_iterator __end1
= __x
.end();
1733 const_iterator __end2
= __y
.end();
1735 const_iterator __i1
= __x
.begin();
1736 const_iterator __i2
= __y
.begin();
1737 while (__i1
!= __end1
&& __i2
!= __end2
&& *__i1
== *__i2
)
1742 return __i1
== __end1
&& __i2
== __end2
;
1746 * @brief List ordering relation.
1747 * @param __x A %list.
1748 * @param __y A %list of the same type as @a __x.
1749 * @return True iff @a __x is lexicographically less than @a __y.
1751 * This is a total ordering relation. It is linear in the size of the
1752 * lists. The elements must be comparable with @c <.
1754 * See std::lexicographical_compare() for how the determination is made.
1756 template<typename _Tp
, typename _Alloc
>
1758 operator<(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1759 { return std::lexicographical_compare(__x
.begin(), __x
.end(),
1760 __y
.begin(), __y
.end()); }
1762 /// Based on operator==
1763 template<typename _Tp
, typename _Alloc
>
1765 operator!=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1766 { return !(__x
== __y
); }
1768 /// Based on operator<
1769 template<typename _Tp
, typename _Alloc
>
1771 operator>(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1772 { return __y
< __x
; }
1774 /// Based on operator<
1775 template<typename _Tp
, typename _Alloc
>
1777 operator<=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1778 { return !(__y
< __x
); }
1780 /// Based on operator<
1781 template<typename _Tp
, typename _Alloc
>
1783 operator>=(const list
<_Tp
, _Alloc
>& __x
, const list
<_Tp
, _Alloc
>& __y
)
1784 { return !(__x
< __y
); }
1786 /// See std::list::swap().
1787 template<typename _Tp
, typename _Alloc
>
1789 swap(list
<_Tp
, _Alloc
>& __x
, list
<_Tp
, _Alloc
>& __y
)
1792 _GLIBCXX_END_NAMESPACE_CONTAINER
1795 #endif /* _STL_LIST_H */