Struct DataGraph 

pub struct DataGraph { /* private fields */ }

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.

Implementations

impl DataGraph

pub fn from_triples(triples: Vec<(String, String, String)>) -> DataGraph

pub fn from_rete(rete: &Rete, graph: Option<&str>) -> DataGraph

Trait Implementations

impl Clone for DataGraph

fn clone(&self) -> DataGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DataGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for DataGraph

fn default() -> DataGraph

Returns the “default value” for a type.

impl GraphView for DataGraph

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