Subject: Re: [boost] interest in structure of arrays container?
From: degski (degski_at_[hidden])
Date: 2016-10-15 00:02:08
On 15 October 2016 at 05:43, Michael Marcin <mike.marcin_at_[hidden]> wrote:
> 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
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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk