Trait LinkedDataGraph 

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

Serialize a Linked-Data graph.

Required Methods

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

where S: GraphVisitor<I, V>,

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, D> LinkedDataGraph<I, V> for DatasetView<'a, D>

where I::Resource: Eq + Hash + LinkedDataResource<I, V>, D: SubjectTraversableDataset<Resource = I::Resource> + PredicateTraversableDataset + PatternMatchingDataset,

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

where S: GraphVisitor<I, V>,

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

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

where S: GraphVisitor<I, V>,

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

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

where S: GraphVisitor<I, V>,

impl<I: Interpretation, V: Vocabulary, T: LinkedDataSubject<I, V> + LinkedDataResource<I, V>> LinkedDataGraph<I, V> for Vec<T>

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

where S: GraphVisitor<I, V>,

impl<I: Interpretation, V: Vocabulary, T: LinkedDataSubject<I, V> + LinkedDataResource<I, V>> LinkedDataGraph<I, V> for [T]

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

where S: GraphVisitor<I, V>,

impl<I: Interpretation, V: Vocabulary> LinkedDataGraph<I, V> for ()

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

where S: GraphVisitor<I, V>,

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

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

where S: GraphVisitor<I, V>,

impl<I: Interpretation, V: Vocabulary> LinkedDataGraph<I, V> for IriBuf

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

where S: GraphVisitor<I, V>,

Implementors

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

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

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