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 &)

SArray1dC>> table;

UIntT entries;

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.