Struct pthash::SinglePhf

pub struct SinglePhf<M: Minimality, H: Hasher, E: Encoder> { /* private fields */ }

Non-partitioned minimal perfect-hash function

This is a binding for pthash::single_phf<H, dictionary_dictionary, true>

Implementations

impl<M: Minimality, H: Hasher, E: Encoder> SinglePhf<M, H, E>

pub fn new() -> Self

Trait Implementations

impl<M: Minimality, H: Hasher, E: Encoder> Phf for SinglePhf<M, H, E>

const MINIMAL: bool = M::AS_BOOL

Whether instances of this function have their values in the range [0; num_keys).

fn build_in_internal_memory_from_bytes<Keys: IntoIterator>( &mut self, keys: Keys, config: &BuildConfiguration ) -> Result<BuildTimings, Exception>

where <Keys as IntoIterator>::IntoIter: ExactSizeIterator + Clone, <<Keys as IntoIterator>::IntoIter as Iterator>::Item: Hashable,

Builds the function from a set of keys

fn hash(&self, key: impl Hashable) -> u64

Returns the hash of the given key

fn num_bits(&self) -> usize

Returns the number of bits needed to represent this perfect-hash function

fn num_keys(&self) -> u64

Returns the number of keys used to build this perfect-hash function

fn table_size(&self) -> u64

Largest value returned by Self::hash plus 1

fn save(&mut self, path: impl AsRef<Path>) -> Result<usize, Exception>

Dump this function to disk

fn load(path: impl AsRef<Path>) -> Result<Self, Exception>

Load this function from disk

impl<M: Minimality, H: Hasher, E: Encoder> Send for SinglePhf<M, H, E>

impl<M: Minimality, H: Hasher, E: Encoder> Sync for SinglePhf<M, H, E>