Struct Graph 

pub struct Graph {
    pub triples: HashSet<String>,
    pub prefixes: BTreeMap<String, String>,
    /* private fields */
}

A minimal in-memory RDF graph used for patch application and diff generation.

Triples are stored as (subject, predicate, object) tuples of PatchTerm. Prefix mappings are stored separately.

Fields

triples: HashSet<String>

Set of (subject, predicate, object) triples

prefixes: BTreeMap<String, String>

Prefix → IRI mappings

Implementations

impl Graph

pub fn new() -> Self

Construct an empty graph

pub fn add_triple(&mut self, triple: PatchTriple) -> bool

Add a triple to the graph; returns true if newly inserted

pub fn remove_triple(&mut self, triple: &PatchTriple) -> bool

Remove a triple from the graph; returns true if it was present

pub fn contains(&self, triple: &PatchTriple) -> bool

Return true if the triple is present in the graph

pub fn len(&self) -> usize

Number of triples in the graph

pub fn is_empty(&self) -> bool

Return true if the graph has no triples

pub fn iter(&self) -> impl Iterator<Item = &PatchTriple>

Iterate over all triples in the graph

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Default for Graph

fn default() -> Graph

Returns the “default value” for a type.