Struct SortedMatcher 

pub struct SortedMatcher<W, F, B>
where
    W: Semiring,
    F: Fst<W>,
    B: Borrow<F>,
{ /* private fields */ }

Trait Implementations

impl<W, F, B> Clone for SortedMatcher<W, F, B>

where W: Semiring + Clone, F: Fst<W> + Clone, B: Borrow<F> + Clone,

fn clone(&self) -> SortedMatcher<W, F, B>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<W, F, B> Debug for SortedMatcher<W, F, B>

where W: Semiring + Debug, F: Fst<W> + Debug, B: Borrow<F> + Debug,

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

Formats the value using the given formatter.

impl<W, F, B> LookaheadMatcher<W, F, B> for SortedMatcher<W, F, B>

where W: Semiring, F: Fst<W>, B: Borrow<F> + Debug,

type MatcherData = ()

fn data(&self) -> Option<&Arc<Self::MatcherData>>

fn new_with_data( _fst: B, _match_type: MatchType, _data: Option<Arc<Self::MatcherData>>, ) -> Result<Self>

where Self: Sized,

fn create_data<F2: Fst<W>, BF2: Borrow<F2>>( _fst: BF2, _match_type: MatchType, ) -> Result<Option<Self::MatcherData>>

fn init_lookahead_fst<LF: Fst<W>, BLF: Borrow<LF>>( &mut self, _lfst: &BLF, ) -> Result<()>

fn lookahead_fst<LF: Fst<W>, BLF: Borrow<LF>>( &self, _matcher_state: StateId, _lfst: &BLF, _lfst_state: StateId, ) -> Result<Option<LookAheadMatcherData<W>>>

fn lookahead_label(&self, _state: StateId, _label: Label) -> Result<bool>

fn lookahead_prefix( &self, _tr: &mut Tr<W>, _la_matcher_data: &LookAheadMatcherData<W>, ) -> bool

impl<W, F, B> Matcher<W, F, B> for SortedMatcher<W, F, B>

where W: Semiring, F: Fst<W>, B: Borrow<F> + Debug,

type Iter = IteratorSortedMatcher<W, <F as CoreFst<W>>::TRS>

fn new(fst: B, match_type: MatchType) -> Result<Self>

fn iter(&self, state: StateId, label: Label) -> Result<Self::Iter>

fn final_weight(&self, state: StateId) -> Result<Option<W>>

fn match_type(&self, test: bool) -> Result<MatchType>

fn flags(&self) -> MatcherFlags

fn priority(&self, state: StateId) -> Result<usize>

Indicates preference for being the side used for matching in composition. If the value is kRequirePriority, then it is mandatory that it be used. Calling this method without passing the current state of the matcher invalidates the state of the matcher.

fn fst(&self) -> &B

impl<W, F, B> PartialEq for SortedMatcher<W, F, B>

where W: Semiring + PartialEq, F: Fst<W> + PartialEq, B: Borrow<F> + PartialEq,

fn eq(&self, other: &SortedMatcher<W, F, B>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<W, F, B> StructuralPartialEq for SortedMatcher<W, F, B>

where W: Semiring, F: Fst<W>, B: Borrow<F>,