|
| list (std::initializer_list< T > il) |
|
| list (const list< T > &l) |
|
| list (list< T > &&l) |
|
list< T > & | operator= (const list< T > &l) |
|
list< T > & | operator= (list< T > &&l) |
|
bool | operator== (const list< T > &rhs) const |
|
bool | operator!= (const list< T > &rhs) const |
|
bool | operator< (const list< T > &rhs) const |
|
bool | operator<= (const list< T > &rhs) const |
|
bool | operator> (const list< T > &rhs) const |
|
bool | operator>= (const list< T > &rhs) const |
|
iterator | begin () |
|
const_iterator | cbegin () const |
|
iterator | end () |
|
const_iterator | cend () const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | crbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | crend () const |
|
bool | empty () const |
|
unsigned | size () const |
|
unsigned | max_size () const |
|
void | resize (unsigned sz, T c=T()) |
|
T & | front () |
|
const T & | front () const |
|
T & | back () |
|
const T & | back () const |
|
void | assign (unsigned n, const T &u) |
|
void | push_front (const T &x) |
|
void | pop_front () |
|
void | push_back (const T &x) |
|
void | pop_back () |
|
iterator | insert (const iterator &position, const T &x) |
|
void | insert (const iterator &position, unsigned n, const T &x) |
|
iterator | erase (const iterator &position) |
|
iterator | erase (const iterator &first, const iterator &last) |
|
void | clear () |
|
void | remove (const T &value) |
|
void | unique () |
|
void | sort () |
|
void | reverse () |
|
The documentation for this class was generated from the following file: