[][src]Crate succinct_vec

The SuccinctVec behaves like a Vec with smaller asymptotic memory overhead. It offers amortized constant time push and pop and constant worst-case time indexed access with O(sqrt n) asymptotic memory overhead.

Structs

SuccinctVec

SuccinctVec guarantees O(1) amortized push and pop and worst-case O(1) indexed access. The memory overhead is guaranteed to be O(sqrt n) where n is the length of the data structure, in contrast to Vecs linear overhead.