string-case
gperf
Our great sponsors
| string-case | gperf | |
|---|---|---|
| 1 | 7 | |
| 14 | 2 | |
| - | - | |
| 10.0 | 4.7 | |
| almost 6 years ago | about 2 months ago | |
| Common Lisp | C++ | |
| BSD 3-clause "New" or "Revised" License | GNU General Public License v3.0 only |
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.
string-case
-
Quickly checking that a string belongs to a small set
This reminds me of the Paul Khuong's string-case macro in Common Lisp.
https://github.com/pkhuong/string-case/blob/master/string-ca...
gperf
-
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?
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
encoding - Go package containing implementations of efficient encoding, decoding, and validation APIs.
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
asm - Go library providing algorithms optimized to leverage the characteristics of modern CPUs
sourcery - 🧙 A simple but very fast recursive source code spell checker made in C
mph - (Fork) Minimal Perfect Hash
C-dictionary - The lightweight macro libary providing control flow as Python dictionary
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.
nbperf - Improved NetBSD's Perfect Hash Generation Tool v3
Nginx - An official read-only mirror of http://hg.nginx.org/nginx/ which is updated hourly. Pull requests on GitHub cannot be accepted and will be automatically closed. The proper way to submit changes to nginx is via the nginx development mailing list, see http://nginx.org/en/docs/contributing_changes.html