15 Oct
2016
15 Oct
'16
4:02 a.m.
On 15 October 2016 at 05:43, Michael Marcin
This is decent start but has several issues including: * nothing to preserve the invariant keeping the arrays the same length * missing coalesced interface for vector methods (size, reserve, etc) * no iterator * wasted storage for duplicated allocators, capacities, sizes * sizeof...(Ts) allocations could be a single large block
<snip> Does this already exist somewhere?
A std::deque that exposes it's chunks (and hopefully chunk-size)? Does it seem useful?
To me yes... I was working on something similar, but with the added requirement that deletion does not (necesarilly) change the indices of the remaining elements. degski