Returns true if the DFA should continue searching past the first match. Leftmost first semantics in the DFA are preserved by not following NFA transitions after the first match is seen. On occasion, we want to avoid leftmost first semantics to find either the longest match (for reverse search) or all possible matches (for regex sets).
(&self)
| 1575 | /// the longest match (for reverse search) or all possible matches (for |
| 1576 | /// regex sets). |
| 1577 | fn continue_past_first_match(&self) -> bool { |
| 1578 | self.prog.is_reverse || self.prog.matches.len() > 1 |
| 1579 | } |
| 1580 | |
| 1581 | /// Returns true if there is a prefix we can quickly search for. |
| 1582 | fn has_prefix(&self) -> bool { |
no test coverage detected