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
use crate::pack;
use duplicate::duplicate_item;
pub fn flat(item: impl Flatten) -> Vec<u8> {
item.flatten()
}
pub trait Flatten {
fn flatten(&self) -> Vec<u8>;
}
#[duplicate_item(
int_type;
[u16];
[u32];
[u64];
)]
impl Flatten for int_type {
fn flatten(&self) -> Vec<u8> {
pack(*self).expect("Value was too large to be flattened")
}
}
impl Flatten for &str {
fn flatten(&self) -> Vec<u8> {
self.bytes().collect()
}
}
impl Flatten for u8 {
fn flatten(&self) -> Vec<u8> {
vec![*self]
}
}
impl<T> Flatten for &[T]
where
T: Flatten,
{
fn flatten(&self) -> Vec<u8> {
self.iter()
.map(|v| v.flatten())
.collect::<Vec<Vec<_>>>()
.concat()
}
}
impl<T, const N: usize> Flatten for &[T; N]
where
T: Flatten,
{
fn flatten(&self) -> Vec<u8> {
self.as_slice().flatten()
}
}
impl<I> Flatten for &[(I, Box<dyn Flatten>)]
where
usize: From<I>,
I: Copy,
{
fn flatten(&self) -> Vec<u8> {
let mut map: Vec<(usize, &Box<dyn Flatten>)> =
self.iter().map(|(i, f)| ((*i).into(), f)).collect();
map.sort_by(|(a, _), (b, _)| a.partial_cmp(b).unwrap());
let mut out: Vec<Option<u8>> = Vec::with_capacity(map.first().map_or(0, |(i, _)| *i));
for (i, val) in map {
let flattened = val.flatten();
let end_i = i + flattened.len();
if end_i > out.len() {
out.extend(std::iter::repeat(None).take(end_i - out.len()));
}
if out
.splice(
i..i + flattened.len(),
flattened.into_iter().map(Some).collect::<Vec<Option<u8>>>(),
)
.any(|v: Option<u8>| v.is_some())
{
panic!("Values in flat() overlap");
}
}
out.iter().map(|v| v.unwrap_or(b'a')).collect()
}
}