list<T> &
|
L =
list<T> L1
|
Assignment.
|
|
bool
|
L ==
list<T> L1
|
Test for equality: Two lists are equal, iff they have the same size
and if their corresponding elements are equal.
|
|
bool
|
L !=
list<T> L1
|
Test for inequality.
|
|
iterator
|
L.begin ()
|
Returns a mutable iterator referring to the first element in
list L.
|
|
const_iterator
|
L.begin () const
|
Returns a constant iterator referring to the first element in
list L.
|
|
iterator
|
L.end ()
|
Returns a mutable iterator which is the past-end-value of
list L.
|
|
const_iterator
|
L.end () const
|
Returns a constant iterator which is the past-end-value of
list L.
|
|
bool
|
L.empty ()
|
Returns true if L is empty.
|
|
int
|
L.size ()
|
Returns the number of items in list L.
|
|
T&
|
L.front ()
|
Returns a reference to the first item in list L.
|
|
T
|
L.front () const
|
Returns a const reference to the first item in list L.
|
|
T&
|
L.back ()
|
Returns a reference to the last item in list L.
|
|
T
|
L.back () const
|
Returns a const reference to the last item in list L.
|
void
|
L.push_front ( T)
|
Inserts an item in front of list L.
|
|
void
|
L.push_back ( T)
|
Inserts an item at the back of list L.
|
|
iterator
|
L.insert ( iterator pos, T t)
|
Inserts a copy of t in front of iterator pos.
The return value points to the inserted item.
|
|
void
|
L.insert ( iterator pos, int n, T t = T())
|
| |
Inserts copies of t in front of iterator pos.
|
|
void
|
L.insert ( iterator pos, const_iterator first, const_iterator last)
|
| |
Inserts a copy of the range first, last
in front of iterator pos.
|