resharp 0.4.1

high-performance regex engine with intersection and complement operations
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

fn test_pattern(label: &str, pattern: &str, input: &[u8]) -> bool {
    match resharp::Regex::new(pattern) {
        Ok(re) => match re.find_all(input) {
            Ok(matches) => {
                let regex_re = regex::bytes::Regex::new(pattern).unwrap();
                let regex_matches: Vec<_> = regex_re.find_iter(input).collect();
                if matches.len() != regex_matches.len() {
                    println!(
                        "  MISMATCH {}: resharp={} regex={} (len={})",
                        label,
                        matches.len(),
                        regex_matches.len(),
                        input.len()
                    );
                    return false;
                }
                for (i, (rm, em)) in matches.iter().zip(regex_matches.iter()).enumerate() {
                    if rm.start != em.start() || rm.end != em.end() {
                        println!(
                            "  MISMATCH {}: match[{}] resharp=[{},{}) regex=[{},{})",
                            label,
                            i,
                            rm.start,
                            rm.end,
                            em.start(),
                            em.end()
                        );
                        return false;
                    }
                }
                true
            }
            Err(e) => {
                println!("  ERROR {}: {}", label, e);
                false
            }
        },
        Err(e) => {
            println!("  PARSE ERROR {}: {}", label, e);
            false
        }
    }
}

fn main() {
    let mut failures = 0;
    let mut total = 0;

    // original cloudflare pattern
    println!("=== cloudflare ===");
    let full = r#"(?:(?:"|'|\]|\}|\\|\d|(?:nan|infinity|true|false|null|undefined|symbol|math)|`|-|\+)+[)]*;?((?:\s|-|\~|!|\{\}|\|\||\+)*.*(?:.*=.*)))"#;
    let input = b"math x=xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx";
    total += 1;
    if !test_pattern("cloudflare", full, input) {
        failures += 1;
    }

    // math.*=.* across many lengths
    println!("=== math.*=.* (0..500) ===");
    for n in 0..500 {
        let input_str = format!("math x={}", "x".repeat(n));
        total += 1;
        if !test_pattern(&format!("n={}", n), r"math.*=.*", input_str.as_bytes()) {
            failures += 1;
        }
    }

    // various patterns with skip-triggering inputs
    println!("=== other patterns ===");
    for n in 0..200 {
        let input_str = format!("hello world {}", "a".repeat(n));
        total += 1;
        if !test_pattern(
            &format!("hello n={}", n),
            r"hello.*world",
            input_str.as_bytes(),
        ) {
            failures += 1;
        }
    }

    for n in 0..200 {
        let input_str = format!("ab{}cd", "x".repeat(n));
        total += 1;
        if !test_pattern(&format!("abcd n={}", n), r"ab.*cd", input_str.as_bytes()) {
            failures += 1;
        }
    }

    println!(
        "\n{}/{} passed, {} failures",
        total - failures,
        total,
        failures
    );
}