libstdc++
|
A standard container with linear time access to elements, and fixed time insertion/deletion at any point in the sequence.
Meets the requirements of a container, a reversible container, and a sequence, including the optional sequence requirements with the exception of at
and operator
[].
This is a doubly linked list. Traversal up and down the list requires linear time, but adding and removing elements (or nodes) is done in constant time, regardless of where the change takes place. Unlike std::vector and std::deque, random-access iterators are not provided, so subscripting ( [] ) access is not allowed. For algorithms which only need sequential access, this lack makes no difference.
Also unlike the other standard containers, std::list provides specialized algorithms unique to linked lists, such as splicing, sorting, and in-place reversal.
A couple points on memory allocation for list<Tp>:
First, we never actually allocate a Tp, we allocate List_node<Tp>'s and trust [20.1.5]/4 to DTRT. This is to ensure that after elements from list<X,Alloc1> are spliced into list<X,Alloc2>, destroying the memory of the second list is a valid operation, i.e., Alloc1 giveth and Alloc2 taketh away.
Second, a list conceptually represented as
A <---> B <---> C <---> D
is actually circular; a link exists between A and D. The list class holds (as its only data member) a private list::iterator pointing to D, not to A! To get to the head of the list, we start at the tail and move forward by one. When this member iterator's next/previous pointers refer to itself, the list is empty.
Definition at line 458 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | ) | [inline] |
Default constructor creates no elements.
Definition at line 543 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | const allocator_type & | __a | ) | [inline, explicit] |
Creates a list with no elements.
__a | An allocator object. |
Definition at line 551 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | size_type | __n | ) | [inline, explicit] |
Creates a list with default constructed elements.
__n | The number of elements to initially create. |
This constructor fills the list with __n default constructed elements.
Definition at line 563 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | size_type | __n, |
const value_type & | __value, | ||
const allocator_type & | __a = allocator_type() |
||
) | [inline] |
Creates a list with copies of an exemplar element.
__n | The number of elements to initially create. |
__value | An element to copy. |
__a | An allocator object. |
This constructor fills the list with __n copies of __value.
Definition at line 575 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | const list< _Tp, _Alloc > & | __x | ) | [inline] |
List copy constructor.
__x | A list of identical element and allocator types. |
The newly-created list uses a copy of the allocation object used by __x.
Definition at line 602 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | list< _Tp, _Alloc > && | __x | ) | [inline] |
List move constructor.
__x | A list of identical element and allocator types. |
The newly-created list contains the exact contents of __x. The contents of __x are a valid, but unspecified list.
Definition at line 614 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | initializer_list< value_type > | __l, |
const allocator_type & | __a = allocator_type() |
||
) | [inline] |
Builds a list from an initializer_list.
__l | An initializer_list of value_type. |
__a | An allocator object. |
Create a list consisting of copies of the elements in the initializer_list __l. This is linear in __l.size().
Definition at line 625 of file stl_list.h.
std::list< _Tp, _Alloc >::list | ( | _InputIterator | __first, |
_InputIterator | __last, | ||
const allocator_type & | __a = allocator_type() |
||
) | [inline] |
Builds a list from a range.
__first | An input iterator. |
__last | An input iterator. |
__a | An allocator object. |
Create a list consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).
Definition at line 642 of file stl_list.h.
_Node* std::list< _Tp, _Alloc >::_M_create_node | ( | _Args &&... | __args | ) | [inline, protected] |
__args | An instance of user data. |
Allocates space for a new node and constructs a copy of __args in it.
Definition at line 520 of file stl_list.h.
void std::list< _Tp, _Alloc >::assign | ( | size_type | __n, |
const value_type & | __val | ||
) | [inline] |
Assigns a given value to a list.
__n | Number of elements to be assigned. |
__val | Value to be assigned. |
This function fills a list with __n copies of the given value. Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. Old data may be lost.
Definition at line 713 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::operator=().
void std::list< _Tp, _Alloc >::assign | ( | _InputIterator | __first, |
_InputIterator | __last | ||
) | [inline] |
Assigns a range to a list.
__first | An input iterator. |
__last | An input iterator. |
This function fills a list with copies of the elements in the range [__first,__last).
Note that the assignment completely changes the list and that the resulting list's size is the same as the number of elements assigned. Old data may be lost.
Definition at line 730 of file stl_list.h.
void std::list< _Tp, _Alloc >::assign | ( | initializer_list< value_type > | __l | ) | [inline] |
Assigns an initializer_list to a list.
__l | An initializer_list of value_type. |
Replace the contents of the list with copies of the elements in the initializer_list __l. This is linear in __l.size().
Definition at line 746 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::assign().
reference std::list< _Tp, _Alloc >::back | ( | ) | [inline] |
Returns a read/write reference to the data at the last element of the list.
Definition at line 952 of file stl_list.h.
const_reference std::list< _Tp, _Alloc >::back | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the last element of the list.
Definition at line 964 of file stl_list.h.
iterator std::list< _Tp, _Alloc >::begin | ( | ) | [inline] |
Returns a read/write iterator that points to the first element in the list. Iteration is done in ordinary element order.
Definition at line 761 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::crend(), std::list< __inp, __rebind_inp >::front(), std::list< __inp, __rebind_inp >::list(), std::list< _Tp, _Alloc >::merge(), std::list< _Tp, _Alloc >::operator=(), std::operator==(), std::list< __inp, __rebind_inp >::pop_front(), std::list< __inp, __rebind_inp >::push_front(), std::list< __inp, __rebind_inp >::rend(), std::list< __inp, __rebind_inp >::size(), std::list< _Tp, _Alloc >::sort(), and std::list< __inp, __rebind_inp >::splice().
const_iterator std::list< _Tp, _Alloc >::begin | ( | ) | const [inline] |
Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order.
Definition at line 770 of file stl_list.h.
const_iterator std::list< _Tp, _Alloc >::cbegin | ( | ) | const [inline] |
Returns a read-only (constant) iterator that points to the first element in the list. Iteration is done in ordinary element order.
Definition at line 834 of file stl_list.h.
const_iterator std::list< _Tp, _Alloc >::cend | ( | ) | const [inline] |
Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order.
Definition at line 843 of file stl_list.h.
void std::list< _Tp, _Alloc >::clear | ( | ) | [inline] |
Erases all the elements. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1235 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::operator=().
const_reverse_iterator std::list< _Tp, _Alloc >::crbegin | ( | ) | const [inline] |
Returns a read-only (constant) reverse iterator that points to the last element in the list. Iteration is done in reverse element order.
Definition at line 852 of file stl_list.h.
const_reverse_iterator std::list< _Tp, _Alloc >::crend | ( | ) | const [inline] |
Returns a read-only (constant) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order.
Definition at line 861 of file stl_list.h.
list< _Tp, _Alloc >::iterator list::emplace | ( | iterator | __position, |
_Args &&... | __args | ||
) |
Constructs object in list before specified iterator.
__position | A const_iterator into the list. |
__args | Arguments. |
This function will insert an object of type T constructed with T(std::forward<Args>(args)...) before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.
Definition at line 89 of file list.tcc.
Referenced by std::list< __inp, __rebind_inp >::insert().
bool std::list< _Tp, _Alloc >::empty | ( | ) | const [inline] |
Returns true if the list is empty. (Thus begin() would equal end().)
Definition at line 871 of file stl_list.h.
Referenced by std::list< _Tp, _Alloc >::sort(), and std::list< __inp, __rebind_inp >::splice().
iterator std::list< _Tp, _Alloc >::end | ( | ) | [inline] |
Returns a read/write iterator that points one past the last element in the list. Iteration is done in ordinary element order.
Definition at line 779 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::back(), std::list< __inp, __rebind_inp >::crbegin(), std::list< __inp, __rebind_inp >::list(), std::list< _Tp, _Alloc >::merge(), std::list< _Tp, _Alloc >::operator=(), std::operator==(), std::list< __inp, __rebind_inp >::push_back(), std::list< __inp, __rebind_inp >::rbegin(), std::list< __inp, __rebind_inp >::size(), and std::list< __inp, __rebind_inp >::splice().
const_iterator std::list< _Tp, _Alloc >::end | ( | ) | const [inline] |
Returns a read-only (constant) iterator that points one past the last element in the list. Iteration is done in ordinary element order.
Definition at line 788 of file stl_list.h.
list< _Tp, _Alloc >::iterator list::erase | ( | iterator | __position | ) |
Remove element at given position.
__position | Iterator pointing to element to be erased. |
This function will erase the element at the given position and thus shorten the list by one.
Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 110 of file list.tcc.
Referenced by std::list< __inp, __rebind_inp >::erase().
iterator std::list< _Tp, _Alloc >::erase | ( | iterator | __first, |
iterator | __last | ||
) | [inline] |
Remove a range of elements.
__first | Iterator pointing to the first element to be erased. |
__last | Iterator pointing to one past the last element to be erased. |
This function will erase the elements in the range [first,last) and shorten the list accordingly.
This operation is linear time in the size of the range and only invalidates iterators/references to the element being removed. The user is also cautioned that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 1197 of file stl_list.h.
reference std::list< _Tp, _Alloc >::front | ( | ) | [inline] |
Returns a read/write reference to the data at the first element of the list.
Definition at line 936 of file stl_list.h.
const_reference std::list< _Tp, _Alloc >::front | ( | ) | const [inline] |
Returns a read-only (constant) reference to the data at the first element of the list.
Definition at line 944 of file stl_list.h.
allocator_type std::list< _Tp, _Alloc >::get_allocator | ( | ) | const [inline] |
Get a copy of the memory allocation object.
Reimplemented from std::_List_base< _Tp, _Alloc >.
Definition at line 752 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::insert().
list< _Tp, _Alloc >::iterator list::insert | ( | iterator | __position, |
const value_type & | __x | ||
) |
Inserts given value into list before specified iterator.
__position | An iterator into the list. |
__x | Data to be inserted. |
This function will insert a copy of the given value before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.
iterator std::list< _Tp, _Alloc >::insert | ( | iterator | __position, |
value_type && | __x | ||
) | [inline] |
Inserts given rvalue into list before specified iterator.
__position | An iterator into the list. |
__x | Data to be inserted. |
This function will insert a copy of the given rvalue before the specified location. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.
Definition at line 1098 of file stl_list.h.
void std::list< _Tp, _Alloc >::insert | ( | iterator | __p, |
initializer_list< value_type > | __l | ||
) | [inline] |
Inserts the contents of an initializer_list into list before specified iterator.
__p | An iterator into the list. |
__l | An initializer_list of value_type. |
This function will insert copies of the data in the initializer_list l into the list before the location specified by p.
This operation is linear in the number of elements inserted and does not invalidate iterators and references.
Definition at line 1115 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::insert().
void std::list< _Tp, _Alloc >::insert | ( | iterator | __position, |
size_type | __n, | ||
const value_type & | __x | ||
) | [inline] |
Inserts a number of copies of given data into the list.
__position | An iterator into the list. |
__n | Number of elements to be inserted. |
__x | Data to be inserted. |
This function will insert a specified number of copies of the given data before the location specified by position.
This operation is linear in the number of elements inserted and does not invalidate iterators and references.
Definition at line 1132 of file stl_list.h.
void std::list< _Tp, _Alloc >::insert | ( | iterator | __position, |
_InputIterator | __first, | ||
_InputIterator | __last | ||
) | [inline] |
Inserts a range into the list.
__position | An iterator into the list. |
__first | An input iterator. |
__last | An input iterator. |
This function will insert copies of the data in the range [first,last) into the list before the location specified by position.
This operation is linear in the number of elements inserted and does not invalidate iterators and references.
Definition at line 1153 of file stl_list.h.
size_type std::list< _Tp, _Alloc >::max_size | ( | ) | const [inline] |
Returns the size() of the largest possible list.
Definition at line 887 of file stl_list.h.
void list::merge | ( | list< _Tp, _Alloc > && | __x | ) |
Merge sorted lists.
__x | Sorted list to merge. |
Assumes that both __x and this list are sorted according to operator<(). Merges elements of __x into this list in sorted order, leaving __x empty when complete. Elements in this list precede elements in __x that are equal.
Definition at line 289 of file list.tcc.
References std::begin(), std::list< _Tp, _Alloc >::begin(), std::end(), std::list< _Tp, _Alloc >::end(), and std::list< _Tp, _Alloc >::size().
Referenced by std::list< _Tp, _Alloc >::sort().
void list::merge | ( | list< _Tp, _Alloc > && | __x, |
_StrictWeakOrdering | __comp | ||
) |
Merge sorted lists according to comparison function.
_StrictWeakOrdering | Comparison function defining sort order. |
__x | Sorted list to merge. |
__comp | Comparison functor. |
Assumes that both __x and this list are sorted according to StrictWeakOrdering. Merges elements of __x into this list in sorted order, leaving __x empty when complete. Elements in this list precede elements in __x that are equivalent according to StrictWeakOrdering().
Definition at line 328 of file list.tcc.
References std::begin(), std::list< _Tp, _Alloc >::begin(), std::end(), std::list< _Tp, _Alloc >::end(), and std::list< _Tp, _Alloc >::size().
list< _Tp, _Alloc > & list::operator= | ( | const list< _Tp, _Alloc > & | __x | ) |
List assignment operator.
No explicit dtor needed as the _Base dtor takes care of things. The _Base dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
__x | A list of identical element and allocator types. |
All the elements of __x are copied, but unlike the copy constructor, the allocator object is not copied.
Definition at line 186 of file list.tcc.
References std::begin(), std::list< _Tp, _Alloc >::begin(), std::end(), and std::list< _Tp, _Alloc >::end().
list& std::list< _Tp, _Alloc >::operator= | ( | list< _Tp, _Alloc > && | __x | ) | [inline] |
List move assignment operator.
__x | A list of identical element and allocator types. |
The contents of __x are moved into this list (without copying). __x is a valid, but unspecified list
Definition at line 678 of file stl_list.h.
list& std::list< _Tp, _Alloc >::operator= | ( | initializer_list< value_type > | __l | ) | [inline] |
List initializer list assignment operator.
__l | An initializer_list of value_type. |
Replace the contents of the list with copies of the elements in the initializer_list __l. This is linear in l.size().
Definition at line 695 of file stl_list.h.
void std::list< _Tp, _Alloc >::pop_back | ( | ) | [inline] |
Removes last element.
This is a typical stack operation. It shrinks the list by one. Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed.
Note that no data is returned, and if the last element's data is needed, it should be retrieved before pop_back() is called.
Definition at line 1050 of file stl_list.h.
void std::list< _Tp, _Alloc >::pop_front | ( | ) | [inline] |
Removes first element.
This is a typical stack operation. It shrinks the list by one. Due to the nature of a list this operation can be done in constant time, and only invalidates iterators/references to the element being removed.
Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop_front() is called.
Definition at line 1010 of file stl_list.h.
void std::list< _Tp, _Alloc >::push_back | ( | const value_type & | __x | ) | [inline] |
Add data to the end of the list.
__x | Data to be added. |
This is a typical stack operation. The function creates an element at the end of the list and assigns the given data to it. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.
Definition at line 1024 of file stl_list.h.
void std::list< _Tp, _Alloc >::push_front | ( | const value_type & | __x | ) | [inline] |
Add data to the front of the list.
__x | Data to be added. |
This is a typical stack operation. The function creates an element at the front of the list and assigns the given data to it. Due to the nature of a list this operation can be done in constant time, and does not invalidate iterators and references.
Definition at line 983 of file stl_list.h.
reverse_iterator std::list< _Tp, _Alloc >::rbegin | ( | ) | [inline] |
Returns a read/write reverse iterator that points to the last element in the list. Iteration is done in reverse element order.
Definition at line 797 of file stl_list.h.
const_reverse_iterator std::list< _Tp, _Alloc >::rbegin | ( | ) | const [inline] |
Returns a read-only (constant) reverse iterator that points to the last element in the list. Iteration is done in reverse element order.
Definition at line 806 of file stl_list.h.
void list::remove | ( | const _Tp & | __value | ) |
Remove all elements equal to value.
__value | The value to remove. |
Removes every element in the list equal to value. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 240 of file list.tcc.
References std::__addressof(), std::begin(), and std::end().
void list::remove_if | ( | _Predicate | __pred | ) |
Remove all elements satisfying a predicate.
_Predicate | Unary predicate function or object. |
Removes every element in the list for which the predicate returns true. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 403 of file list.tcc.
References std::begin(), and std::end().
reverse_iterator std::list< _Tp, _Alloc >::rend | ( | ) | [inline] |
Returns a read/write reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order.
Definition at line 815 of file stl_list.h.
const_reverse_iterator std::list< _Tp, _Alloc >::rend | ( | ) | const [inline] |
Returns a read-only (constant) reverse iterator that points to one before the first element in the list. Iteration is done in reverse element order.
Definition at line 824 of file stl_list.h.
void list::resize | ( | size_type | __new_size | ) |
Resizes the list to the specified number of elements.
__new_size | Number of elements the list should contain. |
This function will resize the list to the specified number of elements. If the number is smaller than the list's current size the list is truncated, otherwise default constructed elements are appended.
Definition at line 140 of file list.tcc.
References std::advance(), std::begin(), std::end(), and std::size().
void list::resize | ( | size_type | __new_size, |
const value_type & | __x | ||
) |
Resizes the list to the specified number of elements.
__new_size | Number of elements the list should contain. |
__x | Data with which new elements should be populated. |
This function will resize the list to the specified number of elements. If the number is smaller than the list's current size the list is truncated, otherwise the list is extended and new elements are populated with given data.
Definition at line 155 of file list.tcc.
References std::advance(), std::begin(), std::end(), and std::size().
void std::list< _Tp, _Alloc >::reverse | ( | ) | [inline] |
Reverse the elements in list.
Reverse the order of elements in the list in linear time.
Definition at line 1476 of file stl_list.h.
size_type std::list< _Tp, _Alloc >::size | ( | ) | const [inline] |
Returns the number of elements in the list.
Definition at line 876 of file stl_list.h.
Referenced by std::list< _Tp, _Alloc >::merge(), std::operator==(), and std::list< __inp, __rebind_inp >::splice().
void list::sort | ( | ) |
Sort the elements.
Sorts the elements of this list in NlogN time. Equivalent elements remain in list order.
Definition at line 365 of file list.tcc.
References std::begin(), std::list< _Tp, _Alloc >::begin(), std::list< _Tp, _Alloc >::empty(), std::list< _Tp, _Alloc >::merge(), std::list< _Tp, _Alloc >::splice(), and std::list< _Tp, _Alloc >::swap().
void list::sort | ( | _StrictWeakOrdering | __comp | ) |
Sort the elements according to comparison function.
Sorts the elements of this list in NlogN time. Equivalent elements remain in list order.
Definition at line 442 of file list.tcc.
References std::begin(), std::list< _Tp, _Alloc >::begin(), std::list< _Tp, _Alloc >::empty(), std::list< _Tp, _Alloc >::merge(), std::list< _Tp, _Alloc >::splice(), and std::list< _Tp, _Alloc >::swap().
void std::list< _Tp, _Alloc >::splice | ( | iterator | __position, |
list< _Tp, _Alloc > && | __x | ||
) | [inline] |
Insert contents of another list.
__position | Iterator referencing the element to insert before. |
__x | Source list. |
The elements of __x are inserted in constant time in front of the element referenced by __position. __x becomes an empty list.
Requires this != __x.
Definition at line 1255 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::insert(), and std::list< _Tp, _Alloc >::sort().
void std::list< _Tp, _Alloc >::splice | ( | iterator | __position, |
list< _Tp, _Alloc > && | __x, | ||
iterator | __i | ||
) | [inline] |
Insert element from another list.
__position | Iterator referencing the element to insert before. |
__x | Source list. |
__i | Iterator referencing the element to move. |
Removes the element in list __x referenced by __i and inserts it into the current list before __position.
Definition at line 1290 of file stl_list.h.
void std::list< _Tp, _Alloc >::splice | ( | iterator | __position, |
list< _Tp, _Alloc > && | __x, | ||
iterator | __first, | ||
iterator | __last | ||
) | [inline] |
Insert range from another list.
__position | Iterator referencing the element to insert before. |
__x | Source list. |
__first | Iterator referencing the start of range in x. |
__last | Iterator referencing the end of range in x. |
Removes elements in the range [first,last) and inserts them before __position in constant time.
Undefined if position is in [__first,last).
Definition at line 1333 of file stl_list.h.
void std::list< _Tp, _Alloc >::swap | ( | list< _Tp, _Alloc > & | __x | ) | [inline] |
Swaps data with another list.
__x | A list of the same element and allocator types. |
This exchanges the elements between two lists in constant time. Note that the global std::swap() function is specialized such that std::swap(l1,l2) will feed to this function.
Definition at line 1214 of file stl_list.h.
Referenced by std::list< __inp, __rebind_inp >::operator=(), std::list< _Tp, _Alloc >::sort(), std::list< __inp, __rebind_inp >::swap(), and std::swap().
void list::unique | ( | ) |
Remove consecutive duplicate elements.
For each consecutive set of elements with the same value, remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 268 of file list.tcc.
References std::begin(), and std::end().
void list::unique | ( | _BinaryPredicate | __binary_pred | ) |
Remove consecutive elements satisfying a predicate.
_BinaryPredicate | Binary predicate function or object. |
For each consecutive set of elements [first,last) that satisfy predicate(first,i) where i is an iterator in [first,last), remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.
Definition at line 421 of file list.tcc.
References std::begin(), and std::end().