dequer (version 2.0-2)

stack: stack

Description

A stack is a "last in, first out" (LIFO) abstract data type. New items are added to the front of the stack via push(). Items are removed from the stack at the front via pop().

The implementation is a head/tail doubly linked list.

Usage

stack()

Details

A constructor for a stack.

Examples

# NOT RUN {
library(dequer)
s <- stack()
s
# }
# NOT RUN {
# }