4 releases
0.1.5 | Aug 26, 2024 |
---|---|
0.1.4 | Aug 26, 2024 |
#882 in Data structures
205 downloads per month
16KB
304 lines
onebuck
An efficient unordered dynamically-sized data structure.
Time Complexity
Method | Time |
---|---|
get | O(1) |
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.
Features
atomic
- usesstd::sync::Arc
instead of the defaultstd::rc::Rc
for thread safety.clone
- allowsValueIndex
to be cloneable, allowing for greater versatility.get
(default) - Obtain a reference from the bucket at the indexed position.