Struct rdf_types::Quad

pub struct Quad<S = Id, P = IriBuf, O = Object, G = GraphLabel>(pub S, pub P, pub O, pub Option<G>);

RDF quad.

Tuple Fields

0: S

1: P

2: O

3: Option<G>

Implementations

impl<S, L> Quad<Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>, Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>, Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>>

pub fn inserted_into<V: VocabularyMut>( &self, vocabulary: &mut V ) -> Triple<Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>>where S: Clone, L: Clone,

pub fn insert_into<V: VocabularyMut>( self, vocabulary: &mut V ) -> Triple<Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>>

impl Quad

pub fn into_grdf(self) -> GrdfQuad

impl<S, L> Quad<Id, IriBuf, Object<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>, GraphLabel>

pub fn inserted_into<V: VocabularyMut>( &self, vocabulary: &mut V ) -> Quad<Id<V::Iri, V::BlankId>, V::Iri, Object<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, GraphLabel<V::Iri, V::BlankId>>where S: Clone, L: Clone,

pub fn insert_into<V: VocabularyMut>( self, vocabulary: &mut V ) -> Quad<Id<V::Iri, V::BlankId>, V::Iri, Object<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, GraphLabel<V::Iri, V::BlankId>>

impl<S, L> Quad<Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>, Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>, Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>, Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>>

pub fn inserted_into<V: VocabularyMut>( &self, vocabulary: &mut V ) -> Quad<Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>>where S: Clone, L: Clone,

pub fn insert_into<V: VocabularyMut>( self, vocabulary: &mut V ) -> Quad<Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>, Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>>

impl<S, P, O, G> Quad<S, P, O, G>

pub fn new(subject: S, predicate: P, object: O, graph: Option<G>) -> Self

Creates a new quad.

pub fn subject(&self) -> &S

Returns a reference to the subject of the quad, the first component.

pub fn subject_mut(&mut self) -> &mut S

Returns a mutable reference to the subject of the quad, the first component.

pub fn into_subject(self) -> S

Turns the quad into its subject, the first component.

pub fn predicate(&self) -> &P

Returns a reference to the predicate of the quad, the second component.

pub fn predicate_mut(&mut self) -> &mut P

Returns a mutable reference to the predicate of the quad, the second component.

pub fn into_predicate(self) -> P

Turns the quad into its predicate, the second component.

pub fn object(&self) -> &O

Returns a reference to the object of the quad, the third component.

pub fn object_mut(&mut self) -> &mut O

Returns a mutable reference to the object of the quad, the third component.

pub fn into_object(self) -> O

Turns the quad into its object, the third component.

pub fn graph(&self) -> Option<&G>

Returns a reference to the graph of the quad, the fourth component.

pub fn graph_mut(&mut self) -> Option<&mut G>

Returns a mutable reference to the graph of the quad, the fourth component.

pub fn into_graph(self) -> Option<G>

Turns the quad into its graph, the fourth component.

pub fn into_parts(self) -> (S, P, O, Option<G>)

pub fn into_triple(self) -> (Triple<S, P, O>, Option<G>)

Turns this quad into a triple and its graph component.

pub fn map_subject<U>(self, f: impl FnOnce(S) -> U) -> Quad<U, P, O, G>

Maps the subject with the given function.

pub fn map_predicate<U>(self, f: impl FnOnce(P) -> U) -> Quad<S, U, O, G>

Maps the subject with the given function.

pub fn map_object<U>(self, f: impl FnOnce(O) -> U) -> Quad<S, P, U, G>

Maps the subject with the given function.

pub fn map_graph<U>( self, f: impl FnOnce(Option<G>) -> Option<U> ) -> Quad<S, P, O, U>

Maps the graph with the given function.

Trait Implementations

impl<S: Clone, P: Clone, O: Clone, G: Clone> Clone for Quad<S, P, O, G>

fn clone(&self) -> Quad<S, P, O, G>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S: Debug, P: Debug, O: Debug, G: Debug> Debug for Quad<S, P, O, G>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S: RdfDisplay, P: RdfDisplay, O: RdfDisplay, G: RdfDisplay> Display for Quad<S, P, O, G>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<S: Hash, P: Hash, O: Hash, G: Hash> Hash for Quad<S, P, O, G>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<S: Ord, P: Ord, O: Ord, G: Ord> Ord for Quad<S, P, O, G>

fn cmp(&self, other: &Quad<S, P, O, G>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<S1: PartialEq<S2>, P1: PartialEq<P2>, O1: PartialEq<O2>, G1: PartialEq<G2>, S2, P2, O2, G2> PartialEq<Quad<S2, P2, O2, G2>> for Quad<S1, P1, O1, G1>

fn eq(&self, other: &Quad<S2, P2, O2, G2>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<S1: PartialOrd<S2>, P1: PartialOrd<P2>, O1: PartialOrd<O2>, G1: PartialOrd<G2>, S2, P2, O2, G2> PartialOrd<Quad<S2, P2, O2, G2>> for Quad<S1, P1, O1, G1>

fn partial_cmp(&self, other: &Quad<S2, P2, O2, G2>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<S: RdfDisplay, P: RdfDisplay, O: RdfDisplay, G: RdfDisplay> RdfDisplay for Quad<S, P, O, G>

fn rdf_fmt(&self, f: &mut Formatter<'_>) -> Result

fn rdf_display(&self) -> RdfDisplayed<&Self>

impl<S: Copy, P: Copy, O: Copy, G: Copy> Copy for Quad<S, P, O, G>

impl<S: Eq, P: Eq, O: Eq, G: Eq> Eq for Quad<S, P, O, G>

impl<S, P, O, G> StructuralEq for Quad<S, P, O, G>