Deque is sometimes thought of as an dynamic array that is comprised of linked arrays.
Such a structure could lead to extremely fast insert and remove operations.
Exactly what performance should one expect from a std::deque implementation though?
 |
| typical deque layout |
Such a structure could lead to extremely fast insert and remove operations.
Exactly what performance should one expect from a std::deque implementation though?
