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
use crate::Bit;

pub fn from(bytes: &Vec<u8>) -> Vec<Bit> {

    let mut res: Vec<Bit> = Vec::new();

    let bin_str: String = bytes
        .iter()
        .fold(String::new(), |acc, x| format!("{}{:b}", acc, x));

    for i in bin_str.chars() {
        match i {
            '0' => res.push(Bit::Zero),
            '1' => res.push(Bit::One),
            _ => ()
        }
    }

    while res.len() > 1 && res[0] == Bit::Zero {
        res.remove(0);
    }

    res

}

pub fn to(mut bits: Vec<Bit>) -> Vec<u8> {

    let mut res: Vec<u8> = Vec::new();

    while !bits.is_empty() {

        let mut byte_str: String = String::new();

        while byte_str.len() < 8 {
            match bits.pop() {
                Some(r) => {
                    match r {
                        Bit::Zero => byte_str = format!("0{}", byte_str),
                        Bit::One => byte_str = format!("1{}", byte_str)
                    }
                },
                None => break
            }
        }

        res.push(u8::from_str_radix(&byte_str, 2).unwrap())

    }

    res.reverse();

    res

}

pub fn to_ext(bits: Vec<Bit>, length: usize) -> Vec<u8> {

    let mut res: Vec<u8> = to(bits);

    if res.len() > length {

        res[(res.len() - length)..].to_vec()

    } else if res.len() == length {
        res
    } else {
        
        res.reverse();
    
        while res.len() < length {
            res.push(0)
        }
        res.reverse();
        
        res

    }

}