Struct Graph 

pub struct Graph { /* private fields */ }

Minimal RDF graph — a sorted set of triples.

Implementations

impl Graph

pub fn new() -> Self

pub fn from_triples(triples: impl IntoIterator<Item = Triple>) -> Self

pub fn insert(&mut self, triple: Triple)

pub fn remove(&mut self, triple: &Triple) -> bool

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn triples(&self) -> impl Iterator<Item = &Triple>

pub fn extend(&mut self, other: &Graph)

Extend with all triples from another graph.

pub fn subtract(&mut self, other: &Graph)

Remove every triple in other that is present in self.

pub fn to_ntriples(&self) -> String

Serialise to N-Triples.

pub fn parse_ntriples(input: &str) -> Result<Self, PodError>

Parse N-Triples — supports the full EBNF subset used by PATCH.

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.

impl PartialEq for Graph

fn eq(&self, other: &Graph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Graph

impl StructuralPartialEq for Graph