unordered_dense
code-style-agnostic-search
| unordered_dense | code-style-agnostic-search | |
|---|---|---|
| 12 | 7 | |
| 730 | 6 | |
| - | - | |
| 7.1 | 10.0 | |
| 24 days ago | about 1 year ago | |
| C++ | C++ | |
| MIT License | - |
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.
unordered_dense
- unordered_dense: A Fast & Densely Stored Hashmap And Hashset Based On Robin-Hood Backward Shift Deletion
- unordered_dense: A fast, densely stored hashmap based on backward shift deletion
-
boost::unordered standalone
That's deprecated. Use https://github.com/martinus/unordered_dense instead And yes, tell use if it's any better(it should)
-
Is there an accepted way to order qualifiers?
No, I've deprecated it because the code has become a mess, I rewrote it quite differently and with much higher code quality and more features here: https://github.com/martinus/unordered_dense
-
Effortless Performance Improvements in C++: std::unordered_map
When no ordering is necessary and the number of elements is larger than 20, nothing beats https://github.com/martinus/unordered_dense (for general use).
-
Effortless Performance Improvements in C++: std:unordered_map
https://github.com/martinus/unordered_dense
Check this one out, it's a successor to this idea. Boost also introduced a very performant flat_hash_map in 1.81
-
Fuzzing is Cool, Actually
I have an API fuzz test for a hash map here: https://github.com/martinus/unordered_dense/blob/main/test/fuzz/api.cpp
-
A container with set interface based on std::vector
That sounds a bit like ankerl::unordered_dense::set: https://github.com/martinus/unordered_dense
- Inside boost::unordered_flat_map
- martinus/unordered_dense v1.4.0: A fast & densely stored hashmap, Now with heterogeneous overloads
code-style-agnostic-search
-
Is there an accepted way to order qualifiers?
This is the next step for my agnostic search thing, as the amount of variance on this in the real-world code is absurd.
- Coding style-agnostic (and more) search for C++ — middle of the road between simple text-search and full semantic analysis
- Better Ctrl+F search for C++ (coding style agnostic) proof of concept
-
C++ Show and Tell - September 2022
Repository: https://github.com/tringi/code-style-agnostic-search (source code, example GUI program, and screenshots)
- Coding Style agnostic search for C++
- Coding Style -agnostic search for C++
What are some alternatives?
robin-map - C++ implementation of a fast hash map and hash set using robin hood hashing
windows_registry_folder_wmi_enumerator - Use C++11 range for-loop to enumerate registry keys/values, folder and WMI queries
STC - A modern, user friendly, generic, type-safe and fast C99 container library: String, Vector, Sorted and Unordered Map and Set, Deque, Forward List, Smart Pointers, Bitset and Random numbers.
lauf - Bytecode interpreter
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
weggli - weggli is a fast and robust semantic search tool for C and C++ codebases. It is designed to help security researchers identify interesting functionality in large codebases.
unordered - Boost.org unordered module
fccf - fccf: A command-line tool that quickly searches through C/C++ source code in a directory based on a search string and prints relevant code snippets that match the query.
flat_hash_map - A very fast hashtable
StrToNum - String to Number conversion constexpr library, for char and wchar_t strings.
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
PhotonLibOS - Probably the fastest coroutine lib in the world!