hash_map and hash_set classes with minimal space overhead
The sparsehash package contains several hash-map implementations, similar in API to the SGI 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 typically faster than the default SGI STL implementation. This package also includes hash-set analogues of these classes.
Source Files (show merged sources derived from linked package)
|_link||0000000122122 Bytes||1340720616almost 6 years ago|
|sparsehash-2.0.2.tar.gz||0000340514333 KB||1333800926about 6 years ago|
|sparsehash.changes||0000000134134 Bytes||1337865894almost 6 years ago|
|sparsehash.spec||00000018691.83 KB||1337865894almost 6 years ago|