stack-class

Implementation of a stack data structure, i.e. a list
 implementation with LIFO principle. <code>stack</code> uses a <code>std::deque</code>
 as default container, so inserting, peeking and popping functions require
 constant O(1). See <code><a href="/link/?package=datastructures&version=0.2.9" queue'="" data-mini-rdoc="datastructures::"></a>'>queue</code> for a class using
 the FIFO principle.

Implementation of advanced data structures such as hashmaps,
heaps, or queues. Advanced data structures are essential
in many computer science and statistics problems, for example graph
algorithms or string analysis. The package uses 'Boost' and 'STL' data
types and extends these to R with 'Rcpp' modules.

Simon Dirmeier

datastructures

Implementation of Core Data Structures

stack-class function

<dl class="dl-horizontal">
<dt><code>.deque</code></dt><dd><code>C++</code> object representing a deque</dd>
</dl>

Slots

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

stack-class: Stack class

Description

Arguments

Slots

See Also