greg7mdp/sparsepp
View on GitHub ↗ ★ 1,314 C++
A fast, memory efficient hash map for C++
14 mentions on Hacker News by 8 people: 8 stories, 6 comments · first 2016-08-21 · latest 2021-05-14
20082026
-
▲ 1
Sparsepp: A fast, memory efficient hash map for C++ Build Statusstory by doener · 2021-05-14 · 0 comments
-
Very interesting use of Google's sparse hash. This library is used throughout the codebase: https://github.com/greg7mdp/sparsepp Also, after a quick look through the codebase, it really resembles how Algolia deals with indexes:…
comment by klaussilveira · 2021-05-14 · in Fast, Open Source Search -
…an issue titled "feedback please!". Many more people answered than I would have expected! [0]: https://github.com/greg7mdp/sparsepp/issues/17
comment by anchpop · 2020-12-27 · in Just Wanted to Say Thanks -
…in hash tables, check out my improved version of Google's already excellent sparsehash at https://github.com/greg7mdp/sparsepp . Excellent performance, very low memory usage, grows as needed of course.
comment by greg7mdp · 2016-09-30 · in Myths about Hash Tables -
…Boost version 1.55's unordered_map, and Google's Sparsehash and cpp-btree libraries, at https://github.com/greg7mdp/sparsepp/blob/master/bench.md . (While a link to the benchmark is in the README, I managed to overlook the link because it…
comment by dalke · 2016-09-17 · in Open source hash_map with unparalleled performance/memory usage ratio -
▲ 5
Open source hash_map with unparalleled performance/memory usage ratiostory by greg7mdp · 2016-09-17 · 1 comment
-
▲ 3
The best compromise memory usage/speed for storing key/value pairs in C++?story by greg7mdp · 2016-09-03 · 0 comments
-
▲ 1
Improving on Google's excellent Sparsehashstory by infinite8s · 2016-08-29 · 0 comments
-
…be Google's dense_hash_map [1] or sparsepp [2] [1] https://github.com/sparsehash/sparsehash [2] https://github.com/greg7mdp/sparsepp
comment by lorenzhs · 2016-08-29 · in Designing a fast hash table -
▲ 1
Sparsepp: improving on Google's already great sparsehashstory by greg7mdp · 2016-08-26 · 0 comments
-
Actually, if you don't need the entries to be sorted, the sparse_hash_set from https://github.com/greg7mdp/sparsepp is much faster than std::set or a sorted vector (except for iteration) and barely uses more memory than the sorted vector.
comment by greg7mdp · 2016-08-25 · in What to use instead of std::set [pdf] -
▲ 3
Sparsepp: A fast, memory efficient hash map for C++story by sidcool · 2016-08-23 · 0 comments
-
▲ 2
Sparsepp: improving on Google's sparsehashstory by greg7mdp · 2016-08-22 · 1 comment
-
▲ 4
Free, fast, and extremely memory efficient unordered_map: introducing sparseppstory by greg7mdp · 2016-08-21 · 0 comments