PUBLIC

BiHashARC::BiHashARC(UIntT) BiHashARC::Map1(const D1T &) BiHashARC::Fwd(const D1T &) BiHashARC::IsFwd(const D1T &) const BiHashARC::Map2(const D2T &) BiHashARC::Bkw(const D1T &) BiHashARC::IsBkw(const D2T &) const BiHashARC::Insert(const D1T &,const D2T &) BiHashARC::DelMap1(const D1T &) BiHashARC::DelMap2(const D2T &) BiHashARC::Size(void) const

BiHashARC<class D1T,class D2T>
Bi-directional hash table.
include	"amma/BiHash.hh"
User Level:	Default
Library:	Hash1d
Example:	exBiHash.cc
Section:	Containers.Hash Tables
In Scope:	std

Comments:
This allows a reversable mapping between two hashed items. For quick mapping in both directions. Forward is nominally from D1T to D2T.

HashARC hmap1;

HashARC hmap2;

BiHashARC(UIntT nBins = 23)

Constructor.

D2T & Map1(const D1T & key)

Do a lookup on data type 1

D2T & Fwd(const D1T & key)

Do a lookup on data type 1

BooleanT IsFwd(const D1T & key) const

Do we have a forward mapping.

D1T & Map2(const D2T & key)

Do a lookup on data type 2;

D2T & Bkw(const D1T & key)

Do a lookup on data type 2

BooleanT IsBkw(const D2T & key) const

Do we have a forward mapping.

BooleanT Insert(const D1T & d1,const D2T & d2)

Insert a mapping into the table.
Should check that they are reversable ?

BooleanT DelMap1(const D1T & key)

Delete a mapping from the table, using d1 as the key.

BooleanT DelMap2(const D2T & key)

Delete a mapping from the table, using d2 as the key.

UIntT Size() const

Get number of mappings.