Struct rkyv::collections::hash_map::ArchivedHashMap

source · [−]

pub struct ArchivedHashMap<K, V> { /* private fields */ }

Expand description

An archived HashMap.

Implementations

source

impl<K, V> ArchivedHashMap<K, V>

source

pub const fn len(&self) -> usize

Gets the number of items in the hash map.

source

pub fn hasher(&self) -> SeaHasher

Gets the hasher for this hashmap. The hasher for all archived hashmaps is the same for reproducibility.

source

pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)>where
K: Borrow<Q>,
Q: Hash + Eq,

Finds the key-value entry for a key.

source

pub fn get_key_value_pin<Q: ?Sized>(
 self: Pin<&mut Self>,
 k: &Q
) -> Option<(&K, Pin<&mut V>)>where
 K: Borrow<Q>,
 Q: Hash + Eq,

Finds the mutable key-value entry for a key.

source

pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> boolwhere
K: Borrow<Q>,
Q: Hash + Eq,

Returns whether a key is present in the hash map.

source

pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>where
K: Borrow<Q>,
Q: Hash + Eq,

Gets the value associated with the given key.

source

pub fn get_pin<Q: ?Sized>(self: Pin<&mut Self>, k: &Q) -> Option<Pin<&mut V>>where
K: Borrow<Q>,
Q: Hash + Eq,

Gets the mutable value associated with the given key.

source

pub const fn is_empty(&self) -> bool

Returns true if the map contains no elements.

source

pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>`impl<'a, K, V> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);`

Gets an iterator over the key-value entries in the hash map.

source

pub fn iter_pin(self: Pin<&mut Self>) -> IterPin<'_, K, V>ⓘNotable traits for IterPin<'a, K, V>`impl<'a, K, V> Iterator for IterPin<'a, K, V> type Item = (&'a K, Pin<&'a mut V>);`

Gets an iterator over the mutable key-value entries in the hash map.

source

pub fn keys(&self) -> Keys<'_, K, V>ⓘNotable traits for Keys<'a, K, V>`impl<'a, K, V> Iterator for Keys<'a, K, V> type Item = &'a K;`

Gets an iterator over the keys in the hash map.

source

pub fn values(&self) -> Values<'_, K, V>ⓘNotable traits for Values<'a, K, V>`impl<'a, K, V> Iterator for Values<'a, K, V> type Item = &'a V;`

Gets an iterator over the values in the hash map.

source

pub fn values_pin(self: Pin<&mut Self>) -> ValuesPin<'_, K, V>ⓘNotable traits for ValuesPin<'a, K, V>`impl<'a, K, V> Iterator for ValuesPin<'a, K, V> type Item = Pin<&'a mut V>;`

Gets an iterator over the mutable values in the hash map.

source

pub unsafe fn resolve_from_len(
    len: usize,
    pos: usize,
    resolver: HashMapResolver,
    out: *mut Self
)

Resolves an archived hash map from a given length and parameters.

Safety

len must be the number of elements that were serialized
pos must be the position of out within the archive
resolver must be the result of serializing a hash map

Trait Implementations

source

impl<K: Debug, V: Debug> Debug for ArchivedHashMap<K, V>

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl<K: Archive + Hash + Eq, V: Archive, D: Fallible + ?Sized, S: Default + BuildHasher> Deserialize<HashMap<K, V, S, Global>, D> for ArchivedHashMap<K::Archived, V::Archived>where
K::Archived: Deserialize<K, D> + Hash + Eq,
V::Archived: Deserialize<V, D>,

source

fn deserialize(&self, deserializer: &mut D) -> Result<HashMap<K, V, S>, D::Error>

Deserializes using the given deserializer

source

impl<K: Archive + Hash + Eq, V: Archive, D: Fallible + ?Sized, S: Default + BuildHasher> Deserialize<HashMap<K, V, S>, D> for ArchivedHashMap<K::Archived, V::Archived>where
K::Archived: Deserialize<K, D> + Hash + Eq,
V::Archived: Deserialize<V, D>,

source

fn deserialize(&self, deserializer: &mut D) -> Result<HashMap<K, V, S>, D::Error>

Deserializes using the given deserializer

source

impl<K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized, V> Index<&Q> for ArchivedHashMap<K, V>

type Output = V

The returned type after indexing.

source

fn index(&self, key: &Q) -> &V

Performs the indexing (container[index]) operation. Read more

source

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>> PartialEq<ArchivedHashMap<AK, AV>> for HashMap<K, V>

source

fn eq(&self, other: &ArchivedHashMap<AK, AV>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>> PartialEq<ArchivedHashMap<AK, AV>> for HashMap<K, V>

source

fn eq(&self, other: &ArchivedHashMap<AK, AV>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<K: Hash + Eq, V: PartialEq> PartialEq<ArchivedHashMap<K, V>> for ArchivedHashMap<K, V>

source

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>, S: BuildHasher> PartialEq<HashMap<K, V, S, Global>> for ArchivedHashMap<AK, AV>

source

fn eq(&self, other: &HashMap<K, V, S>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>, S: BuildHasher> PartialEq<HashMap<K, V, S>> for ArchivedHashMap<AK, AV>

source

fn eq(&self, other: &HashMap<K, V, S>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<K: Hash + Eq, V: Eq> Eq for ArchivedHashMap<K, V>

Auto Trait Implementations

impl<K, V> RefUnwindSafe for ArchivedHashMap<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,

impl<K, V> Send for ArchivedHashMap<K, V>where
K: Send,
V: Send,

impl<K, V> Sync for ArchivedHashMap<K, V>where
K: Sync,
V: Sync,

impl<K, V> !Unpin for ArchivedHashMap<K, V>

impl<K, V> UnwindSafe for ArchivedHashMap<K, V>where
K: UnwindSafe,
V: UnwindSafe,

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> ArchivePointee for T

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.

source

fn pointer_metadata(
&<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
 W: DeserializeWith<F, T, D>,
 D: Fallible + ?Sized,
 F: ?Sized,

source

fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>

Deserializes using the given deserializer

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> Pointee for T

type Metadata = ()

The type for metadata in pointers and references to Self.

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Struct rkyv::collections::hash_map::ArchivedHashMap

Implementations

impl<K, V> ArchivedHashMap<K, V>

pub const fn len(&self) -> usize

pub fn hasher(&self) -> SeaHasher

pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)>where K: Borrow<Q>, Q: Hash + Eq,

pub fn get_key_value_pin<Q: ?Sized>( self: Pin<&mut Self>, k: &Q) -> Option<(&K, Pin<&mut V>)>where K: Borrow<Q>, Q: Hash + Eq,

pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq,

pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>where K: Borrow<Q>, Q: Hash + Eq,

pub fn get_pin<Q: ?Sized>(self: Pin<&mut Self>, k: &Q) -> Option<Pin<&mut V>>where K: Borrow<Q>, Q: Hash + Eq,

pub const fn is_empty(&self) -> bool

pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>impl<'a, K, V> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);

pub fn iter_pin(self: Pin<&mut Self>) -> IterPin<'_, K, V>ⓘNotable traits for IterPin<'a, K, V>impl<'a, K, V> Iterator for IterPin<'a, K, V> type Item = (&'a K, Pin<&'a mut V>);

pub fn keys(&self) -> Keys<'_, K, V>ⓘNotable traits for Keys<'a, K, V>impl<'a, K, V> Iterator for Keys<'a, K, V> type Item = &'a K;

pub fn values(&self) -> Values<'_, K, V>ⓘNotable traits for Values<'a, K, V>impl<'a, K, V> Iterator for Values<'a, K, V> type Item = &'a V;

pub fn values_pin(self: Pin<&mut Self>) -> ValuesPin<'_, K, V>ⓘNotable traits for ValuesPin<'a, K, V>impl<'a, K, V> Iterator for ValuesPin<'a, K, V> type Item = Pin<&'a mut V>;

pub unsafe fn resolve_from_len( len: usize, pos: usize, resolver: HashMapResolver, out: *mut Self)

Safety

Trait Implementations

impl<K: Debug, V: Debug> Debug for ArchivedHashMap<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<K: Archive + Hash + Eq, V: Archive, D: Fallible + ?Sized, S: Default + BuildHasher> Deserialize<HashMap<K, V, S, Global>, D> for ArchivedHashMap<K::Archived, V::Archived>where K::Archived: Deserialize<K, D> + Hash + Eq, V::Archived: Deserialize<V, D>,

fn deserialize(&self, deserializer: &mut D) -> Result<HashMap<K, V, S>, D::Error>

impl<K: Archive + Hash + Eq, V: Archive, D: Fallible + ?Sized, S: Default + BuildHasher> Deserialize<HashMap<K, V, S>, D> for ArchivedHashMap<K::Archived, V::Archived>where K::Archived: Deserialize<K, D> + Hash + Eq, V::Archived: Deserialize<V, D>,

fn deserialize(&self, deserializer: &mut D) -> Result<HashMap<K, V, S>, D::Error>

impl<K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized, V> Index<&Q> for ArchivedHashMap<K, V>

type Output = V

fn index(&self, key: &Q) -> &V

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>> PartialEq<ArchivedHashMap<AK, AV>> for HashMap<K, V>

fn eq(&self, other: &ArchivedHashMap<AK, AV>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>> PartialEq<ArchivedHashMap<AK, AV>> for HashMap<K, V>

fn eq(&self, other: &ArchivedHashMap<AK, AV>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<K: Hash + Eq, V: PartialEq> PartialEq<ArchivedHashMap<K, V>> for ArchivedHashMap<K, V>

fn eq(&self, other: &Self) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>, S: BuildHasher> PartialEq<HashMap<K, V, S, Global>> for ArchivedHashMap<AK, AV>

fn eq(&self, other: &HashMap<K, V, S>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<K: Hash + Eq + Borrow<AK>, V, AK: Hash + Eq, AV: PartialEq<V>, S: BuildHasher> PartialEq<HashMap<K, V, S>> for ArchivedHashMap<AK, AV>

fn eq(&self, other: &HashMap<K, V, S>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<K: Hash + Eq, V: Eq> Eq for ArchivedHashMap<K, V>

Auto Trait Implementations

impl<K, V> RefUnwindSafe for ArchivedHashMap<K, V>where K: RefUnwindSafe, V: RefUnwindSafe,

impl<K, V> Send for ArchivedHashMap<K, V>where K: Send, V: Send,

impl<K, V> Sync for ArchivedHashMap<K, V>where K: Sync, V: Sync,

impl<K, V> !Unpin for ArchivedHashMap<K, V>

impl<K, V> UnwindSafe for ArchivedHashMap<K, V>where K: UnwindSafe, V: UnwindSafe,

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> ArchivePointee for T

type ArchivedMetadata = ()

fn pointer_metadata( &<T as ArchivePointee>::ArchivedMetadata) -> <T as Pointee>::Metadata

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere W: DeserializeWith<F, T, D>, D: Fallible + ?Sized, F: ?Sized,

fn deserialize( &self, deserializer: &mut D) -> Result<With<T, W>, <D as Fallible>::Error>

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> Pointee for T

type Metadata = ()

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)>where
K: Borrow<Q>,
Q: Hash + Eq,

pub fn get_key_value_pin<Q: ?Sized>(
self: Pin<&mut Self>,
k: &Q
) -> Option<(&K, Pin<&mut V>)>where
K: Borrow<Q>,
Q: Hash + Eq,

pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> boolwhere
K: Borrow<Q>,
Q: Hash + Eq,

pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>where
K: Borrow<Q>,
Q: Hash + Eq,

pub fn get_pin<Q: ?Sized>(self: Pin<&mut Self>, k: &Q) -> Option<Pin<&mut V>>where
K: Borrow<Q>,
Q: Hash + Eq,

pub fn iter(&self) -> Iter<'_, K, V>ⓘNotable traits for Iter<'a, K, V>`impl<'a, K, V> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);`

pub fn iter_pin(self: Pin<&mut Self>) -> IterPin<'_, K, V>ⓘNotable traits for IterPin<'a, K, V>`impl<'a, K, V> Iterator for IterPin<'a, K, V> type Item = (&'a K, Pin<&'a mut V>);`

pub fn keys(&self) -> Keys<'_, K, V>ⓘNotable traits for Keys<'a, K, V>`impl<'a, K, V> Iterator for Keys<'a, K, V> type Item = &'a K;`

pub fn values(&self) -> Values<'_, K, V>ⓘNotable traits for Values<'a, K, V>`impl<'a, K, V> Iterator for Values<'a, K, V> type Item = &'a V;`

pub fn values_pin(self: Pin<&mut Self>) -> ValuesPin<'_, K, V>ⓘNotable traits for ValuesPin<'a, K, V>`impl<'a, K, V> Iterator for ValuesPin<'a, K, V> type Item = Pin<&'a mut V>;`

pub unsafe fn resolve_from_len(
len: usize,
pos: usize,
resolver: HashMapResolver,
out: *mut Self
)

impl<K: Archive + Hash + Eq, V: Archive, D: Fallible + ?Sized, S: Default + BuildHasher> Deserialize<HashMap<K, V, S, Global>, D> for ArchivedHashMap<K::Archived, V::Archived>where
K::Archived: Deserialize<K, D> + Hash + Eq,
V::Archived: Deserialize<V, D>,

impl<K: Archive + Hash + Eq, V: Archive, D: Fallible + ?Sized, S: Default + BuildHasher> Deserialize<HashMap<K, V, S>, D> for ArchivedHashMap<K::Archived, V::Archived>where
K::Archived: Deserialize<K, D> + Hash + Eq,
V::Archived: Deserialize<V, D>,

impl<K, V> RefUnwindSafe for ArchivedHashMap<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,

impl<K, V> Send for ArchivedHashMap<K, V>where
K: Send,
V: Send,

impl<K, V> Sync for ArchivedHashMap<K, V>where
K: Sync,
V: Sync,

impl<K, V> UnwindSafe for ArchivedHashMap<K, V>where
K: UnwindSafe,
V: UnwindSafe,

impl<T> Any for Twhere
T: 'static + ?Sized,

fn pointer_metadata(
&<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,

fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,