jppe 1.1.1

This is a byte stream structured serialization and deserialization library.
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

pub mod errors;
mod traits;

pub use errors::*;
use crate::std::*;
use crate::ByteOrder;


#[inline]
pub fn input_take<T>(input: &[T], length: usize) -> JResult<&[T], &[T]> {
    if length <= input.len() {
        return Ok((&input[length..], &input[..length]));
    }

    Err(make_error(input, ErrorKind::InvalidByteLength { offset: input.len() }))
}


#[inline]
pub fn parse_subsequence<'a, 'b,  T>(input: &'a [T], needle: &'b [T], is_save_needle: bool) -> JResult<&'a [T], &'a [T]>
where
    T: PartialEq,
{
    let needle_len = needle.len();
    let input_len = input.len();

    if needle_len > input_len {
        return Err(make_error(input, ErrorKind::InvalidByteLength { offset: input_len }));
    }

    for i in 0..input_len {
        let mut status = false;

        for j in 0..needle_len {
            if needle[j] != input[i + j] {
                status = true;
                break;
            }
        }

        if !status {
            return Ok((&input[i + needle_len..], if is_save_needle {&input[..i + needle_len]} else {&input[..i]}));
        }
    }

    Err(make_error(input, ErrorKind::SubSequence { offset: input_len }))
}


pub fn parse_subsequences<'a, T>(input: &'a [T], needles: &'a [&'a [T]], is_save_needle: bool) -> JResult<&'a [T], &'a [T]>
where
    T: PartialEq,
{
    let input_len = input.len();

    for needle in needles {
        if let Ok((input, value)) = parse_subsequence(input, needle, is_save_needle) {
            return Ok((input, value));
        }
    }

    Err(make_error(input, ErrorKind::SubSequence { offset: input_len }))
}


pub fn parse_u128<'a>(input: &'a [u8], byteorder: &crate::ByteOrder, byte_count: u8) -> JResult<&'a [u8], u128>
{
    let input_len = input.len();
    let mut value: u128 = 0;

    if input_len < byte_count.into() {
        return Err(make_error(input, ErrorKind::InvalidByteLength { offset: input_len }));
    }

    match byteorder {
        ByteOrder::Be => {
            for byte in input.iter().take(byte_count.into()) {
                value = (value << 8) + *byte as u128;
            }
        },
        ByteOrder::Le => {
            for (index, byte) in input.iter().enumerate().take(byte_count.into()) {
                value += (*byte as u128) << (8 * index);
            }
        }
    }

    Ok((&input[byte_count.into()..], value))
}


pub fn parse_usize<'a>(input: &'a [u8], byteorder: &crate::ByteOrder, byte_count: u8) -> JResult<&'a [u8], usize>
{
    let input_len = input.len();
    let mut value: usize = 0;

    if input_len < byte_count.into() {
        return Err(make_error(input, ErrorKind::InvalidByteLength { offset: input_len }));
    }

    match byteorder {
        ByteOrder::Be => {
            for byte in input.iter().take(byte_count.into()) {
                value = (value << 8) + *byte as usize;
            }
        },
        ByteOrder::Le => {
            for (index, byte) in input.iter().enumerate().take(byte_count.into()) {
                value += (*byte as usize) << (8 * index);
            }
        }
    }

    Ok((&input[byte_count.into()..], value))
}


pub fn int_to_vec(value: usize, byte_count: usize, byteorder: &crate::ByteOrder) -> Vec<u8> {
    if let ByteOrder::Be = byteorder {
        match byte_count {
            1 => (value as u8).to_be_bytes().to_vec(),
            2 => (value as u16).to_be_bytes().to_vec(),
            4 => (value as u32).to_be_bytes().to_vec(),
            8 => (value as u64).to_be_bytes().to_vec(),
            16 => (value as u128).to_be_bytes().to_vec(),
            _ => vec![],
        }    
    }
    else {
        match byte_count {
            1 => (value as u8).to_le_bytes().to_vec(),
            2 => (value as u16).to_le_bytes().to_vec(),
            4 => (value as u32).to_le_bytes().to_vec(),
            8 => (value as u64).to_le_bytes().to_vec(),
            16 => (value as u128).to_le_bytes().to_vec(),
            _ => vec![],
        }    
    }
}