stack

<p>A stack is a "last in, first out" (LIFO) abstract data type. New items are
added to the front of the stack via <code>push()</code>. Items are removed from
the stack at the front via <code>pop()</code>.</p>
<p>The implementation is a head/tail doubly linked list.</p>

Queues, stacks, and 'deques' are list-like, abstract data types.
These are meant to be very cheap to "grow", or insert new objects into.
A typical use case involves storing data in a list in a streaming fashion,
when you do not necessarily know how may elements need to be stored.
Unlike R's lists, the new data structures provided here are not
necessarily stored contiguously, making insertions and deletions at the
front/end of the structure much faster.  The underlying implementation
is new and uses a head/tail doubly linked list; thus, we do not rely on R's
environments or hashing.  To avoid unnecessary data copying, most operations
on these data structures are performed via side-effects.

stack: stack

Description

Usage

Arguments

Details

Examples