Tree Compression with Top Trees Revisited
|
RePair hash table using hashing with open addressing and linear probing. More...
#include <HashTable.h>
Public Member Functions | |
HashTable (Records< DataType > &records) | |
PQEntry * | find (const int index) |
Find a PQEntry by its index. More... | |
void | insert (PQEntry *entry) |
Add a PQEntry into the hash table. More... | |
void | remove (PQEntry *entry) |
Delete a PQEntry from the hash table. More... | |
void | clear () |
Static Public Member Functions | |
static DataType | hashPair (const DataType a, const DataType b) |
Hash two things. Maybe not the greatest hash function in the world. More... | |
RePair hash table using hashing with open addressing and linear probing.
Definition at line 12 of file HashTable.h.
|
inline |
Definition at line 14 of file HashTable.h.
|
inline |
Clear everything from the hash table. It won't be reusable afterwards, this is if you no longer need it and want to reclaim the memory
Definition at line 64 of file HashTable.h.
|
inline |
Find a PQEntry by its index.
Definition at line 17 of file HashTable.h.
|
inlinestatic |
Hash two things. Maybe not the greatest hash function in the world.
Definition at line 69 of file HashTable.h.
|
inline |
Add a PQEntry into the hash table.
Definition at line 33 of file HashTable.h.
|
inline |
Delete a PQEntry from the hash table.
Definition at line 40 of file HashTable.h.