PUBLIC

BHashIntC::BHashIntC(UIntT) BHashIntC::BHashIntC(const BHashIntC &) BHashIntC::~BHashIntC(void) BHashIntC::Copy(IntT) const BHashIntC::DeepCopy(void) const BHashIntC::operator=(const BHashIntC &) BHashIntC::Insert(UIntT,const T &) BHashIntC::Insert(UIntT) BHashIntC::Remove(UIntT) BHashIntC::Empty(void) BHashIntC::Lookup(UIntT) BHashIntC::Lookup(UIntT) const BHashIntC::operator[](UIntT) BHashIntC::IsEmpty(void) const BHashIntC::Size(void) const BHashIntC::DoubleSize(void) BHashIntC::BHashIntC(SArray1dC &,UIntT)

BHashIntC<class T>
Branching Hash table.
include	"amma/BHashInt.hh"
User Level:	Default
Library:	Branch
Example:	exBiHash.cc
Section:	Containers.Hash Tables
In Scope:	std

Comments:
!!!! BIG object !!!!

typedef BListC<KeyedPairC<UIntT,T>> ElemLst;

typedef BListIterC<KeyedPairC<UIntT,T>> LstIter;

SArray1dC Table;

UIntT * Elements;

Number of elements in the table.

BHashIntC(UIntT InitSize = 7)

Default constructor.

BHashIntC(const BHashIntC<T> & Oth)

~BHashIntC()

Destructor.

BHashIntC<T> Copy(IntT Delta = 0) const

Make copy changing size, use if items in table are constant.

BHashIntC<T> DeepCopy() const

Make copy, use if you need to modify contents of hash table.

const BHashIntC<T> & operator=(const BHashIntC<T> & Oth)

Assigmment.

T & Insert(UIntT Key,const T & Data)

Insert element into table.
This will override value if key already exists.

T & Insert(UIntT Key)

Insert element into table.
This will override value if key already exists.

BooleanT Remove(UIntT Key)

Remove keyed item from the table.

void Empty()

Empty table of all entries.

T * Lookup(UIntT Key)

Lookup by key.

const T * Lookup(UIntT Key) const

Lookup by key.

T & operator[](UIntT Key)

Access.

BooleanT IsEmpty() const

Is table empty.

IntT Size() const

Get number of entries in table.

void DoubleSize()

Double size of table.

BHashIntC(SArray1dC<ElemLst> & NewTab,UIntT NoElems)

Construct from array.