stash 0.1.5

An amortized `O(1)` table for cases where you don't need to choose the keys and want something faster than a HashTable.
Documentation 
# 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](https://stebalien.github.io/stash-rs/stash/)
documentation for a more detailed description.

# Authors

* Steven Allen <steven@stebalien.com>
* Robbepop <robbepop@web.de>
* Shane Pearman <spearman@github.com>
* Simon Persson <simon.persson@mykolab.com>