#include <intrusive_slist.h>
Inheritance diagram for eastl::intrusive_slist_base:
Collaboration diagram for eastl::intrusive_slist_base:
Public Types | |
| typedef eastl_size_t | size_type |
| typedef ptrdiff_t | difference_type |
Public Member Functions | |
| bool | empty () const |
| Returns true if the container is empty. | |
| size_type | size () const |
| Returns the number of elements in the list; O(n). | |
| void | clear () |
| 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 be present, but is not deallocated. | |
| void | reverse () |
| Reverses a list so that front and back are swapped; O(n). | |
Protected Attributes | |
| intrusive_slist_node * | mpNext |
Detailed Description
Provides a template-less base class for intrusive_slist.
The documentation for this class was generated from the following file:
- third_party/EASTL/include/EASTL/bonus/intrusive_slist.h
