byte-size 0.2.7

An effective short string shrinker with total disregard for speed, memory usage and executable size
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



//Convenient struct containing information on a match, including the index of the match (in whatever map it matched), the length of the match and whether a space was matched too
#[derive(PartialEq, Debug, Clone)]
pub (crate) struct Match {
    pub (crate) index: usize,
    pub (crate) length: usize,
    pub (crate) space: bool,
}

//Little trait that allow us to work generically over phf maps and the bimap (used for matching custom sequences)
//and match sequences with an optional space
pub (crate) trait Bi {

    fn get(&self, string: &  [u8]) -> Option<usize>;

    fn match_sequence(&self, string: & [u8], length: usize, offset: usize, space: bool) -> Option<Match> {
        if let Some(index) = self.get(&string[offset..length+offset]) {
            return Some(Match {
                index,
                length: length+offset,
                space,
            })
        }
        None
    }

    fn match_spaced_sequence(&self, string: &[u8], space: bool, length: usize) -> Option<Match> {
        if string.len() >= length + 1 {
            if space && string[0] == ' ' as u8 {
                return self.match_sequence(string, length, 1, true);
            }
        }

        if string.len() >= length {
            return self.match_sequence(string, length, 0, false);
        }

        None
    }
}

impl Bi for phf::OrderedMap<& 'static [u8], usize> {
    fn get(&self, string: & [u8]) -> Option<usize> {
        self.get(string).copied()
    }
}

impl Bi for bimap::BiHashMap<& 'static [u8], usize> {
    fn get(&self, string: & [u8]) -> Option<usize> {
        self.get_by_left(string).copied()
    }
}