rand_map 0.1.1

A map that creates a random handle on insertion to use when retrieving

Coverage
83.33%
15 out of 18 items documented1 out of 17 items with examples
Size
Source code size: 14.48 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 4.09 MB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 18s Average build duration of successful builds.
all releases: 18s Average build duration of successful builds in releases after 2024-10-23.
Links
andersjl/rand_map
0 0 0
crates.io
Dependencies
Versions
- 0.1.1 (2025-08-30)
- 0.1.0 (2022-06-13)
Owners

A map that creates a random handle on insertion to use when retrieving.

The raison d'être for this map is:

You want to put something in a map, but you have no key. Means you do not want to use a HashMap or BTreeMap .
You want to forget the details of what you put in to later retrieve it with a simple handle, and you are not interested in how many equal objects you insert. Means you do not want to use a HashSet or HashMultiSet .
You want a persistent handle to refer to the item you put in the map. Means you do not want to use a Vec.

The implementation uses a HashMap that does not actually hash. The contained HashMap can be borrowed (.as_hash_map()), so all HashMap functions that do not change the map are at your disposal.