Mar 4, 2017
std::vector.erase
erase returns an iterator that is positioned on the element that follows the one that we just erased
Loading...
seen from Philippines
seen from United States
seen from United States
seen from United States
seen from United States
seen from China
seen from United States
seen from Malaysia
seen from Türkiye
seen from Pakistan
seen from Türkiye
seen from United States
seen from United States
seen from Malaysia
seen from India
seen from France
seen from United States
seen from China
seen from Netherlands
seen from Kazakhstan
std::vector.erase
erase returns an iterator that is positioned on the element that follows the one that we just erased
Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
std::vector.erase is slow
O(n^2) algorithmÂ
Because vectors use an array as their underlying storage, erasing elements in positions other than the vector end causes the container to relocate all the elements after the segment erased to their new positions. This is generally an inefficient operation compared to the one performed for the same operation by other kinds of sequence containers (such as list or forward_list).