Expand description
Stable integrity and SHACL validation API.
Structs§
- Data
Graph - 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. - Rete
Graph - A SHACL data-graph view backed directly by a
.retefile’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 eagerDataGraph). - Shacl
Shapes - Parsed SHACL shapes graph.
- Validation
Report - Validation
Result
Enums§
Traits§
- Graph
View - 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.retefile’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.
Functions§
- validate_
shacl - Validate
dataagainstshapes.datais anyGraphView— an in-memoryDataGraph(eager) or aReteGraphthat 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.