fastmap: Fast Data Structures

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.1.0
Suggests: testthat (≥ 2.1.1)
Published: 2021-01-25
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

Documentation:

Reference manual: fastmap.pdf

Downloads:

Package source: fastmap_1.1.0.tar.gz
Windows binaries: r-devel: fastmap_1.1.0.zip, r-devel-UCRT: fastmap_1.1.0.zip, r-release: fastmap_1.1.0.zip, r-oldrel: fastmap_1.1.0.zip
macOS binaries: r-release (arm64): fastmap_1.1.0.tgz, r-release (x86_64): fastmap_1.1.0.tgz, r-oldrel: fastmap_1.1.0.tgz
Old sources: fastmap archive

Reverse dependencies:

Reverse imports: cachem, dipsaus, htmltools, keyATM, rpymat, shidashi, shiny, shinymeta
Reverse suggests: promises

Linking:

Please use the canonical form https://CRAN.R-project.org/package=fastmap to link to this page.