NGSolve
5.3
|
A closed hash-table. More...
#include <hashtable.hpp>
Public Member Functions | |
ClosedHashTable (int asize) | |
int | Size () const |
bool | UsedPos (int pos) const |
is position used | |
int | UsedElements () const |
number of used elements | |
int | Position (const T_HASH ind) const |
int | PositionCreate (const T_HASH ind, int &apos) |
void | Set (const T_HASH &ahash, const T &acont) |
const T & | Get (const T_HASH &ahash) const |
bool | Used (const T_HASH &ahash) const |
void | SetData (int pos, const T_HASH &ahash, const T &acont) |
void | GetData (int pos, T_HASH &ahash, T &acont) const |
void | SetData (int pos, const T &acont) |
void | GetData (int pos, T &acont) const |
void | SetSize (int asize) |
void | SetName (const char *aname) |
Protected Attributes | |
int | size |
Array< T_HASH, size_t > | hash |
Array< T, size_t > | cont |
T_HASH | invalid |
A closed hash-table.
All information is stored in one fixed array. The array should be allocated with the double size of the expected number of entries.