How Google Sparsehash achieves two bits of overhead per entry using sparsetable

smerity.com/articles/2015/google_sparsehash.html

Google Sparsehash is one of the most space efficient hash tables, but how does it achieve two bits of overhead per entry?

Comments (0)

Sign in to post comments.