# onebuck
[](https://crates.io/crates/onebuck)
An efficient unordered dynamically-sized data structure.
## Time Complexity
| insert | O(1) |
| remove | O(1) |
| grow | O(k) |
| shrink | O(k) |
- k => original capacity
## Memory Fragmentation
- Due to compaction on removal, this is essentially disregarded, resulting in incredibly fast iteration.