list< _Tp, > Struct Template Reference

#include <_list.h>

Inheritance diagram for list< _Tp, >:

Collaboration diagram for list< _Tp, >:

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 size_t	size_type
typedef ptrdiff_t	difference_type
typedef _Base::allocator_type	allocator_type
typedef bidirectional_iterator_tag	_Iterator_category
typedef _STLP_PRIV _List_iterator< _Tp, _Nonconst_traits< _Tp > >	iterator
typedef _STLP_PRIV _List_iterator< _Tp, _Const_traits< _Tp > >	const_iterator
typedef _STLP_PRIV _DBG_iter< _Base, _STLP_PRIV _DbgTraits< _Nonconst_traits< value_type > > >	iterator
typedef _STLP_PRIV _DBG_iter< _Base, _STLP_PRIV _DbgTraits< _Const_traits< value_type > > >	const_iterator
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 size_t	size_type
typedef ptrdiff_t	difference_type
typedef _Alloc_traits< value_type, _Alloc >::allocator_type	allocator_type
typedef bidirectional_iterator_tag	_Iterator_category
typedef _STLP_PRIV _List_iterator< value_type, _Nonconst_traits< value_type > >	iterator
typedef _STLP_PRIV _List_iterator< value_type, _Const_traits< value_type > >	const_iterator

Public Member Functions
	list (size_type __n, const_reference __val=_STLP_DEFAULT_CONSTRUCTED(value_type), const allocator_type &__a=allocator_type())
	list (const value_type *__first, const value_type *__last, const allocator_type &__a=allocator_type())
	list (const_iterator __first, const_iterator __last, const allocator_type &__a=allocator_type())
	list (const allocator_type &__a=allocator_type())
	list (const _Self &__x)
	list (__move_source< _Self > src)
	~list ()
_Self &	operator= (const _Self &__x)
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
size_type	size () const
size_type	max_size () const
reference	front ()
const_reference	front () const
reference	back ()
const_reference	back () const
void	swap (_Self &__x)
iterator	insert (iterator __pos, const_reference __x=value_type())
void	insert (iterator __pos, const value_type *__first, const value_type *__last)
void	insert (iterator __pos, const_iterator __first, const_iterator __last)
void	insert (iterator __pos, size_type __n, const_reference __x)
void	push_front (const_reference __x)
void	push_back (const_reference __x)
iterator	erase (iterator __pos)
iterator	erase (iterator __first, iterator __last)
void	resize (size_type __new_size, const_reference __x=value_type())
void	pop_front ()
void	pop_back ()
void	assign (size_type __n, const_reference __val)
void	_M_fill_assign (size_type __n, const_reference __val)
void	assign (const value_type *__first2, const value_type *__last2)
void	assign (const_iterator __first2, const_iterator __last2)
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	remove (const_reference __val)
void	unique ()
void	merge (_Self &__x)
void	reverse ()
void	sort ()
	list (const allocator_type &__a=allocator_type())
	list (size_type __n, const _Tp &__x=_Tp(), const allocator_type &__a=allocator_type())
	list (__move_source< _Self > src)
	list (const value_type *__first, const value_type *__last, const allocator_type &__a=allocator_type())
	list (const_iterator __first, const_iterator __last, const allocator_type &__a=allocator_type())
	list (const _Self &__x)
_Self &	operator= (const _Self &__x)
allocator_type	get_allocator () const
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
reverse_iterator	rbegin ()
reverse_iterator	rend ()
const_reverse_iterator	rbegin () const
const_reverse_iterator	rend () const
size_type	size () const
size_type	max_size () const
bool	empty () const
reference	front ()
const_reference	front () const
reference	back ()
const_reference	back () const
void	swap (_Self &__x)
iterator	insert (iterator __pos, const _Tp &__x=_Tp())
void	insert (iterator __pos, const _Tp *__first, const _Tp *__last)
void	insert (iterator __pos, const_iterator __first, const_iterator __last)
void	insert (iterator __pos, iterator __first, iterator __last)
void	insert (iterator __pos, size_type __n, const _Tp &__x)
void	push_back (const_reference __x)
void	pop_back ()
void	push_front (const_reference __x)
void	pop_front ()
iterator	erase (iterator __pos)
iterator	erase (iterator __first, iterator __last)
void	resize (size_type __new_size, const _Tp &__x=_Tp())
void	assign (const _Tp *__first, const _Tp *__last)
void	assign (iterator __first, iterator __last)
void	assign (const_iterator __first, const_iterator __last)
void	assign (size_type __n, const _Tp &__val)
void	remove (const _Tp &__x)
void	clear ()
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	merge (_Self &__x)
void	reverse ()
void	unique ()
void	sort ()
allocator_type	get_allocator () const
	list (const allocator_type &__a=allocator_type())
	list (size_type __n, const value_type &__val=_STLP_DEFAULT_CONSTRUCTED(value_type), const allocator_type &__a=allocator_type())
	list (const value_type *__first, const value_type *__last, const allocator_type &__a=allocator_type())
	list (const_iterator __first, const_iterator __last, const allocator_type &__a=allocator_type())
	list (const _Self &__x)
	list (__move_source< _Self > src)
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
bool	empty () const
size_type	size () const
size_type	max_size () const
reference	front ()
const_reference	front () const
reference	back ()
const_reference	back () const
void	swap (_Self &__x)
void	clear ()
iterator	insert (iterator __pos, const_reference __x=_STLP_DEFAULT_CONSTRUCTED(value_type))
void	insert (iterator __pos, const value_type *__first, const value_type *__last)
void	insert (iterator __pos, const_iterator __first, const_iterator __last)
void	insert (iterator __pos, size_type __n, const value_type &__x)
void	push_front (const value_type &__x)
void	push_back (const value_type &__x)
iterator	erase (iterator __pos)
iterator	erase (iterator __first, iterator __last)
void	resize (size_type __new_size, const value_type &__x=_STLP_DEFAULT_CONSTRUCTED(value_type))
void	pop_front ()
void	pop_back ()
_Self &	operator= (const _Self &__x)
void	assign (size_type __n, const value_type &__val)
void	assign (const value_type *__first, const value_type *__last)
void	assign (const_iterator __first, const_iterator __last)
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	remove (const_reference __val)
void	unique ()
void	merge (_Self &__x)
void	reverse ()
void	sort ()

Public Attributes
	_STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS
struct list *	next
struct list *	prev

Protected Member Functions
_Node_base *	_M_create_node (const_reference __x=value_type())

Private Types
typedef _STLP_PRIV _List_base< _Tp, _Alloc >	_Base
typedef list< _Tp, _Alloc >	_Self
typedef _STLP_PRIV _List_node< _Tp >	_Node
typedef _STLP_PRIV _List_node_base	_Node_base
typedef _STLP_NON_DBG_LIST	_Base
typedef list< _Tp, _Alloc >	_Self
typedef _STLP_PRIV __construct_checker< _STLP_NON_DBG_LIST >	_ConstructCheck
typedef _Base::iterator	_Base_iterator
typedef _STLP_TYPENAME _STLP_PRIV _StorageType< _Tp >::_Type	_StorageType
typedef _Alloc_traits< _StorageType, _Alloc >::allocator_type	_StorageTypeAlloc
typedef _STLP_PRIV LIST_IMPL< _StorageType, _StorageTypeAlloc >	_Base
typedef _Base::iterator	_BaseIte
typedef _Base::const_iterator	_BaseConstIte
typedef _STLP_PRIV _CastTraits< _StorageType, _Tp >	cast_traits
typedef list< _Tp, _Alloc >	_Self

Private Member Functions
void	_M_swap_aux (_Self &__x)
void	_M_insert (iterator __pos, const value_type *__first, const value_type *__last)
void	_M_insert (iterator __pos, const_iterator __first, const_iterator __last)
void	_M_fill_insert (iterator __pos, size_type __n, const_reference __x)
void	_Invalidate_iterator (const iterator &__it)
void	_Invalidate_iterators (const iterator &__first, const iterator &__last)

Private Attributes
_Base	_M_non_dbg_impl
_STLP_PRIV __owned_list	_M_iter_list
_Base	_M_impl

Detailed Description

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >)>
struct list< _Tp, >

Definition at line 228 of file _list.h.

Member Typedef Documentation

_Base [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_NON_DBG_LIST list< _Tp, >::_Base

private

Definition at line 66 of file _list.h.

_Base [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV LIST_IMPL<_StorageType, _StorageTypeAlloc> list< _Tp, >::_Base

private

Definition at line 66 of file _list.h.

_Base [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_base<_Tp, _Alloc> list< _Tp, >::_Base

private

Definition at line 258 of file _list.h.

_Base_iterator

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Base::iterator list< _Tp, >::_Base_iterator

private

Definition at line 88 of file _list.h.

_BaseConstIte

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Base::const_iterator list< _Tp, >::_BaseConstIte

private

Definition at line 68 of file _list.h.

_BaseIte

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Base::iterator list< _Tp, >::_BaseIte

private

Definition at line 67 of file _list.h.

_ConstructCheck

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV __construct_checker<_STLP_NON_DBG_LIST > list< _Tp, >::_ConstructCheck

private

Definition at line 68 of file _list.h.

_Iterator_category [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef bidirectional_iterator_tag list< _Tp, >::_Iterator_category

Definition at line 82 of file _list.h.

_Iterator_category [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef bidirectional_iterator_tag list< _Tp, >::_Iterator_category

Definition at line 272 of file _list.h.

_Node

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_node<_Tp> list< _Tp, >::_Node

private

Definition at line 260 of file _list.h.

_Node_base

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_node_base list< _Tp, >::_Node_base

private

Definition at line 261 of file _list.h.

_Self [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef list<_Tp, _Alloc> list< _Tp, >::_Self

private

Definition at line 67 of file _list.h.

_Self [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef list<_Tp, _Alloc> list< _Tp, >::_Self

private

Definition at line 70 of file _list.h.

_Self [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef list<_Tp, _Alloc> list< _Tp, >::_Self

private

Definition at line 259 of file _list.h.

_StorageType

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_TYPENAME _STLP_PRIV _StorageType<_Tp>::_Type list< _Tp, >::_StorageType

private

Definition at line 64 of file _list.h.

_StorageTypeAlloc

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Alloc_traits<_StorageType, _Alloc>::allocator_type list< _Tp, >::_StorageTypeAlloc

private

Definition at line 65 of file _list.h.

allocator_type [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Alloc_traits<value_type, _Alloc>::allocator_type list< _Tp, >::allocator_type

Definition at line 81 of file _list.h.

allocator_type [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Base::allocator_type list< _Tp, >::allocator_type

Definition at line 271 of file _list.h.

cast_traits

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _CastTraits<_StorageType, _Tp> list< _Tp, >::cast_traits

private

Definition at line 69 of file _list.h.

const_iterator [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_Const_traits<value_type> > > list< _Tp, >::const_iterator

Definition at line 75 of file _list.h.

const_iterator [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_iterator<value_type, _Const_traits<value_type> > list< _Tp, >::const_iterator

Definition at line 85 of file _list.h.

const_iterator [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_iterator<_Tp, _Const_traits<_Tp> > list< _Tp, >::const_iterator

Definition at line 276 of file _list.h.

const_pointer [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef const value_type* list< _Tp, >::const_pointer

Definition at line 75 of file _list.h.

const_pointer [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef const value_type* list< _Tp, >::const_pointer

Definition at line 265 of file _list.h.

const_reference [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef const value_type& list< _Tp, >::const_reference

Definition at line 77 of file _list.h.

const_reference [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef const value_type& list< _Tp, >::const_reference

Definition at line 267 of file _list.h.

difference_type [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef ptrdiff_t list< _Tp, >::difference_type

Definition at line 79 of file _list.h.

difference_type [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef ptrdiff_t list< _Tp, >::difference_type

Definition at line 269 of file _list.h.

iterator [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_Nonconst_traits<value_type> > > list< _Tp, >::iterator

Definition at line 74 of file _list.h.

iterator [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_iterator<value_type, _Nonconst_traits<value_type> > list< _Tp, >::iterator

Definition at line 84 of file _list.h.

iterator [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _STLP_PRIV _List_iterator<_Tp, _Nonconst_traits<_Tp> > list< _Tp, >::iterator

Definition at line 275 of file _list.h.

pointer [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef value_type* list< _Tp, >::pointer

Definition at line 74 of file _list.h.

pointer [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef value_type* list< _Tp, >::pointer

Definition at line 264 of file _list.h.

reference [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef value_type& list< _Tp, >::reference

Definition at line 76 of file _list.h.

reference [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef value_type& list< _Tp, >::reference

Definition at line 266 of file _list.h.

size_type [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef size_t list< _Tp, >::size_type

Definition at line 78 of file _list.h.

size_type [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef size_t list< _Tp, >::size_type

Definition at line 268 of file _list.h.

value_type [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Tp list< _Tp, >::value_type

Definition at line 73 of file _list.h.

value_type [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

typedef _Tp list< _Tp, >::value_type

Definition at line 263 of file _list.h.

Constructor & Destructor Documentation

list() [1/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( size_type  __n, const_reference  __val = _STLP_DEFAULT_CONSTRUCTED(value_type), const allocator_type &  __a = allocator_type()  )

inlineexplicit

Definition at line 306 of file _list.h.

    : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type())
    { this->insert(begin(), __n, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
  list(size_type __n, const_reference __val)
    : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type())
    { this->insert(begin(), __n, __val); }
  list(size_type __n, const_reference __val, const allocator_type& __a)
#endif /*_STLP_DONT_SUP_DFLT_PARAM*/
    : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
    { this->insert(begin(), __n, __val); }

Referenced by string_buffer_get(), string_buffer_list_cleanup(), string_buffer_list_init(), string_buffer_release(), and testQuery().

list() [2/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const value_type *  __first, const value_type *  __last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 336 of file _list.h.

    : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
    { _M_insert(begin(), __first, __last); }

list() [3/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const_iterator  __first, const_iterator  __last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 340 of file _list.h.

    : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
    { _M_insert(begin(), __first, __last); }

list() [4/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const allocator_type &  __a = allocator_type() )

inlineexplicit

Definition at line 347 of file _list.h.

    : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type()) {}
  list(const allocator_type& __a)
#endif
    : _STLP_PRIV _List_base<_Tp, _Alloc>(__a) {}

list() [5/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const _Self &  __x )

inline

Definition at line 355 of file _list.h.

                         : _STLP_PRIV _List_base<_Tp, _Alloc>(__x.get_allocator())
  { _M_insert(begin(), __x.begin(), __x.end()); }

list() [6/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( __move_source< _Self >  src )

inline

Definition at line 359 of file _list.h.

    : _STLP_PRIV _List_base<_Tp, _Alloc>(__move_source<_Base>(src.get())) {}

~list()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::~list ( )

inline

Definition at line 363 of file _list.h.

{}

list() [7/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const allocator_type &  __a = allocator_type() )

inlineexplicit

Definition at line 91 of file _list.h.

                                                              :
    _M_non_dbg_impl(__a), _M_iter_list(&_M_non_dbg_impl) {}

list() [8/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( size_type  __n, const _Tp &  __x = _Tp(), const allocator_type &  __a = allocator_type()  )

inlineexplicit

Parameters

__a	_STLP_DONT_SUP_DFLT_PARAM

Definition at line 95 of file _list.h.

    : _M_non_dbg_impl(__n, __x, __a), _M_iter_list(&_M_non_dbg_impl) {}

list() [9/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( __move_source< _Self >  src )

inline

Definition at line 108 of file _list.h.

    : _M_non_dbg_impl(__move_source<_Base>(src.get()._M_non_dbg_impl)),
      _M_iter_list(&_M_non_dbg_impl) {
#  if defined (_STLP_NO_EXTENSIONS) || (_STLP_DEBUG_LEVEL == _STLP_STANDARD_DBG_LEVEL)
    src.get()._M_iter_list._Invalidate_all();
#  else
    src.get()._M_iter_list._Set_owner(_M_iter_list);
#  endif
  }

list() [10/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const value_type *  __first, const value_type *  __last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 135 of file _list.h.

    : _ConstructCheck(__first, __last),
      _M_non_dbg_impl(__first, __last, __a),
      _M_iter_list(&_M_non_dbg_impl) {}

list() [11/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const_iterator  __first, const_iterator  __last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 140 of file _list.h.

    : _ConstructCheck(__first, __last),
      _M_non_dbg_impl(__first._M_iterator, __last._M_iterator, __a),
      _M_iter_list(&_M_non_dbg_impl) {}

list() [12/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const _Self &  __x )

inline

Definition at line 148 of file _list.h.

                         :
    _ConstructCheck(__x),
    _M_non_dbg_impl(__x._M_non_dbg_impl) , _M_iter_list(&_M_non_dbg_impl) {}

list() [13/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const allocator_type &  __a = allocator_type() )

inlineexplicit

Definition at line 92 of file _list.h.

    : _M_impl(_STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}

list() [14/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( size_type  __n, const value_type &  __val = _STLP_DEFAULT_CONSTRUCTED(value_type), const allocator_type &  __a = allocator_type()  )

inlineexplicit

Definition at line 96 of file _list.h.

    : _M_impl(__n, cast_traits::to_storage_type_cref(__val),
              _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}

list() [15/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const value_type *  __first, const value_type *  __last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 133 of file _list.h.

    : _M_impl(cast_traits::to_storage_type_cptr(__first),
              cast_traits::to_storage_type_cptr(__last),
               _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}

list() [16/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const_iterator  __first, const_iterator  __last, const allocator_type &  __a = allocator_type()  )

inline

Definition at line 138 of file _list.h.

    : _M_impl(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node),
              _STLP_CONVERT_ALLOCATOR(__a, _StorageType)) {}

list() [17/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( const _Self &  __x )

inline

Definition at line 145 of file _list.h.

: _M_impl(__x._M_impl) {}

list() [18/18]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::list ( __move_source< _Self >  src )

inline

Definition at line 148 of file _list.h.

    : _M_impl(__move_source<_Base>(src.get()._M_impl)) {}

Member Function Documentation

_Invalidate_iterator()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::_Invalidate_iterator ( const iterator &  __it )

inlineprivate

Definition at line 83 of file _list.h.

  { _STLP_PRIV __invalidate_iterator(&_M_iter_list, __it); }

Referenced by list< BookmarkNode >::erase(), list< BookmarkNode >::pop_back(), list< BookmarkNode >::pop_front(), list< BookmarkNode >::remove(), list< BookmarkNode >::splice(), and list< BookmarkNode >::unique().

_Invalidate_iterators()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::_Invalidate_iterators ( const iterator &  __first, const iterator &  __last  )

inlineprivate

Definition at line 85 of file _list.h.

  { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }

Referenced by list< BookmarkNode >::assign(), list< BookmarkNode >::clear(), list< BookmarkNode >::erase(), list< BookmarkNode >::merge(), list< BookmarkNode >::operator=(), list< BookmarkNode >::resize(), and list< BookmarkNode >::splice().

_M_create_node()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

_Node_base* list< _Tp, >::_M_create_node ( const_reference  __x = value_type() )

inlineprotected

Definition at line 281 of file _list.h.

                                                                 {
#else
  _Node_base* _M_create_node(const_reference __x) {
#endif
    _Node* __p = this->_M_node.allocate(1);
    _STLP_TRY {
      _Copy_Construct(&__p->_M_data, __x);
    }
    _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
    return __p;
  }

Referenced by list< BookmarkNode >::_M_create_node().

_M_fill_assign()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, _Alloc >::_M_fill_assign	(	size_type	__n,
		const_reference	__val
	)

Definition at line 124 of file _list.c.

                                                                      {
  iterator __i = begin();
  for ( ; __i != end() && __n > 0; ++__i, --__n)
    *__i = __val;
  if (__n > 0)
    insert(end(), __n, __val);
  else
    erase(__i, end());
}

Referenced by list< BookmarkNode >::assign().

_M_fill_insert()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::_M_fill_insert ( iterator  __pos, size_type  __n, const_reference  __x  )

inlineprivate

Definition at line 502 of file _list.h.

                                                                          {
    for ( ; __n > 0; --__n)
      insert(__pos, __x);
  }

Referenced by list< BookmarkNode >::insert().

_M_insert() [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::_M_insert ( iterator  __pos, const value_type *  __first, const value_type *  __last  )

inlineprivate

Definition at line 454 of file _list.h.

                                                                                      {
    for (; __first != __last; ++__first)
      insert(__pos, *__first);
  }

Referenced by list< BookmarkNode >::list().

_M_insert() [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::_M_insert ( iterator  __pos, const_iterator  __first, const_iterator  __last  )

inlineprivate

Definition at line 458 of file _list.h.

                                                                                {
#endif /* _STLP_MEMBER_TEMPLATES */
    //We use a temporary list to avoid the auto reference troubles (infinite loop)
    for (; __first != __last; ++__first)
      insert(__pos, *__first);
  }

_M_swap_aux()

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::_M_swap_aux ( _Self &  __x )

inlineprivate

Definition at line 391 of file _list.h.

                               {
    __x._M_node._M_swap_alloc(this->_M_node);
    __x._M_node._M_data._M_next = this->_M_node._M_data._M_next;
    __x._M_node._M_data._M_next->_M_prev = &__x._M_node._M_data;
    __x._M_node._M_data._M_prev = this->_M_node._M_data._M_prev;
    __x._M_node._M_data._M_prev->_M_next = &__x._M_node._M_data;
    this->_M_empty_initialize();
  }

Referenced by list< BookmarkNode >::swap().

assign() [1/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( size_type  __n, const value_type &  __val  )

inline

Definition at line 255 of file _list.h.

  { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }

assign() [2/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( const value_type *  __first, const value_type *  __last  )

inline

Definition at line 285 of file _list.h.

                                                                   {
    _M_impl.assign(cast_traits::to_storage_type_cptr(__first),
                   cast_traits::to_storage_type_cptr(__last));
  }

assign() [3/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( const_iterator  __first, const_iterator  __last  )

inline

Definition at line 289 of file _list.h.

  { _M_impl.assign(_BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node)); }

assign() [4/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( const _Tp *  __first, const _Tp *  __last  )

inline

Definition at line 315 of file _list.h.

                                                     {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__first, __last))
    _M_non_dbg_impl.assign(__first, __last);
    _Invalidate_iterators(begin(), end());
  }

assign() [5/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( iterator  __first, iterator  __last  )

inline

Definition at line 321 of file _list.h.

                                                 {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
    _M_non_dbg_impl.assign(__first._M_iterator, __last._M_iterator);
    _Invalidate_iterators(begin(), end());
  }

assign() [6/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( const_iterator  __first, const_iterator  __last  )

inline

Definition at line 327 of file _list.h.

                                                             {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
    _M_non_dbg_impl.assign(__first._M_iterator, __last._M_iterator);
    _Invalidate_iterators(begin(), end());
  }

assign() [7/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( size_type  __n, const _Tp &  __val  )

inline

Definition at line 334 of file _list.h.

                                               {
    _Invalidate_iterators(begin(), end());
    _M_non_dbg_impl.assign(__n, __val);
  }

assign() [8/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( size_type  __n, const_reference  __val  )

inline

Definition at line 555 of file _list.h.

{ _M_fill_assign(__n, __val); }

Referenced by list< BookmarkNode >::resize().

assign() [9/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( const value_type *  __first2, const value_type *  __last2  )

inline

Definition at line 576 of file _list.h.

                                                                     {
    iterator __first1 = begin();
    iterator __last1 = end();
    for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
      *__first1 = *__first2;
    if (__first2 == __last2)
      erase(__first1, __last1);
    else
      insert(__last1, __first2, __last2);
  }

assign() [10/10]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::assign ( const_iterator  __first2, const_iterator  __last2  )

inline

Definition at line 586 of file _list.h.

                                                               {
#endif /* _STLP_MEMBER_TEMPLATES */
    iterator __first1 = begin();
    iterator __last1 = end();
    for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
      *__first1 = *__first2;
    if (__first2 == __last2)
      erase(__first1, __last1);
    else
      insert(__last1, __first2, __last2);
  }

back() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reference list< _Tp, >::back ( )

inline

Definition at line 170 of file _list.h.

{ return *(--end()); }

back() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reference list< _Tp, >::back ( ) const

inline

Definition at line 171 of file _list.h.

{ return *(--end()); }

back() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reference list< _Tp, >::back ( )

inline

Definition at line 188 of file _list.h.

                   {
    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
    return *(--end());
  }

back() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reference list< _Tp, >::back ( ) const

inline

Definition at line 192 of file _list.h.

                               {
    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
    return *(--end());
  }

back() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reference list< _Tp, >::back ( )

inline

Definition at line 387 of file _list.h.

{ return *(--end()); }

back() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reference list< _Tp, >::back ( ) const

inline

Definition at line 388 of file _list.h.

{ return *(--end()); }

begin() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::begin ( )

inline

Definition at line 152 of file _list.h.

{ return iterator(_M_impl.begin()._M_node); }

begin() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_iterator list< _Tp, >::begin ( ) const

inline

Definition at line 153 of file _list.h.

{ return const_iterator(_M_impl.begin()._M_node); }

begin() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::begin ( )

inline

Definition at line 163 of file _list.h.

{ return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }

begin() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_iterator list< _Tp, >::begin ( ) const

inline

Definition at line 164 of file _list.h.

{ return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }

begin() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::begin ( )

inline

Definition at line 367 of file _list.h.

{ return iterator(this->_M_node._M_data._M_next); }

Referenced by _S_merge(), _S_remove_if(), _S_sort(), _S_unique(), StartMenu::AddEntries(), RecentStartMenu::AddEntries(), FavoritesMenu::AddEntries(), list< BookmarkNode >::assign(), list< BookmarkNode >::clear(), NotifyArea::DetermineHideState(), list< BookmarkNode >::erase(), list< BookmarkNode >::front(), Favorites::import_IE_favorites(), list< BookmarkNode >::list(), list< BookmarkNode >::merge(), test_list_sort::operator()(), list< BookmarkNode >::operator=(), operator==(), list< BookmarkNode >::pop_front(), list< BookmarkNode >::push_front(), FindProgramDlg::Refresh(), TrayNotifyDlg::Refresh(), list< BookmarkNode >::remove(), list< BookmarkNode >::rend(), list< BookmarkNode >::resize(), TrayNotifyDlg::SetIconMode(), list< BookmarkNode >::size(), list< BookmarkNode >::splice(), StartMenu::StartMenu(), and NotifyArea::write_config().

begin() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_iterator list< _Tp, >::begin ( ) const

inline

Definition at line 368 of file _list.h.

{ return const_iterator(this->_M_node._M_data._M_next); }

clear() [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::clear ( void  )

inline

Definition at line 177 of file _list.h.

{ _M_impl.clear(); }

clear() [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::clear ( void  )

inline

Definition at line 352 of file _list.h.

               {
    _Invalidate_iterators(begin(), end());
    _M_non_dbg_impl.clear();
  }

Referenced by _S_merge(), list< BookmarkNode >::splice(), and Desktops::ToggleMinimize().

empty() [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

bool list< _Tp, >::empty ( ) const

inline

Definition at line 164 of file _list.h.

{ return _M_impl.empty(); }

empty() [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

bool list< _Tp, >::empty ( ) const

inline

Definition at line 177 of file _list.h.

{ return _M_non_dbg_impl.empty(); }

Referenced by _S_sort(), StartMenu::ActivateEntry(), list< BookmarkNode >::back(), StartMenu::CreateSubmenu(), list< BookmarkNode >::front(), list< BookmarkNode >::pop_back(), list< BookmarkNode >::pop_front(), list< BookmarkNode >::splice(), list< BookmarkNode >::swap(), and Desktops::ToggleMinimize().

end() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::end ( )

inline

Definition at line 155 of file _list.h.

{ return iterator(_M_impl.end()._M_node); }

end() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_iterator list< _Tp, >::end ( ) const

inline

Definition at line 156 of file _list.h.

{ return const_iterator(_M_impl.end()._M_node); }

end() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::end ( )

inline

Definition at line 166 of file _list.h.

{ return iterator(&_M_iter_list, _M_non_dbg_impl.end()); }

end() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_iterator list< _Tp, >::end ( ) const

inline

Definition at line 167 of file _list.h.

{ return const_iterator(&_M_iter_list, _M_non_dbg_impl.end()); }

end() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::end ( )

inline

Definition at line 370 of file _list.h.

{ return iterator(&this->_M_node._M_data); }

Referenced by _S_merge(), _S_remove_if(), _S_unique(), StartMenu::AddEntries(), RecentStartMenu::AddEntries(), FavoritesMenu::AddEntries(), list< BookmarkNode >::assign(), list< BookmarkNode >::back(), list< BookmarkNode >::clear(), NotifyArea::DetermineHideState(), list< BookmarkNode >::erase(), Favorites::import_IE_favorites(), list< BookmarkNode >::list(), list< BookmarkNode >::merge(), test_list_sort::operator()(), list< BookmarkNode >::operator=(), operator==(), list< BookmarkNode >::pop_back(), list< BookmarkNode >::push_back(), list< BookmarkNode >::rbegin(), FindProgramDlg::Refresh(), TrayNotifyDlg::Refresh(), list< BookmarkNode >::remove(), list< BookmarkNode >::resize(), TrayNotifyDlg::SetIconMode(), list< BookmarkNode >::size(), list< BookmarkNode >::splice(), StartMenu::StartMenu(), and NotifyArea::write_config().

end() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_iterator list< _Tp, >::end ( ) const

inline

Definition at line 371 of file _list.h.

{ return const_iterator(__CONST_CAST(_Node_base*, &this->_M_node._M_data)); }

erase() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::erase ( iterator  __pos )

inline

Definition at line 237 of file _list.h.

  { return iterator(_M_impl.erase(_BaseIte(__pos._M_node))._M_node); }

erase() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::erase ( iterator  __first, iterator  __last  )

inline

Definition at line 239 of file _list.h.

  { return iterator(_M_impl.erase(_BaseIte(__first._M_node), _BaseIte(__last._M_node))._M_node); }

erase() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::erase ( iterator  __pos )

inline

Definition at line 276 of file _list.h.

                                 {
    _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__pos))
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
    _Invalidate_iterator(__pos);
    return iterator(&_M_iter_list,_M_non_dbg_impl.erase(__pos._M_iterator));
  }

erase() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::erase ( iterator  __first, iterator  __last  )

inline

Definition at line 282 of file _list.h.

                                                    {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last, begin(), end()))
    _Invalidate_iterators(__first, __last);
    return iterator (&_M_iter_list, _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator));
  }

erase() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::erase ( iterator  __pos )

inline

Definition at line 518 of file _list.h.

                                 {
    _Node_base* __next_node = __pos._M_node->_M_next;
    _Node_base* __prev_node = __pos._M_node->_M_prev;
    _Node* __n = __STATIC_CAST(_Node*, __pos._M_node);
    __prev_node->_M_next = __next_node;
    __next_node->_M_prev = __prev_node;
    _STLP_STD::_Destroy(&__n->_M_data);
    this->_M_node.deallocate(__n, 1);
    return iterator(__next_node);
  }

Referenced by _S_remove_if(), _S_unique(), list< BookmarkNode >::assign(), list< BookmarkNode >::erase(), list< BookmarkNode >::pop_back(), list< BookmarkNode >::remove(), list< BookmarkNode >::resize(), and list< BookmarkNode >::splice().

erase() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::erase ( iterator  __first, iterator  __last  )

inline

Definition at line 529 of file _list.h.

                                                    {
    while (__first != __last)
      erase(__first++);
    return __last;
  }

front() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reference list< _Tp, >::front ( )

inline

Definition at line 168 of file _list.h.

{ return *begin(); }

front() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reference list< _Tp, >::front ( ) const

inline

Definition at line 169 of file _list.h.

{ return *begin(); }

front() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reference list< _Tp, >::front ( )

inline

Definition at line 180 of file _list.h.

                    {
    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
    return *begin();
  }

front() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reference list< _Tp, >::front ( ) const

inline

Definition at line 184 of file _list.h.

                                {
    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
    return *begin();
  }

front() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reference list< _Tp, >::front ( )

inline

Definition at line 385 of file _list.h.

{ return *begin(); }

Referenced by FindProgramDlg::collect_programs_callback().

front() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reference list< _Tp, >::front ( ) const

inline

Definition at line 386 of file _list.h.

{ return *begin(); }

get_allocator() [1/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

allocator_type list< _Tp, >::get_allocator ( ) const

inline

Definition at line 89 of file _list.h.

  { return _STLP_CONVERT_ALLOCATOR(_M_impl.get_allocator(), value_type); }

get_allocator() [2/2]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

allocator_type list< _Tp, >::get_allocator ( ) const

inline

Definition at line 161 of file _list.h.

{ return _M_non_dbg_impl.get_allocator(); }

Referenced by _S_merge(), _S_sort(), list< BookmarkNode >::insert(), list< BookmarkNode >::merge(), and list< BookmarkNode >::splice().

insert() [1/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::insert ( iterator  __pos, const_reference  __x = _STLP_DEFAULT_CONSTRUCTED(value_type)  )

inline

_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS

Definition at line 180 of file _list.h.

  { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
                                   cast_traits::to_storage_type_cref(__x))._M_node); }

insert() [2/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::insert ( iterator  __pos, const _Tp &  __x = _Tp()  )

inline

_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS

Definition at line 206 of file _list.h.

                                                          {
#else
  iterator insert(iterator __pos, const _Tp& __x) {
#endif 
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
    return iterator(&_M_iter_list,_M_non_dbg_impl.insert(__pos._M_iterator, __x) );
  }

insert() [3/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, const value_type *  __first, const value_type *  __last  )

inline

Definition at line 218 of file _list.h.

  { _M_impl.insert(_BaseIte(__pos._M_node), cast_traits::to_storage_type_cptr(__first),
                                            cast_traits::to_storage_type_cptr(__last)); }

insert() [4/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, const_iterator  __first, const_iterator  __last  )

inline

Definition at line 221 of file _list.h.

  { _M_impl.insert(_BaseIte(__pos._M_node), _BaseConstIte(__first._M_node), _BaseConstIte(__last._M_node)); }

insert() [5/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

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

inline

Definition at line 225 of file _list.h.

  { _M_impl.insert(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }

insert() [6/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, const _Tp *  __first, const _Tp *  __last  )

inline

Definition at line 229 of file _list.h.

                                                                     {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__first, __last))
    _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last);
  }

insert() [7/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, const_iterator  __first, const_iterator  __last  )

inline

Definition at line 237 of file _list.h.

                                                             {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
#  if (_STLP_DEBUG_LEVEL == _STLP_STANDARD_DBG_LEVEL)
    _STLP_STD_DEBUG_CHECK(__check_if_not_owner(&_M_iter_list, __first))
#  endif
    _M_non_dbg_impl.insert(__pos._M_iterator, __first._M_iterator, __last._M_iterator);
  }

insert() [8/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, iterator  __first, iterator  __last  )

inline

Definition at line 246 of file _list.h.

                                                 {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
#  if (_STLP_DEBUG_LEVEL == _STLP_STANDARD_DBG_LEVEL)
    _STLP_STD_DEBUG_CHECK(__check_if_not_owner(&_M_iter_list, __first))
#  endif
    _M_non_dbg_impl.insert(__pos._M_iterator, __first._M_iterator, __last._M_iterator);
  }

insert() [9/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, size_type  __n, const _Tp &  __x  )

inline

Definition at line 257 of file _list.h.

                                                             {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
    _M_non_dbg_impl.insert(__pos._M_iterator, __n, __x);
  }

insert() [10/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

iterator list< _Tp, >::insert ( iterator  __pos, const_reference  __x = value_type()  )

inline

_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS

Definition at line 420 of file _list.h.

  {
    _Node_base* __tmp = _M_create_node(__x);
    _Node_base* __n = __pos._M_node;
    _Node_base* __p = __n->_M_prev;
    __tmp->_M_next = __n;
    __tmp->_M_prev = __p;
    __p->_M_next = __tmp;
    __n->_M_prev = __tmp;
    return iterator(__tmp);
  }

Referenced by list< BookmarkNode >::_M_fill_insert(), list< BookmarkNode >::_M_insert(), _S_merge(), list< BookmarkNode >::assign(), list< BookmarkNode >::insert(), list< BookmarkNode >::list(), list< BookmarkNode >::push_back(), list< BookmarkNode >::push_front(), and list< BookmarkNode >::splice().

insert() [11/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, const value_type *  __first, const value_type *  __last  )

inline

Definition at line 485 of file _list.h.

                                                                                   {
    _Self __tmp(__first, __last, this->get_allocator());
    _STLP_ASSERT(__tmp.get_allocator() == this->get_allocator())
    splice(__pos, __tmp);
  }

insert() [12/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, const_iterator  __first, const_iterator  __last  )

inline

Definition at line 490 of file _list.h.

                                                                             {
#endif /* _STLP_MEMBER_TEMPLATES */
    //We use a temporary list to avoid the auto reference troubles (infinite loop)
    _Self __tmp(__first, __last, this->get_allocator());
    splice(__pos, __tmp);
  }

insert() [13/13]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::insert ( iterator  __pos, size_type  __n, const_reference  __x  )

inline

Definition at line 498 of file _list.h.

  { _M_fill_insert(__pos, __n, __x); }

max_size() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

size_type list< _Tp, >::max_size ( ) const

inline

Definition at line 166 of file _list.h.

{ return _M_impl.max_size(); }

max_size() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

size_type list< _Tp, >::max_size ( ) const

inline

Definition at line 176 of file _list.h.

{ return _M_non_dbg_impl.max_size(); }

max_size() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

size_type list< _Tp, >::max_size ( ) const

inline

Definition at line 383 of file _list.h.

{ return size_type(-1); }

merge() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::merge ( _Self &  __x )

inline

Definition at line 304 of file _list.h.

{ _M_impl.merge(__x._M_impl); }

merge() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::merge ( _Self &  __x )

inline

Definition at line 399 of file _list.h.

                         {
#if !defined (_STLP_NO_EXTENSIONS)
    _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(begin()._M_iterator, end()._M_iterator))
    _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(__x.begin()._M_iterator, __x.end()._M_iterator))
#endif
    _M_non_dbg_impl.merge(__x._M_non_dbg_impl);
    if (this->get_allocator() == __x.get_allocator()) {
      __x._M_iter_list._Set_owner(_M_iter_list);
    }
    else {
      __x._Invalidate_iterators(__x.begin(), __x.end());
    }
  }

merge() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::merge ( _Self &  __x )

inline

Definition at line 648 of file _list.h.

  { _STLP_PRIV _S_merge(*this, __x, less<value_type>()); }

operator=() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

_Self& list< _Tp, >::operator= ( const _Self &  __x )

inline

Definition at line 152 of file _list.h.

                                     {
    if (this != &__x) {
      //Should not invalidate end iterator
      _Invalidate_iterators(begin(), end());
      _M_non_dbg_impl = __x._M_non_dbg_impl;
    }
    return *this;
  }

operator=() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

_Self& list< _Tp, >::operator= ( const _Self &  __x )

inline

Definition at line 253 of file _list.h.

  { _M_impl = __x._M_impl; return *this; }

operator=() [3/3]

template<class _Tp , class _Alloc >

list< _Tp, _Alloc > & list< _Tp, _Alloc >::operator=

(

const _Self &

__x

)

Definition at line 107 of file _list.c.

                                                                            {
  if (this != &__x) {
    iterator __first1 = begin();
    iterator __last1 = end();
    const_iterator __first2 = __x.begin();
    const_iterator __last2 = __x.end();
    while (__first1 != __last1 && __first2 != __last2)
      *__first1++ = *__first2++;
    if (__first2 == __last2)
      erase(__first1, __last1);
    else
      insert(__last1, __first2, __last2);
  }
  return *this;
}

pop_back() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::pop_back ( )

inline

Definition at line 251 of file _list.h.

{ _M_impl.pop_back(); }

pop_back() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::pop_back ( )

inline

Definition at line 263 of file _list.h.

                  {
    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
    _Invalidate_iterator(end());
    _M_non_dbg_impl.pop_back();
  }

pop_back() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::pop_back ( )

inline

Definition at line 544 of file _list.h.

                  {
    iterator __tmp = end();
    erase(--__tmp);
  }

pop_front() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::pop_front ( )

inline

Definition at line 250 of file _list.h.

{ _M_impl.pop_front(); }

pop_front() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::pop_front ( )

inline

Definition at line 270 of file _list.h.

                   {
    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)
    _Invalidate_iterator(begin());
    _M_non_dbg_impl.pop_front();
  }

pop_front() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::pop_front ( )

inline

_STLP_DONT_SUP_DFLT_PARAM

Definition at line 543 of file _list.h.

{ erase(begin()); }

push_back() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::push_back ( const value_type &  __x )

inline

Definition at line 229 of file _list.h.

{ _M_impl.push_back(cast_traits::to_storage_type_cref(__x)); }

push_back() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::push_back ( const_reference  __x )

inline

Definition at line 262 of file _list.h.

{ _M_non_dbg_impl.push_back(__x); }

push_back() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::push_back ( const_reference  __x )

inline

Definition at line 509 of file _list.h.

{ insert(end(), __x); }

Referenced by StartMenu::ActivateEntry(), StartMenu::CreateSubmenu(), Favorites::import_IE_favorites(), MinimizeDesktopEnumFct(), NotifyArea::read_config(), TrayNotifyDlg::SetIconMode(), StartMenu::StartMenu(), and StartMenuRoot::StartMenuRoot().

push_front() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::push_front ( const value_type &  __x )

inline

Definition at line 228 of file _list.h.

{ _M_impl.push_front(cast_traits::to_storage_type_cref(__x)); }

push_front() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::push_front ( const_reference  __x )

inline

Definition at line 269 of file _list.h.

{ _M_non_dbg_impl.push_front(__x); }

push_front() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::push_front ( const_reference  __x )

inline

Definition at line 508 of file _list.h.

{ insert(begin(), __x); }

Referenced by FindProgramDlg::collect_programs_callback().

rbegin() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reverse_iterator list< _Tp, >::rbegin ( )

inline

Definition at line 158 of file _list.h.

{ return reverse_iterator(end()); }

rbegin() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reverse_iterator list< _Tp, >::rbegin ( ) const

inline

Definition at line 159 of file _list.h.

{ return const_reverse_iterator(end()); }

rbegin() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reverse_iterator list< _Tp, >::rbegin ( )

inline

Definition at line 169 of file _list.h.

{ return reverse_iterator(end()); }

rbegin() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reverse_iterator list< _Tp, >::rbegin ( ) const

inline

Definition at line 172 of file _list.h.

{ return const_reverse_iterator(end()); }

rbegin() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reverse_iterator list< _Tp, >::rbegin ( )

inline

Definition at line 373 of file _list.h.

{ return reverse_iterator(end()); }

Referenced by Desktops::ToggleMinimize().

rbegin() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reverse_iterator list< _Tp, >::rbegin ( ) const

inline

Definition at line 374 of file _list.h.

{ return const_reverse_iterator(end()); }

remove() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::remove ( const_reference  __val )

inline

Definition at line 301 of file _list.h.

  { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }

remove() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::remove ( const _Tp &  __x )

inline

Definition at line 339 of file _list.h.

                              {
    _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end();
    while (__first != __last) {
      _Base_iterator __next = __first;
      ++__next;
      if (__x == *__first) {
        _Invalidate_iterator(iterator(&_M_iter_list, __first));
        _M_non_dbg_impl.erase(__first);
      }
      __first = __next;
    }
  }

remove() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::remove ( const_reference  __val )

inline

Definition at line 634 of file _list.h.

                                     {
    iterator __first = begin();
    iterator __last = end();
    while (__first != __last) {
      iterator __next = __first;
      ++__next;
      if (__val == *__first) erase(__first);
      __first = __next;
    }
  }

rend() [1/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reverse_iterator list< _Tp, >::rend ( )

inline

Definition at line 161 of file _list.h.

{ return reverse_iterator(begin()); }

rend() [2/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reverse_iterator list< _Tp, >::rend ( ) const

inline

Definition at line 162 of file _list.h.

{ return const_reverse_iterator(begin()); }

rend() [3/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reverse_iterator list< _Tp, >::rend ( )

inline

Definition at line 170 of file _list.h.

{ return reverse_iterator(begin()); }

rend() [4/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reverse_iterator list< _Tp, >::rend ( ) const

inline

Definition at line 173 of file _list.h.

{ return const_reverse_iterator(begin()); }

rend() [5/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

reverse_iterator list< _Tp, >::rend ( )

inline

Definition at line 376 of file _list.h.

{ return reverse_iterator(begin()); }

Referenced by Desktops::ToggleMinimize().

rend() [6/6]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

const_reverse_iterator list< _Tp, >::rend ( ) const

inline

Definition at line 377 of file _list.h.

{ return const_reverse_iterator(begin()); }

resize() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::resize ( size_type  __new_size, const value_type &  __x = _STLP_DEFAULT_CONSTRUCTED(value_type)  )

inline

_STLP_DONT_SUP_DFLT_PARAM

Definition at line 243 of file _list.h.

                                    { _M_impl.resize(__new_size); }
  void resize(size_type __new_size, const value_type& __x)
#endif 
  {_M_impl.resize(__new_size, cast_traits::to_storage_type_cref(__x));}

resize() [2/3]

template<class _Tp, class _Alloc >

_STLP_MOVE_TO_STD_NAMESPACE void list< _Tp, _Alloc >::resize ( size_type  __new_size, const _Tp &  __x = _Tp()  )

inline

Definition at line 289 of file _list.h.

                                                            {
#else
  void resize(size_type __new_size, const _Tp& __x) {
#endif /*_STLP_DONT_SUP_DFLT_PARAM*/
    _Base_iterator __i = _M_non_dbg_impl.begin();
    size_type __len = 0;
    for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len);

    if (__len == __new_size)
      erase(iterator(&_M_iter_list, __i), end());
    else                          // __i == end()
      _M_non_dbg_impl.insert(_M_non_dbg_impl.end(), __new_size - __len, __x);
  }

resize() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::resize	(	size_type	__new_size,
		const_reference	__x = value_type()
	)

Referenced by list< BookmarkNode >::resize().

reverse() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::reverse ( )

inline

Definition at line 305 of file _list.h.

{ _M_impl.reverse(); }

reverse() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::reverse ( )

inline

Definition at line 412 of file _list.h.

                 {
    _M_non_dbg_impl.reverse();
  }

reverse() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::reverse ( )

inline

Definition at line 651 of file _list.h.

                 {
    _Node_base* __p = &this->_M_node._M_data;
    _Node_base* __tmp = __p;
    do {
      _STLP_STD::swap(__tmp->_M_next, __tmp->_M_prev);
      __tmp = __tmp->_M_prev;     // Old next node is now prev.
    } while (__tmp != __p);
  }

size() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

size_type list< _Tp, >::size ( ) const

inline

Definition at line 165 of file _list.h.

{ return _M_impl.size(); }

size() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

size_type list< _Tp, >::size ( ) const

inline

Definition at line 175 of file _list.h.

{ return _M_non_dbg_impl.size(); }

size() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

size_type list< _Tp, >::size ( ) const

inline

Definition at line 379 of file _list.h.

                         {
    size_type __result = _STLP_STD::distance(begin(), end());
    return __result;
  }

Referenced by _bdf_list_ensure(), _bdf_list_split(), and test_ProcThreadAttributeList().

sort() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::sort ( )

inline

Definition at line 306 of file _list.h.

{ _M_impl.sort(); }

sort() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::sort ( )

inline

Definition at line 429 of file _list.h.

              {
    _M_non_dbg_impl.sort();
  }

sort() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::sort ( )

inline

Definition at line 660 of file _list.h.

  { _STLP_PRIV _S_sort(*this, less<value_type>()); }

Referenced by test_list_sort::operator()().

splice() [1/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::splice ( iterator  __pos, _Self &  __x  )

inline

Definition at line 293 of file _list.h.

  { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl); }

splice() [2/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::splice ( iterator  __pos, _Self &  __x, iterator  __i  )

inline

Definition at line 295 of file _list.h.

  { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl, _BaseIte(__i._M_node)); }

splice() [3/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

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

inline

Definition at line 297 of file _list.h.

  { _M_impl.splice(_BaseIte(__pos._M_node), __x._M_impl,
                   _BaseIte(__first._M_node), _BaseIte(__last._M_node)); }

splice() [4/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::splice ( iterator  __pos, _Self &  __x  )

inline

Definition at line 358 of file _list.h.

                                          {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
    _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl);
#if (_STLP_DEBUG_LEVEL != _STLP_STANDARD_DBG_LEVEL)
    if (get_allocator() == __x.get_allocator())
      __x._M_iter_list._Set_owner(_M_iter_list);
    else
#endif
      // Std: 23.2.2.4:4
      // end iterator is not invalidated:
      __x._Invalidate_iterators(__x.begin(), __x.end());
  }

splice() [5/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::splice ( iterator  __pos, _Self &  __x, iterator  __i  )

inline

Definition at line 371 of file _list.h.

                                                        {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))
    _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__i))
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&(__x._M_iter_list),__i))
    _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __i._M_iterator);
#if (_STLP_DEBUG_LEVEL != _STLP_STANDARD_DBG_LEVEL)
    if (get_allocator() == __x.get_allocator())
      _STLP_PRIV __change_ite_owner(__i, &_M_iter_list);
    else
#endif
      // Std: 23.2.2.4:7
      __x._Invalidate_iterator(__i);
  }

splice() [6/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

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

inline

Definition at line 385 of file _list.h.

                                                                             {
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))
    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last, __x.begin(), __x.end()))
    _STLP_DEBUG_CHECK(this == &__x ? !_STLP_PRIV __check_range(__pos, __first, __last) : true)
#if (_STLP_DEBUG_LEVEL != _STLP_STANDARD_DBG_LEVEL)
    if (this->get_allocator() == __x.get_allocator())
      _STLP_PRIV __change_range_owner(__first, __last, &_M_iter_list);
    else
#endif
      // Std: 23.2.2.4:12
      __x._Invalidate_iterators(__first, __last);
    _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __first._M_iterator, __last._M_iterator);
  }

splice() [7/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::splice ( iterator  __pos, _Self &  __x  )

inline

Definition at line 599 of file _list.h.

                                          {
    if (!__x.empty()) {
      if (this->get_allocator() == __x.get_allocator()) {
        _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __x.begin()._M_node, __x.end()._M_node);
      }
      else {
        insert(__pos, __x.begin(), __x.end());
        __x.clear();
      }
    }
  }

Referenced by list< BookmarkNode >::insert().

splice() [8/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::splice ( iterator  __pos, _Self &  __x, iterator  __i  )

inline

Definition at line 610 of file _list.h.

                                                        {
    iterator __j = __i;
    ++__j;
    if (__pos == __i || __pos == __j) return;
    if (this->get_allocator() == __x.get_allocator()) {
      _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __i._M_node, __j._M_node);
    }
    else {
      insert(__pos, *__i);
      __x.erase(__i);
    }
  }

splice() [9/9]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

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

inline

Definition at line 622 of file _list.h.

                                                                             {
    if (__first != __last) {
      if (this->get_allocator() == __x.get_allocator()) {
        _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __first._M_node, __last._M_node);
      }
      else {
        insert(__pos, __first, __last);
        __x.erase(__first, __last);
      }
    }
  }

swap() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::swap ( _Self &  __x )

inline

Definition at line 173 of file _list.h.

{ _M_impl.swap(__x._M_impl); }

swap() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::swap ( _Self &  __x )

inline

Definition at line 197 of file _list.h.

                        {
    _M_iter_list._Swap_owners(__x._M_iter_list);
    _M_non_dbg_impl.swap(__x._M_non_dbg_impl);
  }

swap() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::swap ( _Self &  __x )

inline

Definition at line 401 of file _list.h.

                        {
    if (__x.empty()) {
      if (this->empty()) {
        return;
      }
      this->_M_swap_aux(__x);
    } else if (this->empty()) {
      __x._M_swap_aux(*this);
    } else {
      this->_M_node.swap(__x._M_node);
      _STLP_STD::swap(this->_M_node._M_data._M_prev->_M_next, __x._M_node._M_data._M_prev->_M_next);
      _STLP_STD::swap(this->_M_node._M_data._M_next->_M_prev, __x._M_node._M_data._M_next->_M_prev);
    }
  }

Referenced by _S_sort().

unique() [1/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::unique ( )

inline

Definition at line 303 of file _list.h.

{ _M_impl.unique(); }

unique() [2/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::unique ( )

inline

Definition at line 415 of file _list.h.

                {
    _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end();
    if (__first == __last) return;
    _Base_iterator __next = __first;
    while (++__next != __last) {
      if (*__first == *__next) {
        _Invalidate_iterator(iterator(&_M_iter_list, __next));
        _M_non_dbg_impl.erase(__next);
      }
      else
        __first = __next;
      __next = __first;
    }
  }

unique() [3/3]

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

void list< _Tp, >::unique ( )

inline

Definition at line 645 of file _list.h.

  { _STLP_PRIV _S_unique(*this, equal_to<value_type>()); }

Member Data Documentation

_M_impl

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

_Base list< _Tp, >::_M_impl

private

Definition at line 326 of file _list.h.

Referenced by list< BookmarkNode >::assign(), list< BookmarkNode >::begin(), list< BookmarkNode >::clear(), list< BookmarkNode >::empty(), list< BookmarkNode >::end(), list< BookmarkNode >::erase(), list< BookmarkNode >::get_allocator(), list< BookmarkNode >::insert(), list< BookmarkNode >::max_size(), list< BookmarkNode >::merge(), list< BookmarkNode >::operator=(), list< BookmarkNode >::pop_back(), list< BookmarkNode >::pop_front(), list< BookmarkNode >::push_back(), list< BookmarkNode >::push_front(), list< BookmarkNode >::remove(), list< BookmarkNode >::resize(), list< BookmarkNode >::reverse(), list< BookmarkNode >::size(), list< BookmarkNode >::sort(), list< BookmarkNode >::splice(), list< BookmarkNode >::swap(), and list< BookmarkNode >::unique().

_M_iter_list

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

_STLP_PRIV __owned_list list< _Tp, >::_M_iter_list

private

Definition at line 81 of file _list.h.

Referenced by list< BookmarkNode >::_Invalidate_iterator(), list< BookmarkNode >::_Invalidate_iterators(), list< BookmarkNode >::begin(), list< BookmarkNode >::end(), list< BookmarkNode >::erase(), list< BookmarkNode >::insert(), list< BookmarkNode >::list(), list< BookmarkNode >::merge(), list< BookmarkNode >::remove(), list< BookmarkNode >::resize(), list< BookmarkNode >::splice(), list< BookmarkNode >::swap(), and list< BookmarkNode >::unique().

_M_non_dbg_impl

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

_Base list< _Tp, >::_M_non_dbg_impl

private

Definition at line 80 of file _list.h.

Referenced by list< BookmarkNode >::assign(), list< BookmarkNode >::begin(), list< BookmarkNode >::clear(), list< BookmarkNode >::empty(), list< BookmarkNode >::end(), list< BookmarkNode >::erase(), list< BookmarkNode >::get_allocator(), list< BookmarkNode >::insert(), list< BookmarkNode >::max_size(), list< BookmarkNode >::merge(), list< BookmarkNode >::operator=(), list< BookmarkNode >::pop_back(), list< BookmarkNode >::pop_front(), list< BookmarkNode >::push_back(), list< BookmarkNode >::push_front(), list< BookmarkNode >::remove(), list< BookmarkNode >::resize(), list< BookmarkNode >::reverse(), list< BookmarkNode >::size(), list< BookmarkNode >::sort(), list< BookmarkNode >::splice(), list< BookmarkNode >::swap(), and list< BookmarkNode >::unique().

_STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

list< _Tp, >::_STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS

Definition at line 277 of file _list.h.

next

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

struct list* list< _Tp, >::next

Definition at line 38 of file list.h.

Referenced by __list_splice(), AddFileInfo(), AddLine(), bezierPatchMeshListDelete(), build_properties(), build_transforms(), ContextPropertyList_EnumPropIDs(), free_sinks(), getnetconfig(), getnetconfigent(), INIT_LIST_HEAD(), list_add_after(), list_add_before(), list_count(), list_empty(), list_init(), list_move(), list_move_tail(), shader_glsl_destroy(), skb_peek(), skb_queue_empty(), skb_queue_head_init(), StringListAppend(), xmlParseReference(), xsltAddTemplate(), xsltCopyTreeList(), xsltFreeAttrElemList(), xsltFreeUseAttrSetList(), and xsltGetTemplate().

prev

template<class _Tp, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Tp >) >

struct list* list< _Tp, >::prev

Definition at line 39 of file list.h.

Referenced by __list_splice(), cert_compare_certs_in_store(), CertEnumCertificatesInStore(), CertEnumCRLsInStore(), Collection_enumCert(), Collection_enumCRL(), Collection_enumCTL(), CRYPT_CollectionAdvanceEnum(), EmptyStore_enum(), find_cert_any(), find_cert_by_issuer(), find_cert_by_name_str_a(), find_cert_by_name_str_w(), FT_List_Up(), FTC_MruList_New(), INIT_LIST_HEAD(), list_add_after(), list_add_before(), list_init(), list_move(), list_move_tail(), MemStore_enumCert(), MemStore_enumContext(), MemStore_enumCRL(), MemStore_enumCTL(), msi_dialog_set_tab_order(), skb_peek_tail(), skb_queue_head_init(), and TransactedSnapshotImpl_FindFirstChild().

---

The documentation for this struct was generated from the following files:

• sdk/include/c++/stlport/stl/_list.h
• sdk/include/reactos/wine/list.h
• sdk/include/c++/stlport/stl/_list.c