_slist.h File Reference

#include <stl/_algobase.h>
#include <stl/_alloc.h>
#include <stl/_iterator.h>
#include <stl/_construct.h>
#include <stl/_function_base.h>
#include <stl/_slist_base.h>
#include <stl/_slist.c>
#include <stl/_relops_cont.h>

Go to the source code of this file.

Data Structures
class	_Slist_node< _Tp >
struct	_Slist_iterator_base
class	_Slist_iterator< _Tp, _Traits >
class	_Slist_base< _Tp, _Alloc >
class	slist< _Tp, _Alloc >
Defines
#define	_STLP_EQUAL_OPERATOR_SPECIALIZED
#define	_STLP_TEMPLATE_HEADER   template <class _Tp, class _Alloc>
#define	_STLP_TEMPLATE_CONTAINER   slist<_Tp, _Alloc>
Functions
template<class _Tp , class _Alloc , class _BinaryPredicate >
_STLP_MOVE_TO_PRIV_NAMESPACE void	_Slist_unique (slist< _Tp, _Alloc > &__that, _BinaryPredicate __binary_pred)
template<class _Tp , class _Alloc , class _StrictWeakOrdering >
void	_Slist_merge (slist< _Tp, _Alloc > &__that, slist< _Tp, _Alloc > &__x, _StrictWeakOrdering __comp)
template<class _Tp , class _Alloc , class _StrictWeakOrdering >
void	_Slist_sort (slist< _Tp, _Alloc > &__that, _StrictWeakOrdering __comp)
template<class _Tp , class _Alloc >
_STLP_END_NAMESPACE _STLP_BEGIN_NAMESPACE bool _STLP_CALL	operator== (const slist< _Tp, _Alloc > &_SL1, const slist< _Tp, _Alloc > &_SL2)