Struct HashMapTracedValues

pub(crate) struct HashMapTracedValues<K, V, S = RandomState>(pub(crate) HashMap<K, V, S>);

HashMap wrapper, that has non-jsmanaged keys

Not all methods are reexposed, but you can access inner type via .0 If you need cryptographic secure hashs, or your keys are arbitrary large inputs stick with the default hasher. Otherwise, stronlgy think about using FxHashBuilder with new_fx()

Tuple Fields

0: HashMap<K, V, S>

Implementations

impl<K, V> HashMapTracedValues<K, V, RandomState>

pub(crate) fn new() -> HashMapTracedValues<K, V, RandomState>

Wrapper for HashMap::new()

impl<K, V> HashMapTracedValues<K, V, FxBuildHasher>

pub(crate) fn new_fx() -> HashMapTracedValues<K, V, FxBuildHasher>

impl<K, V, S> HashMapTracedValues<K, V, S>

pub(crate) fn iter(&self) -> Iter<'_, K, V>

pub(crate) fn drain(&mut self) -> Drain<'_, K, V>

pub(crate) fn is_empty(&self) -> bool

impl<K, V, S> HashMapTracedValues<K, V, S>

where K: Eq + Hash, S: BuildHasher,

pub(crate) fn insert(&mut self, k: K, v: V) -> Option<V>

pub(crate) fn get<Q>(&self, k: &Q) -> Option<&V>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub(crate) fn get_mut<Q: Hash + Eq + ?Sized>(&mut self, k: &Q) -> Option<&mut V>

where K: Borrow<Q>,

pub(crate) fn contains_key<Q: Hash + Eq + ?Sized>(&self, k: &Q) -> bool

where K: Borrow<Q>,

pub(crate) fn remove<Q: Hash + Eq + ?Sized>(&mut self, k: &Q) -> Option<V>

where K: Borrow<Q>,

pub(crate) fn entry(&mut self, key: K) -> Entry<'_, K, V>

Trait Implementations

impl<K: Clone, V: Clone, S: Clone> Clone for HashMapTracedValues<K, V, S>

fn clone(&self) -> HashMapTracedValues<K, V, S>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug, V: Debug, S: Debug> Debug for HashMapTracedValues<K, V, S>

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

Formats the value using the given formatter.

impl<K, V, S: Default> Default for HashMapTracedValues<K, V, S>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, S> MallocSizeOf for HashMapTracedValues<K, V, S>

where K: Eq + Hash + MallocSizeOf, V: MallocSizeOf, S: BuildHasher,

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.

impl<K, V: JSTraceable, S> Traceable for HashMapTracedValues<K, V, S>

unsafe fn trace(&self, trc: *mut JSTracer)

Trace self.