ingraph 0.1.0

A declaration-driven indexing framework: records and nodes are written as Rust types, and the storage rows, the dataflow between them and the GraphQL query surface are emitted from the declaration.
Documentation
//! The affix vocabulary a text match is asked in — the QUESTION, which no backend family owns.
//!
//! # Why it is not inside one
//!
//! It was, and what that cost is the defect the storage forms record one layer over — [`BeU64`] and
//! its neighbours were gated on `sqlx` by where they lived rather than by what they name. The enum
//! sat in `comparison::sql`, behind the same feature, so a build with the MongoDB family and no
//! other could not name the three questions that family asks — and a byte-identical copy was
//! declared beside its own renderer instead.
//!
//! The vocabulary is the FILTER's: three of a [`TextFilter`](crate::TextFilter)'s twelve affix slots
//! differ by nothing else, and neither family decides what they are. What a feature gate here
//! selected was therefore not a capability but a spelling, and the second family paid for it by
//! writing the enum out again.
//!
//! What each family does own is the RENDERING, and that is where the two genuinely differ:
//! `like_pattern` and `text_regex` stay with the families that write them, each taking a member as
//! an argument.
//!
//! [`BeU64`]: crate::BeU64

/// Which substring / affix form a text match asks for.
///
/// One vocabulary rather than twelve leaf functions: the twelve affix slots a
/// [`TextFilter`](crate::TextFilter) carries are (kind × negated × nocase) triples over these three,
/// so a family's slot walk is a twelve-row table and a loop rather than twelve renderings written
/// out.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub enum TextMatch {
  /// The operand appears anywhere in the stored text.
  Contains,
  /// The stored text begins with the operand.
  Prefix,
  /// The stored text ends with the operand.
  Suffix,
}