Množina: deques
Short for double-ended que. A form of the queue data structure that can have elements added to or removed from either end of the list. See also queue.
Abbreviation for Double Ended Queue.
As a vector, decue suports random access iterators. But in addition to the vector, which only allows constant time insert and erase operations at the end, a deque supports the constant time execution of these operations at the end as well as at the beginning. Insert and erase in the middle take constant time.