Module validation

Expand description

Stable integrity and SHACL validation API.

Structs§

DataGraph: A validation data graph held fully in memory as a sorted triple vector. Backs the shapes graph and the eager data path; the lazy data path uses ReteGraph.
ReteGraph: A SHACL data-graph view backed directly by a .rete file’s index: every lookup is a routed pattern query, so over a lazy (Rete::open_ranged_lazy) open a validation faults only the tiles holding the shapes’ target nodes — not the whole graph. Views the default graph (named-graph validation uses the eager DataGraph).
ShaclShapes: Parsed SHACL shapes graph.
ValidationReport
ValidationResult

GraphView: A read-only view of the data graph for SHACL validation. The validator only ever asks targeted questions — a focus node’s values, the subjects of a predicate, the instances of a class — so this surface is small enough to back two ways: an in-memory triple set (DataGraph, eager) or a .rete file’s index directly (ReteGraph), which routes each lookup as a range read so a remote validation faults only the tiles holding the shapes’ targets, not the whole graph. The class/instance helpers are derived from the primitives, so a backend only implements the six lookups.

validate_shacl: Validate data against shapes. data is any GraphView — an in-memory DataGraph (eager) or a ReteGraph that routes lookups as range reads (lazy / remote, fetching only the shapes’ targets).
verify: Recompute the content hash from a file image and check it against the header — detects corruption or truncation of the payload sections. The LABEL_INDEX, SCHEMA and predicate-restricted TEXT_INDEX sections (kinds 8, 9, 11) are outside that hash — an older reader’s verify must keep passing on a file that carries them — so each is checked against its own leading digest instead. The QUAD_INDEX section (kind 10) is hashed by reference: its digest is the seal inside the (hashed) index container, checked here.