Struct MapKV
pub struct MapKV<K, V> { /* private fields */ }
Available on crate feature
dep_rkyv
only.Expand description
A wrapper that applies key and value wrappers to the key-value pairs contained in a type. This can be applied to a hash map or B-tree map to map the key-value pairs.
§Example
use std::collections::HashMap;
use rkyv::{
with::{Inline, InlineAsBox, MapKV},
Archive,
};
#[derive(Archive)]
struct Example<'a> {
// This will apply `InlineAsBox` to the `&str` key, and `Inline` to the
// `&str` value.
#[rkyv(with = MapKV<InlineAsBox, Inline>)]
hash_map: HashMap<&'a str, &'a str>,
}
Trait Implementations§
§impl<A, B, K, V> ArchiveWith<BTreeMap<K, V>> for MapKV<A, B>where
A: ArchiveWith<K>,
B: ArchiveWith<V>,
impl<A, B, K, V> ArchiveWith<BTreeMap<K, V>> for MapKV<A, B>where
A: ArchiveWith<K>,
B: ArchiveWith<V>,
§type Archived = ArchivedBTreeMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>
type Archived = ArchivedBTreeMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>
The archived type of
Self
with F
.§type Resolver = BTreeMapResolver
type Resolver = BTreeMapResolver
The resolver of a
Self
with F
.§fn resolve_with(
field: &BTreeMap<K, V>,
resolver: <MapKV<A, B> as ArchiveWith<BTreeMap<K, V>>>::Resolver,
out: Place<<MapKV<A, B> as ArchiveWith<BTreeMap<K, V>>>::Archived>,
)
fn resolve_with( field: &BTreeMap<K, V>, resolver: <MapKV<A, B> as ArchiveWith<BTreeMap<K, V>>>::Resolver, out: Place<<MapKV<A, B> as ArchiveWith<BTreeMap<K, V>>>::Archived>, )
Resolves the archived type using a reference to the field type
F
.§impl<A, B, K, V, H> ArchiveWith<HashMap<K, V, H>> for MapKV<A, B>
impl<A, B, K, V, H> ArchiveWith<HashMap<K, V, H>> for MapKV<A, B>
§type Archived = ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>
type Archived = ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>
The archived type of
Self
with F
.§type Resolver = HashMapResolver
type Resolver = HashMapResolver
The resolver of a
Self
with F
.§fn resolve_with(
field: &HashMap<K, V, H>,
resolver: <MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Resolver,
out: Place<<MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Archived>,
)
fn resolve_with( field: &HashMap<K, V, H>, resolver: <MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Resolver, out: Place<<MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Archived>, )
Resolves the archived type using a reference to the field type
F
.§impl<A, B, K, V, H> ArchiveWith<HashMap<K, V, H>> for MapKV<A, B>
impl<A, B, K, V, H> ArchiveWith<HashMap<K, V, H>> for MapKV<A, B>
§type Archived = ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>
type Archived = ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>
The archived type of
Self
with F
.§type Resolver = HashMapResolver
type Resolver = HashMapResolver
The resolver of a
Self
with F
.§fn resolve_with(
field: &HashMap<K, V, H>,
resolver: <MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Resolver,
out: Place<<MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Archived>,
)
fn resolve_with( field: &HashMap<K, V, H>, resolver: <MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Resolver, out: Place<<MapKV<A, B> as ArchiveWith<HashMap<K, V, H>>>::Archived>, )
Resolves the archived type using a reference to the field type
F
.§impl<A, B, K, V, D> DeserializeWith<ArchivedBTreeMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, BTreeMap<K, V>, D> for MapKV<A, B>where
A: ArchiveWith<K> + DeserializeWith<<A as ArchiveWith<K>>::Archived, K, D>,
B: ArchiveWith<V> + DeserializeWith<<B as ArchiveWith<V>>::Archived, V, D>,
K: Ord,
D: Fallible + ?Sized,
impl<A, B, K, V, D> DeserializeWith<ArchivedBTreeMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, BTreeMap<K, V>, D> for MapKV<A, B>where
A: ArchiveWith<K> + DeserializeWith<<A as ArchiveWith<K>>::Archived, K, D>,
B: ArchiveWith<V> + DeserializeWith<<B as ArchiveWith<V>>::Archived, V, D>,
K: Ord,
D: Fallible + ?Sized,
§fn deserialize_with(
field: &ArchivedBTreeMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>,
deserializer: &mut D,
) -> Result<BTreeMap<K, V>, <D as Fallible>::Error> ⓘ
fn deserialize_with( field: &ArchivedBTreeMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, deserializer: &mut D, ) -> Result<BTreeMap<K, V>, <D as Fallible>::Error> ⓘ
Deserializes the field type
F
using the given deserializer.§impl<A, B, K, V, D, S> DeserializeWith<ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, HashMap<K, V, S>, D> for MapKV<A, B>where
A: ArchiveWith<K> + DeserializeWith<<A as ArchiveWith<K>>::Archived, K, D>,
B: ArchiveWith<V> + DeserializeWith<<B as ArchiveWith<V>>::Archived, V, D>,
K: Ord + Hash + Eq,
D: Fallible + ?Sized,
S: Default + BuildHasher,
impl<A, B, K, V, D, S> DeserializeWith<ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, HashMap<K, V, S>, D> for MapKV<A, B>where
A: ArchiveWith<K> + DeserializeWith<<A as ArchiveWith<K>>::Archived, K, D>,
B: ArchiveWith<V> + DeserializeWith<<B as ArchiveWith<V>>::Archived, V, D>,
K: Ord + Hash + Eq,
D: Fallible + ?Sized,
S: Default + BuildHasher,
§fn deserialize_with(
field: &ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>,
deserializer: &mut D,
) -> Result<HashMap<K, V, S>, <D as Fallible>::Error> ⓘ
fn deserialize_with( field: &ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, deserializer: &mut D, ) -> Result<HashMap<K, V, S>, <D as Fallible>::Error> ⓘ
Deserializes the field type
F
using the given deserializer.§impl<A, B, K, V, D, S> DeserializeWith<ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, HashMap<K, V, S>, D> for MapKV<A, B>where
A: ArchiveWith<K> + DeserializeWith<<A as ArchiveWith<K>>::Archived, K, D>,
B: ArchiveWith<V> + DeserializeWith<<B as ArchiveWith<V>>::Archived, V, D>,
K: Ord + Hash + Eq,
D: Fallible + ?Sized,
S: Default + BuildHasher,
impl<A, B, K, V, D, S> DeserializeWith<ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, HashMap<K, V, S>, D> for MapKV<A, B>where
A: ArchiveWith<K> + DeserializeWith<<A as ArchiveWith<K>>::Archived, K, D>,
B: ArchiveWith<V> + DeserializeWith<<B as ArchiveWith<V>>::Archived, V, D>,
K: Ord + Hash + Eq,
D: Fallible + ?Sized,
S: Default + BuildHasher,
§fn deserialize_with(
field: &ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>,
deserializer: &mut D,
) -> Result<HashMap<K, V, S>, <D as Fallible>::Error> ⓘ
fn deserialize_with( field: &ArchivedHashMap<<A as ArchiveWith<K>>::Archived, <B as ArchiveWith<V>>::Archived>, deserializer: &mut D, ) -> Result<HashMap<K, V, S>, <D as Fallible>::Error> ⓘ
Deserializes the field type
F
using the given deserializer.§impl<A, B, K, V, S> SerializeWith<BTreeMap<K, V>, S> for MapKV<A, B>where
A: ArchiveWith<K> + SerializeWith<K, S>,
B: ArchiveWith<V> + SerializeWith<V, S>,
<A as ArchiveWith<K>>::Archived: Ord,
S: Fallible + Allocator + Writer + ?Sized,
<S as Fallible>::Error: Source,
impl<A, B, K, V, S> SerializeWith<BTreeMap<K, V>, S> for MapKV<A, B>where
A: ArchiveWith<K> + SerializeWith<K, S>,
B: ArchiveWith<V> + SerializeWith<V, S>,
<A as ArchiveWith<K>>::Archived: Ord,
S: Fallible + Allocator + Writer + ?Sized,
<S as Fallible>::Error: Source,
§impl<A, B, K, V, S, H> SerializeWith<HashMap<K, V, H>, S> for MapKV<A, B>where
A: ArchiveWith<K> + SerializeWith<K, S>,
B: ArchiveWith<V> + SerializeWith<V, S>,
K: Hash + Eq,
<A as ArchiveWith<K>>::Archived: Eq + Hash,
S: Fallible + Allocator + Writer + ?Sized,
<S as Fallible>::Error: Source,
H: Default + BuildHasher,
<H as BuildHasher>::Hasher: Default,
impl<A, B, K, V, S, H> SerializeWith<HashMap<K, V, H>, S> for MapKV<A, B>where
A: ArchiveWith<K> + SerializeWith<K, S>,
B: ArchiveWith<V> + SerializeWith<V, S>,
K: Hash + Eq,
<A as ArchiveWith<K>>::Archived: Eq + Hash,
S: Fallible + Allocator + Writer + ?Sized,
<S as Fallible>::Error: Source,
H: Default + BuildHasher,
<H as BuildHasher>::Hasher: Default,
§impl<A, B, K, V, H, S> SerializeWith<HashMap<K, V, H>, S> for MapKV<A, B>where
A: ArchiveWith<K> + SerializeWith<K, S>,
B: ArchiveWith<V> + SerializeWith<V, S>,
K: Hash + Eq,
<A as ArchiveWith<K>>::Archived: Eq + Hash,
S: Fallible + Writer + Allocator + ?Sized,
<S as Fallible>::Error: Source,
H: Default + BuildHasher,
<H as BuildHasher>::Hasher: Default,
impl<A, B, K, V, H, S> SerializeWith<HashMap<K, V, H>, S> for MapKV<A, B>where
A: ArchiveWith<K> + SerializeWith<K, S>,
B: ArchiveWith<V> + SerializeWith<V, S>,
K: Hash + Eq,
<A as ArchiveWith<K>>::Archived: Eq + Hash,
S: Fallible + Writer + Allocator + ?Sized,
<S as Fallible>::Error: Source,
H: Default + BuildHasher,
<H as BuildHasher>::Hasher: Default,
Auto Trait Implementations§
impl<K, V> Freeze for MapKV<K, V>
impl<K, V> RefUnwindSafe for MapKV<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for MapKV<K, V>
impl<K, V> Sync for MapKV<K, V>
impl<K, V> Unpin for MapKV<K, V>
impl<K, V> UnwindSafe for MapKV<K, V>where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
The alignment of this type in bytes.
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Returns the alignment of this type in bytes.
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,
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 = _
Know whether dropping values of this type matters, in compile-time.
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Returns the alignment of the pointed-to value in bytes. Read more
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Returns the size of the pointed-to value in bytes. Read more
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
Returns
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
Forgets about
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
Available on crate feature
unsafe_layout
only.Returns the value of type
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
Available on crate feature
unsafe_layout
only.Returns the value of type
T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
Available on crate feature
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> ⓘ
Converts
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> ⓘ
Converts
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> ⓘ
Returns the layout of the type.
§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
Returns whether the given value has been niched. Read more
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out
indicating that a T
is niched.