rstackdeque: 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.

Version: 1.1.1
Depends: utils
Suggests: testthat
Published: 2015-04-13
DOI: 10.32614/CRAN.package.rstackdeque
Author: Shawn T. O'Neil
Maintainer: Shawn T. O'Neil <shawn.oneil at>
License: MIT + file LICENSE
NeedsCompilation: no
CRAN checks: rstackdeque results


Reference manual: rstackdeque.pdf


Package source: rstackdeque_1.1.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): rstackdeque_1.1.1.tgz, r-oldrel (arm64): rstackdeque_1.1.1.tgz, r-release (x86_64): rstackdeque_1.1.1.tgz, r-oldrel (x86_64): rstackdeque_1.1.1.tgz
Old sources: rstackdeque archive

Reverse dependencies:

Reverse imports: delayed, RLogicalOps, SiPhyNetwork


Please use the canonical form to link to this page.