hibana 0.9.9

Choreographic programming in Rust with no_std and no heap allocation
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118

use core::ops::{Deref, DerefMut, Index, IndexMut};

#[derive(Clone, Copy)]
pub(super) struct EntryView<'a, T> {
    slots: &'a [T],
}

impl<'a, T> EntryView<'a, T> {
    pub(super) const fn empty() -> Self {
        Self { slots: &[] }
    }

    #[inline]
    pub(super) unsafe fn from_parts(ptr: *const T, capacity: usize) -> Self {
        if capacity > u16::MAX as usize || (capacity != 0 && ptr.is_null()) {
            crate::invariant();
        }
        let slots = if capacity == 0 {
            &[]
        } else {
            /* SAFETY: the caller grants an initialized immutable span for the
            complete lifetime represented by this view. */
            unsafe { core::slice::from_raw_parts(ptr, capacity) }
        };
        Self { slots }
    }

    #[inline]
    pub(super) const fn capacity(&self) -> usize {
        self.slots.len()
    }

    #[inline]
    pub(super) const fn as_slice(&self) -> &[T] {
        self.slots
    }
}

impl<T> Index<usize> for EntryView<'_, T> {
    type Output = T;

    #[inline]
    fn index(&self, index: usize) -> &Self::Output {
        &self.as_slice()[index]
    }
}

pub(super) struct EntryBuffer<'a, T> {
    slots: &'a mut [T],
}

impl<'a, T> EntryBuffer<'a, T> {
    #[inline]
    pub(super) const fn capacity(&self) -> usize {
        self.slots.len()
    }

    #[inline]
    pub(super) fn from_slice(slots: &'a mut [T]) -> Self {
        if slots.len() > u16::MAX as usize {
            crate::invariant();
        }
        Self { slots }
    }

    #[inline]
    pub(super) const fn into_view(self) -> EntryView<'a, T> {
        EntryView { slots: self.slots }
    }

    #[inline]
    pub(super) const fn as_slice(&self) -> &[T] {
        self.slots
    }

    #[inline]
    pub(super) fn as_mut_slice(&mut self) -> &mut [T] {
        self.slots
    }
}

impl<T> Deref for EntryBuffer<'_, T> {
    type Target = [T];

    #[inline]
    fn deref(&self) -> &Self::Target {
        self.as_slice()
    }
}

impl<T> DerefMut for EntryBuffer<'_, T> {
    #[inline]
    fn deref_mut(&mut self) -> &mut Self::Target {
        self.as_mut_slice()
    }
}

impl<T, I> Index<I> for EntryBuffer<'_, T>
where
    [T]: Index<I>,
{
    type Output = <[T] as Index<I>>::Output;

    #[inline]
    fn index(&self, index: I) -> &Self::Output {
        &self.as_slice()[index]
    }
}

impl<T, I> IndexMut<I> for EntryBuffer<'_, T>
where
    [T]: IndexMut<I>,
{
    #[inline]
    fn index_mut(&mut self, index: I) -> &mut Self::Output {
        &mut self.as_mut_slice()[index]
    }
}