Struct Graph 

pub struct Graph<'inst, 'nodes, Input, Output> { /* private fields */ }

A deterministic finite automaton (DFA) that can be used to process sequential input to produce an output.

Implementations

impl<'nodes, 'inst, Input, Output> Graph<'inst, 'nodes, Input, Output>

pub const fn new( nodes: &'nodes [Node<'inst, Input, Output>], start: usize, ) -> Self

Create a new graph from a set of nodes.

impl<'nodes, 'inst, Input: Segmentable, Output> Graph<'inst, 'nodes, Input, Output>

pub fn nodes(&self) -> &'nodes [Node<'inst, Input, Output>]

Get the nodes of this graph.

pub fn start(&self) -> usize

Get the start node index.

pub fn process(&self, input: Input) -> &Output

Process the input and return the output.

Trait Implementations

impl<'inst, 'nodes, Input: Clone, Output: Clone> Clone for Graph<'inst, 'nodes, Input, Output>

fn clone(&self) -> Graph<'inst, 'nodes, Input, Output>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'inst, 'nodes, Input: Debug, Output: Debug> Debug for Graph<'inst, 'nodes, Input, Output>

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

Formats the value using the given formatter.

impl<'inst, 'nodes, Input: Hash, Output: Hash> Hash for Graph<'inst, 'nodes, Input, Output>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'inst, 'nodes, Input: Ord, Output: Ord> Ord for Graph<'inst, 'nodes, Input, Output>

fn cmp(&self, other: &Graph<'inst, 'nodes, Input, Output>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'inst, 'nodes, Input: PartialEq, Output: PartialEq> PartialEq for Graph<'inst, 'nodes, Input, Output>

fn eq(&self, other: &Graph<'inst, 'nodes, Input, Output>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'inst, 'nodes, Input: PartialOrd, Output: PartialOrd> PartialOrd for Graph<'inst, 'nodes, Input, Output>

fn partial_cmp( &self, other: &Graph<'inst, 'nodes, Input, Output>, ) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'inst, 'nodes, Input: Copy, Output: Copy> Copy for Graph<'inst, 'nodes, Input, Output>

impl<'inst, 'nodes, Input: Eq, Output: Eq> Eq for Graph<'inst, 'nodes, Input, Output>

impl<'inst, 'nodes, Input, Output> StructuralPartialEq for Graph<'inst, 'nodes, Input, Output>