Does std::vector *have* to move objects when growing capacity? Or, can allocators "reallocate"?
allocator, c++, realloc, vector
Solution
When `std::vector<T>` runs out of capacity it has to allocate a new block. You have correctly covered the reasons.
IMO it would make sense to augment the allocator interface. Two of us tried to for C++11 and we were unable to gain support for it: [1] [2]
I became convinced that in order to make this work, an additional C-level API would be needed. I failed in gaining support for that as well: [3]
Problem
A different question inspired the following thought: Does `std::vector<T>` have to move all the elements when it increases its capacity? As far as I understand, the standard behaviour is for the underlying allocator to request an entire chunk of the new size, then move all the old elements over, then destroy the old elements and then deallocate the old memory. This behaviour appears to be the only possible correct solution given the standard allocator interface. But I was wondering, would it make sense to amend the allocator to offer a `reallocate(std::size_t)` function which would return a `pair<pointer, bool>` and could map to the underlying `realloc()`? The advantage of this would be that in the event that the OS can actually just extend the allocated memory, then no moving would have to happen at all. The boolean would indicate whether the memory has moved. (`std::realloc()` is maybe not the best choice, because we don't need do copy data if we cannot extend. So in fact we'd rather want something like `extend_or_malloc_new()`. Edit: Perhaps a `is_pod`-trait-based specialization would allow us to use the actual `realloc`, including its bitwise copy. Just not in general.) It seems like a missed opportunity. Worst case, you could always implement `reallocate(size_t n)` as `return make_pair(allocate(n), true);`, so there wouldn't be any penalty. Is there any problem that makes this feature inappropriate or undesirable for C++? Perhaps the only container that could take advantage of this is `std::vector`, but then again that's a fairly useful container. Update: A little example to clarify. Current `resize()`: ``` pointer p = alloc.allocate(new_size); for (size_t i = 0; i != old_size; ++i) { alloc.construct(p + i, T(std::move(buf[i]))) alloc.destroy(buf[i]); } for (size_t i = old_size; i < new_size; ++i) { alloc.construct(p + i, T()); } alloc.deallocate(buf); buf = p; ``` New implementation: ``` pair<pointer, bool> pp = alloc.reallocate(buf, new_size); if (pp.second) { /* as before */ } else { /* only construct new elements */ } ```