regex 0.1.51

An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
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

// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
// file at the top-level directory of this distribution and at
// http://rust-lang.org/COPYRIGHT.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.

use test::Bencher;

use regex::internal::ProgramBuilder;

#[bench]
fn compile_simple(b: &mut Bencher) {
    b.iter(|| {
        let re = r"^bc(d|e)*$";
        ProgramBuilder::new(&re).compile().unwrap()
    });
}

#[bench]
fn compile_simple_bytes(b: &mut Bencher) {
    b.iter(|| {
        let re = r"^bc(d|e)*$";
        ProgramBuilder::new(&re).bytes(true).compile().unwrap()
    });
}

#[bench]
fn compile_small(b: &mut Bencher) {
    b.iter(|| {
        let re = r"\p{L}|\p{N}|\s|.|\d";
        ProgramBuilder::new(&re).compile().unwrap()
    });
}

#[bench]
fn compile_small_bytes(b: &mut Bencher) {
    b.iter(|| {
        let re = r"\p{L}|\p{N}|\s|.|\d";
        ProgramBuilder::new(&re).bytes(true).compile().unwrap()
    });
}

#[bench]
fn compile_huge(b: &mut Bencher) {
    b.iter(|| {
        let re = r"\p{L}{100}";
        ProgramBuilder::new(&re).compile().unwrap()
    });
}

#[bench]
fn compile_huge_bytes(b: &mut Bencher) {
    b.iter(|| {
        let re = r"\p{L}{100}";
        ProgramBuilder::new(&re).bytes(true).compile().unwrap()
    });
}