derivre 0.3.11

A derivative-based regular expression engine
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

use crate::HashMap;

use crate::ast::{Expr, ExprRef, ExprSet, NextByte};

/// Cache for [`NextByte`] analysis results.
///
/// Stores the precomputed [`NextByte`] value for each expression, which
/// indicates whether a state is forced to accept a single byte, is at
/// end-of-input, or has multiple possible transitions.
#[derive(Clone)]
pub struct NextByteCache {
    next_byte_cache: HashMap<ExprRef, NextByte>,
}

pub(crate) fn next_byte_simple(exprs: &ExprSet, mut r: ExprRef) -> NextByte {
    let mut fuzzy = false;
    let res = 'dfs: loop {
        match exprs.get(r) {
            Expr::EmptyString => break NextByte::ForcedEOI,
            Expr::NoMatch => break NextByte::Dead,
            Expr::ByteSet(lst) => {
                let mut b0 = None;
                for (idx, &w) in lst.iter().enumerate() {
                    if w > 0 {
                        let b = (idx as u32 * 32 + w.trailing_zeros()) as u8;
                        if let Some(b1) = b0 {
                            break 'dfs NextByte::SomeBytes2([b1, b]);
                        } else {
                            b0 = Some(b);
                        }
                        let w = w & !(1 << (b as u32 % 32));
                        if w > 0 {
                            let b2 = (idx as u32 * 32 + w.trailing_zeros()) as u8;
                            break 'dfs NextByte::SomeBytes2([b, b2]);
                        }
                    }
                }
                unreachable!("ByteSet should have at least two bytes set");
            }
            Expr::Byte(b) => break NextByte::ForcedByte(b),
            Expr::ByteConcat(_, bytes, _) => break NextByte::ForcedByte(bytes[0]),
            Expr::Or(_, args) | Expr::And(_, args) => {
                fuzzy = true;
                r = args[0];
            }
            Expr::Not(_, _) => break NextByte::SomeBytes0,
            Expr::RemainderIs { .. } => {
                break NextByte::SomeBytes2([exprs.digits[0], exprs.digits[1]]);
            }
            Expr::Lookahead(_, e, _) => {
                r = e;
            }
            Expr::Repeat(_, arg, min, _) => {
                if min == 0 {
                    fuzzy = true;
                }
                r = arg;
            }
            Expr::Concat(_, args) => {
                if exprs.is_nullable(args[0]) {
                    fuzzy = true;
                }
                r = args[0];
            }
        }
    };
    if fuzzy {
        res.make_fuzzy()
    } else {
        res
    }
}

impl Default for NextByteCache {
    fn default() -> Self {
        Self::new()
    }
}

impl NextByteCache {
    pub fn new() -> Self {
        NextByteCache {
            next_byte_cache: HashMap::default(),
        }
    }

    pub fn num_bytes(&self) -> usize {
        self.next_byte_cache.len() * 4 * std::mem::size_of::<isize>()
    }

    pub fn next_byte(&mut self, exprs: &ExprSet, r: ExprRef) -> NextByte {
        if let Some(&found) = self.next_byte_cache.get(&r) {
            return found;
        }
        let next = match exprs.get(r) {
            Expr::Or(_, args) => {
                let mut found = next_byte_simple(exprs, args[0]);
                for child in args.iter().skip(1) {
                    if found.is_some_bytes() {
                        break;
                    }
                    found = found | next_byte_simple(exprs, *child);
                }
                found
            }
            _ => next_byte_simple(exprs, r),
        };
        self.next_byte_cache.insert(r, next);
        next
    }
}