Struct ArchivedIndexMap
#[repr(C)]pub struct ArchivedIndexMap<K, V, H = FxHasher64> { /* private fields */ }
dep_rkyv
only.Expand description
An archived IndexMap
.
Implementations§
§impl<K, V, H> ArchivedIndexMap<K, V, H>
impl<K, V, H> ArchivedIndexMap<K, V, H>
§impl<K, V, H> ArchivedIndexMap<K, V, H>
impl<K, V, H> ArchivedIndexMap<K, V, H>
pub fn get_full_with<Q, C>(&self, key: &Q, cmp: C) -> Option<(usize, &K, &V)> ⓘ
pub fn get_full_with<Q, C>(&self, key: &Q, cmp: C) -> Option<(usize, &K, &V)> ⓘ
Gets the index, key, and value corresponding to the supplied key using the given comparison function.
pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)> ⓘ
pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)> ⓘ
Gets the index, key, and value corresponding to the supplied key.
pub fn get_key_value_with<Q, C>(&self, key: &Q, cmp: C) -> Option<(&K, &V)> ⓘ
pub fn get_key_value_with<Q, C>(&self, key: &Q, cmp: C) -> Option<(&K, &V)> ⓘ
Returns the key-value pair corresponding to the supplied key using the given comparison function.
pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)> ⓘ
pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)> ⓘ
Returns the key-value pair corresponding to the supplied key.
pub fn get_with<Q, C>(&self, key: &Q, cmp: C) -> Option<&V> ⓘ
pub fn get_with<Q, C>(&self, key: &Q, cmp: C) -> Option<&V> ⓘ
Returns a reference to the value corresponding to the supplied key using the given comparison function.
pub fn get<Q>(&self, key: &Q) -> Option<&V> ⓘ
pub fn get<Q>(&self, key: &Q) -> Option<&V> ⓘ
Returns a reference to the value corresponding to the supplied key.
pub fn get_full_seal_with<'a, Q, C>(
this: Seal<'a, ArchivedIndexMap<K, V, H>>,
key: &Q,
cmp: C,
) -> Option<(usize, &'a K, Seal<'a, V>)> ⓘ
pub fn get_full_seal_with<'a, Q, C>( this: Seal<'a, ArchivedIndexMap<K, V, H>>, key: &Q, cmp: C, ) -> Option<(usize, &'a K, Seal<'a, V>)> ⓘ
Gets the mutable index, key, and value corresponding to the supplied key using the given comparison function.
pub fn get_full_seal<'a, Q>(
this: Seal<'a, ArchivedIndexMap<K, V, H>>,
key: &Q,
) -> Option<(usize, &'a K, Seal<'a, V>)> ⓘ
pub fn get_full_seal<'a, Q>( this: Seal<'a, ArchivedIndexMap<K, V, H>>, key: &Q, ) -> Option<(usize, &'a K, Seal<'a, V>)> ⓘ
Gets the mutable index, key, and value corresponding to the supplied key.
pub fn get_key_value_seal_with<'a, Q, C>(
this: Seal<'a, ArchivedIndexMap<K, V, H>>,
key: &Q,
cmp: C,
) -> Option<(&'a K, Seal<'a, V>)> ⓘ
pub fn get_key_value_seal_with<'a, Q, C>( this: Seal<'a, ArchivedIndexMap<K, V, H>>, key: &Q, cmp: C, ) -> Option<(&'a K, Seal<'a, V>)> ⓘ
Returns the mutable key-value pair corresponding to the supplied key using the given comparison function.
pub fn get_key_value_seal<'a, Q>(
this: Seal<'a, ArchivedIndexMap<K, V, H>>,
key: &Q,
) -> Option<(&'a K, Seal<'a, V>)> ⓘ
pub fn get_key_value_seal<'a, Q>( this: Seal<'a, ArchivedIndexMap<K, V, H>>, key: &Q, ) -> Option<(&'a K, Seal<'a, V>)> ⓘ
Returns the mutable key-value pair corresponding to the supplied key.
pub fn get_seal_with<'a, Q, C>(
this: Seal<'a, ArchivedIndexMap<K, V, H>>,
key: &Q,
cmp: C,
) -> Option<Seal<'a, V>> ⓘ
pub fn get_seal_with<'a, Q, C>( this: Seal<'a, ArchivedIndexMap<K, V, H>>, key: &Q, cmp: C, ) -> Option<Seal<'a, V>> ⓘ
Returns a mutable reference to the value corresponding to the supplied key using the given comparison function.
pub fn get_seal<'a, Q>(
this: Seal<'a, ArchivedIndexMap<K, V, H>>,
key: &Q,
) -> Option<Seal<'a, V>> ⓘ
pub fn get_seal<'a, Q>( this: Seal<'a, ArchivedIndexMap<K, V, H>>, key: &Q, ) -> Option<Seal<'a, V>> ⓘ
Returns a mutable reference to the value corresponding to the supplied key.
pub fn contains_key<Q>(&self, key: &Q) -> bool
pub fn contains_key<Q>(&self, key: &Q) -> bool
Returns whether a key is present in the hash map.
pub fn get_index_of_with<Q, C>(&self, key: &Q, cmp: C) -> Option<usize> ⓘ
pub fn get_index_of_with<Q, C>(&self, key: &Q, cmp: C) -> Option<usize> ⓘ
Gets the index of a key if it exists in the map using the given comparison function.
pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize> ⓘ
pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize> ⓘ
Gets the index of a key if it exists in the map.
pub fn resolve_from_len(
len: usize,
load_factor: (usize, usize),
resolver: IndexMapResolver,
out: Place<ArchivedIndexMap<K, V, H>>,
)
pub fn resolve_from_len( len: usize, load_factor: (usize, usize), resolver: IndexMapResolver, out: Place<ArchivedIndexMap<K, V, H>>, )
Resolves an archived index map from a given length and parameters.
pub fn serialize_from_iter<I, BKU, BVU, KU, VU, S>(
iter: I,
load_factor: (usize, usize),
serializer: &mut S,
) -> Result<IndexMapResolver, <S as Fallible>::Error> ⓘ
pub fn serialize_from_iter<I, BKU, BVU, KU, VU, S>( iter: I, load_factor: (usize, usize), serializer: &mut S, ) -> Result<IndexMapResolver, <S as Fallible>::Error> ⓘ
Serializes an iterator of key-value pairs as an index map.
Trait Implementations§
§impl<K, V, H, __C> CheckBytes<__C> for ArchivedIndexMap<K, V, H>where
__C: Fallible + ?Sized,
<__C as Fallible>::Error: Trace,
ArchivedIndexMap<K, V, H>: Verify<__C>,
ArchivedHashTable<u32_le>: CheckBytes<__C>,
RelPtr<Entry<K, V>, i32_le>: CheckBytes<__C>,
PhantomData<H>: CheckBytes<__C>,
impl<K, V, H, __C> CheckBytes<__C> for ArchivedIndexMap<K, V, H>where
__C: Fallible + ?Sized,
<__C as Fallible>::Error: Trace,
ArchivedIndexMap<K, V, H>: Verify<__C>,
ArchivedHashTable<u32_le>: CheckBytes<__C>,
RelPtr<Entry<K, V>, i32_le>: CheckBytes<__C>,
PhantomData<H>: CheckBytes<__C>,
§impl<K, V, H> Debug for ArchivedIndexMap<K, V, H>
impl<K, V, H> Debug for ArchivedIndexMap<K, V, H>
§impl<K, V, H> PartialEq for ArchivedIndexMap<K, V, H>
impl<K, V, H> PartialEq for ArchivedIndexMap<K, V, H>
§impl<C, K, V, H> Verify<C> for ArchivedIndexMap<K, V, H>where
C: Fallible + ArchiveContext + ?Sized,
<C as Fallible>::Error: Source,
K: CheckBytes<C>,
V: CheckBytes<C>,
impl<C, K, V, H> Verify<C> for ArchivedIndexMap<K, V, H>where
C: Fallible + ArchiveContext + ?Sized,
<C as Fallible>::Error: Source,
K: CheckBytes<C>,
V: CheckBytes<C>,
impl<K, V, H> Eq for ArchivedIndexMap<K, V, H>
impl<K, V, H> Portable for ArchivedIndexMap<K, V, H>where
ArchivedHashTable<u32_le>: Portable,
RelPtr<Entry<K, V>, i32_le>: Portable,
PhantomData<H>: Portable,
Auto Trait Implementations§
impl<K, V, H> Freeze for ArchivedIndexMap<K, V, H>
impl<K, V, H> RefUnwindSafe for ArchivedIndexMap<K, V, H>
impl<K, V, H> Send for ArchivedIndexMap<K, V, H>
impl<K, V, H> Sync for ArchivedIndexMap<K, V, H>
impl<K, V, H = FxHasher64> !Unpin for ArchivedIndexMap<K, V, H>
impl<K, V, H> UnwindSafe for ArchivedIndexMap<K, V, H>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.