An unordered map and set type implemented as hash tables
The tables use a keyed hash with new random keys generated for each container, so the ordering of a set of keys in a hash table is randomized.
| HashMap | A hash map implementation which uses linear probing along with the SipHash hash function for internal state. This means that the order of all hash maps is randomized by keying each hash map randomly on creation. |
| HashMapIterator | HashMap iterator |
| HashMapMoveIterator | HashMap move iterator |
| HashMapMutIterator | HashMap mutable values iterator |
| HashSet | An implementation of a hash set using the underlying representation of a
HashMap where the value is (). As with the |
| HashSetIterator | HashSet iterator |
| HashSetMoveIterator | HashSet move iterator |
| SetAlgebraIter | Set operations iterator |
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct (or str), enum,
trait, typedef (or
tdef).