Struct SeedOnlyK 

pub struct SeedOnlyK(pub u8);

SeedChooser to build k-perfect functions. k is given as a parameter of this chooser.

Should be used with [Perfect].

It chooses best seed with quite strong hasher, without shift component, which should lead to quite small size, but long construction time.

Tuple Fields

0: u8

Trait Implementations

impl Clone for SeedOnlyK

fn clone(&self) -> SeedOnlyK

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl SeedChooser for SeedOnlyK

fn k(self) -> u8

Returns maximum number of keys mapped to each output value; k of k-perfect function.

fn minimal_output_range(self, num_of_keys: usize) -> usize

Returns output range of minimal (perfect or k-perfect) function for given number of keys.

type UsedValues = CyclicArray<u8, MAX_VALUES>

fn f(self, primary_code: u64, seed: u16, conf: &Conf) -> usize

Returns function value for given primary code and seed.

fn best_seed( self, used_values: &mut Self::UsedValues, keys: &[u64], conf: &Conf, bits_per_seed: u8, ) -> u16

Returns best seed to store in seeds array or u16::MAX if NO_BUMPING is true and there is no feasible seed.

const BUMPING: bool = true

Specifies whether bumping is allowed.

const FIRST_SEED: u16 = _

The lowest seed that does not indicate bumping.

const FUNCTION2_THRESHOLD: usize = 4096

Size of last level of Function2. Important when extra_shift()>0 (i.e. for ShiftOnly).

fn bucket_evaluator(&self, bits_per_seed: u8, slice_len: u16) -> Weights

fn conf( self, output_range: usize, input_size: usize, bits_per_seed: u8, bucket_size_100: u16, preferred_slice_len: u16, ) -> Conf

fn conf_for_minimal( self, num_of_keys: usize, bits_per_seed: u8, bucket_size_100: u16, preferred_slice_len: u16, ) -> Conf

fn conf_for_minimal_p<SS: Copy + Into<u8>>( self, num_of_keys: usize, params: &Params<SS>, ) -> Conf

fn extra_shift(self, _bits_per_seed: u8) -> u16

How much the chooser can add to value over slice length.

impl Copy for SeedOnlyK