Trait LinkedData 

pub trait LinkedData<I: Interpretation = (), V: Vocabulary = ()> {
    // Required method
    fn visit<S>(&self, visitor: S) -> Result<S::Ok, S::Error>
       where S: Visitor<I, V>;
}

Linked-Data type.

A Linked-Data type represents an RDF dataset which can be visited using the visit method.

Required Methods

fn visit<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: Visitor<I, V>,

Visit the RDF dataset represented by this type.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<'a, I: Interpretation, V: Vocabulary, T: ?Sized + LinkedData<I, V>> LinkedData<I, V> for &'a T

fn visit<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: Visitor<I, V>,

impl<I: Interpretation, V: Vocabulary, T: ?Sized + LinkedData<I, V>> LinkedData<I, V> for Box<T>

fn visit<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: Visitor<I, V>,

impl<I: Interpretation, V: Vocabulary> LinkedData<I, V> for Iri

fn visit<S>(&self, visitor: S) -> Result<S::Ok, S::Error>

where S: Visitor<I, V>,

Implementors

impl<'a, V: Vocabulary + IriVocabularyMut, I: Interpretation, T: LinkedDataPredicateObjects<I, V>> LinkedData<I, V> for AnonymousBinding<'a, T>

impl<I: Interpretation, V: Vocabulary, T: LinkedDataGraph<I, V>> LinkedData<I, V> for AnonymousGraph<T>

impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedData<I, V> for Ref<T>