Struct Regex

pub struct Regex<A: Alphabet> { /* private fields */ }

Represents regular expressions over some finite alphabet.

Optimizes storage and construction for reoccurring subexpressions to allow polynomial time conversion from NFA. You can create (and keep) handles on subexpressions, then evaluate as if those subexpressions were at the root. This relationship forms an acyclic graph.

Implementations

impl<A: Alphabet> Regex<A>

pub fn new() -> Self

pub fn push(&mut self, op: Op<A>) -> Handle

Push a new operation as the regex root.

It is not required that all regex states are reachable afterwards but all handles must point to existing operations. Returns a handle on the newly inserted operation.

pub fn root(&self) -> Option<Handle>

Get a root to the regex.

pub fn cached(self) -> Cached<A>

Modify the regex with a cache for same terms.

By using a cache for terms, it is possible to lower the memory requirements of the resulting regex through resued subexpressions.

pub fn to_string(&self) -> String

Get a string representation of this regex.

Trait Implementations

impl<A: Alphabet> Default for Regex<A>

fn default() -> Self

Returns the “default value” for a type.