PUBLIC

HashInt1D::HashInt1D(Index) HashInt1D::HashInt1D(const HashInt1D &) HashInt1D::HashInt1D(const HashInt1D &,int) HashInt1D::~HashInt1D(void) HashInt1D::HashVal(Index) const HashInt1D::Lookup(Index) const HashInt1D::Add(Index,const T &) HashInt1D::Add(Index) HashInt1D::Insert(HashInt1DBase::Index,const T &) HashInt1D::Insert(HashInt1DBase::Index) HashInt1D::operator[](Index) HashInt1D::Update(Index,const T &) HashInt1D::Update(Index) HashInt1D::Remove(Index) HashInt1D::Empty(void) HashInt1D::operator=(const HashInt1D &) HashInt1D::Move(HashInt1D &) HashInt1D::Resize(Index) HashInt1D::GetHashSize(void) const HashInt1D::Count(void) const HashInt1D::IsEmpty(void) const HashInt1D::Remove(const HashInt1DElem *,Index)

HashInt1D<class T>
include	"amma/HashInt1D.hh"
User Level:	Default
Library:	Hash1d
Example:	exStack.cc
Section:	Containers.Hash Tables
In Scope:	std

Parent Classes:

public HashInt1DBase

HashInt1DAR

Index Size;

HashInt1DElem ** Array;

HashInt1D(Index nSize = 20)

Default constructor.

HashInt1D(const HashInt1D<T> & Oth)

Copy constructor.

HashInt1D(const HashInt1D<T> & Oth,int nSize)

~HashInt1D()

Destructor.

Index HashVal(Index V) const

Get the index into array from hash value.

T * Lookup(Index Key) const

Lookup key in table. Returns NULL if not found.

T & Add(Index Key,const T & Data)

Add new element. !! Doesn't check if exists already !!

T & Add(Index Key)

Add without setting data. !! Doesn't check if exists already !!

T & Insert(HashInt1DBase::Index Key,const T & Data)

New alias for Add.

T & Insert(HashInt1DBase::Index Key)

New alias for Add.

T & operator[](Index Key)

Lookup key, create if not found.

BooleanT Update(Index Key,const T & Data)

Update value(Ret:TRUE), if not there add it (Ret:FALSE).

T & Update(Index Key)

Get value, add default if its not there. (Could be faster.)

BooleanT Remove(Index key)

Delete value by key.

void Empty(void)

Remove all items from table.

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

Not cheap !

void Move(HashInt1D<T> & Oth)

Move contents of other set to this, leave other empty. NB. Empties this set first !!

void Resize(Index nSize)

Resize the hashtable.

Index GetHashSize(void) const

Get Hashtable size.

Index Count(void) const

Count elements in hash table.

BooleanT IsEmpty(void) const

Is table empty ??

BooleanT Remove(const HashInt1DElem<T> * Elem,Index BinNo)