pub struct CompactIriKeyRef<'a, T, B>(pub &'a Term<T, B>, pub bool, pub bool, pub ProcessingMode);Expand description
Borrowed view over a CompactIriKey for cache lookups that don’t need
to allocate a fresh Term. Hashes byte-for-byte identically to the
owned tuple, so HashMap::get finds the same bucket.
Tuple Fields§
§0: &'a Term<T, B>§1: bool§2: bool§3: ProcessingModeTrait Implementations§
Source§impl<T: PartialEq, B: PartialEq> Equivalent<(Term<T, B>, bool, bool, ProcessingMode)> for CompactIriKeyRef<'_, T, B>
impl<T: PartialEq, B: PartialEq> Equivalent<(Term<T, B>, bool, bool, ProcessingMode)> for CompactIriKeyRef<'_, T, B>
Source§fn equivalent(&self, key: &CompactIriKey<T, B>) -> bool
fn equivalent(&self, key: &CompactIriKey<T, B>) -> bool
Compare self to
key and return true if they are equal.Auto Trait Implementations§
impl<'a, T, B> Freeze for CompactIriKeyRef<'a, T, B>
impl<'a, T, B> RefUnwindSafe for CompactIriKeyRef<'a, T, B>where
&'a Term<T, B>: RefUnwindSafe,
impl<'a, T, B> Send for CompactIriKeyRef<'a, T, B>
impl<'a, T, B> Sync for CompactIriKeyRef<'a, T, B>
impl<'a, T, B> Unpin for CompactIriKeyRef<'a, T, B>
impl<'a, T, B> UnsafeUnpin for CompactIriKeyRef<'a, T, B>where
&'a Term<T, B>: UnsafeUnpin,
impl<'a, T, B> UnwindSafe for CompactIriKeyRef<'a, T, B>where
&'a Term<T, B>: 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<T> BorrowUnordered for T
impl<T> BorrowUnordered for T
Source§fn as_unordered(&self) -> &Unordered<T>
fn as_unordered(&self) -> &Unordered<T>
Views this value as an
Unordered reference.