Moha_regex 1.12.4

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

[[test]]

name = "no-greedy-100"

regex = 'a+'

haystack = "aaa"

matches = [[0, 1], [1, 2], [2, 3]]

search-kind = "earliest"



[[test]]

name = "no-greedy-200"

regex = 'abc+'

haystack = "zzzabccc"

matches = [[3, 6]]

search-kind = "earliest"



[[test]]

name = "is-ungreedy"

regex = 'a+?'

haystack = "aaa"

matches = [[0, 1], [1, 2], [2, 3]]

search-kind = "earliest"



[[test]]

name = "look-start-test"

regex = '^(abc|a)'

haystack = "abc"

matches = [

  [[0, 1], [0, 1]],

]

search-kind = "earliest"



[[test]]

name = "look-end-test"

regex = '(abc|a)$'

haystack = "abc"

matches = [

  [[0, 3], [0, 3]],

]

search-kind = "earliest"



[[test]]

name = "no-leftmost-first-100"

regex = 'abc|a'

haystack = "abc"

matches = [[0, 1]]

search-kind = "earliest"



[[test]]

name = "no-leftmost-first-200"

regex = 'aba|a'

haystack = "aba"

matches = [[0, 1], [2, 3]]

search-kind = "earliest"