Struct rustfst::algorithms::replace::ReplaceFst

pub struct ReplaceFst<W: Semiring, F: Fst<W>, B: Borrow<F>>(_);

ReplaceFst supports lazy replacement of trs in one FST with another FST. This replacement is recursive. ReplaceFst can be used to support a variety of delayed constructions such as recursive transition networks, union, or closure.

Implementations

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

pub fn new(
    fst_list: Vec<(Label, B)>,
    root: Label,
    epsilon_on_replace: bool
) -> Result<Self>

pub fn compute<F2: MutableFst<W> + AllocableFst<W>>(&self) -> Result<F2>

Turns the Lazy FST into a static one.

Trait Implementations

impl<W, F, B> CoreFst<W> for ReplaceFst<W, F, B> where
    W: Semiring,
    F: Fst<W>,
    B: Borrow<F>, 

type TRS = TrsVec<W>

Weight use in the wFST. This type must implement the Semiring trait.

fn start(&self) -> Option<usize>

Returns the ID of the start state of the wFST if it exists else none.

fn final_weight(&self, state_id: usize) -> Result<Option<W>>

Retrieves the final weight of a state (if the state is a final one).

unsafe fn final_weight_unchecked(&self, state_id: usize) -> Option<W>

fn num_trs(&self, s: usize) -> Result<usize>

Number of trs leaving a specific state in the wFST.

unsafe fn num_trs_unchecked(&self, s: usize) -> usize

fn get_trs(&self, state_id: usize) -> Result<Self::TRS>

unsafe fn get_trs_unchecked(&self, state_id: usize) -> Self::TRS

fn properties(&self) -> FstProperties

Retrieve the FstProperties stored in the Fst. As a result, all the properties returned are verified by the Fst but some other properties might be true as well despite the flag not being set.

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

Returns the number of trs with epsilon input labels leaving a state.

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

Returns the number of trs with epsilon output labels leaving a state.

fn is_final(&self, state_id: StateId) -> Result<bool>

Returns whether or not the state with identifier passed as parameters is a final state.

unsafe fn is_final_unchecked(&self, state_id: StateId) -> bool

fn is_start(&self, state_id: StateId) -> bool

Check whether a state is the start state or not.

fn properties_with_mask(&self, mask: FstProperties) -> FstProperties

Apply a mask to the FstProperties returned.

fn properties_check(&self, props_known: FstProperties) -> Result<FstProperties>

Retrieve the FstProperties in the Fst and check that all the properties in props_known are known (not the same as true). If not an error is returned.

impl<W, F, B> Debug for ReplaceFst<W, F, B> where
    W: Semiring,
    F: Fst<W>,
    B: Borrow<F>, 

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

Formats the value using the given formatter.

impl<W, F, B> Fst<W> for ReplaceFst<W, F, B> where
    W: Semiring,
    F: Fst<W> + 'static,
    B: Borrow<F> + 'static, 

fn input_symbols(&self) -> Option<&Arc<SymbolTable>>

Retrieves the input SymbolTable associated to the Fst. If no SymbolTable has been previously attached then None is returned.

fn output_symbols(&self) -> Option<&Arc<SymbolTable>>

Retrieves the output SymbolTable associated to the Fst. If no SymbolTable has been previously attached then None is returned.

fn set_input_symbols(&mut self, symt: Arc<SymbolTable>)

Attaches an output SymbolTable to the Fst. The SymbolTable is not duplicated with the use of Arc.

fn set_output_symbols(&mut self, symt: Arc<SymbolTable>)

Attaches an output SymbolTable to the Fst. The SymbolTable is not duplicated with the use of Arc.

fn take_input_symbols(&mut self) -> Option<Arc<SymbolTable>>

Removes the input symbol table from the Fst and retrieves it.

fn take_output_symbols(&mut self) -> Option<Arc<SymbolTable>>

Removes the output symbol table from the Fst and retrieves it.

fn set_symts_from_fst<W2: Semiring, OF: Fst<W2>>(&mut self, other_fst: &OF)

fn final_states_iter(&self) -> FinalStatesIterator<'_, W, Self> where
    Self: Sized, 

impl<'a, W, F, B> FstIterator<'a, W> for ReplaceFst<W, F, B> where
    W: Semiring,
    F: Fst<W> + 'a,
    B: Borrow<F> + 'a, 

type FstIter = <LazyFst<W, ReplaceFstOp<W, F, B>, SimpleHashMapCache<W>> as FstIterator<'a, W>>::FstIter

fn fst_iter(&'a self) -> Self::FstIter

impl<'a, W, F, B> StateIterator<'a> for ReplaceFst<W, F, B> where
    W: Semiring,
    F: Fst<W> + 'a,
    B: Borrow<F> + 'a, 

type Iter = <LazyFst<W, ReplaceFstOp<W, F, B>, SimpleHashMapCache<W>> as StateIterator<'a>>::Iter

Iterator used to iterate over the state_id of the states of an FST.

fn states_iter(&'a self) -> Self::Iter

Creates an iterator over the state_id of the states of an FST.