Learn R Programming

rstackdeque (version 1.1.1)

Persistent Fast Amortized Stack and Queue Data Structures

Description

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.

Copy Link

Version

Install

install.packages('rstackdeque')

Monthly Downloads

598

Version

1.1.1

License

MIT + file LICENSE

Issues

0

Pull Requests

0

Stars

31

Forks

4

Maintainer

Shawn T ONeil

Last Published

April 13th, 2015

Functions in rstackdeque (1.1.1)

insert_back.rpqueue

Insert an element into the back of an rpqueue
insert_back.rdeque

Insert an element into the back of an rdeque
as.list.rstack

Convert an rstack to a list
as.data.frame.rstack

Convert an rstack to a data.frame
head.rstack

Return the head (top) of an rstack
insert_back

Insert an element into the back of an rdeque or rpqueue
as.rstack.default

Default method for converting to an rstack
rstack

Create a new, empty rstack
peek_front.rdeque

Return the data element at the front of an rdeque
without_back

Return a version of an rdeque without the back element
insert_front.rdeque

Insert an element into the front of an rdeque
as.data.frame.rpqueue

Convert an rpqueue to a data.frame
as.rdeque.default

Default method for converting to an rdeque
peek_back

Return the data element at the back of an rdeque
as.rpqueue

Create a pre-filled rpqueue from a given input
print.rstack

Print an rstack
fixd

Fix an rdeque
without_front.rpqueue

Return a version of an rpqueue without the front element
peek_back.rdeque

Return the data element at the back of an rdeque
without_front.rdeque

Return a version of an rdeque without the front element
empty.rstack

Check if an rstack is empty
rotate.rpqueue

Maintenance function for rpqueues
peek_back<-

Assign to/modify the back of an rdeque
peek_front<-.rdeque

Assign to/modify the front of an rdeque
peek_top<-.rstack

Assign to/modify the top of an rstack
peek_front

Return the data element at the front of an rdeque
as.list.rpqueue

Convert an rpqueue to a list
empty

Check if an rstack, rdeque, or rpqueue is empty
as.list.rdeque

Convert an rdeque to a list
as.rdeque

Create a pre-filled rdeque from a given input
makeequal.rpqueue

Maintenance function for rpqueues
head.rdeque

Return the first n elements of an rdeque as an rdeque
peek_front<-.rpqueue

Assign to/modify the front of an rpqueue
insert_top

Insert an element onto the top of an rstack
head.rpqueue

Return the head (front) of an rpqueue
without_top

Return a version of an rstack without the top element
peek_front.rpqueue

Return the data element at the front of an rpqueue
insert_top.rstack

Insert an element onto the top of an rstack
without_front

Return a version of an rdeque or rpqueue without the front element
rev.rstack

Reverse an rstack
rstacknode

Internal structure used by rstacks, rdeques, and rpqueues
rpqueue

Create a new empty rpqueue
print.rdeque

Print an rdeque
peek_top<-

Assign to/modify the top of an rstack
without_top.rstack

Return a version of an rstack without the top element
peek_top

Return the data element at the top of an rstack
peek_back<-.rdeque

Assign to/modify the back of an rdeque
fixd.rdeque

Fix an rdeque
peek_front<-

Assign to/modify the front of an rdeque or rpqueue
as.rpqueue.default

Default method for converting to an rpqueue
as.rstack

Create an rstack pre-filled from a given input
rdeque

Create a new empty rdeque
length.rpqueue

Return the number of elements in an rpqueue
print.rpqueue

Print an rpqueue
rotate

Generic maintenance function for rpqueues
length.rdeque

Return the number of elements in an rdeque
as.data.frame.rdeque

Convert an rdeque to a data.frame
empty.rdeque

Check if an rdeque is empty
insert_front

Insert an element into the front of an rdeque
without_back.rdeque

Return a version of an rdeque without the back element
empty.rpqueue

Check if an rpqueue is empty
length.rstack

Return the number of elements in an rstack
peek_top.rstack

Return the data element at the top of an rstack
makeequal

Generic maintenance function for rpqueues