sourcery
🧙 A simple but very fast recursive source code spell checker made in C (by Theldus)
gperf
mirror of git.savannah.gnu.org/gperf.git with more features. gitlab has the issues (by rurban)
sourcery | gperf | |
---|---|---|
1 | 7 | |
14 | 2 | |
- | - | |
5.2 | 4.7 | |
8 months ago | 2 months ago | |
C | C++ | |
MIT License | GNU General Public License v3.0 only |
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.
sourcery
Posts with mentions or reviews of sourcery.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-03-15.
-
On implementing Bloom Filters in C
There's also 'MPH', it's an old and no longer maintained project but it works surprisingly well. I have used it in a project of mine (Sourcery) with a wordlist of 127k words and the performance was better than with CMPH in the tests I did.
gperf
Posts with mentions or reviews of gperf.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-30.
-
What is an example of non-linear static data structure and what is an accurate breakdown of ds types?
Can create a ton of theoretical examples, but even in practice we use such data structures. An example that first came to mind is gperf which generates static hash table data structure for predefined set of strings (So you cannot add or remove any elements).
-
Hashtables
gperf is a generator for perfect hash functions. Its documentation has a bibliography that might contain helpful links.
- Quickly checking that a string belongs to a small set
-
Generating the code for an efficient conditional tree to select from a list of strings
I think gperf is what you need. Alternatively cmph.
-
How to emulate map literals in C?
Adding to this, there are tools such as gperf which are specifically designed for this. Apparently gperf works well for smaller number of keys but not for really high n (> 100,000 ish) and mph apparently works better for larger n.
- On implementing Bloom Filters in C
What are some alternatives?
When comparing sourcery and gperf you can also consider the following projects:
dateutils - nifty command line date and time utilities; fast date calculations and conversion in the shell
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.