Struct regex_automata::meta::strategy::ReverseInner
source · struct ReverseInner {
core: Core,
preinner: Prefilter,
nfarev: NFA,
hybrid: ReverseHybrid,
dfa: ReverseDFA,
}
Fields§
§core: Core
§preinner: Prefilter
§nfarev: NFA
§hybrid: ReverseHybrid
§dfa: ReverseDFA
Implementations§
source§impl ReverseInner
impl ReverseInner
fn new(core: Core, hirs: &[&Hir]) -> Result<ReverseInner, Core>
fn try_search_full( &self, cache: &mut Cache, input: &Input<'_>, ) -> Result<Option<Match>, RetryError>
fn try_search_half_fwd_stopat( &self, cache: &mut Cache, input: &Input<'_>, ) -> Result<Result<HalfMatch, usize>, RetryFailError>
fn try_search_half_rev_limited( &self, cache: &mut Cache, input: &Input<'_>, min_start: usize, ) -> Result<Option<HalfMatch>, RetryError>
Trait Implementations§
source§impl Debug for ReverseInner
impl Debug for ReverseInner
source§impl Strategy for ReverseInner
impl Strategy for ReverseInner
fn group_info(&self) -> &GroupInfo
fn create_cache(&self) -> Cache
fn reset_cache(&self, cache: &mut Cache)
fn is_accelerated(&self) -> bool
fn memory_usage(&self) -> usize
fn search(&self, cache: &mut Cache, input: &Input<'_>) -> Option<Match>
fn search_half(&self, cache: &mut Cache, input: &Input<'_>) -> Option<HalfMatch>
fn is_match(&self, cache: &mut Cache, input: &Input<'_>) -> bool
fn search_slots( &self, cache: &mut Cache, input: &Input<'_>, slots: &mut [Option<NonMaxUsize>], ) -> Option<PatternID>
fn which_overlapping_matches( &self, cache: &mut Cache, input: &Input<'_>, patset: &mut PatternSet, )
Auto Trait Implementations§
impl Freeze for ReverseInner
impl RefUnwindSafe for ReverseInner
impl Send for ReverseInner
impl Sync for ReverseInner
impl Unpin for ReverseInner
impl UnwindSafe for ReverseInner
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more