accepts-codegen 0.0.1

Rust toolkit for composing synchronous and asynchronous acceptor pipelines
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

use std::ops::{Index, IndexMut};

#[derive(Debug, Clone, PartialEq, Eq)]
pub struct HybridDeck<T, const C: usize> {
    inline: [T; C],
    extras: Vec<T>,
}

#[allow(dead_code)]
impl<T, const C: usize> HybridDeck<T, C> {
    pub fn from_inline(inline: [T; C]) -> Self {
        Self {
            inline,
            extras: Vec::new(),
        }
    }

    pub fn from_parts(inline: [T; C], extras: Vec<T>) -> Self {
        Self { inline, extras }
    }

    pub fn into_parts(self) -> ([T; C], Vec<T>) {
        (self.inline, self.extras)
    }

    pub fn inline(&self) -> &[T; C] {
        &self.inline
    }
    pub fn inline_mut(&mut self) -> &mut [T; C] {
        &mut self.inline
    }

    pub fn extras(&self) -> &Vec<T> {
        &self.extras
    }
    pub fn extras_mut(&mut self) -> &mut Vec<T> {
        &mut self.extras
    }

    pub fn push_extra(&mut self, v: T) {
        self.extras.push(v);
    }

    pub fn len_total(&self) -> usize {
        C + self.extras.len()
    }

    pub fn get(&self, i: usize) -> Option<&T> {
        if i < C {
            Some(&self.inline[i])
        } else {
            self.extras.get(i - C)
        }
    }
}

impl<T, const C: usize> IntoIterator for HybridDeck<T, C> {
    type Item = T;
    type IntoIter = std::iter::Chain<std::array::IntoIter<T, C>, std::vec::IntoIter<T>>;
    fn into_iter(self) -> Self::IntoIter {
        (self.inline.into_iter()).chain(self.extras.into_iter())
    }
}

impl<T, const C: usize> Index<usize> for HybridDeck<T, C> {
    type Output = T;

    fn index(&self, index: usize) -> &Self::Output {
        let inline_len = self.inline.len();
        if index < inline_len {
            &self.inline[index]
        } else {
            &self.extras[index - inline_len]
        }
    }
}
impl<T, const C: usize> IndexMut<usize> for HybridDeck<T, C> {
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        let inline_len = self.inline.len();
        if index < inline_len {
            &mut self.inline[index]
        } else {
            &mut self.extras[index - inline_len]
        }
    }
}

impl<T, const C: usize> From<[T; C]> for HybridDeck<T, C> {
    fn from(inline: [T; C]) -> Self {
        Self::from_inline(inline)
    }
}
impl<T, const C: usize> From<([T; C], Vec<T>)> for HybridDeck<T, C> {
    fn from(p: ([T; C], Vec<T>)) -> Self {
        Self::from_parts(p.0, p.1)
    }
}

impl<T, const C: usize> Extend<T> for HybridDeck<T, C> {
    fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I) {
        self.extras.extend(iter);
    }
}