Developer Documentation
RAVL, Recognition And Vision Library
USER HOME PAGE CLASS LIST CONTENTS
Ravl - Core - Trees - HashTreeIterC<class KeyT,class DataT>
 

  PUBLIC
HashTreeIterC::HashTreeIterC(void)
HashTreeIterC::HashTreeIterC(const HashTreeC &)
HashTreeIterC::Tree(void)
HashTreeIterC::Go(void)
HashIterC::First(void)
HashIterC::Next(void)
HashIterC::operator ++(int)
HashIterC::operator ++(void)
HashIterC::IsElm(void) const
HashIterC::operator bool(void) const
HashIterC::Key(void) const
HashIterC::Data(void) const
HashIterC::Data(void)
HashIterC::operator *(void)
HashIterC::operator *(void) const
HashIterC::Del(void)
HashIterC::operator =(const HashC &)
HashIterC::operator =(const HashIterC &)
HashIterC::CheckValid(void)

   HashTreeIterC<class KeyT,class DataT>   
 
Iterate through a tree.
 
include "Ravl/HashTree.hh"
Source file:Ravl/Core/Container/Trees/HashTree.hh
User Level:Normal
Library:RavlCore
In Scope:RavlN

Parent Classes: Methods:
HashTreeIterC()
Default constructor.

HashTreeIterC(const HashTreeC<KeyT,DataT> & tree)
Constructor from tree.

HashTreeC<KeyT,DataT> Tree()
Access current node as tree.

bool Go()
Go down the current node in the tree.

#include "Ravl/HashIter.hh"
bool First(void)
Goto first item in table.

bool Next(void)
Goto next iterm in table. Once this returns false (or IsElm() is false) this should not be called again.

void operator ++(int)
Goto next element.

void operator ++()
Goto next element.

bool IsElm() const
Pointing to valid element ?

operator bool() const
At a valid element ?

const KeyT & Key(void) const
Key for current item. IsElm() Must be true.

const HashTreeNodeC<KeyT,DataT> & Data(void) const
Data for current item.IsElm() Must be true.

HashTreeNodeC<KeyT,DataT> & Data(void)
Data for current item.IsElm() Must be true.

HashTreeNodeC<KeyT,DataT> & operator *()
Access data.

const HashTreeNodeC<KeyT,DataT> & operator *() const
Access data.

void Del(void)
Delete current item from table, move to next. -> this breaks HashAR, if required I'll make a new non-constant iterator which can do this.

HashIterC<KeyT,HashTreeNodeC<KeyT,DataT>> & operator =(const HashC<KeyT,HashTreeNodeC<KeyT,DataT>> & oth)
Assign to another table.

HashIterC<KeyT,HashTreeNodeC<KeyT,DataT>> & operator =(const HashIterC<KeyT,HashTreeNodeC<KeyT,DataT>> & oth)
Assign to another iterator. const HashC &GetTable() const { return hashTab; } Which table ?

bool CheckValid(void)


Maintainer:Charles Galambos, Documentation by CxxDoc: Tue Aug 13 09:59:30 2002