|0.1.5||Feb 27, 2023|
|0.1.4||Jul 5, 2019|
|0.1.3||Feb 26, 2017|
|0.1.0||Aug 27, 2016|
|0.0.1||Aug 27, 2016|
#452 in Data structures
98 downloads per month
Used in 2 crates (via addressable-pairing-heap)
Stash is a library for storing items where you need (amortized)
insertion, deletion, and lookups but don't care about the order of the items and
don't need to be able to choose the keys.
Please see the API documentation for a more detailed description.
- Steven Allen firstname.lastname@example.org
- Robbepop email@example.com
- Shane Pearman firstname.lastname@example.org
- Simon Persson email@example.com
Stash is a library for efficiently storing maps of keys to values when one
doesn't care what the keys are but wants blazing† fast
insertions, deletions, and lookups.
Common use cases include file descriptor tables, session tables, or MIO context tables.
†Blazing means an order of magnitude faster than hash maps and btree maps.