Enum json_ld_core::id::ValidId
source · pub enum ValidId<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<&Id<I, B>, &L>
pub fn as_term<L>(&self) -> Term<&Id<I, B>, &L>
Converts this id reference into the term Term::Id(&id)
.
source§impl Id<IriBuf, BlankIdBuf>
impl Id<IriBuf, BlankIdBuf>
pub fn inserted_into<V>( &self, vocabulary: &mut V ) -> Id<<V as IriVocabulary>::Iri, <V as BlankIdVocabulary>::BlankId>where V: VocabularyMut,
pub fn insert_into<V>( self, vocabulary: &mut V ) -> Id<<V as IriVocabulary>::Iri, <V as BlankIdVocabulary>::BlankId>where V: VocabularyMut,
Trait Implementations§
source§impl<I, B, V> AsRefWithContext<str, V> for Id<I, B>where
V: Vocabulary<Iri = I, BlankId = B>,
impl<I, B, V> AsRefWithContext<str, V> for Id<I, B>where V: Vocabulary<Iri = I, BlankId = B>,
fn as_ref_with<'a>(&'a self, vocabulary: &'a V) -> &'a str
source§impl<I, B, V> DisplayWithContext<V> for Id<I, B>where
V: Vocabulary<Iri = I, BlankId = B>,
impl<I, B, V> DisplayWithContext<V> for Id<I, B>where V: Vocabulary<Iri = I, BlankId = B>,
source§impl<I, B> FromBlankId for Id<I, B>
impl<I, B> FromBlankId for Id<I, B>
source§fn from_blank(b: <Id<I, B> as MaybeBlankId>::BlankId) -> Id<I, B>
fn from_blank(b: <Id<I, B> as MaybeBlankId>::BlankId) -> Id<I, B>
Builds a value from a blank node identifier.
source§impl<I, B> IntoBlankId for Id<I, B>
impl<I, B> IntoBlankId for Id<I, B>
fn try_into_blank(self) -> Result<<Id<I, B> as MaybeBlankId>::BlankId, Id<I, B>>
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> Ord for Id<I, B>where
I: Ord,
B: Ord,
impl<I, B> Ord for Id<I, B>where I: Ord, B: Ord,
source§impl<I1, B1, I2, B2> PartialEq<Id<I2, B2>> for Id<I1, B1>where
I1: PartialEq<I2>,
B1: PartialEq<B2>,
impl<I1, B1, I2, B2> PartialEq<Id<I2, B2>> for Id<I1, B1>where I1: PartialEq<I2>, B1: PartialEq<B2>,
source§impl<I1, B1, I2, B2> PartialOrd<Id<I2, B2>> for Id<I1, B1>where
I1: PartialOrd<I2>,
B1: PartialOrd<B2>,
impl<I1, B1, I2, B2> PartialOrd<Id<I2, B2>> for Id<I1, B1>where I1: PartialOrd<I2>, B1: PartialOrd<B2>,
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, B, V> RdfDisplayWithContext<V> for Id<I, B>where
V: Vocabulary<Iri = I, BlankId = B>,
impl<I, B, V> RdfDisplayWithContext<V> for Id<I, B>where V: Vocabulary<Iri = I, BlankId = B>,
source§impl<I, B> StrippedHash for Id<I, B>where
I: Hash,
B: Hash,
impl<I, B> StrippedHash for Id<I, B>where I: Hash, B: Hash,
fn stripped_hash<H>(&self, state: &mut H)where H: Hasher,
source§impl<I, B> StrippedOrd for Id<I, B>where
I: Ord,
B: Ord,
impl<I, B> StrippedOrd for Id<I, B>where I: Ord, B: Ord,
fn stripped_cmp(&self, other: &Id<I, B>) -> Ordering
source§impl<I, B, __I, __B> StrippedPartialEq<Id<__I, __B>> for Id<I, B>where
I: PartialEq<__I>,
B: PartialEq<__B>,
impl<I, B, __I, __B> StrippedPartialEq<Id<__I, __B>> for Id<I, B>where I: PartialEq<__I>, B: PartialEq<__B>,
fn stripped_eq(&self, other: &Id<__I, __B>) -> bool
source§impl<I, B, __I, __B> StrippedPartialOrd<Id<__I, __B>> for Id<I, B>where
I: PartialOrd<__I>,
B: PartialOrd<__B>,
impl<I, B, __I, __B> StrippedPartialOrd<Id<__I, __B>> for Id<I, B>where I: PartialOrd<__I>, B: PartialOrd<__B>,
impl<I, B> Copy for Id<I, B>where I: Copy, B: Copy,
impl<I, B> Eq for Id<I, B>where I: Eq, B: Eq,
impl<I, B> StrippedEq for Id<I, B>where I: Eq, B: Eq,
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<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,
fn equivalent(&self, key: &K) -> bool
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.