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

use std::{
    cmp::Ord,
    collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, LinkedList, VecDeque},
    hash::Hash,
};

use crate::{unwrap_return, Serializable, bin_slice, get_vec};

impl Serializable for String {
    fn serialize(&self) -> Vec<u8> {
        let bytes = self.clone().into_bytes().to_vec();
        vec![bytes.len().serialize(), bytes].concat()
    }

    fn parse(data: &mut Vec<u8>) -> Option<Self> {
        let string_byte_length = unwrap_return!(usize::parse(data));

        let bytes: Vec<u8> = data.drain(0..string_byte_length).collect();

        if bytes.len() != string_byte_length {
            return None;
        }

        String::from_utf8(bytes).ok()
    }
}

impl<T: Serializable> Serializable for Vec<T> {
    fn serialize(&self) -> Vec<u8> {
        let mut stuffs = self.len().serialize();
        stuffs.append(&mut bin_slice(self));
        stuffs
    }
    fn parse(data: &mut Vec<u8>) -> Option<Self> {
        usize::parse(data).and_then(|length| get_vec(length, data))
    }
}

impl<T: Serializable> Serializable for VecDeque<T> {
    fn serialize(&self) -> Vec<u8> {
        let mut bytes = self.len().serialize();
        for item in self.iter() {
            bytes.append(&mut item.serialize());
        }
        bytes
    }
    fn parse(data: &mut Vec<u8>) -> Option<Self> {
        match <Vec<T>>::parse(data) {
            Some(parsed) => Some(parsed.into()),
            None => None,
        }
    }
}

impl<T: Serializable> Serializable for LinkedList<T> {
    fn serialize(&self) -> Vec<u8> {
        let mut bytes = self.len().serialize();
        for item in self.iter() {
            bytes.append(&mut item.serialize());
        }
        bytes
    }
    fn parse(data: &mut Vec<u8>) -> Option<Self> {
        let length = unwrap_return!(usize::parse(data));

        get_vec(length, data).and_then(|parsed|{
            let mut linked_list = Self::new();
            for item in parsed {
                linked_list.push_back(item);
            }
            Some(linked_list)
        })
    }
}

macro_rules! impl_map {
    ($map_type:ty, $( $key_traits:tt, )*) => {
        impl<K: Serializable $( + $key_traits)*, V: Serializable> Serializable for $map_type {
            fn serialize(&self) -> Vec<u8> {
                let mut bytes = self.len().serialize();
                for pair in self {
                    bytes.append(&mut pair.0.serialize());
                    bytes.append(&mut pair.1.serialize());
                }
                bytes
            }

            fn parse(data: &mut Vec<u8>) -> Option<Self> {
                let item_count = unwrap_return!(usize::parse(data));

                get_vec::<(K, V)>(item_count, data).and_then(|pairs| {
                    let mut result = Self::new();
                    for pair in pairs {
                        _ = result.insert(pair.0, pair.1)
                    }
                    Some(result)
                })
            }
        }
    };
}

impl_map!(HashMap<K, V>, Eq, Hash,);
impl_map!(BTreeMap<K, V>, Ord,);

macro_rules! impl_set {
    ($map_type:ty, $adder_name:ident, $( $key_traits:tt, )*) => {
		impl<T: Serializable $( + $key_traits)*> Serializable for $map_type {
			fn serialize(&self) -> Vec<u8> {
				let mut bytes = self.len().serialize();
				for item in self {
					bytes.append(&mut item.serialize());
				}
				bytes
			}

			fn parse(data: &mut Vec<u8>) -> Option<Self> {
				let item_count = unwrap_return!(usize::parse(data));

				get_vec::<T>(item_count, data).and_then(|items| {
                    let mut result = Self::new();
                    for item in items {
                        _ = result.$adder_name(item)
                    }
                    Some(result)
                })
			}
		}
	}
}

impl_set!(HashSet<T>, insert, Eq, Hash,);
impl_set!(BTreeSet<T>, insert, Ord,);
impl_set!(BinaryHeap<T>, push, Ord,); // a heap is not a set but here they work the same so idc