o3 0.36.2

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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

use std::mem;

use runtime::entry;

use crate::depot::{
    arena::{
        hash::{self, errors, runtime},
        slab::key,
    },
    map,
    queue::links,
};

/// A vacant value and directory bucket belonging to one exclusive owner.
pub struct Vacancy<'a, T, Tag> {
    value: hash::Vacant<'a, T, Tag>,
    bucket: map::raw::Vacant,
    hash: u64,
}

const _: () = {
    assert!(mem::size_of::<Vacancy<'static, (), ()>>() == 4 * mem::size_of::<usize>());
    assert!(
        mem::size_of::<Option<Vacancy<'static, (), ()>>>()
            == mem::size_of::<Vacancy<'static, (), ()>>()
    );
};

impl<'a, T, Tag> Vacancy<'a, T, Tag> {
    pub(in crate::depot) fn new(
        entry: map::Vacancy<&'a mut hash::Core<T, Tag>>,
        hash: u64,
    ) -> Option<Self> {
        let (core, bucket, ()) = entry.into_parts();
        Some(Self {
            value: hash::Vacant::new(core)?,
            bucket,
            hash,
        })
    }

    /// Returns the slot reserved for this insertion.
    ///
    /// This vacancy retains exclusive access until insertion or drop; the index
    /// alone does not establish an initialized value.
    pub fn index(&self) -> links::Index {
        self.value.index.into()
    }

    pub(in crate::depot) fn insert_entry(
        self,
        value: T,
    ) -> entry::Live<'a, T, Tag, entry::Indexed> {
        entry::Live::index(self.value.insert(value), self.bucket, self.hash)
    }
}

impl<'a, T, Tag> entry::Vacancy<'a, T, Tag> {
    pub(in crate::depot) fn try_new(
        core: &'a mut hash::Core<T, Tag>,
        hash: u64,
        value: T,
        matches: impl Fn(&T, &T) -> bool,
    ) -> Result<(Self, T), errors::Insert<T, Tag>> {
        match map::raw::Probe::new(core, hash, |stored| matches(stored, &value)).entry() {
            map::Entry::Occupied(occupied) => Err(errors::Insert::Occupied {
                key: occupied.key(),
                value,
            }),
            map::Entry::Vacant(None) => Err(errors::Insert::Full(value)),
            map::Entry::Vacant(Some(place)) => Ok((place, value)),
        }
    }

    pub fn insert(self, value: T) -> key::Handle<runtime::Domain<Tag>> {
        self.insert_entry(value).key()
    }
}