Исправление jeuta, (текущая версия) :
https://en.cppreference.com/w/cpp/container/deque
...deques typically have large minimal memory cost; a deque holding just one element has to allocate its full internal array (e.g. 8 times the object size on 64-bit libstdc++; 16 times the object size or 4096 bytes, whichever is larger, on 64-bit libc++). ...
Двусвязный список, но из блоков по 8 (gcc) или 16 (clang) элементов
Исходная версия jeuta, :
https://en.cppreference.com/w/cpp/container/deque
...deques typically have large minimal memory cost; a deque holding just one element has to allocate its full internal array (e.g. 8 times the object size on 64-bit libstdc++; 16 times the object size or 4096 bytes, whichever is larger, on 64-bit libc++). ...
Двусвязный список, но из блоками по 8 (gcc) или 16 (clang) элементов