Struct probminhash::probminhasher::ProbMinHash3a

pub struct ProbMinHash3a<D, H> where
    D: Copy + Eq + Hash + Debug,
    H: Hasher + Default,  { /* fields omitted */ }

implementation of the algorithm ProbMinHash3a as described in Etrl.
This version of ProbMinHash3 is faster but needs some more memory as it stores some states between 2 passes on data.

Probminhash3a needs at least 2 hash values to run. D must be convertible (at least partially) injectively into a usize for random generator initialization hence the requirement D:Hash.
If all data are referred to by an unsigned integer, and weight association is given in a tuple for example if data comes in a Vec<(D,f64)> then D can be in fact replaced by the rank in the Vector, then no hash is need and you can use NoHasher

Implementations

impl<D, H> ProbMinHash3a<D, H> where
    D: Copy + Eq + Debug + Hash,
    H: Hasher + Default, 

pub fn new(nbhash: usize, initobj: D) -> Self

Allocates a new ProbMinHash3a structure with nbhash >= 2 functions and initial object initobj to fill signature.
The precision on the final estimation depends on the number of hash functions.
The initial object can be any object , typically 0 for numerical objects.

pub fn hash_weigthed_idxmap<Hidx>(&mut self, data: &IndexMap<D, f64, Hidx>) where
    Hidx: BuildHasher, 

It is the entry point of this hash algorithm. The indexmap gives multiplicity (or weight) to the objects hashed.

pub fn get_signature(&self) -> &Vec<D>

return final signature.