Memory-efficient hashtable implementations
This library 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, particularly on lookup. sparse_hash_set
and dense_hash_set
are the set versions of these routines. All these implementation use a hashtable with internal quadratic probing. This method is space-efficient -- there is no pointer overhead -- and time-efficient for good hash functions.
System | Target | Derivation | Build status |
---|---|---|---|
x86_64-linux | /gnu/store/l0y677a9yi7vh9if7prrwlmjpb3n0kh4-sparsehash-2.0.3.drv | ||
mips64el-linux | /gnu/store/xabxiphkwmgxw3lav6fv7v4y851lhl88-sparsehash-2.0.3.drv | ||
i686-linux | /gnu/store/hdl8a63j95kxqyq0b0xz0yyhmg8m0381-sparsehash-2.0.3.drv | ||
armhf-linux | /gnu/store/c0csza326vh91083ybqw0kw994v7qmmj-sparsehash-2.0.3.drv | ||
aarch64-linux | /gnu/store/d2i926nwyc8my2bmviiaqr1lgbk9y83b-sparsehash-2.0.3.drv |
Linter | Message | Location |
---|---|---|
source-unstable-tarball Check for autogenerated tarballs | the source URI should not be an autogenerated tarball |