#include <listnode.h>
Node have to be only ListNode derived class!
Public Member Functions | |
ListNode (void *pdata=NULL) | |
virtual | ~ListNode () |
Node * | GetNext () const |
Node * | GetPrev () const |
List< Node > * | GetParent () const |
void | SetData (void *data) |
void * | GetData () const |
bool | IsLinked () const |
void | InsertBefore (Node *next) |
void | InsertAfter (Node *prev) |
void | Remove () |
Private Attributes | |
List< Node > * | parent |
Node * | next |
Node * | prev |
void * | data |
Friends | |
class | List< Node > |
class | ListNode< Node > |
Node * ListNode< Node >::GetNext | ( | ) | const [inline] |
Returns next object in the same hierarchy level, NULL
if no next object exists.
Node * ListNode< Node >::GetPrev | ( | void | ) | const [inline] |
Returns previous object in the same hierarchy level, NULL
if no previous object exists.
Returns the parent List object.
Reimplemented in TreeNode< Node >, and TreeNode< Root >.
void ListNode< Node >::SetData | ( | void * | data | ) | [inline] |
void * ListNode< Node >::GetData | ( | void | ) | const [inline] |
bool ListNode< Node >::IsLinked | ( | void | ) | const [inline] |
void ListNode< Node >::InsertBefore | ( | Node * | next | ) | [inline] |
void ListNode< Node >::InsertAfter | ( | Node * | prev | ) | [inline] |
friend class List< Node > [friend] |
Reimplemented in PoolNode< Node >.
friend class ListNode< Node > [friend] |
Reimplemented in PoolNode< Node >.