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++.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.1.0 by Winston Chang, a year ago,

Report a bug at

Browse source code at

Authors: Winston Chang [aut, cre] , RStudio [cph, fnd] , Tessil [cph] (hopscotch_map library)

Documentation:   PDF Manual  

MIT + file LICENSE license

Suggests testthat

Imported by cachem, dipsaus, htmltools, keyATM, ompr, rpymat, shidashi, shiny, shinymeta, trampoline.

Suggested by promises.

See at CRAN