The fastmap package provides efficient implementations of data structures, specifically a key-value store, a stack, and a queue. It uses C++ to implement the map, which prevents the memory leakage associated with R's global symbol table when using environments as key-value stores with many unique keys.
