colain 0.1.4

A parser for the Common Layer Interface format (.cli)
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

//! Produces copies of N elements from the array
//! Yields a ~10% performance bump over returning pointers
pub struct ArrayChunksCopy<'a, T: 'a + Copy, const N: usize> {
    v: &'a [T],
    rem: &'a [T],
}

impl<'a, T: Copy, const N: usize> ArrayChunksCopy<'a, T, N> {
    #[inline]
    pub fn new(slice: &'a [T]) -> Self {
        let rem = slice.len() % N;
        let fst_len = slice.len() - rem;
        // SAFETY: 0 <= fst_len <= slice.len() by construction above
        let (fst, snd) = slice.split_at(fst_len);
        Self { v: fst, rem: snd }
    }

    /// Returns the remainder of the original slice that is not going to be
    /// returned by the iterator. The returned slice has at most `chunk_size-1`
    /// elements.
    pub fn remainder(&self) -> &'a [T] {
        self.rem
    }
}

impl<T: Copy, const N: usize> Clone for ArrayChunksCopy<'_, T, N> {
    fn clone(&self) -> Self {
        ArrayChunksCopy {
            v: self.v,
            rem: self.rem,
        }
    }
}

impl<'a, T: Copy, const N: usize> Iterator for ArrayChunksCopy<'a, T, N> {
    type Item = [T; N];

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        if self.v.len() < N {
            None
        } else {
            let (fst, snd) = self.v.split_at(N);
            self.v = snd;
            Some(*unsafe { &*(fst as *const [T] as *const [T; N]) })
        }
    }
}

/// Stopgap until ArrayChunks is stabilized
pub struct ArrayChunks<'a, T: 'a, const N: usize> {
    v: &'a [T],
    rem: &'a [T],
}

impl<'a, T, const N: usize> ArrayChunks<'a, T, N> {
    #[inline]
    pub fn new(slice: &'a [T]) -> Self {
        let rem = slice.len() % N;
        let fst_len = slice.len() - rem;
        // SAFETY: 0 <= fst_len <= slice.len() by construction above
        let (fst, snd) = slice.split_at(fst_len);
        Self { v: fst, rem: snd }
    }

    /// Returns the remainder of the original slice that is not going to be
    /// returned by the iterator. The returned slice has at most `chunk_size-1`
    /// elements.
    pub fn remainder(&self) -> &'a [T] {
        self.rem
    }
}

impl<T, const N: usize> Clone for ArrayChunks<'_, T, N> {
    fn clone(&self) -> Self {
        ArrayChunks {
            v: self.v,
            rem: self.rem,
        }
    }
}

impl<'a, T, const N: usize> Iterator for ArrayChunks<'a, T, N> {
    type Item = &'a [T; N];

    #[inline]
    fn next(&mut self) -> Option<&'a [T; N]> {
        if self.v.len() < N {
            None
        } else {
            let (fst, snd) = self.v.split_at(N);
            self.v = snd;
            Some(unsafe { &*(fst as *const [T] as *const [T; N]) })
        }
    }
}