pub struct HashMapTracedValues<K, V, S = RandomState>(pub HashMap<K, V, S>);
Expand description
HashMap wrapper, that has non-jsmanaged keys
Not all methods are reexposed, but you can access inner type via .0
Tuple Fields§
§0: HashMap<K, V, S>
Implementations§
source§impl<K, V> HashMapTracedValues<K, V, RandomState>
impl<K, V> HashMapTracedValues<K, V, RandomState>
sourcepub fn new() -> HashMapTracedValues<K, V, RandomState>
pub fn new() -> HashMapTracedValues<K, V, RandomState>
Wrapper for HashMap::new()
source§impl<K, V, S> HashMapTracedValues<K, V, S>
impl<K, V, S> HashMapTracedValues<K, V, S>
source§impl<K, V, S> HashMapTracedValues<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
impl<K, V, S> HashMapTracedValues<K, V, S>where K: Eq + Hash, S: BuildHasher,
pub fn insert(&mut self, k: K, v: V) -> Option<V>
pub fn get<Q>(&self, k: &Q) -> Option<&V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,
pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,
pub fn contains_key<Q>(&self, k: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,
pub fn remove<Q>(&mut self, k: &Q) -> Option<V>where K: Borrow<Q>, Q: Hash + Eq + ?Sized,
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
Trait Implementations§
source§impl<K: Clone, V: Clone, S: Clone> Clone for HashMapTracedValues<K, V, S>
impl<K: Clone, V: Clone, S: Clone> Clone for HashMapTracedValues<K, V, S>
source§fn clone(&self) -> HashMapTracedValues<K, V, S>
fn clone(&self) -> HashMapTracedValues<K, V, S>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<K, V, S: Default> Default for HashMapTracedValues<K, V, S>
impl<K, V, S: Default> Default for HashMapTracedValues<K, V, S>
source§impl<K, V, S> MallocSizeOf for HashMapTracedValues<K, V, S>where
K: Eq + Hash + MallocSizeOf,
V: MallocSizeOf,
S: BuildHasher,
impl<K, V, S> MallocSizeOf for HashMapTracedValues<K, V, S>where K: Eq + Hash + MallocSizeOf, V: MallocSizeOf, S: BuildHasher,
source§fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize
fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize
Measure the heap usage of all descendant heap-allocated structures, but
not the space taken up by the value itself.
source§impl<K, V: JSTraceable, S> Traceable for HashMapTracedValues<K, V, S>
impl<K, V: JSTraceable, S> Traceable for HashMapTracedValues<K, V, S>
Auto Trait Implementations§
impl<K, V, S> RefUnwindSafe for HashMapTracedValues<K, V, S>where K: RefUnwindSafe, S: RefUnwindSafe, V: RefUnwindSafe,
impl<K, V, S> Send for HashMapTracedValues<K, V, S>where K: Send, S: Send, V: Send,
impl<K, V, S> Sync for HashMapTracedValues<K, V, S>where K: Sync, S: Sync, V: Sync,
impl<K, V, S> Unpin for HashMapTracedValues<K, V, S>where K: Unpin, S: Unpin, V: Unpin,
impl<K, V, S> UnwindSafe for HashMapTracedValues<K, V, S>where K: UnwindSafe, S: UnwindSafe, V: UnwindSafe,
Blanket Implementations§
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> MaybeBoxed<Box<T, Global>> for T
impl<T> MaybeBoxed<Box<T, Global>> for T
source§fn maybe_boxed(self) -> Box<T, Global>
fn maybe_boxed(self) -> Box<T, Global>
Convert
source§impl<T> MaybeBoxed<T> for T
impl<T> MaybeBoxed<T> for T
source§fn maybe_boxed(self) -> T
fn maybe_boxed(self) -> T
Convert
source§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<R, P> ReadPrimitive<R> for Pwhere
R: Read + ReadEndian<P>,
P: Default,
impl<R, P> ReadPrimitive<R> for Pwhere R: Read + ReadEndian<P>, P: Default,
source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian()
.