customized vector: o(1) deletion

[icegood]

Is it somewhere implemented customized vectior container with o(1) deletion operation and invalidation of only of last and end iterators?

[icegood]

std::swap( container.back(), *iterator );
container.pop_back()

is a solution

[Peter87]

In this situation I think it's better to move the object instead of using swap.

*iterator = std::move(container.back());
container.pop_back();

[cire]

In C++11, std::swap already takes advantage of move semantics. resize is probably more appropriate than pop_back, though. Do we really want to generate a copy if we're worried about performance?

[Peter87]

In C++11, std::swap already takes advantage of move semantics.

Yes, but swap might do more work because it will move a value to the soon-to-be-popped last element.

[helios]

Do we really want to generate a copy if we're worried about performance?

The STL pop*() functions are named somewhat wrong, since they don't return anything. pop_back() is equivalent to resize(size() - 1).

[cire]

I've been spending too much time with Python lately, I guess. ;)