o3 0.34.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
79
80
81
82
83
84
85
86
87
88
89

use std::cmp;

use crate::depot::heap::{self, hole};

/// Owns the only hole and restores its source before returning.
pub(in crate::depot) struct Hole<S: hole::raw::Source> {
    pub(in crate::depot) owner: S,
    pub(in crate::depot) value: S::Value,
    pub(in crate::depot) position: usize,
}

impl<S: hole::raw::Source> Hole<S> {
    pub(in crate::depot) fn append(vacancy: heap::Vacancy<S, S::Value>) -> Self {
        let (owner, value) = vacancy.into_inner();
        let position = owner.len() as usize;
        hole::Path::up(owner, position, &value, S::compare).append(value)
    }

    pub(in crate::depot) fn prepare(entry: heap::Entry<S, S::Value>) -> heap::Entry<S> {
        let (entry, old) = Self::replace(entry);
        drop(old);
        entry
    }

    pub(in crate::depot) fn commit<const PLACE: bool>(self) -> S {
        S::write::<PLACE>(hole::Finish { hole: self })
    }

    pub(in crate::depot) fn finish(self) -> heap::Entry<S> {
        let position = self.position;
        unsafe { heap::Entry::new(self.commit::<true>(), position, ()) }
    }

    pub(in crate::depot) fn replace(entry: heap::Entry<S, S::Value>) -> (heap::Entry<S>, S::Value) {
        let (owner, position, value) = entry.into_inner();
        let len = owner.len() as usize;
        let mut path = hole::Path::repair(owner, position, len, &value, S::compare);
        let old = S::read::<false>(hole::At::new(&mut path.owner, position, ()));
        (path.apply(value).finish(), old)
    }

    pub(in crate::depot) fn update(entry: heap::Entry<S, S::Value>) {
        let (owner, position, value) = entry.into_inner();
        let order = S::direction(hole::At::new(&owner, position, &value));
        let mut path = match order {
            cmp::Ordering::Less => hole::Path::up(owner, position, &value, S::compare),
            cmp::Ordering::Greater => {
                let len = owner.len() as usize;
                hole::Path::down(owner, position, len, &value, S::compare)
            }
            cmp::Ordering::Equal => hole::Path::at(owner, position),
        };
        let old = S::read::<false>(hole::At::new(&mut path.owner, position, ()));
        let hole = path.apply(value);
        if hole.position != position {
            hole.commit::<true>();
        } else {
            hole.commit::<false>();
        }
        drop(old);
    }

    pub(in crate::depot) fn remove(entry: heap::Entry<S>) -> heap::Vacancy<S, S::Value> {
        let (mut owner, position, ()) = entry.into_inner();
        let tail = (owner.len() - 1) as usize;
        if position == tail {
            let value = S::read::<true>(hole::At::new(&mut owner, position, ()));
            *unsafe { owner.len_mut() } = tail as u32;
            return unsafe { heap::Vacancy::new(owner, value) };
        }
        let mut path = hole::Path::repair(owner, position, tail, &tail, |entry| {
            let (owner, position, tail) = entry.into_inner();
            S::compare_at(
                hole::At::new(owner, *tail, ()),
                hole::At::new(owner, position, ()),
            )
        });
        let value = S::read::<true>(hole::At::new(&mut path.owner, position, ()));
        let mut hole = path.apply(value);
        hole::Step {
            hole: &mut hole,
            source: tail,
        }
        .shift();
        *unsafe { hole.owner.len_mut() } = tail as u32;
        let Self { owner, value, .. } = hole;
        unsafe { heap::Vacancy::new(owner, value) }
    }
}