stack-class: Stack class
In dirmeier/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
.dequeC++ object representing a deque
See Also
stack for creating a new stack object.
dirmeier/datastructures documentation built on Aug. 9, 2020, 2:55 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
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
.dequeC++object representing a deque
See Also
stack for creating a new stack object.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.