rexact-core 0.2.0

Derivative-based regex engine for Rexact: symbol classes, lazy DFA, minimisation, per-dialect semantics
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

//! Language engine: symbol classes, terms, derivatives, automata, matching.
//!
//! Design note: pattern syntax trees are lowered to normalised extended
//! regular-expression terms ([`term`]); a lazily explored derivative automaton
//! ([`dfa`]) answers matching in linear time and minimises to a canonical form
//! whose hash is the language fingerprint. Everything is bounded by
//! [`limits`].

pub mod alphabet;
pub mod casefold;
pub mod charset;
pub mod dfa;
pub mod language;
pub mod limits;
mod lower;
pub mod resolved;
pub mod sha256;
pub mod term;

pub use alphabet::Alphabet;
pub use language::{
    fingerprint_term, lower_into, minimal_of_term, resolve, Language, Mode, Resolved,
};
pub use limits::{Budget, Limits};