serial_traits 1.1.2

A trait that allows you to serialize to and parse from Vec<u8> buffers. Comes with implementations for primitive types, String and generic collection types (if the item type implements the trait too.)
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143

#[cfg(test)]
mod tests {
    use std::collections::{
        BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, LinkedList, VecDeque,
    };

    use crate::Serializable;
    use rand;
    use rand::Rng;

    #[test]
    fn test_string() {
        let mut rng = rand::rng();
        let mut value = "".to_string();
        for _ in 0..rng.random::<u16>() {
            value.push(rng.random::<char>());
        }

        let mut buffer = value.serialize();
        let result = String::parse(&mut buffer);

        match result {
            Some(outcome) => assert_eq!(value, outcome),
            None => panic!(),
        }
    }

    macro_rules! test_list {
        ($name:ident, $list_type:ty, $adder_name:ident) => {
            #[test]
            fn $name() {
                let mut rng = rand::rng();
                let mut value = <$list_type>::new();
                for _ in 1..rng.random::<u8>() {
                    value.$adder_name(rng.random::<char>());
                }

                let mut buffer = value.serialize();
                let result = <$list_type>::parse(&mut buffer);

                match result {
                    Some(outcome) => assert_eq!(value, outcome),
                    None => panic!(),
                }
            }
        };
    }

    test_list!(test_vec, Vec<char>, push);
    test_list!(test_vecdeque, VecDeque<char>, push_back);
    test_list!(test_linkedlist, LinkedList<char>, push_back);

    macro_rules! test_map {
        ($name:ident, $map_type:ty) => {
            #[test]
            fn $name() {
                let mut rng = rand::rng();
                let mut value = <$map_type>::new();
                for _ in 1..rng.random::<u8>() {
                    value.insert(rng.random::<char>(), rng.random::<char>());
                }

                let mut buffer = value.serialize();
                let result = <$map_type>::parse(&mut buffer);

                match result {
                    Some(outcome) => assert_eq!(value, outcome),
                    None => panic!(),
                }
            }
        };
    }

    test_map!(test_map_hash, HashMap<char, char>);
    test_map!(test_map_btree, BTreeMap<char, char>);

    macro_rules! test_set {
        ($name:ident, $set_type:ty) => {
            #[test]
            fn $name() {
                let mut rng = rand::rng();
                let mut value = <$set_type>::new();
                for _ in 1..rng.random::<u8>() {
                    value.insert(rng.random::<char>());
                }

                let mut buffer = value.serialize();
                let result = <$set_type>::parse(&mut buffer);

                match result {
                    Some(outcome) => {
                        if value.len() != outcome.len() {
                            panic!("set length didn't equal");
                        }

                        for element in value {
                            if !outcome.contains(&element) {
                                panic!("set didn't contain item");
                            }
                        }
                    }
                    None => panic!(),
                }
            }
        };
    }

    test_set!(test_set_hash, HashSet<char>);
    test_set!(test_set_btree, BTreeSet<char>);

    #[test]
    fn test_binaryheap() {
        let mut rng = rand::rng();
        let mut value = <BinaryHeap<char>>::new();
        for _ in 1..rng.random::<u8>() {
            value.push(rng.random::<char>());
        }

        let mut buffer = value.serialize();
        let result = <BinaryHeap<char>>::parse(&mut buffer);

        match result {
            Some(outcome) => {
                if value.len() != outcome.len() {
                    panic!("heap size didn't equal");
                }

                for element in value {
                    let mut contains = false;
                    for other in &outcome {
                        if element == *other {
                            contains = true;
                        }
                    }
                    if !contains {
                        panic!("heap didn't contain item");
                    }
                }
            }
            None => panic!(),
        }
    }
}