The Pedigree Project 0.1
Public Member Functions | Public Attributes | Private Member Functions | Private Attributes | List of all members
Tree< K, E >::IteratorNode Class Reference

#include <Tree.h>

+ Collaboration diagram for Tree< K, E >::IteratorNode:

Public Member Functions

 IteratorNode (Node *node, Node *prev, size_t n)
 
IteratorNode * next ()
 
IteratorNode * previous ()
 
void reset (Node *node, Node *prev, size_t n)
 

Public Attributes

Node * value
 

Private Member Functions

void traverseNext ()
 

Private Attributes

Node * pNode
 
Node * pPreviousNode
 

Detailed Description

template<class K, class E>
class Tree< K, E >::IteratorNode
Todo:
This will actually mean for each Tree you can only use one iterator at a time, which may not be effective depending on how this is used.

Definition at line 49 of file Tree.h.

Constructor & Destructor Documentation

◆ IteratorNode() [1/2]

template<class K , class E >
Tree< K, E >::IteratorNode::IteratorNode ( )
inline

Definition at line 51 of file Tree.h.

◆ IteratorNode() [2/2]

template<class K , class E >
Tree< K, E >::IteratorNode::IteratorNode ( Node *  node,
Node *  prev,
size_t  n 
)
inline

Definition at line 52 of file Tree.h.

Member Function Documentation

◆ next()

template<class K , class E >
IteratorNode * Tree< K, E >::IteratorNode::next ( )
inline

Definition at line 59 of file Tree.h.

◆ previous()

template<class K , class E >
IteratorNode * Tree< K, E >::IteratorNode::previous ( )
inline

Definition at line 66 of file Tree.h.

◆ reset()

template<class K , class E >
void Tree< K, E >::IteratorNode::reset ( Node *  node,
Node *  prev,
size_t  n 
)
inline

Definition at line 70 of file Tree.h.

◆ traverseNext()

template<class K , class E >
void Tree< K, E >::IteratorNode::traverseNext ( )
inlineprivate

Definition at line 84 of file Tree.h.

Member Data Documentation

◆ pNode

template<class K , class E >
Node* Tree< K, E >::IteratorNode::pNode
private

Definition at line 81 of file Tree.h.

◆ pPreviousNode

template<class K , class E >
Node* Tree< K, E >::IteratorNode::pPreviousNode
private

Definition at line 82 of file Tree.h.

◆ value

template<class K , class E >
Node* Tree< K, E >::IteratorNode::value

Definition at line 78 of file Tree.h.


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