Enum rdf_types::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::BlankId) -> Selfwhere I: FromBlankId,

pub fn iri(iri: I::Iri) -> Selfwhere 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 as_literal(&self) -> Option<&L>

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

pub fn is_blank(&self) -> boolwhere I: AsBlankId,

pub fn is_iri(&self) -> boolwhere I: AsIri,

pub fn as_blank(&self) -> Option<&I::BlankId>where I: AsBlankId,

pub fn into_blank(self) -> Option<I::BlankId>where I: IntoBlankId,

pub fn as_iri(&self) -> Option<&I::Iri>where I: AsIri,

pub fn into_iri(self) -> Option<I::Iri>where I: IntoIri,

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<S, L> Term<Id<IriBuf, BlankIdBuf>, Literal<S, IriBuf, L>>

pub fn inserted_into<V: VocabularyMut>( &self, vocabulary: &mut V ) -> 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 ) -> Term<Id<V::Iri, V::BlankId>, Literal<S, V::Iri, L>>

Trait Implementations

impl<I: AsBlankId, L> AsBlankId for Term<I, L>

fn as_blank(&self) -> Option<&Self::BlankId>

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

fn is_blank(&self) -> bool

impl<I: AsIri, L> AsIri for Term<I, L>

fn as_iri(&self) -> Option<&Self::Iri>

Returns a reference to the iri value, if any.

fn is_iri(&self) -> bool

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

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

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

Formats the value using the given formatter.

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

fn from_blank(b: Self::BlankId) -> Self

Builds a value from a blank node identifier.

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

fn from_iri(b: Self::Iri) -> Self

Builds a value from an iri.

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

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<I: IntoBlankId, L> IntoBlankId for Term<I, L>

fn into_blank(self) -> Option<Self::BlankId>

Converts the value into a blank node identifier, if any.

impl<I: IntoIri, L> IntoIri for Term<I, L>

fn into_iri(self) -> Option<Self::Iri>

Converts the value into an iri, if any.

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

type BlankId = <I as MaybeBlankId>::BlankId

Inner blank node identifier type.

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

type Iri = <I as MaybeIri>::Iri

Inner iri type.

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

fn cmp(&self, other: &Term<I, L>) -> 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<I1: PartialEq<I2>, L1: PartialEq<L2>, I2, L2> PartialEq<Term<I2, L2>> for Term<I1, L1>

fn eq(&self, other: &Term<I2, L2>) -> 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<I1: PartialOrd<I2>, L1: PartialOrd<L2>, I2, L2> PartialOrd<Term<I2, L2>> for Term<I1, L1>

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

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<I: RdfDisplay, L: RdfDisplay> RdfDisplay for Term<I, L>

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

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

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

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

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