PUBLIC

HashInt1DAR::HashInt1DAR(HashInt1DBase::Index) HashInt1DAR::HashInt1DAR(const HashInt1DAR &) HashInt1DAR::HashInt1DAR(const HashInt1DAR &,int) HashInt1DAR::HashInt1DAR(const HashInt1D &) HashInt1DAR::Lookup(Index) const HashInt1DAR::operator[](HashInt1DBase::Index) HashInt1DAR::Add(HashInt1DBase::Index,const T &) HashInt1DAR::Add(HashInt1DBase::Index) HashInt1DAR::Insert(HashInt1DBase::Index,const T &) HashInt1DAR::Insert(HashInt1DBase::Index) HashInt1DAR::Update(HashInt1DBase::Index,const T &) HashInt1DAR::Update(HashInt1DBase::Index) HashInt1DAR::Remove(HashInt1DBase::Index) HashInt1DAR::RemoveNoResize(HashInt1DBase::Index) HashInt1DAR::Empty(void) HashInt1DAR::operator=(const HashInt1DAR &) HashInt1DAR::Move(HashInt1DAR &) HashInt1DAR::Count(void) const HashInt1DAR::Size(void) const HashInt1DAR::IsEmpty(void) const HashInt1DAR::GetHashSize(void) const HashInt1DAR::Resize(Index) 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

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

Parent Classes:

public HashInt1D<class T>
public HashInt1DARBase

HashInt1DAR(HashInt1DBase::Index nSize = 7)

Default constructor.

HashInt1DAR(const HashInt1DAR<T> & Oth)

Copy constructor.

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

Copy with resize.

HashInt1DAR(const HashInt1D<T> & Oth)

Copy from non-resizing table.

T * Lookup(Index Key) const

Is a item in the table ?

T & operator[](HashInt1DBase::Index Key)

Lookup key, create if not found.

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

Add an element to the table. !! Doesn't check if exists already !!

T & Add(HashInt1DBase::Index Key)

Add an element to the table. !! 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.

BooleanT Update(HashInt1DBase::Index Key,const T & Data)

Update a value, create in it doesn't exist.

T & Update(HashInt1DBase::Index Key)

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

BooleanT Remove(HashInt1DBase::Index key)

Remove element from table, !! DO NOT use if there is an iterator attached !!

BooleanT RemoveNoResize(HashInt1DBase::Index Key)

Remove without resizing. Safe to use with an iterator provided it does not point the element in question.

void Empty(void)

Remove all items from table.

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

Assigment.

void Move(HashInt1DAR<T> & Oth)

Move contents from another table to here.

Index Count(void) const

Number of elements (old name).

Index Size(void) const

Number of elements in table.

BooleanT IsEmpty(void) const

Is table empty ?

Index GetHashSize(void) const

Get number of bins in hash table.

void Resize(Index nSize)

Rezie table.

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 ??