Struct fst::raw::Node
[−]
[src]
pub struct Node<'f> { // some 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>
[src]
fn transitions<'n>(&'n self) -> Transitions<'f, 'n>
Returns an iterator over all transitions in this node in lexicographic order.
fn transition(&self, i: usize) -> Transition
Returns the transition at index i
.
fn transition_addr(&self, i: usize) -> CompiledAddr
Returns the transition address of the i
th transition.
fn find_input(&self, b: u8) -> Option<usize>
Finds the i
th transition corresponding to the given input byte.
If no transition for this byte exists, then None
is returned.
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.
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.
fn len(&self) -> usize
Returns the number of transitions in this node.
The maximum number of transitions is 256.
fn is_empty(&self) -> bool
Returns true if and only if this node has zero transitions.
fn addr(&self) -> CompiledAddr
Return the address of this node.
Trait Implementations
impl<'f> Copy for Node<'f>
[src]
impl<'f> Clone for Node<'f>
[src]
fn clone(&self) -> Node<'f>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more