makequeue: Efficient implementation of a standard FIFO queue using...
In edahelsinki/cyclesampler: Randomization Algorithms for Large Sparse Matrices
Description
Usage
Arguments
Value
Description
Efficient implementation of a standard FIFO queue using cyclic
array.
Usage
1
makequeue(size)
Arguments
size
maximum size of the queue.
Value
Returns methods $isempty(), $push(x), and $eject().
edahelsinki/cyclesampler documentation built on June 9, 2019, 10:51 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 Arguments Value
Description
Efficient implementation of a standard FIFO queue using cyclic array.
Usage
1 | makequeue(size)
|
Arguments
size |
maximum size of the queue. |
Value
Returns methods $isempty(), $push(x), and $eject().
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.