o3 0.14.0

shared-nothing primitives
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

use std::hint;

use crate::collections::fixed::hash;

pub trait Map<V> {
    /// # Safety
    /// The matching entry must exist or the map must have spare capacity.
    unsafe fn entry_unchecked<'map>(
        &'map mut self,
        hash: u64,
        matches: impl FnMut(&V) -> bool,
    ) -> hash::Entry<'map, V>;

    /// # Safety
    /// The matching entry must exist.
    unsafe fn occupied_entry_unchecked<'map>(
        &'map mut self,
        hash: u64,
        matches: impl FnMut(&V) -> bool,
    ) -> hash::Occupied<'map, V>;
}

impl<V> Map<V> for hash::Map<V> {
    unsafe fn entry_unchecked<'map>(
        &'map mut self,
        hash: u64,
        matches: impl FnMut(&V) -> bool,
    ) -> hash::Entry<'map, V> {
        match self.probe(hash, matches) {
            hash::Probe::Occupied(index) => {
                hash::Entry::Occupied(hash::Occupied { map: self, index })
            }
            hash::Probe::Vacant(index) => hash::Entry::Vacant(hash::Vacant {
                map: self,
                index,
                hash,
            }),
            hash::Probe::Full => unsafe { hint::unreachable_unchecked() },
        }
    }

    unsafe fn occupied_entry_unchecked<'map>(
        &'map mut self,
        hash: u64,
        matches: impl FnMut(&V) -> bool,
    ) -> hash::Occupied<'map, V> {
        match self.probe(hash, matches) {
            hash::Probe::Occupied(index) => hash::Occupied { map: self, index },
            hash::Probe::Vacant(_) | hash::Probe::Full => unsafe { hint::unreachable_unchecked() },
        }
    }
}