$darkmode
Elektra 0.11.0
|
Order Preserving Minimal Perfect Hash Map. More...
#include <kdbopmphm.h>
Public Attributes | |
uint32_t | order |
uint32_t * | nextEdge |
uint32_t * | vertices |
Order Preserving Minimal Perfect Hash Map.
Based on the work of
Fabiano C. Botelho and Nivio Ziviani "Near-Optimal Space Perfect Hashing Algorithms"
and
Zbigniew J. Czech, George Havas, and Bohdan S. Majewski "An Optimal Algorithm for Generating Minimal Perfect Hash Functions" In: Information Processing Letters 43 (1992), pp. 257–264
For usage look in datastructures.md
Theoretical limit of elements:
The whole OPMPHM is limited to the opmphmHashfunction (...) that returns a uint32_t. The limit of elements is than ((2^32) - 1) * r / c, since (2^32) - 1 is the maximum component size of the r-uniform r-partite hypergraph.
To save space the limit of elements is set to (2^32) - 1. The r-uniform r-partite hypergraph
uint32_t* OpmphmEdge::nextEdge |
arary with Opmphm->rUniPar indices of the next edge in the lists
uint32_t OpmphmEdge::order |
desired hash map return value
uint32_t* OpmphmEdge::vertices |
array with Opmphm->rUniPar indices of vertices that the edge connects