In the C++ STL, double ended queues (deque) can be used very similar to vectors.
With the addition that elements can also be added at the beginning.
In terms of insertion and deletion of elements, a deque is faster than a vector.
00:00 Intro
00:29 Declaring a deque
01:00 Adding new elements push_front(), emplace_front(), push_back(), emplace_back(),
02:43 Removing elements: pop_front(), pop_back()
03:47 Iterator operations: insert(), erase()
06:07 Size operations: size(), max_size()
06:54 Summary of deque
Tools that I use:
https://www.virtualbox.org/
https://kubuntu.org/
https://code.visualstudio.com/
https://llvm.org/
http://clang.org/
https://mesonbuild.com/index.html
In code:
https://github.com/renatoGarcia/icecream-cpp
https://github.com/ZenSepiol
https://github.com/ocornut/imgui
https://github.com/epezent/implot
