An efficient unordered dynamically-sized data structure.
| Method | Time |
|---|---|
| get | O(1) |
| insert | O(1) |
| remove | O(1) |
| grow | O(k) |
| shrink | O(k) |
k- original capacity
- Due to compaction on removal, this is essentially disregarded, resulting in incredibly fast iteration.
atomic- usesstd::sync::Arcinstead of the defaultstd::rc::Rcfor thread safety.clone- allowsValueIndexto be cloneable, allowing for greater versatility.get(default) - Obtain a reference from the bucket at the indexed position.