|
| ETL_STATIC_ASSERT ((MAX_SIZE_ > 0U), "Zero capacity etl::list is not valid") |
|
| list () |
| Default constructor.
|
|
| ~list () |
| Destructor.
|
|
| list (size_t initial_size) |
| Construct from size.
|
|
| list (size_t initial_size, const T &value) |
| Construct from size and value.
|
|
| list (const list &other) |
| Copy constructor.
|
|
template<typename TIterator > |
| list (TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral< TIterator >::value, int >::type=0) |
| Construct from range.
|
|
list & | operator= (const list &rhs) |
| Assignment operator.
|
|
iterator | begin () |
| Gets the beginning of the list.
|
|
const_iterator | begin () const |
| Gets the beginning of the list.
|
|
iterator | end () |
| Gets the end of the list.
|
|
const_iterator | end () const |
| Gets the end of the list.
|
|
const_iterator | cbegin () const |
| Gets the beginning of the list.
|
|
const_iterator | cend () const |
| Gets the end of the list.
|
|
reverse_iterator | rbegin () |
| Gets the reverse beginning of the list.
|
|
const_reverse_iterator | rbegin () const |
| Gets the reverse beginning of the list.
|
|
reverse_iterator | rend () |
| Gets the reverse end of the list.
|
|
const_reverse_iterator | rend () const |
| Gets the reverse end of the list.
|
|
const_reverse_iterator | crbegin () const |
| Gets the reverse beginning of the list.
|
|
const_reverse_iterator | crend () const |
| Gets the reverse end of the 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 reference to the last element.
|
|
template<typename TIterator > |
void | assign (TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral< TIterator >::value, int >::type=0) |
|
void | assign (size_t n, const T &value) |
| Assigns 'n' copies of a value to the list.
|
|
void | push_front (const T &value) |
| Pushes a value to the front of the list.
|
|
reference | emplace_front () |
| Emplaces a value to the front of the list.
|
|
template<typename T1 > |
reference | emplace_front (const T1 &value1) |
| Emplaces a value to the front of the list.
|
|
template<typename T1 , typename T2 > |
reference | emplace_front (const T1 &value1, const T2 &value2) |
| Emplaces a value to the front of the list.
|
|
template<typename T1 , typename T2 , typename T3 > |
reference | emplace_front (const T1 &value1, const T2 &value2, const T3 &value3) |
| Emplaces a value to the front of the list.
|
|
template<typename T1 , typename T2 , typename T3 , typename T4 > |
reference | emplace_front (const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4) |
| Emplaces a value to the front of the list.
|
|
void | pop_front () |
| Removes a value from the front of the list.
|
|
void | push_back (const T &value) |
| Pushes a value to the back of the list.
|
|
reference | emplace_back () |
| Emplaces a value to the back of the list.
|
|
template<typename T1 > |
reference | emplace_back (const T1 &value1) |
|
template<typename T1 , typename T2 > |
reference | emplace_back (const T1 &value1, const T2 &value2) |
|
template<typename T1 , typename T2 , typename T3 > |
reference | emplace_back (const T1 &value1, const T2 &value2, const T3 &value3) |
|
template<typename T1 , typename T2 , typename T3 , typename T4 > |
reference | emplace_back (const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4) |
|
void | pop_back () |
| Removes a value from the back of the list.
|
|
iterator | insert (const_iterator position, const_reference value) |
| Inserts a value to the list at the specified position.
|
|
iterator | emplace (const_iterator position) |
| Emplaces a value to the list at the specified position.
|
|
template<typename T1 > |
iterator | emplace (const_iterator position, const T1 &value1) |
|
template<typename T1 , typename T2 > |
iterator | emplace (const_iterator position, const T1 &value1, const T2 &value2) |
|
template<typename T1 , typename T2 , typename T3 > |
iterator | emplace (const_iterator position, const T1 &value1, const T2 &value2, const T3 &value3) |
|
template<typename T1 , typename T2 , typename T3 , typename T4 > |
iterator | emplace (const_iterator position, const T1 &value1, const T2 &value2, const T3 &value3, const T4 &value4) |
|
void | insert (const_iterator position, size_t n, const_reference value) |
| Inserts 'n' copies of a value to the list at the specified position.
|
|
template<typename TIterator > |
void | insert (const_iterator position, TIterator first, TIterator last, typename etl::enable_if<!etl::is_integral< TIterator >::value, int >::type=0) |
| Inserts a range of values to the list at the specified position.
|
|
iterator | erase (const_iterator position) |
| Erases the value at the specified position.
|
|
iterator | erase (const_iterator first, const_iterator last) |
| Erases a range of elements.
|
|
void | resize (size_t n) |
| Resizes the list.
|
|
void | resize (size_t n, const_reference value) |
| Resizes the list.
|
|
void | clear () |
| Clears the list.
|
|
void | remove (const_reference value) |
|
template<typename TPredicate > |
void | remove_if (TPredicate predicate) |
| Removes according to a predicate.
|
|
void | unique () |
|
template<typename TIsEqual > |
void | unique (TIsEqual isEqual) |
|
void | splice (iterator to, ilist &other) |
| Splices from another list to this.
|
|
void | splice (iterator to, ilist &other, iterator from) |
| Splices an element from another list to this.
|
|
void | splice (iterator to, ilist &other, iterator first, iterator last) |
| Splices a range of elements from another list to this.
|
|
void | merge (ilist &other) |
| Merge another list into this one. Both lists should be sorted.
|
|
template<typename TCompare > |
void | merge (ilist &other, TCompare compare) |
| Merge another list into this one. Both lists should be sorted.
|
|
void | sort () |
|
template<typename TCompare > |
void | sort (TCompare compare) |
|
ilist & | operator= (const ilist &rhs) |
| Assignment operator.
|
|
bool | has_shared_pool () const |
| true if the list has a shared pool.
|
|
void | reverse () |
| Reverses the list.
|
|
size_type | max_size () const |
| Gets the maximum possible size of the list.
|
|
size_type | capacity () const |
| Gets the maximum possible size of the list.
|
|
size_type | size () const |
| Gets the size of the list.
|
|
bool | empty () const |
| Checks to see if the list is empty.
|
|
bool | full () const |
| Checks to see if the list is full.
|
|
size_type | available () const |
|
A templated list implementation that uses a fixed size buffer.