Provides interface to 'sparsepp' - fast, memory efficient hash map. It is derived from Google's excellent 'sparsehash' implementation. We believe 'sparsepp' provides an unparalleled combination of performance and memory usage, and will outperform your compiler's unordered_map on both counts. Only Google's 'dense_hash_map' is consistently faster, at the cost of much greater memory usage (especially when the final size of the map is not known in advance).
|Author||Gregory Popovitch [aut, cph], Google Inc [aut, cph], Dmitriy Selivanov [cre]|
|Date of publication||2017-08-07 10:29:19 UTC|
|Maintainer||Dmitriy Selivanov <[email protected]>|
|License||BSD_3_clause + file LICENSE|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.