Fast implementation of a key-value store. Environments are commonly used as key-value stores, but every time a new key is used, it is added to R's global symbol table, causing a small amount of memory leakage. This can be problematic in cases where many different keys are used. Fastmap avoids this memory leak issue by implementing the map using data structures in C++.
| Version: | 1.0.1 |
| Suggests: | testthat (≥ 2.1.1) |
| Published: | 2019-10-08 |
| Author: | Winston Chang [aut, cre], RStudio [cph, fnd], Tessil [cph] (hopscotch_map library) |
| Maintainer: | Winston Chang <winston at rstudio.com> |
| BugReports: | https://github.com/r-lib/fastmap/issues |
| License: | MIT + file LICENSE |
| URL: | https://r-lib.github.io/fastmap/, https://github.com/r-lib/fastmap |
| NeedsCompilation: | yes |
| Materials: | README NEWS |
| CRAN checks: | fastmap results |
| Reference manual: | fastmap.pdf |
| Package source: | fastmap_1.0.1.tar.gz |
| Windows binaries: | r-devel: fastmap_1.0.1.zip, r-release: fastmap_1.0.1.zip, r-oldrel: fastmap_1.0.1.zip |
| macOS binaries: | r-release: fastmap_1.0.1.tgz, r-oldrel: fastmap_1.0.1.tgz |
| Old sources: | fastmap archive |
| Reverse imports: | dipsaus, keyATM, shiny |
Please use the canonical form https://CRAN.R-project.org/package=fastmap to link to this page.