Nothing
Provides fast, side-effect free data structures, including catenable named lists, priority queues, double-ended queues, ordered sequences, and interval indices. Implementation is based on the finger-tree data structure of Hinze and Paterson (2006) <doi:10.1017/S0956796805005769>.
Package details |
|
|---|---|
| Author | Shawn T. O'Neil [aut, cre] |
| Maintainer | Shawn T. O'Neil <shawn@tislab.org> |
| License | MIT + file LICENSE |
| Version | 1.0.1 |
| URL | https://oneilsh.github.io/immutables/ https://github.com/oneilsh/immutables |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.