icbiadb 0.3.7

I can't believe it's a database | Simple embedded 3-in-1 database
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

/// Slice helper functions
pub fn is_zero(s: &[u8]) -> bool {
    for b in s {
        if *b != 0 {
            return false;
        }
    }

    true
}

pub fn strip_ref_symbols(v: &[u8]) -> &[u8] {
    // 38 = &, 42 = *
    let mut rv = v;
    while rv[0] == 38 || rv[0] == 42 {
        rv = &rv[1..];
    }

    if rv.starts_with(b"mut ") {
        rv = &rv[4..];
    } else if rv.starts_with(b"const ") {
        rv = &rv[6..];
    }

    rv
}

// Manipulate functions
pub fn find(v: &[u8], seq: &[u8]) -> Option<usize> {
    if seq.len() > v.len() {
        return None;
    }

    if v.starts_with(seq) || v == seq {
        return Some(0);
    }

    let mut seq_i = 0;
    for (i, byte) in v.iter().enumerate() {
        if *byte == seq[seq_i] {
            seq_i += 1;
        } else if *byte == seq[0] {
            seq_i = 1;
        } else {
            seq_i = 0;
        }

        if seq_i == seq.len() {
            return Some(i - (seq.len() - 1));
        }
    }

    None
}

pub fn find_all(v: &[u8], seq: &[u8]) -> Vec<usize> {
    if seq.len() > v.len() {
        return vec![];
    }

    let mut result = Vec::new();
    let mut seq_i = 0;
    for (i, byte) in v.iter().enumerate() {
        if *byte == seq[seq_i] {
            seq_i += 1;
        } else if *byte == seq[0] {
            seq_i = 1;
        } else {
            seq_i = 0;
        }

        if seq_i == seq.len() {
            result.push(i - (seq.len() - 1))
        }
    }

    result
}

pub fn split<'a>(mut v: &'a [u8], seq: &[u8]) -> Vec<&'a [u8]> {
    if seq.len() > v.len() {
        return vec![];
    }

    let mut result = Vec::new();

    while let Some(idx) = find(v, seq) {
        result.push(&v[..idx]);
        v = &v[idx + seq.len()..];
    }
    result.push(&v);

    result
}

pub fn contains_sequence(v: &[u8], seq: &[u8]) -> bool {
    if seq.len() > v.len() {
        return false;
    }

    let mut seq_i = 0;
    for byte in v {
        if *byte == seq[seq_i] {
            seq_i += 1;
        } else if *byte == seq[0] {
            seq_i = 1;
        } else {
            seq_i = 0;
        }

        if seq_i == seq.len() {
            return true;
        }
    }

    false
}