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++.
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 Reverse suggests: jmvcore, singleCellTK Linking:Please use the canonical form https://CRAN.R-project.org/package=fastmap to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4