Struct aho_corasick::automaton::OverlappingState
source · pub struct OverlappingState {
mat: Option<Match>,
id: Option<StateID>,
at: usize,
next_match_index: Option<usize>,
}
Expand description
Represents the current state of an overlapping search.
This is used for overlapping searches since they need to know something about the previous search. For example, when multiple patterns match at the same position, this state tracks the last reported pattern so that the next search knows whether to report another matching pattern or continue with the search at the next position. Additionally, it also tracks which state the last search call terminated in and the current offset of the search in the haystack.
This type provides limited introspection capabilities. The only thing a caller can do is construct it and pass it around to permit search routines to use it to track state, and to ask whether a match has been found.
Callers should always provide a fresh state constructed via
OverlappingState::start
when starting a new search. That same state
should be reused for subsequent searches on the same Input
. The state
given will advance through the haystack itself. Callers can detect the end
of a search when neither an error nor a match is returned.
§Example
This example shows how to manually iterate over all overlapping matches. If
you need this, you might consider using
AhoCorasick::find_overlapping_iter
instead, but this shows how to correctly use an OverlappingState
.
use aho_corasick::{
automaton::OverlappingState,
AhoCorasick, Input, Match,
};
let patterns = &["append", "appendage", "app"];
let haystack = "append the app to the appendage";
let ac = AhoCorasick::new(patterns).unwrap();
let mut state = OverlappingState::start();
let mut matches = vec![];
loop {
ac.find_overlapping(haystack, &mut state);
let mat = match state.get_match() {
None => break,
Some(mat) => mat,
};
matches.push(mat);
}
let expected = vec![
Match::must(2, 0..3),
Match::must(0, 0..6),
Match::must(2, 11..14),
Match::must(2, 22..25),
Match::must(0, 22..28),
Match::must(1, 22..31),
];
assert_eq!(expected, matches);
Fields§
§mat: Option<Match>
The match reported by the most recent overlapping search to use this state.
If a search does not find any matches, then it is expected to clear this value.
id: Option<StateID>
The state ID of the state at which the search was in when the call
terminated. When this is a match state, last_match
must be set to a
non-None value.
A None
value indicates the start state of the corresponding
automaton. We cannot use the actual ID, since any one automaton may
have many start states, and which one is in use depends on search-time
factors (such as whether the search is anchored or not).
at: usize
The position of the search.
When id
is None (i.e., we are starting a search), this is set to
the beginning of the search as given by the caller regardless of its
current value. Subsequent calls to an overlapping search pick up at
this offset.
next_match_index: Option<usize>
The index into the matching patterns of the next match to report if the current state is a match state. Note that this may be 1 greater than the total number of matches to report for the current match state. (In which case, no more matches should be reported at the current position and the search should advance to the next position.)
Implementations§
source§impl OverlappingState
impl OverlappingState
sourcepub fn start() -> OverlappingState
pub fn start() -> OverlappingState
Create a new overlapping state that begins at the start state.
Trait Implementations§
source§impl Clone for OverlappingState
impl Clone for OverlappingState
source§fn clone(&self) -> OverlappingState
fn clone(&self) -> OverlappingState
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more