qc-hash
recursive-variant
qc-hash | recursive-variant | |
---|---|---|
1 | 4 | |
10 | 77 | |
- | - | |
5.7 | 0.0 | |
8 months ago | over 2 years ago | |
C++ | C++ | |
MIT License | GNU General Public License v3.0 or later |
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.
qc-hash
recursive-variant
What are some alternatives?
CppPerformanceBenchmarks
variant - C++17 `std::variant` for C++11/14/17
dense_hash_map - A simple replacement for std::unordered_map
chessCAMO - chessCAMO is a newly proposed chess engine with a built-in variant that stands for Calculations Always Make Opportunities and was inspired by the very popular chess variant Crazyhouse. The "CAMO" portion comes from the idea that in this variant a player can sacrifice making a move to replace one of their pieces from the "piece reservoir".
fph-table - Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
cmake-init - The missing CMake project initializer
google-sparsehash - Clone of google-sparsehash
BackportCpp - Library of backported modern C++ types to work with C++11
eytzinger - Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
filesystem - An implementation of C++17 std::filesystem for C++11 /C++14/C++17/C++20 on Windows, macOS, Linux and FreeBSD.
flat_hash_map - A very fast hashtable
variate - Deduce the template parameter of a variant based on every return path