A memory-efficient hash_map tool that comes with just 2 bits of entry overhead.
The Google SparseHash project is an efficient and diversified set of hash-map implementations used by Google. The project houses a variety of implementations that deliver varying levels of performance. Some of these implementations aim to optimize for speed while others strive to optimize for space.
This free and open source project is a template library that does not require installation of binary files. The hash-table implementations provided by Google SparseHash have similar API to SGI's hash_map class and the tr1 unordered_map class, but provide a different set of performance characteristics.
With the easy-to-use replace feature, replacing hash_map or unordered_map with sparse_hash_map or dense_hash_map in C++ code is a simple process. This feature helps developers to take advantage of the performance optimization provided by Google SparseHash seamlessly.
This free and open source project is a template library that does not require installation of binary files. The hash-table implementations provided by Google SparseHash have similar API to SGI's hash_map class and the tr1 unordered_map class, but provide a different set of performance characteristics.
With the easy-to-use replace feature, replacing hash_map or unordered_map with sparse_hash_map or dense_hash_map in C++ code is a simple process. This feature helps developers to take advantage of the performance optimization provided by Google SparseHash seamlessly.
What's New
Version 1.5.2: N/A