Struct fst::raw::Node [−][src]
pub struct Node<'f> { /* fields omitted */ }
Expand description
Node represents a single state in a finite state transducer.
Nodes are very cheap to construct. Notably, they satisfy the Copy
trait.
Implementations
pub fn transitions<'n>(&'n self) -> Transitions<'f, 'n>ⓘNotable traits for Transitions<'f, 'n>
impl<'f, 'n> Iterator for Transitions<'f, 'n> type Item = Transition;
[src]
pub fn transitions<'n>(&'n self) -> Transitions<'f, 'n>ⓘNotable traits for Transitions<'f, 'n>
impl<'f, 'n> Iterator for Transitions<'f, 'n> type Item = Transition;
[src]Returns an iterator over all transitions in this node in lexicographic order.
Returns the transition at index i
.
Returns the transition address of the i
th transition.
Finds the i
th transition corresponding to the given input byte.
If no transition for this byte exists, then None
is returned.
If this node is final and has a terminal output value, then it is returned. Otherwise, a zero output is returned.
Returns true if and only if this node corresponds to a final or “match” state in the finite state transducer.
Returns the number of transitions in this node.
The maximum number of transitions is 256.
Return the address of this node.
Trait Implementations
Auto Trait Implementations
impl<'f> RefUnwindSafe for Node<'f>
impl<'f> UnwindSafe for Node<'f>
Blanket Implementations
Mutably borrows from an owned value. Read more