How Google Sparsehash achieves two bits of overhead per entry using sparsetable Google Sparsehash is one of the most space efficient hash tables, but how does it achieve two bits of overhead per entry? Click to view the original at smerity.com
