Trait SubjectVisitor 

pub trait SubjectVisitor<I: Interpretation> {
    type Ok;
    type Error;

    // Required methods
    fn predicate<L, T>(
        &mut self,
        predicate: &L,
        objects: &T,
    ) -> Result<(), Self::Error>
       where L: ?Sized + LinkedDataResource<I>,
             T: ?Sized + LinkedDataPredicateObjects<I>;
    fn reverse_predicate<L, T>(
        &mut self,
        predicate: &L,
        subjects: &T,
    ) -> Result<(), Self::Error>
       where L: ?Sized + LinkedDataResource<I>,
             T: ?Sized + LinkedDataPredicateObjects<I>;
    fn graph<T>(&mut self, value: &T) -> Result<(), Self::Error>
       where T: ?Sized + LinkedDataGraph<I>;
    fn include<T>(&mut self, value: &T) -> Result<(), Self::Error>
       where T: ?Sized + LinkedDataResource<I> + LinkedDataSubject<I>;
    fn end(self) -> Result<Self::Ok, Self::Error>;
}

Visitor over the properties of an RDF subject.

Required Associated Types

type Ok

Value returned once the subject has been entirely visited.

type Error

Error type.

Required Methods

fn predicate<L, T>( &mut self, predicate: &L, objects: &T, ) -> Result<(), Self::Error>

where L: ?Sized + LinkedDataResource<I>, T: ?Sized + LinkedDataPredicateObjects<I>,

Visit a predicate of the graph.

fn reverse_predicate<L, T>( &mut self, predicate: &L, subjects: &T, ) -> Result<(), Self::Error>

where L: ?Sized + LinkedDataResource<I>, T: ?Sized + LinkedDataPredicateObjects<I>,

Visit a reverse predicate of the graph.

fn graph<T>(&mut self, value: &T) -> Result<(), Self::Error>

where T: ?Sized + LinkedDataGraph<I>,

Visits a graph named by the subject.

fn include<T>(&mut self, value: &T) -> Result<(), Self::Error>

where T: ?Sized + LinkedDataResource<I> + LinkedDataSubject<I>,

Includes another subject in the same graph.

fn end(self) -> Result<Self::Ok, Self::Error>

Ends the subject visit.

Dyn Compatibility

This trait is not dyn compatible.

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

Implementations on Foreign Types

impl<I: Interpretation, S: SubjectVisitor<I>> SubjectVisitor<I> for &mut S

type Ok = ()

type Error = <S as SubjectVisitor<I>>::Error

fn predicate<L, T>( &mut self, predicate: &L, objects: &T, ) -> Result<(), Self::Error>

where L: ?Sized + LinkedDataResource<I>, T: ?Sized + LinkedDataPredicateObjects<I>,

fn reverse_predicate<L, T>( &mut self, predicate: &L, subjects: &T, ) -> Result<(), Self::Error>

where L: ?Sized + LinkedDataResource<I>, T: ?Sized + LinkedDataPredicateObjects<I>,

fn graph<T>(&mut self, value: &T) -> Result<(), Self::Error>

where T: ?Sized + LinkedDataGraph<I>,

fn include<T>(&mut self, value: &T) -> Result<(), Self::Error>

where T: ?Sized + LinkedDataResource<I> + LinkedDataSubject<I>,

fn end(self) -> Result<Self::Ok, Self::Error>

Implementors