Enum Term 

pub enum Term<I = Id, L = Literal> {
    Id(I),
    Literal(L),
}

gRDF term.

Either a node identifier or a literal value.

Hash implementation

It is guaranteed that the Hash implementation of Term is transparent, meaning that the hash of Term::Id(id) the same as id and the hash of Term::Literal(l) is the same as l.

Variants

Id(I)

Node identifier.

Literal(L)

Literal value.

Implementations

impl<I, L> Term<I, L>

pub fn blank(id: <I as MaybeBlankId>::BlankId) -> Term<I, L>

where I: FromBlankId,

pub fn iri(iri: <I as MaybeIri>::Iri) -> Term<I, L>

where I: FromIri,

pub fn is_id(&self) -> bool

pub fn is_literal(&self) -> bool

pub fn as_id(&self) -> Option<&I>

pub fn into_id(self) -> Option<I>

pub fn try_into_id(self) -> Result<I, L>

pub fn as_literal(&self) -> Option<&L>

pub fn into_literal(self) -> Option<L>

pub fn try_into_literal(self) -> Result<L, I>

pub fn is_blank(&self) -> bool

where I: TryAsBlankId,

pub fn is_iri(&self) -> bool

where I: TryAsIri,

pub fn as_blank(&self) -> Option<&<I as MaybeBlankId>::BlankId>

where I: TryAsBlankId,

pub fn try_into_blank(self) -> Result<<I as MaybeBlankId>::BlankId, Term<I, L>>

where I: TryIntoBlankId,

pub fn into_blank(self) -> Option<<I as MaybeBlankId>::BlankId>

where I: TryIntoBlankId,

pub fn as_iri(&self) -> Option<&<I as MaybeIri>::Iri>

where I: TryAsIri,

pub fn try_into_iri(self) -> Result<<I as MaybeIri>::Iri, Term<I, L>>

where I: TryIntoIri,

pub fn into_iri(self) -> Option<<I as MaybeIri>::Iri>

where I: TryIntoIri,

pub fn as_ref(&self) -> Term<&I, &L>

Converts from &Term<I, L> to Term<&I, &L>.

impl<'a, I, L> Term<&'a I, &'a L>

pub fn cloned(self) -> Term<I, L>

where I: Clone, L: Clone,

pub fn copied(self) -> Term<I, L>

where I: Copy, L: Copy,

impl Term

pub fn as_lexical_term_ref(&self) -> Term<Id<&Iri, &BlankId>, &Literal>

pub fn as_lexical_object_ref(&self) -> Term<Id<&Iri, &BlankId>, &Literal>

Alias for Self::as_lexical_term_ref.

impl Term<Id<&Iri, &BlankId>, &Literal>

pub fn into_owned(self) -> Term

Trait Implementations

impl<I, B, L> AsRdfTerm<I, B, L> for Term<Id<I, B>, L>

fn as_rdf_term(&self) -> Term<Id<&I, &B>, &L>

Returns this value as an RDF term.

impl<I, L, V> AsRefWithContext<str, V> for Term<I, L>

where I: AsRefWithContext<str, V>, L: AsRef<str>,

Available on crate feature contextual only.

fn as_ref_with<'a>(&'a self, vocabulary: &'a V) -> &'a str

impl<I, L> Clone for Term<I, L>

where I: Clone, L: Clone,

fn clone(&self) -> Term<I, L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I, L> Debug for Term<I, L>

where I: Debug, L: Debug,

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

Formats the value using the given formatter.

impl<I, L> Display for Term<I, L>

where I: Display, L: Display,

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

Formats the value using the given formatter.

impl<I, L, V> DisplayWithContext<V> for Term<I, L>

where I: DisplayWithContext<V>, L: DisplayWithContext<V>,

Available on crate feature contextual only.

fn fmt_with(&self, vocabulary: &V, f: &mut Formatter<'_>) -> Result<(), Error>

impl<V, I, L> EmbedIntoVocabulary<V> for Term<I, L>

where I: EmbedIntoVocabulary<V>, L: EmbedIntoVocabulary<V>,

type Embedded = Term<<I as EmbedIntoVocabulary<V>>::Embedded, <L as EmbedIntoVocabulary<V>>::Embedded>

Type of the value once embedded into the vocabulary.

fn embed_into_vocabulary( self, vocabulary: &mut V, ) -> <Term<I, L> as EmbedIntoVocabulary<V>>::Embedded

impl<V, I, L> EmbeddedIntoVocabulary<V> for Term<I, L>

where I: EmbeddedIntoVocabulary<V>, L: EmbeddedIntoVocabulary<V>,

type Embedded = Term<<I as EmbeddedIntoVocabulary<V>>::Embedded, <L as EmbeddedIntoVocabulary<V>>::Embedded>

fn embedded_into_vocabulary( &self, vocabulary: &mut V, ) -> <Term<I, L> as EmbeddedIntoVocabulary<V>>::Embedded

impl<V, I> ExtractFromVocabulary<V> for Term<I, <V as LiteralVocabulary>::Literal>

where V: LiteralVocabulary, I: ExtractFromVocabulary<V>,

type Extracted = Term<<I as ExtractFromVocabulary<V>>::Extracted>

fn extract_from_vocabulary( self, vocabulary: &V, ) -> <Term<I, <V as LiteralVocabulary>::Literal> as ExtractFromVocabulary<V>>::Extracted

impl<V, I> ExtractedFromVocabulary<V> for Term<I, <V as LiteralVocabulary>::Literal>

where V: LiteralVocabulary, I: ExtractedFromVocabulary<V>,

type Extracted = Term<<I as ExtractedFromVocabulary<V>>::Extracted>

fn extracted_from_vocabulary( &self, vocabulary: &V, ) -> <Term<I, <V as LiteralVocabulary>::Literal> as ExtractedFromVocabulary<V>>::Extracted

Exports a value embedded into the vocabulary V.

impl<V> From<Term<Id<<V as IriVocabulary>::Iri, <V as BlankIdVocabulary>::BlankId>, <V as LiteralVocabulary>::Literal>> for Resource<V>

where V: Vocabulary,

fn from( value: Term<Id<<V as IriVocabulary>::Iri, <V as BlankIdVocabulary>::BlankId>, <V as LiteralVocabulary>::Literal>, ) -> Resource<V>

Converts to this type from the input type.

impl<I, L> FromBlankId for Term<I, L>

where I: FromBlankId,

fn from_blank(b: <Term<I, L> as MaybeBlankId>::BlankId) -> Term<I, L>

Builds a value from a blank node identifier.

impl<I, L> FromIri for Term<I, L>

where I: FromIri,

fn from_iri(b: <Term<I, L> as MaybeIri>::Iri) -> Term<I, L>

Builds a value from an iri.

impl<I, L> Hash for Term<I, L>

where I: Hash, L: Hash,

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

where H: Hasher,

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<I, T, L> Interpret<I> for Term<T, L>

where I: LiteralInterpretationMut<L>, T: Interpret<I, Interpreted = <I as Interpretation>::Resource>,

type Interpreted = <I as Interpretation>::Resource

Interpreted form.

fn interpret( self, interpretation: &mut I, ) -> <Term<T, L> as Interpret<I>>::Interpreted

Interpret the given resource.

impl<I, L> IntoTerm for Term<I, L>

type Id = I

Node identifier type.

type Literal = L

Literal type.

fn into_term(self) -> Term<I, L>

Turns the value into a Term.

impl<V, I, T, B, L> LinkedDataResource<I, V> for Term<Id<T, B>, L>

where V: Vocabulary, I: Interpretation, T: LinkedDataResource<I, V>, B: LinkedDataResource<I, V>, L: LinkedDataResource<I, V>,

fn interpretation( &self, vocabulary: &mut V, interpretation: &mut I, ) -> ResourceInterpretation<'_, I, V>

fn lexical_representation<'a>( &'a self, vocabulary: &'a mut V, interpretation: &'a mut I, ) -> Option<CowRdfTerm<'a, V>>

where I: ReverseTermInterpretation<Iri = <V as IriVocabulary>::Iri, BlankId = <V as BlankIdVocabulary>::BlankId, Literal = <V as LiteralVocabulary>::Literal>,

fn reference_interpretation( &self, vocabulary: &mut V, interpretation: &mut I, ) -> ResourceInterpretation<'_, I, V>

impl<I, L> MaybeBlankId for Term<I, L>

where I: MaybeBlankId,

type BlankId = <I as MaybeBlankId>::BlankId

Inner blank node identifier type.

impl<I, L> MaybeIri for Term<I, L>

where I: MaybeIri,

type Iri = <I as MaybeIri>::Iri

Inner iri type.

impl<I, L> Ord for Term<I, L>

where I: Ord, L: Ord,

fn cmp(&self, other: &Term<I, L>) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I1, L1, I2, L2> PartialEq<Term<I2, L2>> for Term<I1, L1>

where I1: PartialEq<I2>, L1: PartialEq<L2>,

fn eq(&self, other: &Term<I2, L2>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<I1, L1, I2, L2> PartialOrd<Term<I2, L2>> for Term<I1, L1>

where I1: PartialOrd<I2>, L1: PartialOrd<L2>,

fn partial_cmp(&self, other: &Term<I2, L2>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<I, L> RdfDisplay for Term<I, L>

where I: RdfDisplay, L: RdfDisplay,

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

Formats the value using the given formatter.

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

Prepare the value to be formatted as an RDF syntax element.

impl<I, L, V> RdfDisplayWithContext<V> for Term<I, L>

where I: RdfDisplayWithContext<V>, L: RdfDisplayWithContext<V>,

Available on crate feature contextual only.

fn rdf_fmt_with( &self, vocabulary: &V, f: &mut Formatter<'_>, ) -> Result<(), Error>

impl<I, L> TryAsBlankId for Term<I, L>

where I: TryAsBlankId,

fn try_as_blank(&self) -> Option<&<Term<I, L> as MaybeBlankId>::BlankId>

Returns a reference to the blank node identifier value, if any.

fn is_blank(&self) -> bool

impl<I, L> TryAsIri for Term<I, L>

where I: TryAsIri,

fn try_as_iri(&self) -> Option<&<Term<I, L> as MaybeIri>::Iri>

Returns a reference to the iri value, if any.

fn is_iri(&self) -> bool

impl<V, I, L> TryExtractFromVocabulary<V> for Term<I, L>

where I: TryExtractFromVocabulary<V>, L: TryExtractFromVocabulary<V>,

type Extracted = Term<<I as TryExtractFromVocabulary<V>>::Extracted, <L as TryExtractFromVocabulary<V>>::Extracted>

type Error = Term<<I as TryExtractFromVocabulary<V>>::Error, <L as TryExtractFromVocabulary<V>>::Error>

fn try_extract_from_vocabulary( self, vocabulary: &V, ) -> Result<<Term<I, L> as TryExtractFromVocabulary<V>>::Extracted, <Term<I, L> as TryExtractFromVocabulary<V>>::Error>

impl<I, L> TryIntoBlankId for Term<I, L>

where I: TryIntoBlankId,

fn try_into_blank( self, ) -> Result<<Term<I, L> as MaybeBlankId>::BlankId, Term<I, L>>

impl<I, L> TryIntoIri for Term<I, L>

where I: TryIntoIri,

fn try_into_iri(self) -> Result<<Term<I, L> as MaybeIri>::Iri, Term<I, L>>

impl<I, L> Copy for Term<I, L>

where I: Copy, L: Copy,

impl<I, L> Eq for Term<I, L>

where I: Eq, L: Eq,