Lines Matching full:every

42 to exponential runtimes, so we keep track of every state we've visited to make
54 a new state for every input byte, regardless of what's in the state cache). To
114 point in the program to another were removed. Instead, every instruction has a
147 This means that every compilation of a regular expression generally results in
161 Only the first two matching engines are capable of executing every regular
233 approach would have been to encode every test into some kind of format (like
241   algorithm on every regex.
243   algorithm on every regex and use *arbitrary* byte based programs.
245   algorithm on every regex and use *UTF-8* byte based programs.
247   backtracking on every regex.
249   backtracking on every regex and use *arbitrary* byte based programs.
251   backtracking on every regex and use *UTF-8* byte based programs.
259 they cannot be used on every regular expression. Instead, we rely on