Struct Compiled

pub struct Compiled<I: Clone + Ord> { /* private fields */ }

Deterministic finite automata.

Implementations

impl<I: Clone + Ord> Graph<I>

pub fn accept<Iter: IntoIterator<Item = I>>(&self, iter: Iter) -> bool

Decide whether an input belongs to the regular langage this NFA accepts.

pub fn reject<Iter: IntoIterator<Item = I>>(&self, iter: Iter) -> bool

Decide whether an input belongs to the regular langage this NFA accepts.

pub fn size(&self) -> usize

Number of states.

pub fn generalize(&self) -> Graph<I>

Generalize to an identical NFA.

pub fn fuzz(&self) -> Result<Fuzzer<I>, NeverAccepts>

Randomly generate inputs that are all guaranteed to be accepted. NOTE: returns an infinite iterator! for input in automaton.fuzz()? will loop forever . . .

Errors

If this automaton never accepts any input.

pub fn would_ever_accept(&self) -> bool

Check if there exists a string this DFA will accept.

pub fn into_source(self, name: &str) -> String

where I: Expression,

Print as a set of Rust source-code functions.

pub fn to_ast(&self, name: &str) -> (ItemFn, ItemMod)

where I: Expression,

Print as a set of Rust source-code functions.

pub fn to_fuzz_ast(&self, name: &str) -> (ItemFn, ItemMod)

where I: Expression,

Print as a set of Rust source-code functions.

Trait Implementations

impl<I: Clone + Clone + Ord> Clone for Graph<I>

fn clone(&self) -> Graph<I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Clone + Ord> Debug for Graph<I>

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

Formats the value using the given formatter.

impl<I: Clone + Ord + Expression> Display for Graph<I>

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

Formats the value using the given formatter.

impl<I: Hash + Clone + Ord> Hash for Graph<I>

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<'a, I: Clone + Ord> IntoIterator for &'a Graph<I>

type Item = &'a State<I>

The type of the elements being iterated over.

type IntoIter = Iter<'a, State<I>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: Clone + Ord> IntoIterator for Graph<I>

type Item = State<I>

The type of the elements being iterated over.

type IntoIter = IntoIter<State<I>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: Ord + Clone + Ord> Ord for Graph<I>

fn cmp(&self, other: &Graph<I>) -> 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<I: PartialEq + Clone + Ord> PartialEq for Graph<I>

fn eq(&self, other: &Graph<I>) -> 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<I: PartialOrd + Clone + Ord> PartialOrd for Graph<I>

fn partial_cmp(&self, other: &Graph<I>) -> 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<I: Eq + Clone + Ord> Eq for Graph<I>

impl<I: Clone + Ord> StructuralPartialEq for Graph<I>