sparsehash-c11
Experimental C++11 version of sparsehash (by sparsehash)
Hopscotch map
C++ implementation of a fast hash map and hash set using hopscotch hashing (by Tessil)
| sparsehash-c11 | Hopscotch map | |
|---|---|---|
| - | 3 | |
| 287 | 736 | |
| 0.0% | 0.4% | |
| 0.0 | 6.2 | |
| over 2 years ago | 6 months ago | |
| C++ | C++ | |
| BSD 3-clause "New" or "Revised" License | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
sparsehash-c11
Posts with mentions or reviews of sparsehash-c11.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning sparsehash-c11 yet.
Tracking mentions began in Dec 2020.
Hopscotch map
Posts with mentions or reviews of Hopscotch map.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-30.
- boost::unordered map is a new king of data structures
-
Yes, this is embarrassingly slow .so I solved your problem
the map member used for the lookups is a tsl::hopscotch_map (https://github.com/Tessil/hopscotch-map), which is a proper hash map. so it seems to be the latter, that the API is wrong, but from what I can tell it is only a wrongly named class. i don't see where the API makes guarantees about iteration order, which is where the implementation difference would be noticeable (beyond performance for lookup).
-
Any suggestions for resources to optimize for memory allocation/reallocation?
using an open-addressing hash table, such as abseil flat_hash_map or tessil/hopscotch-map
What are some alternatives?
When comparing sparsehash-c11 and Hopscotch map you can also consider the following projects:
C++ B-tree - Git mirror of the official (mercurial) repository of cpp-btree
PEGTL - Parsing Expression Grammar Template Library
sparsehash - C++ associative containers
Optional Argument in C++ - Named Optional Arguments in C++17
Hashmaps - Various open addressing hashmap algorithms in C++