HashInt1DAR<class T> -

Developer Documentation

Centre for Vision, Speech & Signal Processing

Parent Classes:

HashInt1D

HashInt1DARBase

Variables:

Index Elements;

Methods:

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.
void CheckPosResize(void)
void CheckNegResize(void)

#include "amma/HashInt1D.hh"

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)

Programmer:Charles Galambos, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001

HashInt1DAR<class T>

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