gnat 0.1.5

Type-level numbers without extra bounds
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

use crate::array::*;

#[repr(transparent)]
pub struct ArrDrop<T>(pub T);

impl<A: Array> ArrDrop<A> {
    pub const fn enter(self) -> ArrDrop<ArrVecApi<A>> {
        // SAFETY: repr(transparent)
        unsafe {
            ArrDrop(ArrVecApi::new_full(crate::utils::union_transmute!(
                ArrDrop<A>,
                A,
                self,
            )))
        }
    }
}
impl<A: Array> ArrDrop<ArrVecApi<A>> {
    pub const fn enter(self) -> Self {
        self
    }
    pub const fn needs_drop(&self) -> bool {
        const { core::mem::needs_drop::<A::Item>() }
    }
    pub const fn pop_next(&mut self) -> Option<A::Item> {
        self.0.pop()
    }
    pub const fn discard(self) {
        debug_assert!(!self.needs_drop() || self.0.is_empty());
        core::mem::forget(self);
    }
}
impl<A: Array> ArrDrop<ArrDeqApi<A>> {
    pub const fn enter(self) -> Self {
        self
    }
    pub const fn needs_drop(&self) -> bool {
        const { core::mem::needs_drop::<A::Item>() }
    }
    pub const fn pop_next(&mut self) -> Option<A::Item> {
        self.0.pop_front()
    }
    pub const fn discard(self) {
        debug_assert!(!self.needs_drop() || self.0.is_empty());
        core::mem::forget(self);
    }
}