Skip to main content

triblespace_paths/
lib.rs

1//! Exact regular-path relations kept outside the core query solver.
2//!
3//! A [`PathSummary`] is the unionable, constructional form: a canonical fixed
4//! automaton, the graph-term domain it requires, and the direct arcs of their
5//! product. Nullable automata retain the complete supplied endpoint universe;
6//! non-nullable automata need only matched-edge support. A [`PathIndex`]
7//! materializes one snapshot with a single algorithm:
8//! SCC condensation followed by reverse-topological bitset propagation. No
9//! product transitive closure survives materialization: the index retains the
10//! constructional summary and the accepted endpoint relation.
11
12mod automaton;
13mod constraint;
14mod expr;
15mod index;
16#[cfg(test)]
17mod path_collection;
18pub mod path_summary_union;
19mod persistence;
20mod summary;
21
22pub use automaton::{Automaton, AutomatonError, StateId, Step, Transition};
23pub use constraint::PathConstraint;
24pub use expr::PathExpr;
25pub use index::PathIndex;
26pub use path_summary_union::{
27    PathIndexViewError, PathSummaryView, RegularPathMappingError, RegularPathMappingV1,
28    REGULAR_PATH_MAPPING_V1,
29};
30pub use persistence::{
31    automaton_fingerprint, path_automaton_accepting_state, path_automaton_fingerprint,
32    path_automaton_initial_state, path_automaton_state_count, path_automaton_transition,
33    path_transition_from, path_transition_kind, path_transition_label, path_transition_to,
34    PathAutomatonBlob, PathAutomatonBlobError, PathSummaryBlob, PathSummaryBlobError,
35};
36pub use summary::{GraphEdge, PathError, PathSummary};
37
38/// The shared text grammar for path expressions and its parser.
39pub mod syntax;
40
41#[cfg(any(kani, test))]
42#[path = "../proofs/mod.rs"]
43mod proofs;