dlhn 0.1.7

DLHN is a blazing fast and small data serialization format.
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

// https://developers.google.com/protocol-buffers/docs/encoding#signed_integers
// https://stackoverflow.com/questions/2210923/zig-zag-decoding

pub(crate) trait ZigZag<T> {
    fn encode_zigzag(self) -> T;
    fn decode_zigzag(value: T) -> Self;
}

// impl ZigZag<u128> for i128 {
//     fn encode_zigzag(self) -> u128 {
//         ((self << 1) ^ (self >> 127)) as u128
//     }

//     fn decode_zigzag(value: u128) -> Self {
//         (value >> 1) as i128 ^ (-(value as i128 & 1))
//     }
// }

impl ZigZag<u64> for i64 {
    fn encode_zigzag(self) -> u64 {
        ((self << 1) ^ (self >> 63)) as u64
    }

    fn decode_zigzag(value: u64) -> Self {
        (value >> 1) as i64 ^ (-(value as i64 & 1))
    }
}

impl ZigZag<u32> for i32 {
    fn encode_zigzag(self) -> u32 {
        ((self << 1) ^ (self >> 31)) as u32
    }

    fn decode_zigzag(value: u32) -> Self {
        (value >> 1) as i32 ^ (-(value as i32 & 1))
    }
}

impl ZigZag<u16> for i16 {
    fn encode_zigzag(self) -> u16 {
        ((self << 1) ^ (self >> 15)) as u16
    }

    fn decode_zigzag(value: u16) -> Self {
        (value >> 1) as i16 ^ (-(value as i16 & 1))
    }
}

impl ZigZag<u8> for i8 {
    fn encode_zigzag(self) -> u8 {
        ((self << 1) ^ (self >> 7)) as u8
    }

    fn decode_zigzag(value: u8) -> Self {
        (value >> 1) as i8 ^ (-(value as i8 & 1))
    }
}