stack-class: Stack class

In datastructures: Implementation of Core Data Structures

Description

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

Slots

.deque

C++ object representing a deque

See Also

stack for creating a new stack object.

datastructures documentation built on Aug. 10, 2020, 5:08 p.m.