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.


News

Reference manual

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

install.packages("rstackdeque")

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


https://github.com/oneilsh/rstackdeque


Report a bug at https://github.com/oneilsh/rstackdeque/issues


Browse source code at https://github.com/cran/rstackdeque


Authors: Shawn T. O'Neil


Documentation:   PDF Manual  


MIT + file LICENSE license


Depends on utils

Suggests testthat


Imported by RLogicalOps.


See at CRAN