Google's extremely memory-efficient C++ hash_map implementation
The Google SparseHash project contains several C++ template hash-map
implementations in use at Google, with different performance
characteristics, including an implementation that optimizes for space
and one that optimizes for speed.
This directory contains several hash-map implementations, similar in
API to SGI's hash_map class, but with different performance
characteristics. sparse_hash_map uses very little space overhead, 1-2
bits per entry. dense_hash_map is very fast, particulary on lookup.
(sparse_hash_set and dense_hash_set are the set versions of these
routines.) On the other hand, these classes have requirements th
This project has been ported to Windows. A working solution file
exists in this directory:
You can load this solution file into either VC++ 7.1 (Visual Studio
2003) or VC++ 8.0 (Visual Studio 2005) -- in the latter case, it will
automatically convert the files to the latest format for you.
When you build the solution, it will create a number of
== 21 January 2011 ==
I've just released sparsehash 1.10. This fixes a performance
regression in sparsehash 1.8, where sparse_hash_map would copy
hashtable keys by value even when the key was explicitly a reference.
It also fixes compiler warnings from MSVC 10, which uses some c++0x
features that did not interact well with sparsehash.
There is no reason to upgrade unless you use references for
sparsehash (1.10-1) unstable; urgency=low
* New upstream release (Closes: #624823)
Thu Jan 20 16:07:39 2011 Google Inc. <email@example.com>
* sparsehash: version 1.10 release
1) TODO: I/O implementation in densehashtable.h
2) TODO: document SPARSEHASH_STAT_UPDATE macro, and
This package was originally debianized by Wes Chow <firstname.lastname@example.org>,
and was previously maintaine
Browse inside libsparsehash-dev_1.10-1_all.deb