#include <bslstp_slist.h>

Inheritance diagram for bsl::slist< _Tp, _Alloc >:

Public Types
typedef _Tp	value_type

typedef value_type *	pointer

typedef const value_type *	const_pointer

typedef value_type &	reference

typedef const value_type &	const_reference

typedef std::size_t	size_type

typedef std::ptrdiff_t	difference_type

typedef std::forward_iterator_tag	_Iterator_category

typedef _Slist_iterator< _Tp, _Nonconst_traits< _Tp > >	iterator

typedef _Slist_iterator< _Tp, _Const_traits< _Tp > >	const_iterator

typedef _Base::allocator_type	allocator_type

Public Member Functions
allocator_type	get_allocator () const

	slist (const allocator_type &__a=allocator_type())

	slist (size_type __n, const value_type &__x=_Tp(), const allocator_type &__a=allocator_type())

template<class _InputIterator >
	slist (_InputIterator __first, _InputIterator __last, const allocator_type &__a=allocator_type())

	slist (const _Self &__x)

	slist (const _Self &__x, const allocator_type &__a)

_Self &	operator= (const _Self &__x)

	~slist ()

void	assign (size_type __n, const _Tp &__val)

void	_M_fill_assign (size_type __n, const _Tp &__val)

template<class _InputIterator >
void	assign (_InputIterator __first, _InputIterator __last)

template<class _Integer >
void	_M_assign_dispatch (_Integer __n, _Integer __val, bsl::true_type *)

template<class _InputIter >
void	_M_assign_dispatch (_InputIter __first, _InputIter __last, bsl::false_type *)

iterator	before_begin ()

const_iterator	before_begin () const

iterator	begin ()

const_iterator	begin () const

iterator	end ()

const_iterator	end () const

size_type	size () const

size_type	max_size () const

bool	empty () const

void	swap (_Self &__x)

reference	front ()

const_reference	front () const

void	push_front (const value_type &__x=_Tp())

void	pop_front ()

iterator	previous (const_iterator __pos)

const_iterator	previous (const_iterator __pos) const

iterator	insert_after (iterator __pos, const value_type &__x=_Tp())

void	insert_after (iterator __pos, size_type __n, const value_type &__x)

template<class _InIter >
void	insert_after (iterator __pos, _InIter __first, _InIter __last)

iterator	insert (iterator __pos, const value_type &__x=_Tp())

void	insert (iterator __pos, size_type __n, const value_type &__x)

template<class _InIter >
void	insert (iterator __pos, _InIter __first, _InIter __last)

iterator	erase_after (iterator __pos)

iterator	erase_after (iterator __before_first, iterator __last)

iterator	erase (iterator __pos)

iterator	erase (iterator __first, iterator __last)

void	resize (size_type new_size, const value_type &__x=_Tp())

void	clear ()

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

void	splice_after (iterator __pos, iterator __prev)

void	splice_after (iterator __pos, _Self &__x)

void	splice (iterator __pos, _Self &__x)

void	splice (iterator __pos, _Self &__x, iterator __i)

void	splice (iterator __pos, _Self &__x, iterator __first, iterator __last)

void	reverse ()

void	remove (const _Tp &__val)

void	unique ()

void	merge (_Self &__x)

void	sort ()

template<class _Predicate >
void	remove_if (_Predicate __pred)

template<class _BinaryPredicate >
void	unique (_BinaryPredicate __pred)

template<class _StrictWeakOrdering >
void	merge (slist< _Tp, _Alloc > &__x, _StrictWeakOrdering __comp)

template<class _StrictWeakOrdering >
void	sort (_StrictWeakOrdering __comp)

Friends
struct	QuickSwap

Additional Inherited Members
Protected Types inherited from bsl::_Slist_base< _Tp, _Alloc >
typedef _Alloc_traits< _Node, _Alloc >::allocator_type	_M_node_allocator_type

typedef _Alloc_traits< _Tp, _Alloc >::allocator_type	allocator_type

typedef _Slist_node< _Tp >	_Node

Protected Member Functions inherited from bsl::_Slist_base< _Tp, _Alloc >
_Slist_node_base *	_M_erase_after (_Slist_node_base *__pos)

_Slist_node_base *	_M_erase_after (_Slist_node_base , _Slist_node_base )

	_Slist_base (const allocator_type &__a)

	~_Slist_base ()

allocator_type	get_allocator () const

Protected Attributes inherited from bsl::_Slist_base< _Tp, _Alloc >
_STLP_alloc_proxy< _Slist_node_base, _Node, _M_node_allocator_type >	_M_head

Member Typedef Documentation

◆ _Iterator_category

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef std::forward_iterator_tag bsl::slist< _Tp, _Alloc >::_Iterator_category

◆ allocator_type

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef _Base::allocator_type bsl::slist< _Tp, _Alloc >::allocator_type

◆ const_iterator

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef _Slist_iterator<_Tp, _Const_traits<_Tp> > bsl::slist< _Tp, _Alloc >::const_iterator

◆ const_pointer

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef const value_type* bsl::slist< _Tp, _Alloc >::const_pointer

◆ const_reference

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef const value_type& bsl::slist< _Tp, _Alloc >::const_reference

◆ difference_type

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef std::ptrdiff_t bsl::slist< _Tp, _Alloc >::difference_type

◆ iterator

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef _Slist_iterator<_Tp, _Nonconst_traits<_Tp> > bsl::slist< _Tp, _Alloc >::iterator

◆ pointer

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef value_type* bsl::slist< _Tp, _Alloc >::pointer

◆ reference

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef value_type& bsl::slist< _Tp, _Alloc >::reference

◆ size_type

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef std::size_t bsl::slist< _Tp, _Alloc >::size_type

◆ value_type

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

typedef _Tp bsl::slist< _Tp, _Alloc >::value_type

Constructor & Destructor Documentation

◆ slist() [1/5]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

bsl::slist< _Tp, _Alloc >::slist ( const allocator_type & __a = allocator_type() )

inlineexplicit

◆ slist() [2/5]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

bsl::slist< _Tp, _Alloc >::slist	(	size_type	__n,
		const value_type &	__x = `_Tp()`,
		const allocator_type &	__a = `allocator_type()`
	)

inlineexplicit

◆ slist() [3/5]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _InputIterator >

bsl::slist< _Tp, _Alloc >::slist	(	_InputIterator	__first,
		_InputIterator	__last,
		const allocator_type &	__a = `allocator_type()`
	)

inline

◆ slist() [4/5]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

bsl::slist< _Tp, _Alloc >::slist ( const _Self & __x )

inline

◆ slist() [5/5]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

bsl::slist< _Tp, _Alloc >::slist	(	const _Self &	__x,
		const allocator_type &	__a
	)

inline

◆ ~slist()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

bsl::slist< _Tp, _Alloc >::~slist ( )

inline

Member Function Documentation

◆ _M_assign_dispatch() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _InputIter >

void bsl::slist< _Tp, _Alloc >::_M_assign_dispatch	(	_InputIter	__first,
		_InputIter	__last,
		bsl::false_type *
	)

inline

◆ _M_assign_dispatch() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _Integer >

void bsl::slist< _Tp, _Alloc >::_M_assign_dispatch	(	_Integer	__n,
		_Integer	__val,
		bsl::true_type *
	)

inline

◆ _M_fill_assign()

template<class _Tp , class _Alloc >

void bsl::slist< _Tp, _Alloc >::_M_fill_assign	(	size_type	__n,
		const _Tp &	__val
	)

◆ assign() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _InputIterator >

void bsl::slist< _Tp, _Alloc >::assign	(	_InputIterator	__first,
		_InputIterator	__last
	)

inline

◆ assign() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::assign	(	size_type	__n,
		const _Tp &	__val
	)

inline

◆ before_begin() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::before_begin ( )

inline

◆ before_begin() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

const_iterator bsl::slist< _Tp, _Alloc >::before_begin ( ) const

inline

◆ begin() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::begin ( )

inline

◆ begin() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

const_iterator bsl::slist< _Tp, _Alloc >::begin ( ) const

inline

◆ clear()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::clear ( )

inline

◆ empty()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

bool bsl::slist< _Tp, _Alloc >::empty ( ) const

inline

◆ end() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::end ( )

inline

◆ end() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

const_iterator bsl::slist< _Tp, _Alloc >::end ( ) const

inline

◆ erase() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::erase	(	iterator	__first,
		iterator	__last
	)

inline

◆ erase() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::erase ( iterator __pos )

inline

◆ erase_after() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::erase_after	(	iterator	__before_first,
		iterator	__last
	)

inline

◆ erase_after() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::erase_after ( iterator __pos )

inline

◆ front() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

reference bsl::slist< _Tp, _Alloc >::front ( )

inline

◆ front() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

const_reference bsl::slist< _Tp, _Alloc >::front ( ) const

inline

◆ get_allocator()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

allocator_type bsl::slist< _Tp, _Alloc >::get_allocator ( ) const

inline

◆ insert() [1/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _InIter >

void bsl::slist< _Tp, _Alloc >::insert	(	iterator	__pos,
		_InIter	__first,
		_InIter	__last
	)

inline

◆ insert() [2/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::insert	(	iterator	__pos,
		const value_type &	__x = `_Tp()`
	)

inline

◆ insert() [3/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::insert	(	iterator	__pos,
		size_type	__n,
		const value_type &	__x
	)

inline

◆ insert_after() [1/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _InIter >

void bsl::slist< _Tp, _Alloc >::insert_after	(	iterator	__pos,
		_InIter	__first,
		_InIter	__last
	)

inline

◆ insert_after() [2/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::insert_after	(	iterator	__pos,
		const value_type &	__x = `_Tp()`
	)

inline

◆ insert_after() [3/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::insert_after	(	iterator	__pos,
		size_type	__n,
		const value_type &	__x
	)

inline

◆ max_size()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

size_type bsl::slist< _Tp, _Alloc >::max_size ( ) const

inline

◆ merge() [1/2]

template<class _Tp , class _Alloc >

void bsl::slist< _Tp, _Alloc >::merge ( _Self & __x )

◆ merge() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _StrictWeakOrdering >

void bsl::slist< _Tp, _Alloc >::merge	(	slist< _Tp, _Alloc > &	__x,
		_StrictWeakOrdering	__comp
	)

inline

◆ operator=()

template<class _Tp , class _Alloc >

slist< _Tp, _Alloc > & bsl::slist< _Tp, _Alloc >::operator= ( const _Self & __x )

◆ pop_front()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::pop_front ( )

inline

◆ previous() [1/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

iterator bsl::slist< _Tp, _Alloc >::previous ( const_iterator __pos )

inline

◆ previous() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

const_iterator bsl::slist< _Tp, _Alloc >::previous ( const_iterator __pos ) const

inline

◆ push_front()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::push_front ( const value_type & __x = _Tp() )

inline

◆ remove()

template<class _Tp , class _Alloc >

void bsl::slist< _Tp, _Alloc >::remove ( const _Tp & __val )

◆ remove_if()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _Predicate >

void bsl::slist< _Tp, _Alloc >::remove_if ( _Predicate __pred )

inline

◆ resize()

template<class _Tp , class _Alloc >

void bsl::slist< _Tp, _Alloc >::resize	(	size_type	new_size,
		const value_type &	__x = `_Tp()`
	)

◆ reverse()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::reverse ( )

inline

◆ size()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

size_type bsl::slist< _Tp, _Alloc >::size ( ) const

inline

◆ sort() [1/2]

template<class _Tp , class _Alloc >

void bsl::slist< _Tp, _Alloc >::sort ( )

◆ sort() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _StrictWeakOrdering >

void bsl::slist< _Tp, _Alloc >::sort ( _StrictWeakOrdering __comp )

inline

◆ splice() [1/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::splice	(	iterator	__pos,
		_Self &	__x
	)

inline

◆ splice() [2/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::splice	(	iterator	__pos,
		_Self &	__x,
		iterator	__first,
		iterator	__last
	)

inline

◆ splice() [3/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::splice	(	iterator	__pos,
		_Self &	__x,
		iterator	__i
	)

inline

◆ splice_after() [1/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::splice_after	(	iterator	__pos,
		_Self &	__x
	)

inline

◆ splice_after() [2/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::splice_after	(	iterator	__pos,
		iterator	__before_first,
		iterator	__before_last
	)

inline

◆ splice_after() [3/3]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::splice_after	(	iterator	__pos,
		iterator	__prev
	)

inline

◆ swap()

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

void bsl::slist< _Tp, _Alloc >::swap ( _Self & __x )

inline

◆ unique() [1/2]

template<class _Tp , class _Alloc >

void bsl::slist< _Tp, _Alloc >::unique ( )

◆ unique() [2/2]

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

template<class _BinaryPredicate >

void bsl::slist< _Tp, _Alloc >::unique ( _BinaryPredicate __pred )

inline

Friends And Related Symbol Documentation

◆ QuickSwap

template<class _Tp , class _Alloc = bsl::allocator<_Tp>>

friend struct QuickSwap

friend

The documentation for this class was generated from the following file:

bslstp_slist.h

Public Types

Public Member Functions

Friends

Additional Inherited Members

Member Typedef Documentation

◆ _Iterator_category

◆ allocator_type

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ difference_type

◆ iterator

◆ pointer

◆ reference

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ slist() [1/5]

◆ slist() [2/5]

◆ slist() [3/5]

◆ slist() [4/5]

◆ slist() [5/5]

◆ ~slist()

Member Function Documentation

◆ _M_assign_dispatch() [1/2]

◆ _M_assign_dispatch() [2/2]

◆ _M_fill_assign()

◆ assign() [1/2]

◆ assign() [2/2]

◆ before_begin() [1/2]

◆ before_begin() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ clear()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ erase_after() [1/2]

◆ erase_after() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ get_allocator()

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ insert_after() [1/3]

◆ insert_after() [2/3]

◆ insert_after() [3/3]

◆ max_size()

◆ merge() [1/2]

◆ merge() [2/2]

◆ operator=()

◆ pop_front()

◆ previous() [1/2]

◆ previous() [2/2]

◆ push_front()

◆ remove()

◆ remove_if()

◆ resize()

◆ reverse()

◆ size()

◆ sort() [1/2]

◆ sort() [2/2]

◆ splice() [1/3]

◆ splice() [2/3]

◆ splice() [3/3]

◆ splice_after() [1/3]

◆ splice_after() [2/3]

◆ splice_after() [3/3]

◆ swap()

◆ unique() [1/2]

◆ unique() [2/2]

Friends And Related Symbol Documentation

◆ QuickSwap