Struct perfect_hash::PerfectHashMap16

pub struct PerfectHashMap16<C, H, T> { /* fields omitted */ }

Methods

impl<C, T> PerfectHashMap16<C, DefaultHasher, T>

pub fn new() -> Self

If you are not worried about DDoS you should use a faster hasher. Rust defaults to SipHash which is more DDoS resistant, but very slow. I recommend the fasthash crate for a collection of faster hashing algorithms. You should use with_hasher(hasher) or default() when you don't need DDoS resistance.

impl<C, H, T> PerfectHashMap16<C, H, T> where
    H: Hasher,
    C: Hash + Ord, 

pub fn with_hasher(hasher: H) -> Self

pub fn with_capacity(capacity: u16) -> PerfectHashMap16<C, DefaultHasher, T>

pub fn with_capacity_and_hasher(capacity: u16, hasher: H) -> Self

pub fn unique_id<F>(&mut self, content: C, data: T, modify: F) -> Id<u16> where
    F: FnOnce(&mut T, &T), 

pub fn index_mut(&mut self, id: Id<u16>) -> (&C, &mut T)

pub fn get_mut(&mut self, id: u16) -> Option<(&C, &mut T)>

Trait Implementations

impl<C, H, T> Default for PerfectHashMap16<C, H, T> where
    H: Hasher + Default,
    C: Hash + Ord, 

fn default() -> PerfectHashMap16<C, H, T>

Returns the "default value" for a type.

impl<C, H, T> Index<Id<u16>> for PerfectHashMap16<C, H, T>

type Output = (C, T)

The returned type after indexing.

fn index(&self, id: Id<u16>) -> &(C, T)

Performs the indexing (container[index]) operation.