[−][src]Struct rustfst::algorithms::compose::matchers::SortedMatcher
Trait Implementations
impl<W: Clone + Semiring, F: Clone + ExpandedFst<W>> Clone for SortedMatcher<W, F>[src]
fn clone(&self) -> SortedMatcher<W, F>[src]
fn clone_from(&mut self, source: &Self)1.0.0[src]
impl<W: Debug + Semiring, F: Debug + ExpandedFst<W>> Debug for SortedMatcher<W, F>[src]
impl<W: Semiring, F: ExpandedFst<W>> LookaheadMatcher<W> for SortedMatcher<W, F>[src]
type MatcherData = ()
fn data(&self) -> Option<&Arc<Self::MatcherData>>[src]
fn new_with_data(
_fst: Arc<Self::F>,
_match_type: MatchType,
_data: Option<Arc<Self::MatcherData>>
) -> Result<Self> where
Self: Sized, [src]
_fst: Arc<Self::F>,
_match_type: MatchType,
_data: Option<Arc<Self::MatcherData>>
) -> Result<Self> where
Self: Sized,
fn create_data<G: ExpandedFst<W>>(
_fst: &G,
_match_type: MatchType
) -> Result<Option<Self::MatcherData>>[src]
_fst: &G,
_match_type: MatchType
) -> Result<Option<Self::MatcherData>>
fn init_lookahead_fst<LF: ExpandedFst<W>>(
&mut self,
_lfst: &Arc<LF>
) -> Result<()>[src]
&mut self,
_lfst: &Arc<LF>
) -> Result<()>
fn lookahead_fst<LF: ExpandedFst<W>>(
&self,
_matcher_state: usize,
_lfst: &Arc<LF>,
_lfst_state: usize
) -> Result<Option<LookAheadMatcherData<W>>>[src]
&self,
_matcher_state: usize,
_lfst: &Arc<LF>,
_lfst_state: usize
) -> Result<Option<LookAheadMatcherData<W>>>
fn lookahead_label(&self, _state: usize, _label: usize) -> Result<bool>[src]
fn lookahead_prefix(
&self,
_tr: &mut Tr<W>,
_la_matcher_data: &LookAheadMatcherData<W>
) -> bool[src]
&self,
_tr: &mut Tr<W>,
_la_matcher_data: &LookAheadMatcherData<W>
) -> bool
impl<W: Semiring, F: ExpandedFst<W>> Matcher<W> for SortedMatcher<W, F>[src]
type F = F
type Iter = IteratorSortedMatcher<W, F::TRS>
fn new(fst: Arc<F>, match_type: MatchType) -> Result<Self>[src]
fn iter(&self, state: usize, label: usize) -> Result<Self::Iter>[src]
fn final_weight(&self, state: usize) -> Result<Option<W>>[src]
fn match_type(&self, test: bool) -> Result<MatchType>[src]
fn flags(&self) -> MatcherFlags[src]
fn priority(&self, state: StateId) -> Result<usize>[src]
fn fst(&self) -> &Arc<Self::F>[src]
impl<W: PartialEq + Semiring, F: PartialEq + ExpandedFst<W>> PartialEq<SortedMatcher<W, F>> for SortedMatcher<W, F>[src]
fn eq(&self, other: &SortedMatcher<W, F>) -> bool[src]
fn ne(&self, other: &SortedMatcher<W, F>) -> bool[src]
impl<W: Semiring, F: ExpandedFst<W>> StructuralPartialEq for SortedMatcher<W, F>[src]
Auto Trait Implementations
impl<W, F> RefUnwindSafe for SortedMatcher<W, F> where
F: RefUnwindSafe,
W: RefUnwindSafe,
F: RefUnwindSafe,
W: RefUnwindSafe,
impl<W, F> Send for SortedMatcher<W, F> where
F: Send + Sync,
W: Send,
F: Send + Sync,
W: Send,
impl<W, F> Sync for SortedMatcher<W, F> where
F: Send + Sync,
F: Send + Sync,
impl<W, F> Unpin for SortedMatcher<W, F> where
W: Unpin,
W: Unpin,
impl<W, F> UnwindSafe for SortedMatcher<W, F> where
F: RefUnwindSafe,
W: UnwindSafe,
F: RefUnwindSafe,
W: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T> Same<T> for T[src]
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone, [src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T[src]
fn clone_into(&self, target: &mut T)[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,