User Documentation
RAVL, Recognition And Vision Library
DEVELOP HOME PAGE CLASS LIST CONTENTS
Ravl - Core - Branch - BHashC<class KeyT,class DataT>
 

  PUBLIC
BHashC::BHashC(void)
BHashC::BHashC(const BHashC &)
BHashC::Lookup(const KeyT &,DataT &)
BHashC::Insert(const KeyT &,const DataT &)
BHashC::Copy(void) const
BHashC::operator [](const KeyT &)
BHashC::IsEmpty(void) const
BHashC::IsElm(const KeyT &) const
BHashC::Size(void) const
BHashC::Lookup(const KeyT &)

   BHashC<class KeyT,class DataT>   
 
Branching hash table.
 
include "Ravl/BHash.hh"
User Level:Develop
Library:RavlCore
In Scope:RavlN

Comments:
This behaves as a non-reference counted object.

Variables:
Methods:
BHashC()
Default constructor.

BHashC(const BHashC<KeyT,DataT> & oth)
Copy constructor.

bool Lookup(const KeyT & key,DataT & data)
Lookup 'key' in hash table.
If an entry is found its assigned to data and true is returned.

bool Insert(const KeyT & key,const DataT & data)
Associated value 'data' with key 'key'.

BHashC<KeyT,DataT> Copy() const
Copy table.
Since this is a small object, its a trivial operation.

const DataT & operator [](const KeyT & key)
Array style access.

bool IsEmpty() const
Test if hash table is empty.

bool IsElm(const KeyT & key) const
Is 'key' an key in the table ?

UIntT Size() const
Return the number of entries in the table.

DataT * Lookup(const KeyT & key)
Lookup 'key' in hash table.
If an entry is found return a pointer to it. otherwise return 0.


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