Struct ReverseInner 

struct ReverseInner {
    core: Core,
    preinner: Prefilter,
    nfarev: NFA,
    hybrid: ReverseHybrid,
    dfa: ReverseDFA,
}

Fields

core: Core

preinner: Prefilter

nfarev: NFA

hybrid: ReverseHybrid

dfa: ReverseDFA

Implementations

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

impl Debug for ReverseInner

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

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, )