fastmap: Fast Data Structures (original) (raw)
Fast implementation of data structures, including a key-value store, stack, and queue. Environments are commonly used as key-value stores in R, 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.2.0 |
|---|---|
| Suggests: | testthat (≥ 2.1.1) |
| Published: | 2024-05-15 |
| DOI: | 10.32614/CRAN.package.fastmap |
| Author: | Winston Chang [aut, cre], Posit Software, PBC [cph, fnd], Tessil [cph] (hopscotch_map library) |
| Maintainer: | Winston Chang |
| BugReports: | https://github.com/r-lib/fastmap/issues |
| License: | MIT + file |
| URL: | https://r-lib.github.io/fastmap/, https://github.com/r-lib/fastmap |
| NeedsCompilation: | yes |
| Materials: | README NEWS |
| CRAN checks: | fastmap results |
Documentation:
Downloads:
Reverse dependencies:
| Reverse imports: | bslib, cachem, chromote, dipsaus, filearray, htmltools, hydroloom, ieegio, keras3, keyATM, ompr, promises, rang, readNSx, ResultModelManager, rpymat, shidashi, shiny, shinymeta, trampoline |
|---|---|
| Reverse suggests: | jmvcore, singleCellTK |
Linking:
Please use the canonical formhttps://CRAN.R-project.org/package=fastmapto link to this page.