o3 0.26.1

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

use std::mem;

pub(in crate::depot::queue::indexed) use front::Front;

use crate::depot::queue::{
    indexed::{fifo, keyed},
    links,
};

mod front;

impl<T> fifo::Store<T> {
    pub(in crate::depot::queue::indexed) fn front_entry(&self) -> Option<Front<'_, T>> {
        if self.state().is_empty() {
            return None;
        }
        // SAFETY: this store retains the live head in its exact allocation.
        Some(Self::front_from(unsafe {
            crate::depot::raw::Proof::new(self)
        }))
    }

    pub(in crate::depot::queue::indexed) fn front_from(
        source: crate::depot::raw::Proof<&Self, keyed::NonEmpty>,
    ) -> Front<'_, T> {
        let owner = source.into_inner();
        // SAFETY: the retained source proves this exact store's initialized nonempty head.
        let index = unsafe { owner.state().front_key() };
        unsafe { Front::new(owner.at(index)) }
    }
}

impl<T> Drop for fifo::Store<T> {
    fn drop(&mut self) {
        if !mem::needs_drop::<T>() {
            return;
        }
        let mut next = self.state().first();
        while let Some(index) = next {
            // SAFETY: the allocation owner retains every initialized node in
            // its unchanged live chain until the backing storage is released.
            let entry = unsafe { self.at(index) };
            let node = entry.slot();
            next = links::Index::decode(node.hook.next.get());
            unsafe { (*node.value.get()).assume_init_drop() };
        }
    }
}