onebuck 0.1.2

An efficient unordered dynamically-sized data structure.
Documentation

onebuck

Crate

An efficient unordered dynamically-sized data structure.

Time Complexity

Method Time
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.