Struct rustfst::algorithms::compose::matchers::SortedMatcher
source · pub struct SortedMatcher<W, F, B>{ /* private fields */ }
Trait Implementations§
source§impl<W, F, B> Clone for SortedMatcher<W, F, B>
impl<W, F, B> Clone for SortedMatcher<W, F, B>
source§fn clone(&self) -> SortedMatcher<W, F, B>
fn clone(&self) -> SortedMatcher<W, F, B>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<W, F, B> Debug for SortedMatcher<W, F, B>
impl<W, F, B> Debug for SortedMatcher<W, F, B>
source§impl<W, F, B> LookaheadMatcher<W, F, B> for SortedMatcher<W, F, B>
impl<W, F, B> LookaheadMatcher<W, F, B> for SortedMatcher<W, F, B>
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
source§impl<W, F, B> Matcher<W, F, B> for SortedMatcher<W, F, B>
impl<W, F, B> Matcher<W, F, B> for SortedMatcher<W, F, B>
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
source§fn priority(&self, state: StateId) -> Result<usize>
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
source§impl<W, F, B> PartialEq for SortedMatcher<W, F, B>
impl<W, F, B> PartialEq for SortedMatcher<W, F, B>
impl<W, F, B> StructuralPartialEq for SortedMatcher<W, F, B>
Auto Trait Implementations§
impl<W, F, B> Freeze for SortedMatcher<W, F, B>where
B: Freeze,
impl<W, F, B> RefUnwindSafe for SortedMatcher<W, F, B>
impl<W, F, B> Send for SortedMatcher<W, F, B>
impl<W, F, B> Sync for SortedMatcher<W, F, B>
impl<W, F, B> Unpin for SortedMatcher<W, F, B>
impl<W, F, B> UnwindSafe for SortedMatcher<W, F, B>
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more