Enum RegexTree

pub enum RegexTree {
    Top,
    Bottom,
    Set(Intervals),
    Epsilon,
    Concat(Rc<RegexTree>, Rc<RegexTree>),
    KleeneClosure(Rc<RegexTree>),
    Union(Rc<RegexTree>, Rc<RegexTree>),
    Intersection(Rc<RegexTree>, Rc<RegexTree>),
    Complement(Rc<RegexTree>),
}

Variants

Top

Bottom

Set(Intervals)

Epsilon

Concat(Rc<RegexTree>, Rc<RegexTree>)

KleeneClosure(Rc<RegexTree>)

Union(Rc<RegexTree>, Rc<RegexTree>)

Intersection(Rc<RegexTree>, Rc<RegexTree>)

Complement(Rc<RegexTree>)

Implementations

impl RegexTree

pub fn single(x: u8) -> Self

pub fn range(x: RangeInclusive<u8>) -> Self

pub fn mangle(&self) -> String

pub fn is_nullable(&self) -> bool

Trait Implementations

impl Clone for RegexTree

fn clone(&self) -> RegexTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RegexTree

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

Formats the value using the given formatter.

impl Display for RegexTree

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

Formats the value using the given formatter.

impl Hash for RegexTree

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 Ord for RegexTree

fn cmp(&self, other: &RegexTree) -> 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 PartialEq for RegexTree

fn eq(&self, other: &RegexTree) -> bool

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

const 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 PartialOrd for RegexTree

fn partial_cmp(&self, other: &RegexTree) -> 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 Eq for RegexTree

impl StructuralPartialEq for RegexTree