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>
impl<K, V, S> HashMapTracedValues<K, V, S>
pub fn insert(&mut self, k: K, v: V) -> Option<V>
pub fn get<Q>(&self, k: &Q) -> Option<&V>
pub fn get_mut<Q: Hash + Eq + ?Sized>(&mut self, k: &Q) -> Option<&mut V>where
K: Borrow<Q>,
pub fn contains_key<Q: Hash + Eq + ?Sized>(&self, k: &Q) -> boolwhere
K: Borrow<Q>,
pub fn remove<Q: Hash + Eq + ?Sized>(&mut self, k: &Q) -> Option<V>where
K: Borrow<Q>,
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>
impl<K, V, S> MallocSizeOf for HashMapTracedValues<K, V, S>
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> Freeze for HashMapTracedValues<K, V, S>where
S: Freeze,
impl<K, V, S> RefUnwindSafe for HashMapTracedValues<K, V, S>
impl<K, V, S> Send for HashMapTracedValues<K, V, S>
impl<K, V, S> Sync for HashMapTracedValues<K, V, S>
impl<K, V, S> Unpin for HashMapTracedValues<K, V, S>
impl<K, V, S> UnwindSafe for HashMapTracedValues<K, V, S>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)source§impl<T> Filterable for T
impl<T> Filterable for T
source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
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> 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 moresource§impl<T> MaybeBoxed<Box<T>> for T
impl<T> MaybeBoxed<Box<T>> for T
source§fn maybe_boxed(self) -> Box<T>
fn maybe_boxed(self) -> Box<T>
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 P
impl<R, P> ReadPrimitive<R> for P
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()
.