reduces constant overhead
(
&self,
text: &[u8],
start: usize,
)
| 752 | /// |
| 753 | #[inline(always)] // reduces constant overhead |
| 754 | fn shortest_dfa_reverse_suffix( |
| 755 | &self, |
| 756 | text: &[u8], |
| 757 | start: usize, |
| 758 | ) -> dfa::Result<usize> { |
| 759 | match self.exec_dfa_reverse_suffix(text, start) { |
| 760 | None => self.shortest_dfa(text, start), |
| 761 | Some(r) => r.map(|(_, end)| end), |
| 762 | } |
| 763 | } |
| 764 | |
| 765 | /// Finds the end of the shortest match using only the DFA by scanning for |
| 766 | /// suffix literals. It also reports the start of the match. |
no test coverage detected