o3 0.26.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

use std::num::NonZero;

use crate::buffer::write::spans;

#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub struct Error {
    required: NonZero<usize>,
    available: usize,
}

impl Error {
    /// Classifies a nonempty request against a destination with no remaining capacity.
    pub const fn empty(required: NonZero<usize>) -> Self {
        Self::new(required, 0)
    }

    pub const fn new(required: NonZero<usize>, room: usize) -> Self {
        Self {
            required,
            available: room,
        }
    }

    pub fn check(required: usize, room: usize) -> Result<(), Self> {
        if required <= room {
            return Ok(());
        }
        Err(Self::new(
            NonZero::<usize>::MIN.saturating_add(required - 1),
            room,
        ))
    }

    pub const fn into_parts(self) -> (NonZero<usize>, usize) {
        (self.required, self.available)
    }

    pub(in crate::buffer) fn checked_end<const N: usize>(
        start: usize,
        capacity: usize,
        slices: &[&[u8]; N],
    ) -> Result<usize, Self> {
        Self::check(start, capacity)?;
        let Some((last, prefix)) = slices.split_last() else {
            return Ok(start);
        };
        let mut room = capacity - start;
        for slice in prefix {
            Self::check(slice.len(), room)?;
            room -= slice.len();
        }
        Self::check(last.len(), room)?;
        Ok(capacity - room + last.len())
    }
}

impl From<spans::Gap> for Error {
    fn from(gap: spans::Gap) -> Self {
        let (expected, actual) = gap.into_parts();
        Self::new(
            NonZero::<usize>::MIN.saturating_add(expected.get() as usize - 1),
            actual as usize,
        )
    }
}

const _: () = assert!(size_of::<Error>() == 2 * size_of::<usize>());