weak-table 0.4.0-pre1

Weak hash maps and sets
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

//! Internal implementation for weak tables, based on [`hashbrown`].
//!
//! Rather than write our own hashtable implementation,
//! we're using `hashbrown` as a backend,
//! since it uses a lot of tricky techniques (SIMD! Swisstables!)
//! to keep performance high.
//! (It's also the backend used by Rust's standard library.)
//!
//! To avoid duplicated code,
//! we define a single [`Table`] type to serve as the backend for all of our weak tables,
//! and a pair of wrappers for [`Weak`] and [`Owned`] keys and values to hide
//! the difference between the two types.
//! These wrapper types implement internal [`Element`] and [`Key`] traits
//! that the table code uses.
//!
//! For example, a [`WeakKeyHashMap`] is internally implemented as a
//! `Table<Weak<K>, Owned<V>>`.
//!
//! [`WeakKeyHashMap`]: super::WeakKeyHashMap
mod table;
mod wrappers;

pub(crate) use table::*;
pub(crate) use wrappers::*;

/// Alias for a weak wrapper for a key.
///
/// Since this is a key, we need to store its hash.
pub(crate) type WeakK<T> = Weak<T, u64>;

/// Alias for a weak wrapper for a value.
///
/// Since this is a value, we do not need to store its hash.
pub(crate) type WeakV<T> = Weak<T, ()>;