Struct ReteGraph 

pub struct ReteGraph<'a> { /* private fields */ }

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).

Implementations

impl<'a> ReteGraph<'a>

pub fn new(rete: &'a Rete) -> Self

Trait Implementations

impl GraphView for ReteGraph<'_>

fn objects(&self, subject: &str, predicate: &str) -> Vec<String>

Objects of (subject, predicate, ?).

fn subjects_with(&self, predicate: &str, object: &str) -> Vec<String>

Subjects of (?, predicate, object).

fn subjects_of(&self, predicate: &str) -> Vec<String>

Distinct subjects of (?, predicate, ?).

fn objects_of(&self, predicate: &str) -> Vec<String>

Distinct objects of (?, predicate, ?).

fn predicates_for_subject(&self, subject: &str) -> Vec<String>

Distinct predicates of (subject, ?, ?).

fn all_nodes(&self) -> Vec<String>

Every node (subject or object). The one inherently non-targeted lookup — a remote validation that reaches it reads the whole graph (only a general inverse path or a target-less shape does).

fn is_subclass_of(&self, child: &str, parent: &str) -> bool

Is child a reflexive/transitive rdfs:subClassOf of parent?

fn subclasses_of(&self, parent: &str) -> BTreeSet<String>

The (transitive) subclasses of parent.

fn instances_of(&self, class: &str) -> Vec<String>

Instances of class (direct, or via a subclass).

fn is_instance_of(&self, node: &str, class: &str) -> bool

Is node an instance of class (direct, or via a subclass)?