Struct fst::raw::Node

pub struct Node<'f> { /* fields omitted */ }

Node represents a single state in a finite state transducer.

Nodes are very cheap to construct. Notably, they satisfy the Copy trait.

Methods

impl<'f> Node<'f>

Important traits for Transitions<'f, 'n>

impl<'f, 'n> Iterator for Transitions<'f, 'n> type Item = Transition;

pub fn transitions<'n>(&'n self) -> Transitions<'f, 'n>

Returns an iterator over all transitions in this node in lexicographic order.

pub fn transition(&self, i: usize) -> Transition

Returns the transition at index i.

pub fn transition_addr(&self, i: usize) -> CompiledAddr

Returns the transition address of the ith transition.

pub fn find_input(&self, b: u8) -> Option<usize>

Finds the ith transition corresponding to the given input byte.

If no transition for this byte exists, then None is returned.

pub fn final_output(&self) -> Output

If this node is final and has a terminal output value, then it is returned. Otherwise, a zero output is returned.

pub fn is_final(&self) -> bool

Returns true if and only if this node corresponds to a final or "match" state in the finite state transducer.

pub fn len(&self) -> usize

Returns the number of transitions in this node.

The maximum number of transitions is 256.

pub fn is_empty(&self) -> bool

Returns true if and only if this node has zero transitions.

pub fn addr(&self) -> CompiledAddr

Return the address of this node.

Trait Implementations

impl<'f> Clone for Node<'f>

fn clone(&self) -> Node<'f>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'f> Copy for Node<'f>

impl<'f> Debug for Node<'f>

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

Formats the value using the given formatter.