Struct hdt::hdt_graph::HdtGraph

pub struct HdtGraph {
    pub hdt: Hdt,
}

Adapter to use HDT as a Sophia graph.

Fields

hdt: Hdt

Wrapped HDT instance

Implementations

impl HdtGraph

pub const fn new(hdt: Hdt) -> Self

Wrapper around Hdt.

pub fn size_in_bytes(&self) -> usize

Size in bytes on the heap.

Trait Implementations

impl Graph for HdtGraph

fn triples(&self) -> GTripleSource<'_, Self>

Example

use hdt::sophia::api::graph::Graph;
fn print_first_triple(graph: hdt::HdtGraph) {
    println!("{:?}", graph.triples().next().expect("no triple in the graph"));
}

fn triples_matching<'s, S, P, O>( &'s self, sm: S, pm: P, om: O ) -> GTripleSource<'s, Self>

where S: TermMatcher + 's, P: TermMatcher + 's, O: TermMatcher + 's,

Only supports constant and “any” matchers. Non-constant matchers are supposed to be “any” matchers.

Example

Who was born in Leipzig?

use hdt::{Hdt,HdtGraph};
use hdt::sophia::api::graph::Graph;
use hdt::sophia::api::term::{IriRef, SimpleTerm, matcher::Any};

fn query(dbpedia: hdt::HdtGraph) {
    let birth_place = SimpleTerm::Iri(IriRef::new_unchecked("http://www.snik.eu/ontology/birthPlace".into()));
    let leipzig = SimpleTerm::Iri(IriRef::new_unchecked("http://www.snik.eu/resource/Leipzig".into()));
    let persons = dbpedia.triples_matching(Any, Some(birth_place), Some(leipzig));
}

type Triple<'a> = [HdtTerm; 3]

Determine the type of Triples that the methods of this graph will yield.

type Error = Infallible

The error type that this graph may raise.

fn contains<TS, TP, TO>(&self, s: TS, p: TP, o: TO) -> Result<bool, Self::Error>

where TS: Term, TP: Term, TO: Term,

Return true if this graph contains the given triple.

fn subjects( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the terms used as subject in this Graph.

fn predicates( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the terms used as predicate in this Graph.

fn objects( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the terms used as object in this Graph.

fn iris( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the IRIs used in this Graph (including those used inside quoted triples, if any).

fn blank_nodes( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the blank nodes used in this Graph (including those used inside quoted triples, if any).

fn literals( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the literals used in this Graph (including those used inside quoted triples, if any).

fn quoted_triples<'s>( &'s self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'s> as Triple>::Term, Self::Error>> + 's>

where <Self::Triple<'s> as Triple>::Term: Clone,

Build a fallible iterator of all the quoted triples used in this Graph (including those used inside quoted triples, if any).

fn variables( &self ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>> + '_>

Build a fallible iterator of all the variables used in this Graph (including those used inside quoted triples, if any).

fn as_dataset(&self) -> GraphAsDataset<&Self>

Dataset adapter borrowing this graph

fn as_dataset_mut(&mut self) -> GraphAsDataset<&mut Self>

Dataset adapter borrowing this graph mutably

fn into_dataset(self) -> GraphAsDataset<Self>

where Self: Sized,

Dataset adapter taking ownership of this graph