ptr_hash 1.1.0

A high-throughput minimal perfect hash function
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62

use std::ops::{Add, Index, IndexMut, Sub};

// Ord so we can sort them.
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
pub struct BucketIdx(pub u32);

impl Add<usize> for BucketIdx {
    type Output = Self;

    fn add(self, rhs: usize) -> Self::Output {
        Self(self.0 + rhs as u32)
    }
}

impl Sub<usize> for BucketIdx {
    type Output = Self;

    fn sub(self, rhs: usize) -> Self::Output {
        Self(self.0 - rhs as u32)
    }
}

impl BucketIdx {
    pub const NONE: BucketIdx = BucketIdx(u32::MAX);
    pub fn range(num_buckets: usize) -> impl Iterator<Item = Self> + Clone {
        (0..num_buckets as u32).map(Self)
    }
    pub fn is_some(&self) -> bool {
        self.0 != u32::MAX
    }
    pub fn is_none(&self) -> bool {
        self.0 == u32::MAX
    }
}

impl<T> Index<BucketIdx> for [T] {
    type Output = T;

    fn index(&self, index: BucketIdx) -> &Self::Output {
        unsafe { self.get_unchecked(index.0 as usize) }
    }
}

impl<T> IndexMut<BucketIdx> for [T] {
    fn index_mut(&mut self, index: BucketIdx) -> &mut Self::Output {
        unsafe { self.get_unchecked_mut(index.0 as usize) }
    }
}

impl<T> Index<BucketIdx> for Vec<T> {
    type Output = T;

    fn index(&self, index: BucketIdx) -> &Self::Output {
        unsafe { self.get_unchecked(index.0 as usize) }
    }
}

impl<T> IndexMut<BucketIdx> for Vec<T> {
    fn index_mut(&mut self, index: BucketIdx) -> &mut Self::Output {
        unsafe { self.get_unchecked_mut(index.0 as usize) }
    }
}