queue-class

Implementation of a queue data structure, i.e. a list
 implementation with FIFO principle. <code>queue</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" stack'="" data-mini-rdoc="datastructures::"></a>'>stack</code> for a class using
 the LIFO 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

queue-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 queue data structure, i.e. a list
 implementation with FIFO principle. <code>queue</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='stack'></a>'>stack</a></code> for a class using
 the LIFO principle.

queue-class: Queue class

Description

Arguments

Slots

See Also