queue-class: Queue class

Description Slots


Implementation of a queue data structure, i.e. a list implementation with FIFO principle. queue uses a std::deque as default container, so inserting, peeking and popping functions require constant O(1). See stack for a class using the LIFO principle.



C++ object representing a deque


the class of the keys

datastructures documentation built on July 16, 2017, 1:03 a.m.