pub enum Id<I = IriBuf, B = BlankIdBuf> {
Blank(B),
Iri(I),
}
Expand description
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§
Implementations§
source§impl<I, B> Id<I, B>
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>
sourcepub fn as_term<L>(&self) -> Term<&Self, &L>
pub fn as_term<L>(&self) -> Term<&Self, &L>
Converts this id reference into the term Term::Id(&id)
.
source§impl Id
impl Id
sourcepub fn as_subject_ref(&self) -> SubjectRef<'_>
pub fn as_subject_ref(&self) -> SubjectRef<'_>
Alias for as_id_ref
.
sourcepub fn as_graph_label_ref(&self) -> GraphLabelRef<'_>
pub fn as_graph_label_ref(&self) -> GraphLabelRef<'_>
Alias for as_id_ref
.
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§
source§impl<I, B> FromBlankId for Id<I, B>
impl<I, B> FromBlankId for Id<I, B>
source§fn from_blank(b: Self::BlankId) -> Self
fn from_blank(b: Self::BlankId) -> Self
Builds a value from a blank node identifier.
source§impl<V, I: InsertIntoVocabulary<V>, B: InsertIntoVocabulary<V>> InsertIntoVocabulary<V> for Id<I, B>
impl<V, I: InsertIntoVocabulary<V>, B: InsertIntoVocabulary<V>> InsertIntoVocabulary<V> for Id<I, B>
type Inserted = Id<<I as InsertIntoVocabulary<V>>::Inserted, <B as InsertIntoVocabulary<V>>::Inserted>
fn insert_into_vocabulary(self, vocabulary: &mut V) -> Self::Inserted
source§impl<V, I: InsertedIntoVocabulary<V>, B: InsertedIntoVocabulary<V>> InsertedIntoVocabulary<V> for Id<I, B>
impl<V, I: InsertedIntoVocabulary<V>, B: InsertedIntoVocabulary<V>> InsertedIntoVocabulary<V> for Id<I, B>
type Inserted = Id<<I as InsertedIntoVocabulary<V>>::Inserted, <B as InsertedIntoVocabulary<V>>::Inserted>
fn inserted_into_vocabulary(&self, vocabulary: &mut V) -> Self::Inserted
source§impl<I, B, T: IdInterpretationMut<Self>> Interpret<T> for Id<I, B>
impl<I, B, T: IdInterpretationMut<Self>> Interpret<T> for Id<I, B>
§type Interpreted = <T as Interpretation>::Resource
type Interpreted = <T as Interpretation>::Resource
Interpreted form.
source§fn interpret(self, interpretation: &mut T) -> Self::Interpreted
fn interpret(self, interpretation: &mut T) -> Self::Interpreted
Interpret the given resource.
source§impl<I, B> IntoBlankId for Id<I, B>
impl<I, B> IntoBlankId for Id<I, B>
fn try_into_blank(self) -> Result<Self::BlankId, Self>
source§fn into_blank(self) -> Option<Self::BlankId>
fn into_blank(self) -> Option<Self::BlankId>
Converts the value into a blank node identifier, if any.
source§impl<I, B, T, U> MapLiteral<T, U> for Id<I, B>
impl<I, B, T, U> MapLiteral<T, U> for Id<I, B>
source§impl<I: Ord, B: Ord> Ord for Id<I, B>
impl<I: Ord, B: Ord> Ord for Id<I, B>
source§impl<I1: PartialEq<I2>, B1: PartialEq<B2>, I2, B2> PartialEq<Id<I2, B2>> for Id<I1, B1>
impl<I1: PartialEq<I2>, B1: PartialEq<B2>, I2, B2> PartialEq<Id<I2, B2>> for Id<I1, B1>
source§impl<I1: PartialOrd<I2>, B1: PartialOrd<B2>, I2, B2> PartialOrd<Id<I2, B2>> for Id<I1, B1>
impl<I1: PartialOrd<I2>, B1: PartialOrd<B2>, I2, B2> PartialOrd<Id<I2, B2>> for Id<I1, B1>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moresource§impl<I: Display, B: Display> RdfDisplay for Id<I, B>
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>
Auto Trait Implementations§
impl<I, B> RefUnwindSafe for Id<I, B>where B: RefUnwindSafe, I: RefUnwindSafe,
impl<I, B> Send for Id<I, B>where B: Send, I: Send,
impl<I, B> Sync for Id<I, B>where B: Sync, I: Sync,
impl<I, B> Unpin for Id<I, B>where B: Unpin, I: Unpin,
impl<I, B> UnwindSafe for Id<I, B>where B: UnwindSafe, I: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.source§impl<I, B, T> IdInterpretation<Id<I, B>> for Twhere
T: IriInterpretation<I> + BlankIdInterpretation<B>,
impl<I, B, T> IdInterpretation<Id<I, B>> for Twhere T: IriInterpretation<I> + BlankIdInterpretation<B>,
source§fn id_interpretation(
&self,
id: &Id<I, B>
) -> Option<<T as Interpretation>::Resource>
fn id_interpretation( &self, id: &Id<I, B> ) -> Option<<T as Interpretation>::Resource>
Returns the interpretation of the given node identifier, if any.
source§impl<I, B, T> IdInterpretationMut<Id<I, B>> for Twhere
T: IriInterpretationMut<I> + BlankIdInterpretationMut<B>,
impl<I, B, T> IdInterpretationMut<Id<I, B>> for Twhere T: IriInterpretationMut<I> + BlankIdInterpretationMut<B>,
source§fn interpret_id(&mut self, id: Id<I, B>) -> <T as Interpretation>::Resource
fn interpret_id(&mut self, id: Id<I, B>) -> <T as Interpretation>::Resource
Interprets the given identifier.