map_benchmark
STC
Our great sponsors
map_benchmark | STC | |
---|---|---|
5 | 89 | |
287 | 1,113 | |
- | 5.4% | |
5.5 | 9.1 | |
about 1 year ago | 25 days ago | |
C++ | C | |
MIT License | 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.
map_benchmark
-
Optimizing Open Addressing
I tied adding the maps to the [1] benchmark, but I wasn't able to, since they aren't type generic yet. You may want to benchmark against [2], and [3] which are the best performing ones in the above benchmark.
[1] https://github.com/martinus/map_benchmark/
[2] https://github.com/TheNumbat/hashtables/blob/main/code/robin...
[3] https://github.com/ktprime/ktprime
-
Benchmarking my data structure
In any case, I guess you can find some inspiration in this comparison of maps which was posted to /r/cpp a couple of months ago: https://martin.ankerl.com/2022/08/27/hashmap-bench-01/ (source code for the benchmark seems to be on https://github.com/martinus/map_benchmark ). It's made for maps but adjusting most benchmarks for other containers should be fairly straightforward.
-
Is there a committee paper on a "simplified" random interface?
There is no such thing as best random generator. They have so many different properties, e.g. is it cryptographic secure, how large is the state, how fast on x86 architecture, can it jump forward, etc. My go-to generator is sfc64 because it's fast, simple, and seems to produce high quality random numbers. Here is one implementation: https://github.com/martinus/map_benchmark/blob/master/src/app/sfc64.h other popular generators are PCG and xorshift
-
boost::unordered map is a new king of data structures
I've implemented this PoolAllocator which does exactly this: https://github.com/martinus/map_benchmark/blob/master/src/app/pool.h
-
Development Plan for Boost.Unordered
Hi Martin, thanks for the pointer! BTW, I think we may use your impressive benchmark suite to test our advances once we come up with something worth deep testing.
STC
-
Macro to automatically unlock a mutex in a block (ansi c)
This technique is often used to implement RAII in C. See example in Standard Template Containers. The library delivers STL-like functionality to C.
-
Is using void* considered "evil" in C just as it is in C++?
I'd say it's evil, but quite understandable very commonly used because there are no built-in alternatives in C. I basically never use void* in user-code, simply because there are no need for it when using a templating technique, like in my STC library. Even in the implementation of STC itself, void* is hardly used, if at all.
-
Book recommendations for learning C really thoroughly
Study Other Peoples C Code and here's one that is easy to read: https://github.com/stclib/STC/releases
-
[Noob Question] How do C programmers get around not having hash maps?
STC
-
Should I use templates or stick with rewriting code?
This is more or less how C-ish templates are implemented in STC library.
-
What’s the right hash table API?
As the author of a STL-like templated C container library, I had many of the exact same thoughts when implementing the unordered map. In fact, I also changed to many of the suggestions here, rather than consistently following the C++ umap API. E.g.
-
What's the fastest high level language?
Sure it is. C misses a proper efficient generic standard/container library, like my https://github.com/stclib/STC, but that is irrelevant.
- STC v4.2 Released (note: new URL)
-
Popular Data Structure Libraries in C ?
Smart Template Containers (STC)
-
So what's the best data structures and algorithms library for C?
Some data structure and algorithm library in C enable the (optional) separation between the interface of the container (which is expanded in your header) and its implementation (which is expanded in your source), like STC.
What are some alternatives?
robin-map - C++ implementation of a fast hash map and hash set using robin hood hashing
ctl - The C Template Library
unordered_dense - A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion
Klib - A standalone and lightweight C library
Hopscotch map - C++ implementation of a fast hash map and hash set using hopscotch hashing
mlib - Library of generic and type safe containers in pure C language (C99 or C11) for a wide collection of container (comparable to the C++ STL).
unordered - Boost.org unordered module
ctl - My variant of the C Template Library
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
CommonC - Common utilities for C
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20