|
The Pedigree Project 0.1
|
One node in the list. More...
#include <List.h>
Collaboration diagram for _ListNode_t< T >:Public Member Functions | |
| _ListNode_t * | next () |
| _ListNode_t * | previous () |
Public Attributes | |
| _ListNode_t * | m_Next |
| _ListNode_t * | m_Previous |
| T | value |
One node in the list.
One node in the list
| [in] | T | the element type |
|
inline |
Get the next data structure in the list
Definition at line 43 of file List.h.
References _ListNode_t< T >::m_Next.
|
inline |
Get the previous data structure in the list
Definition at line 48 of file List.h.
References _ListNode_t< T >::m_Previous.
| _ListNode_t* _ListNode_t< T >::m_Next |
Pointer to the next node
Definition at line 53 of file List.h.
Referenced by List< T, nodePoolSize >::clear(), List< T, nodePoolSize >::erase(), List< T, nodePoolSize >::erase(), _ListNode_t< T >::next(), List< T, nodePoolSize >::pushBack(), List< T, nodePoolSize >::pushBack(), List< T, nodePoolSize >::pushFront(), List< T, nodePoolSize >::pushFront(), and List< T, nodePoolSize >::tryPushBack().
| _ListNode_t* _ListNode_t< T >::m_Previous |
Pointer to the previous node
Definition at line 55 of file List.h.
Referenced by List< T, nodePoolSize >::erase(), List< T, nodePoolSize >::erase(), _ListNode_t< T >::previous(), List< T, nodePoolSize >::pushBack(), List< T, nodePoolSize >::pushBack(), List< T, nodePoolSize >::pushFront(), List< T, nodePoolSize >::pushFront(), and List< T, nodePoolSize >::tryPushBack().
| T _ListNode_t< T >::value |
The value of the node
Definition at line 57 of file List.h.
Referenced by List< T, nodePoolSize >::pushBack(), List< T, nodePoolSize >::pushBack(), List< T, nodePoolSize >::pushFront(), List< T, nodePoolSize >::pushFront(), and List< T, nodePoolSize >::tryPushBack().