Struct probminhash::probminhasher::ProbMinHash2

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

implementation of the algorithm ProbMinHash2 as described in Ertl paper.

D must be convertible injectively into a usize for random generator initialization hence the requirement 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 replaced by the rank in the Vector, then no hash is need and you can use NoHasher

Implementations

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

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

Allocates a ProbMinHash2 structure with nbhash hash functions and initialize signature with initobj (typically 0 for numeric objects)

pub fn hash_item(&mut self, id: D, weight: f64)

Incrementally adds an item in hash signature. It can be used in streaming.
It is the building block of the computation, but this method does not check for unicity of id added in hash computation.
It is user responsability to enforce that. See method hash_wset

pub fn hash_wset<T>(&mut self, data: &mut T) where
    T: WeightedSet<Object = D> + Iterator<Item = D>, 

hash data when given by an iterable WeightedSet

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

return final signature.