Inheritance diagram for eastl::intrusive_list_base:

Collaboration diagram for eastl::intrusive_list_base:

Public Member Functions
bool	empty () const EA_NOEXCEPT

eastl_size_t	size () const EA_NOEXCEPT
	Returns the number of elements in the list; O(n).

void	clear () EA_NOEXCEPT
	Clears the list; O(1). No deallocation occurs.

void	pop_front ()
	Removes an element from the front of the list; O(1). The element must exist, but is not deallocated.

void	pop_back ()
	Removes an element from the back of the list; O(1). The element must exist, but is not deallocated.

EASTL_API void	reverse () EA_NOEXCEPT
	Reverses a list so that front and back are swapped; O(n).

EASTL_API bool	validate () const
	Scans a list for linkage inconsistencies; O(n) time, O(1) space. Returns false if errors are detected, such as loops or branching.

Protected Attributes
intrusive_list_node	mAnchor
	Sentinel node (end). All data nodes are linked in a ring from this node.

Detailed Description

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

Public Types