Crate iregex_automata 

This library provides an implementation of Nondeterministic Finite Automata (NFA) and Deterministic Finite Automata (DFA) for Unicode scalar values (the char type). It is used by the iregex crate to represent compiled regular expressions.

Re-exports

pub use dfa::DFA;

pub use nfa::NFA;

Modules

dfa

nfa

util

Structs

AnyRange

OptionClassIntoIter

OptionClassIter

Unmapped

Traits

Automaton

Deterministic or non-deterministic automaton.

Class

Token class.

Map

MapSource

TaggedAutomaton

Deterministic or non-deterministic automaton.

Token

Functions

any_char

token_set_intersection

Computes the intersection of two character sets.

Type Aliases

RangeSet