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.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 <winston at>
License: MIT + file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: fastmap results


Reference manual: fastmap.pdf


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

Reverse dependencies:

Reverse imports: bslib, cachem, chromote, dipsaus, filearray, htmltools, hydroloom, keras3, keyATM, ompr, promises, rang, readNSx, rpymat, shidashi, shiny, shinymeta, trampoline
Reverse suggests: jmvcore, singleCellTK


Please use the canonical form to link to this page.