Trait SubjectVisitor

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

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

Required Associated Types

type Ok

type Error

Required Methods

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

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

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, V>, T: ?Sized + LinkedDataPredicateObjects<I, V>,

Visit a reverse predicate of the graph.

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

where T: ?Sized + LinkedDataGraph<I, V>,

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

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

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

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

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

type Ok = ()

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

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

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

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

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

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

where T: ?Sized + LinkedDataGraph<I, V>,

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

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

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

Implementors