sparsehash - An extremely memory-efficient hash_map implementation - Google Project Hosting

sparsehash - An extremely memory-efficient hash_map implementation - Google Project Hosting

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.

These hashtable implementations are similar in API to SGI's hash_map class and the tr1 unordered_map class, but with different performance characteristics. It's easy to replace hash_map or unordered_map by sparse_hash_map or dense_hash_map in C++ code.

They also contain code to serialize and unserialize from disk.

Recent news:

23 Ferbruary 2012

A backwards incompatibility arose from flattening the include headers structure for the <google> folder.

This is now fixed in 2.0.2. You only need to upgrade if you had previously included files from the <google/sparsehash> folder.

1 February 2012

A minor bug related to the namespace switch from google to sparsehash stopped the build from working when perftools is also installed.

This is now fixed in 2.0.1. You only need to upgrade if you have perftools installed.