Struct Node 

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

A node in a DFA.

Implementations

impl<'inst, Input, Output> Node<'inst, Input, Output>

pub const fn new( inputs: &'inst [(Input, usize)], output: Output, default: usize, amount: usize, ) -> Self

Create a new node from its parts.

impl<'inst, Input: Segmentable, Output> Node<'inst, Input, Output>

pub fn inputs(&self) -> &[(Input, usize)]

Get the inputs of this node.

pub fn output(&self) -> &Output

Get the output of this node.

pub fn default(&self) -> usize

Get the default node index.

pub fn amount(&self) -> usize

Get the amount of input to match on.

Trait Implementations

impl<'inst, Input: Clone, Output: Clone> Clone for Node<'inst, Input, Output>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'inst, Input: Debug, Output: Debug> Debug for Node<'inst, Input, Output>

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

Formats the value using the given formatter.

impl<'inst, Input: Hash, Output: Hash> Hash for Node<'inst, 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, Input: Ord, Output: Ord> Ord for Node<'inst, Input, Output>

fn cmp(&self, other: &Node<'inst, 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, Input: PartialEq, Output: PartialEq> PartialEq for Node<'inst, Input, Output>

fn eq(&self, other: &Node<'inst, 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, Input: PartialOrd, Output: PartialOrd> PartialOrd for Node<'inst, Input, Output>

fn partial_cmp(&self, other: &Node<'inst, 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, Input: Eq, Output: Eq> Eq for Node<'inst, Input, Output>

impl<'inst, Input, Output> StructuralPartialEq for Node<'inst, Input, Output>