Hopscotch map
C++ implementation of a fast hash map and hash set using hopscotch hashing (by Tessil)
C++ B-tree
Git mirror of the official (mercurial) repository of cpp-btree (by algorithm-ninja)
| Hopscotch map | C++ B-tree | |
|---|---|---|
| 3 | - | |
| 743 | 71 | |
| 0.4% | - | |
| 6.2 | 0.0 | |
| 9 months ago | almost 11 years ago | |
| C++ | C | |
| MIT License | Apache License 2.0 |
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.
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
C++ B-tree
Posts with mentions or reviews of C++ B-tree.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning C++ B-tree yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing Hopscotch map and C++ B-tree you can also consider the following projects:
PEGTL - Parsing Expression Grammar Template Library
stx-btree - OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
sparsehash-c11 - Experimental C++11 version of sparsehash
Hashmaps - Various open addressing hashmap algorithms in C++
sparsehash - C++ associative containers