|
| intrusive_list () |
| Constructor.
|
|
| ~intrusive_list () |
| Destructor.
|
|
template<typename TIterator > |
| intrusive_list (TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral< TIterator >::value, int >::type=0) |
| Constructor from range.
|
|
iterator | begin () |
| Gets the beginning of the intrusive_list.
|
|
const_iterator | begin () const |
| Gets the beginning of the intrusive_list.
|
|
const_iterator | cbegin () const |
| Gets the beginning of the intrusive_list.
|
|
iterator | end () |
| Gets the end of the intrusive_list.
|
|
const_iterator | end () const |
| Gets the end of the intrusive_list.
|
|
const_iterator | cend () const |
| Gets the end of the intrusive_list.
|
|
reference | front () |
| Gets a reference to the first element.
|
|
const_reference | front () const |
| Gets a const reference to the first element.
|
|
reference | back () |
| Gets a reference to the last element.
|
|
const_reference | back () const |
| Gets a const reference to the last element.
|
|
iterator | insert (const_iterator position, value_type &value) |
| Inserts a value to the intrusive_list before the specified position.
|
|
template<typename TIterator > |
void | insert (const_iterator position, TIterator first, TIterator last) |
| Inserts a range of values to the intrusive_list after the specified position.
|
|
iterator | erase (iterator position) |
| Erases the value at the specified position.
|
|
iterator | erase (const_iterator position) |
| Erases the value at the specified position.
|
|
iterator | erase (const_iterator first, const_iterator last) |
|
node_type * | erase (node_type &node) |
| Erases the specified node.
|
|
template<typename TIsEqual > |
void | unique (TIsEqual isEqual) |
|
void | sort () |
| Sort using in-place merge sort algorithm.
|
|
template<typename TCompare > |
void | sort (TCompare compare) |
|
void | remove (const_reference value) |
|
template<typename TPredicate > |
void | remove_if (TPredicate predicate) |
| Removes according to a predicate.
|
|
void | splice (iterator position, list_type &other) |
| Splice another list into this one.
|
|
void | splice (iterator position, list_type &other, iterator isource) |
| Splice an element from another list into this one.
|
|
void | splice (iterator position, list_type &other, iterator begin_, iterator end_) |
| Splice a range of elements from another list into this one.
|
|
void | merge (list_type &other) |
| Merge another list into this one. Both lists should be sorted.
|
|
template<typename TCompare > |
void | merge (list_type &other, TCompare compare) |
| Merge another list into this one. Both lists should be sorted.
|
|
template<typename TIterator > |
void | assign (TIterator first, TIterator last) |
|
void | push_front (link_type &value) |
| Pushes a value to the front of the intrusive_list.
|
|
void | pop_front () |
| Removes a value from the front of the intrusive_list.
|
|
void | push_back (link_type &value) |
| Pushes a value to the back of the intrusive_list.
|
|
void | pop_back () |
| Removes a value from the back of the intrusive_list.
|
|
void | clear () |
| Clears the intrusive_list.
|
|
void | reverse () |
| Reverses the list.
|
|
bool | empty () const |
| Returns true if the list has no elements.
|
|
size_t | size () const |
| Returns the number of elements.
|
|
An intrusive list.
- Note
- TLink must be a base of TValue.
Stable sort using in-place merge sort algorithm. Copyright 2001 Simon Tatham.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL SIMON TATHAM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.