typedef Type value_type

typedef value_type * pointer

typedef const value_type * const_pointer

typedef value_type & reference

typedef const value_type & const_reference

typedef size_t size_type

typedef ptrdiff_t difference_type

typedef Slist_iterator< Type, Type &, Type * > iterator

typedef Slist_iterator< Type, const Type &, const Type * > const_iterator

typedef Base::allocator_type allocator_type

allocator_type get_allocator () const

slist (const allocator_type &a=allocator_type())

slist (size_type n, const value_type &x, const allocator_type &a=allocator_type())

slist (size_type n)

template<class InputIterator> slist (InputIterator first, InputIterator last, const allocator_type &a=allocator_type())

slist (const slist &x)

~slist ()

void assign (size_type n, const Type &__val)

void M_fill_assign (size_type n, const Type &__val)

template<class InputIterator> void assign (InputIterator first, InputIterator last)

template<class Integer> void M_assign_dispatch (Integer n, Integer __val, __true_type)

template<class InputIterator> void M_assign_dispatch (InputIterator first, InputIterator last, __false_type)

iterator begin ()

const_iterator begin () const

iterator end ()

const_iterator end () const

iterator before_begin ()

const_iterator before_begin () const

size_type size () const

size_type max_size () const

bool empty () const

void swap (slist &x)

reference front ()

const_reference front () const

void push_front (const value_type &x)

void push_front ()

void pop_front ()

iterator previous (const_iterator position)

const_iterator previous (const_iterator position) const

iterator insert_after (iterator position, const value_type &x)

iterator insert_after (iterator position)

void insert_after (iterator position, size_type n, const value_type &x)

template<class InIterator> void insert_after (iterator position, InIterator first, InIterator last)

iterator insert (iterator position, const value_type &x)

iterator insert (iterator position)

void insert (iterator position, size_type n, const value_type &x)

template<class InIterator> void insert (iterator position, InIterator first, InIterator last)

iterator erase_after (iterator position)

iterator erase_after (iterator __before_first, iterator last)

iterator erase (iterator position)

iterator erase (iterator first, iterator last)

void resize (size_type new_size, const Type &x)

void resize (size_type new_size)

void clear ()

void splice_after (iterator position, iterator __before_first, iterator __before_last)

void splice_after (iterator position, iterator __prev)

void splice_after (iterator position, slist &x)

void splice (iterator position, slist &x)

void splice (iterator position, slist &x, iterator __i)

void splice (iterator position, slist &x, iterator first, iterator last)

void reverse ()

void remove (const Type &__val)

void unique ()

void sort ()

template<class Predicate> void remove_if (Predicate pred)

template<class BinaryPredicate> void unique (BinaryPredicate pred)

template<class StrictWeakOrdering> void sort (StrictWeakOrdering comp)

template<class StrictWeakOrdering> void merge (slist< Type, Alloc > &x, StrictWeakOrdering comp)

typedef Slist_base< Type, Alloc > Base

typedef Slist_node< Type > Node

typedef Slist_node_base Node_base

typedef Slist_iterator_base Iterator_base

typedef Alloc::template rebind< Slist_node< Type > >::other Node_alloc

Node * M_create_node (const value_type &x)

Node * M_create_node ()

Node * M_insert_after (Node_base *position, const value_type &x)

Node * M_insert_after (Node_base *position)

void M_insert_after_fill (Node_base *position, size_type n, const value_type &x)

template<class InIterator> void M_insert_after_range (Node_base *position, InIterator first, InIterator last)

template<class Integer> void M_insert_after_range (Node_base *position, Integer n, Integer x, __true_type)

template<class InIterator> void M_insert_after_range (Node_base *position, InIterator first, InIterator last, __false_type)

Slist_node< Type > * M_get_node ()

void M_put_node (Slist_node< Type > *__p)

Slist_node_base * M_erase_after (Slist_node_base *position)

Slist_node_base * M_erase_after (Slist_node_base *, Slist_node_base *)

Slist_node_base M_head

This is an SGI extension.

Todo Doc me! See docs/doxygen/TODO and http://gcc.gnu.org/ml/libstdc++/2002-02/msg00003.html for more.

Definition at line 257 of file slist.