Efficient data structures for those times when arrays don't cut it. Will include queues, purely functional double-ended queues, double-ended queues with random access/insert/delete/catenate in O(log N), priority queues, and etc. Also includes tools to construct lazy data structures and infinite sequences.
Package details |
|
---|---|
Maintainer | |
License | MIT |
Version | 0.0.1 |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.