Enum rdf_types::Id

pub enum Id<I = IriBuf, B = BlankIdBuf> {
    Blank(B),
    Iri(I),
}

RDF node identifier.

Either a blank node identifier or an IRI.

Hash implementation

It is guaranteed that the Hash implementation of Id is transparent, meaning that the hash of Term::Blank(id) the same as id and the hash of Subject::Iri(iri) is the same as iri.

Variants

Blank(B)

Blank node identifier.

Iri(I)

IRI.

Implementations

impl<I, B> Id<I, B>

pub fn is_blank(&self) -> bool

pub fn is_iri(&self) -> bool

pub fn as_blank(&self) -> Option<&B>

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

pub fn try_into_blank(self) -> Result<B, I>

pub fn into_blank(self) -> Option<B>

pub fn try_into_iri(self) -> Result<I, B>

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

pub fn as_term<L>(&self) -> Term<&Self, &L>

Converts this id reference into the term Term::Id(&id).

pub fn into_term<L>(self) -> Term<Self, L>

Converts the id into the term Term::Id(id).

pub fn as_str(&self) -> &strwhere I: AsRef<str>, B: AsRef<str>,

Returns a borrowed string representation of the id.

pub fn as_ref(&self) -> Id<&I, &B>

Converts an &Id<I, B> into an Id<&I, &B>.

impl<'a, I, B> Id<&'a I, &'a B>

pub fn cloned(self) -> Id<I, B>where I: Clone, B: Clone,

Maps an Id<&I, &B> into an Id<I, B> by cloning the contents of the id.

pub fn copied(self) -> Id<I, B>where I: Copy, B: Copy,

Maps an Id<&I, &B> into an Id<I, B> by copying the contents of the id.

impl Id

pub fn inserted_into<V: VocabularyMut>( &self, vocabulary: &mut V ) -> Id<V::Iri, V::BlankId>

pub fn insert_into<V: VocabularyMut>( self, vocabulary: &mut V ) -> Id<V::Iri, V::BlankId>

Trait Implementations

impl<I, B> AsBlankId for Id<I, B>

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, B> AsIri for Id<I, B>

fn as_iri(&self) -> Option<&I>

Returns a reference to the iri value, if any.

fn is_iri(&self) -> bool

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

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

impl<I: Clone, B: Clone> Clone for Id<I, B>

fn clone(&self) -> Id<I, B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug, B: Debug> Debug for Id<I, B>

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

Formats the value using the given formatter.

impl<I: Display, B: Display> Display for Id<I, B>

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

Formats the value using the given formatter.

impl<I, B> FromBlankId for Id<I, B>

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

Builds a value from a blank node identifier.

impl<I, B> FromIri for Id<I, B>

fn from_iri(b: I) -> Self

Builds a value from an iri.

impl<I: Hash, B: Hash> Hash for Id<I, B>

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, B> IntoBlankId for Id<I, B>

fn try_into_blank(self) -> Result<Self::BlankId, Self>

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

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

impl<I, B> IntoIri for Id<I, B>

fn try_into_iri(self) -> Result<I, Self>

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

Converts the value into an iri, if any.

impl<I, B> MaybeBlankId for Id<I, B>

type BlankId = B

Inner blank node identifier type.

impl<I, B> MaybeIri for Id<I, B>

type Iri = I

Inner iri type.

impl<I: Ord, B: Ord> Ord for Id<I, B>

fn cmp(&self, other: &Id<I, B>) -> 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>, B1: PartialEq<B2>, I2, B2> PartialEq<Id<I2, B2>> for Id<I1, B1>

fn eq(&self, other: &Id<I2, B2>) -> 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>, B1: PartialOrd<B2>, I2, B2> PartialOrd<Id<I2, B2>> for Id<I1, B1>

fn partial_cmp(&self, other: &Id<I2, B2>) -> 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: Display, B: Display> RdfDisplay for Id<I, B>

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

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

impl<I: Copy, B: Copy> Copy for Id<I, B>

impl<I: Eq, B: Eq> Eq for Id<I, B>

impl<I, B> StructuralEq for Id<I, B>