libdictenstein 0.1.0

High-performance dictionary data structures (trie, DAWG, double-array trie, suffix automaton, lock-free durable persistent ART) behind one trait API; pairs with liblevenshtein for fuzzy matching
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

//! Generic suffix automaton core shared between
//! [`crate::suffix_automaton::SuffixAutomaton`] (byte-keyed) and
//! [`crate::suffix_automaton_char::SuffixAutomatonChar`] (char-keyed).
//!
//! # Background
//!
//! The byte and char suffix-automaton variants used to ship two
//! byte-for-byte-identical `SuffixNode` struct definitions plus identical
//! 5-method `impl` blocks (root/new/find_edge/add_edge/update_edge),
//! differing only in the edge-label type (`u8` vs `char`). This module
//! exposes a single generic [`SuffixNode<U, V>`] (and its impl) so the
//! variants share the node-shape and node-API entirely.
//!
//! The larger [`SuffixAutomatonInner<V>`] (each variant's mutable state
//! machine wrapped in an `Arc<RwLock<…>>`) and the on-line `extend()`
//! construction algorithm stay per-variant for now — see
//! `docs/benchmarks/c3-suffix-automaton-core-handoff.md` for the full
//! generification plan.

pub mod inner;
pub mod node;

pub use inner::SuffixAutomatonInner;
pub use node::SuffixNode;