#serialization #map

no-std stash

An amortized O(1) table for cases where you don’t need to choose the keys and want something faster than a HashTable

8 releases

0.1.6 Nov 5, 2024
0.1.5 Feb 27, 2023
0.1.4 Jul 5, 2019
0.1.3 Feb 26, 2017
0.0.1 Aug 27, 2016

#354 in Data structures


Used in 2 crates (via addressable-pairing-heap)

MIT/Apache

50KB
1K SLoC

Stash

Stash is a library for storing items where you need (amortized) O(1) 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.

Authors

Dependencies

~165KB