STC
unordered_dense
STC | unordered_dense | |
---|---|---|
89 | 12 | |
1,158 | 735 | |
7.9% | - | |
9.1 | 7.1 | |
about 1 month ago | about 1 month 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.
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.
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
What are some alternatives?
ctl - The C Template Library
robin-map - C++ implementation of a fast hash map and hash set using robin hood 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).
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
Klib - A standalone and lightweight C library
unordered - Boost.org unordered module
ctl - My variant of the C Template Library
flat_hash_map - A very fast hashtable
CommonC - Common utilities for C
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
ccan - The C Code Archive Network
hashtable-benchmarks - An Evaluation of Linear Probing Hashtable Algorithms