rstackdeque: Persistent Fast Amortized Stack and Queue Data Structures
Version 1.1.1

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.

AuthorShawn T. O'Neil
Date of publication2015-04-13 22:27:44
MaintainerShawn T. O'Neil <shawn.oneil@cgrb.oregonstate.edu>
LicenseMIT + file LICENSE
Version1.1.1
URL https://github.com/oneilsh/rstackdeque
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("rstackdeque")

Popular man pages

as.data.frame.rpqueue: Convert an rpqueue to a data.frame
empty.rpqueue: Check if an rpqueue is empty
empty.rstack: Check if an rstack is empty
insert_back: Insert an element into the back of an rdeque or rpqueue
insert_back.rdeque: Insert an element into the back of an rdeque
insert_top: Insert an element onto the top of an rstack
peek_front.rdeque: Return the data element at the front of an rdeque
See all...

All man pages Function index File listing

Man pages

as.data.frame.rdeque: Convert an rdeque to a data.frame
as.data.frame.rpqueue: Convert an rpqueue to a data.frame
as.data.frame.rstack: Convert an rstack to a data.frame
as.list.rdeque: Convert an rdeque to a list
as.list.rpqueue: Convert an rpqueue to a list
as.list.rstack: Convert an rstack to a list
as.rdeque: Create a pre-filled rdeque from a given input
as.rdeque.default: Default method for converting to an rdeque
as.rpqueue: Create a pre-filled rpqueue from a given input
as.rpqueue.default: Default method for converting to an rpqueue
as.rstack: Create an rstack pre-filled from a given input
as.rstack.default: Default method for converting to an rstack
empty: Check if an rstack, rdeque, or rpqueue is empty
empty.rdeque: Check if an rdeque is empty
empty.rpqueue: Check if an rpqueue is empty
empty.rstack: Check if an rstack is empty
fixd: Fix an rdeque
fixd.rdeque: Fix an rdeque
head.rdeque: Return the first n elements of an rdeque as an rdeque
head.rpqueue: Return the head (front) of an rpqueue
head.rstack: Return the head (top) of an rstack
insert_back: Insert an element into the back of an rdeque or rpqueue
insert_back.rdeque: Insert an element into the back of an rdeque
insert_back.rpqueue: Insert an element into the back of an rpqueue
insert_front: Insert an element into the front of an rdeque
insert_front.rdeque: Insert an element into the front of an rdeque
insert_top: Insert an element onto the top of an rstack
insert_top.rstack: Insert an element onto the top of an rstack
length.rdeque: Return the number of elements in an rdeque
length.rpqueue: Return the number of elements in an rpqueue
length.rstack: Return the number of elements in an rstack
makeequal: Generic maintenance function for rpqueues
makeequal.rpqueue: Maintenance function for rpqueues
peek_back: Return the data element at the back of an rdeque
peek_back.rdeque: Return the data element at the back of an rdeque
peek_back-set: Assign to/modify the back of an rdeque
peek_back-set-.rdeque: Assign to/modify the back of an rdeque
peek_front: Return the data element at the front of an rdeque
peek_front.rdeque: Return the data element at the front of an rdeque
peek_front.rpqueue: Return the data element at the front of an rpqueue
peek_front-set: Assign to/modify the front of an rdeque or rpqueue
peek_front-set-.rdeque: Assign to/modify the front of an rdeque
peek_front-set-.rpqueue: Assign to/modify the front of an rpqueue
peek_top: Return the data element at the top of an rstack
peek_top.rstack: Return the data element at the top of an rstack
peek_top-set: Assign to/modify the top of an rstack
peek_top-set-.rstack: Assign to/modify the top of an rstack
print.rdeque: Print an rdeque
print.rpqueue: Print an rpqueue
print.rstack: Print an rstack
rdeque: Create a new empty rdeque
rev.rstack: Reverse an rstack
rotate: Generic maintenance function for rpqueues
rotate.rpqueue: Maintenance function for rpqueues
rpqueue: Create a new empty rpqueue
rstack: Create a new, empty rstack
rstacknode: Internal structure used by rstacks, rdeques, and rpqueues
without_back: Return a version of an rdeque without the back element
without_back.rdeque: Return a version of an rdeque without the back element
without_front: Return a version of an rdeque or rpqueue without the front...
without_front.rdeque: Return a version of an rdeque without the front element
without_front.rpqueue: Return a version of an rpqueue without the front element
without_top: Return a version of an rstack without the top element
without_top.rstack: Return a version of an rstack without the top element

Functions

as.data.frame.rdeque Man page Source code
as.data.frame.rpqueue Man page Source code
as.data.frame.rstack Man page Source code
as.list.rdeque Man page Source code
as.list.rpqueue Man page Source code
as.list.rstack Man page Source code
as.rdeque Man page Source code
as.rdeque.default Man page Source code
as.rpqueue Man page Source code
as.rpqueue.default Man page Source code
as.rstack Man page Source code
as.rstack.default Man page Source code
empty Man page Source code
empty.rdeque Man page Source code
empty.rpqueue Man page Source code
empty.rstack Man page Source code
fixd Man page Source code
fixd.rdeque Man page Source code
head.rdeque Man page Source code
head.rpqueue Man page Source code
head.rstack Man page Source code
insert_back Man page Source code
insert_back.rdeque Man page Source code
insert_back.rpqueue Man page Source code
insert_front Man page Source code
insert_front.rdeque Man page Source code
insert_top Man page Source code
insert_top.rstack Man page Source code
length.rdeque Man page Source code
length.rpqueue Man page Source code
length.rstack Man page Source code
makeequal Man page Source code
makeequal.rpqueue Man page Source code
peek_back Man page Source code
peek_back.rdeque Man page Source code
peek_back<- Man page
peek_back<-.rdeque Man page
peek_front Man page Source code
peek_front.rdeque Man page Source code
peek_front.rpqueue Man page Source code
peek_front<- Man page
peek_front<-.rdeque Man page
peek_front<-.rpqueue Man page
peek_top Man page Source code
peek_top.rstack Man page Source code
peek_top<- Man page
peek_top<-.rstack Man page
print.rdeque Man page Source code
print.rpqueue Man page Source code
print.rstack Man page Source code
rdeque Man page Source code
rev.rstack Man page Source code
rotate Man page Source code
rotate.rpqueue Man page Source code
rpqueue Man page Source code
rstack Man page Source code
rstacknode Man page Source code
without_back Man page Source code
without_back.rdeque Man page Source code
without_front Man page Source code
without_front.rdeque Man page Source code
without_front.rpqueue Man page Source code
without_top Man page Source code
without_top.rstack Man page Source code

Files

tests
tests/testthat.R
tests/testthat
tests/testthat/test.rpqueue.R
tests/testthat/test.stack.R
tests/testthat/test.rdeque.R
NAMESPACE
R
R/as.rpqueue.default.R
R/fixd.rdeque.R
R/insert_front.R
R/rstacknode.R
R/empty.R
R/empty.rstack.R
R/as.rpqueue.R
R/as.data.frame.rdeque.R
R/without_front.R
R/peek_back-set.rdeque.R
R/makeequal.rpqueue.R
R/as.rstack.R
R/as.list.rdeque.R
R/peek_front.rpqueue.R
R/peek_front-set.rpqueue.R
R/without_top.rstack.R
R/peek_top.R
R/as.rstack.default.R
R/peek_back-set.R
R/peek_top-set.R
R/insert_back.R
R/head.rstack.R
R/length.rpqueue.R
R/peek_front.rdeque.R
R/peek_top-set.rstack.R
R/as.data.frame.rpqueue.R
R/insert_top.R
R/rdeque.R
R/empty.rdeque.R
R/peek_front-set.R
R/head.rdeque.R
R/print.rdeque.R
R/rotate.R
R/insert_back.rpqueue.R
R/insert_back.rdeque.R
R/length.rdeque.R
R/without_back.rdeque.R
R/makeequal.R
R/empty.rpqueue.R
R/as.rdeque.default.R
R/as.rdeque.R
R/as.data.frame.rstack.R
R/peek_front-set.rdeque.R
R/head.rpqueue.R
R/peek_back.R
R/insert_front.rdeque.R
R/print.rstack.R
R/as.list.rpqueue.R
R/rev.rstack.R
R/without_front.rpqueue.R
R/as.list.rstack.R
R/without_front.rdeque.R
R/print.rpqueue.R
R/rpqueue.R
R/fixd.R
R/rstack.R
R/without_top.R
R/insert_top.rstack.R
R/peek_back.rdeque.R
R/without_back.R
R/length.rstack.R
R/peek_top.rstack.R
R/rotate.rpqueue.R
R/peek_front.R
MD5
DESCRIPTION
man
man/insert_back.rdeque.Rd
man/insert_top.rstack.Rd
man/as.list.rdeque.Rd
man/without_front.rdeque.Rd
man/insert_back.Rd
man/as.data.frame.rdeque.Rd
man/empty.rpqueue.Rd
man/head.rpqueue.Rd
man/without_front.rpqueue.Rd
man/peek_front-set-.rpqueue.Rd
man/empty.rdeque.Rd
man/peek_top-set-.rstack.Rd
man/peek_front.rdeque.Rd
man/without_front.Rd
man/without_top.rstack.Rd
man/print.rdeque.Rd
man/rev.rstack.Rd
man/as.data.frame.rpqueue.Rd
man/peek_back.Rd
man/peek_back-set.Rd
man/fixd.rdeque.Rd
man/without_top.Rd
man/as.list.rstack.Rd
man/peek_front.Rd
man/rotate.Rd
man/as.rpqueue.Rd
man/peek_top.rstack.Rd
man/insert_top.Rd
man/print.rpqueue.Rd
man/as.rdeque.Rd
man/empty.Rd
man/peek_back-set-.rdeque.Rd
man/empty.rstack.Rd
man/rotate.rpqueue.Rd
man/length.rdeque.Rd
man/rstacknode.Rd
man/as.rstack.default.Rd
man/as.rdeque.default.Rd
man/fixd.Rd
man/as.rpqueue.default.Rd
man/rdeque.Rd
man/as.rstack.Rd
man/rpqueue.Rd
man/as.data.frame.rstack.Rd
man/peek_front-set.Rd
man/makeequal.rpqueue.Rd
man/insert_back.rpqueue.Rd
man/without_back.Rd
man/head.rstack.Rd
man/peek_front-set-.rdeque.Rd
man/length.rstack.Rd
man/head.rdeque.Rd
man/peek_top-set.Rd
man/as.list.rpqueue.Rd
man/insert_front.rdeque.Rd
man/length.rpqueue.Rd
man/print.rstack.Rd
man/without_back.rdeque.Rd
man/makeequal.Rd
man/peek_back.rdeque.Rd
man/peek_front.rpqueue.Rd
man/insert_front.Rd
man/rstack.Rd
man/peek_top.Rd
LICENSE
rstackdeque documentation built on May 19, 2017, 3:07 p.m.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.