No title available
Keni
styofa doing anything

pixel skylines
todays bird
wallacepolsom

oozey mess
sheepfilms
trying on a metaphor
KIROKAZE

Kaledo Art

Andulka

⁂

Origami Around

@theartofmadeline
One Nice Bug Per Day
Lint Roller? I Barely Know Her
d e v o n
Game of Thrones Daily
Peter Solarz
seen from Türkiye
seen from Brazil
seen from United States
seen from United States

seen from Brazil
seen from United States
seen from Tajikistan
seen from United States

seen from Malaysia

seen from Brazil
seen from Malaysia

seen from Australia
seen from United States
seen from United States

seen from United Kingdom

seen from France
seen from Germany
seen from United States

seen from France
seen from United States
@dafukinsun
Standard-library sort function can not be used to sort values that are stored in a list.
std::list provides its own sort member function, which uses an algorithm that is optimized for sorting data stored in a list.
Operations erase and push_back for std::list do not invalidate iterators to other elements
std::list does not support indexing
std::vector does
std::list is optimized for fast insertion and deletion anywhere within the container
std::vector.erase
erase returns an iterator that is positioned on the element that follows the one that we just erased
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).
std::vector is optimized for fast random access