refqueue: An impure (modify-by-reference), single-ended queue,...
In crowding/lazr: Lazy and purely functional data structures for R
Description
Usage
Value
Author(s)
Description
An impure (modify-by-reference), single-ended queue,
implemented using lazy pairs.
Usage
1
refqueue()
Value
A list with four functions as elements; append,
pop, \push, and has.
appendplaces v at the
tail of the queue.
pop()removes an
element from the head quese and returns it.
push(c)places v at the head of the
queue.
has() returns TRUE if any
elements are in the queue.
Removing from the tail of the queue is not supported. (A
double-ended queue will be added.)
Author(s)
Peter Meilstrup
crowding/lazr documentation built on May 14, 2019, 11:33 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Value Author(s)
Description
An impure (modify-by-reference), single-ended queue, implemented using lazy pairs.
Usage
1 | refqueue()
|
Value
A list with four functions as elements; append,
pop, \push, and has.
appendplacesvat the tail of the queue.pop()removes an element from the head quese and returns it.push(c)placesvat the head of the queue.has()returnsTRUEif any elements are in the queue.
Removing from the tail of the queue is not supported. (A double-ended queue will be added.)
Author(s)
Peter Meilstrup
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.