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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
use regex_automata::{DenseDFA, Regex, RegexBuilder, SparseDFA};
use collection::{RegexTester, SUITE};
#[test]
fn unminimized_standard() {
let mut builder = RegexBuilder::new();
builder.minimize(false).premultiply(false).byte_classes(false);
let mut tester = RegexTester::new().skip_expensive();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn unminimized_premultiply() {
let mut builder = RegexBuilder::new();
builder.minimize(false).premultiply(true).byte_classes(false);
let mut tester = RegexTester::new().skip_expensive();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn unminimized_byte_class() {
let mut builder = RegexBuilder::new();
builder.minimize(false).premultiply(false).byte_classes(true);
let mut tester = RegexTester::new();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn unminimized_premultiply_byte_class() {
let mut builder = RegexBuilder::new();
builder.minimize(false).premultiply(true).byte_classes(true);
let mut tester = RegexTester::new();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn unminimized_standard_no_nfa_shrink() {
let mut builder = RegexBuilder::new();
builder
.minimize(false)
.premultiply(false)
.byte_classes(false)
.shrink(false);
let mut tester = RegexTester::new().skip_expensive();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn minimized_standard() {
let mut builder = RegexBuilder::new();
builder.minimize(true).premultiply(false).byte_classes(false);
let mut tester = RegexTester::new().skip_expensive();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn minimized_premultiply() {
let mut builder = RegexBuilder::new();
builder.minimize(true).premultiply(true).byte_classes(false);
let mut tester = RegexTester::new().skip_expensive();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn minimized_byte_class() {
let mut builder = RegexBuilder::new();
builder.minimize(true).premultiply(false).byte_classes(true);
let mut tester = RegexTester::new();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn minimized_premultiply_byte_class() {
let mut builder = RegexBuilder::new();
builder.minimize(true).premultiply(true).byte_classes(true);
let mut tester = RegexTester::new();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
#[test]
fn minimized_standard_no_nfa_shrink() {
let mut builder = RegexBuilder::new();
builder
.minimize(true)
.premultiply(false)
.byte_classes(false)
.shrink(false);
let mut tester = RegexTester::new().skip_expensive();
tester.test_all(builder, SUITE.tests());
tester.assert();
}
// A basic sanity test that checks we can convert a regex to a smaller
// representation and that the resulting regex still passes our tests.
//
// If tests grow minimal regexes that cannot be represented in 16 bits, then
// we'll either want to skip those or increase the size to test to u32.
#[test]
fn u16() {
let mut builder = RegexBuilder::new();
builder.minimize(true).premultiply(false).byte_classes(true);
let mut tester = RegexTester::new().skip_expensive();
for test in SUITE.tests() {
let builder = builder.clone();
let re: Regex = match tester.build_regex(builder, test) {
None => continue,
Some(re) => re,
};
let small_re = Regex::from_dfas(
re.forward().to_u16().unwrap(),
re.reverse().to_u16().unwrap(),
);
tester.test(test, &small_re);
}
tester.assert();
}
// Test that sparse DFAs work using the standard configuration.
#[test]
fn sparse_unminimized_standard() {
let mut builder = RegexBuilder::new();
builder.minimize(false).premultiply(false).byte_classes(false);
let mut tester = RegexTester::new().skip_expensive();
for test in SUITE.tests() {
let builder = builder.clone();
let re: Regex = match tester.build_regex(builder, test) {
None => continue,
Some(re) => re,
};
let fwd = re.forward().to_sparse().unwrap();
let rev = re.reverse().to_sparse().unwrap();
let sparse_re = Regex::from_dfas(fwd, rev);
tester.test(test, &sparse_re);
}
tester.assert();
}
// Test that sparse DFAs work after converting them to a different state ID
// representation.
#[test]
fn sparse_u16() {
let mut builder = RegexBuilder::new();
builder.minimize(true).premultiply(false).byte_classes(false);
let mut tester = RegexTester::new().skip_expensive();
for test in SUITE.tests() {
let builder = builder.clone();
let re: Regex = match tester.build_regex(builder, test) {
None => continue,
Some(re) => re,
};
let fwd = re.forward().to_sparse().unwrap().to_u16().unwrap();
let rev = re.reverse().to_sparse().unwrap().to_u16().unwrap();
let sparse_re = Regex::from_dfas(fwd, rev);
tester.test(test, &sparse_re);
}
tester.assert();
}
// Another basic sanity test that checks we can serialize and then deserialize
// a regex, and that the resulting regex can be used for searching correctly.
#[test]
fn serialization_roundtrip() {
let mut builder = RegexBuilder::new();
builder.premultiply(false).byte_classes(true);
let mut tester = RegexTester::new().skip_expensive();
for test in SUITE.tests() {
let builder = builder.clone();
let re: Regex = match tester.build_regex(builder, test) {
None => continue,
Some(re) => re,
};
let fwd_bytes = re.forward().to_bytes_native_endian().unwrap();
let rev_bytes = re.reverse().to_bytes_native_endian().unwrap();
let fwd: DenseDFA<&[usize], usize> =
unsafe { DenseDFA::from_bytes(&fwd_bytes) };
let rev: DenseDFA<&[usize], usize> =
unsafe { DenseDFA::from_bytes(&rev_bytes) };
let re = Regex::from_dfas(fwd, rev);
tester.test(test, &re);
}
tester.assert();
}
// A basic sanity test that checks we can serialize and then deserialize a
// regex using sparse DFAs, and that the resulting regex can be used for
// searching correctly.
#[test]
fn sparse_serialization_roundtrip() {
let mut builder = RegexBuilder::new();
builder.byte_classes(true);
let mut tester = RegexTester::new().skip_expensive();
for test in SUITE.tests() {
let builder = builder.clone();
let re: Regex = match tester.build_regex(builder, test) {
None => continue,
Some(re) => re,
};
let fwd_bytes = re
.forward()
.to_sparse()
.unwrap()
.to_bytes_native_endian()
.unwrap();
let rev_bytes = re
.reverse()
.to_sparse()
.unwrap()
.to_bytes_native_endian()
.unwrap();
let fwd: SparseDFA<&[u8], usize> =
unsafe { SparseDFA::from_bytes(&fwd_bytes) };
let rev: SparseDFA<&[u8], usize> =
unsafe { SparseDFA::from_bytes(&rev_bytes) };
let re = Regex::from_dfas(fwd, rev);
tester.test(test, &re);
}
tester.assert();
}
|
