Struct rustfst::algorithms::queues::TopOrderQueue

pub struct TopOrderQueue { /* fields omitted */ }

Topological-order queue discipline, templated on the StateId. States are ordered in the queue topologically. The FST must be acyclic.

Implementations

impl TopOrderQueue

pub fn new<W: Semiring, F: ExpandedFst<W>, A: TrFilter<W>>(
    fst: &F,
    tr_filter: &A
) -> Self

pub fn from_precomputed_order(order: Vec<StateId>) -> Self

Trait Implementations

impl Clone for TopOrderQueue

fn clone(&self) -> TopOrderQueue

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TopOrderQueue

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

Formats the value using the given formatter.

impl Queue for TopOrderQueue

fn head(&mut self) -> Option<usize>

fn enqueue(&mut self, state: usize)

fn dequeue(&mut self)

fn update(&mut self, _state: usize)

fn is_empty(&self) -> bool

fn clear(&mut self)

fn queue_type(&self) -> QueueType