Persistent Fast Amortized Stack and Queue Data Structures

Provides fast, persistent (side-effect-free) stack, queue and deque (double-ended-queue) data structures. While deques include a superset of functionality provided by queues, in these implementations queues are more efficient in some specialized situations. See the documentation for rstack, rdeque, and rpqueue for details.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.1.1 by Shawn T. O'Neil, 7 years ago

Report a bug at

Browse source code at

Authors: Shawn T. O'Neil

Documentation:   PDF Manual  

MIT + file LICENSE license

Depends on utils

Suggests testthat

Imported by RLogicalOps, delayed.

See at CRAN