Lines Matching full:weak

1 //! This library offers a variety of weak hash tables:
3 //!   - For a hash map where the keys are held by weak pointers and compared by key value, see
6 //!   - For a hash map where the keys are held by weak pointers and compared by pointer, see
9 //!   - For a hash map where the values are held by weak pointers, see
12 //!   - For a hash map where the keys and values are both held by weak pointers and the keys are
16 //!   - For a hash map where the keys and values are both held by weak pointers and the keys are
20 //!   - For a hash set where the elements are held by weak pointers and compared by element value, …
23 //!   - For a hash set where the elements are held by weak pointers and compared by pointer, see
26 //! To add support for your own weak pointers, see
48 //! `weak-table` is built with the `std` feature, which enables
58 //! Here we create a weak hash table mapping strings to integers.
60 //! This is because the map holds the strings as `std::sync::Weak<str>`s.
64 //! use std::sync::{Arc, Weak};
66 //! let mut table = <WeakKeyHashMap<Weak<str>, u32>>::new();
87 //! Here we use a weak hash set to implement a simple string interning facility:
92 //! use std::rc::{Rc, Weak};
113 //! pub struct SymbolTable(WeakHashSet<Weak<str>>);
144 #![doc(html_root_url = "https://docs.rs/weak-table/0.3.2")]
171 /// A hash map with weak keys, hashed on key value.
173 /// When a weak pointer expires, its mapping is lazily removed.
186 /// A hash map with weak keys, hashed on key pointer.
188 /// When a weak pointer expires, its mapping is lazily removed.
194 /// use std::rc::{Rc, Weak};
196 /// type Table = PtrWeakKeyHashMap<Weak<str>, usize>;
217 /// A hash map with weak values.
219 /// When a weak pointer expires, its mapping is lazily removed.
232 /// A hash map with weak keys and weak values, hashed on key value.
234 /// When a weak pointer expires, its mapping is lazily removed.
247 /// A hash map with weak keys and weak values, hashed on key pointer.
249 /// When a weak pointer expires, its mapping is lazily removed.
255 /// A hash set with weak elements, hashed on element value.
257 /// When a weak pointer expires, its mapping is lazily removed.
261 /// A hash set with weak elements, hashed on element pointer.
263 /// When a weak pointer expires, its mapping is lazily removed.