queue-class {datastructures}R Documentation

Queue class

Description

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.

Slots

.deque

C++ object representing a deque

See Also

queue for creating a new queue object.


[Package datastructures version 0.2.8 Index]