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
Published:
2024年05月15日
Author:
Winston Chang [aut, cre],
Posit Software, PBC [cph, fnd],
Tessil [cph] (hopscotch_map library)
Maintainer:
Winston Chang <winston at posit.co>
NeedsCompilation:
yes
Documentation:
Downloads:
Reverse dependencies:
Reverse imports:
bidsr,
bslib,
cachem,
chromote,
dipsaus,
filearray,
htmltools,
hydroloom,
ieegio,
keras3,
keyATM,
ompr,
promises,
rang,
ravepipeline,
readNSx,
ResultModelManager,
rpymat,
shidashi,
shiny,
shinychat,
shinymeta,
TreeSearch
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=fastmap
to link to this page.