gperf
encoding
gperf | encoding | |
---|---|---|
7 | 8 | |
2 | 964 | |
- | 0.5% | |
4.7 | 3.6 | |
about 2 months ago | 5 months ago | |
C++ | Go | |
GNU General Public License v3.0 only | 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.
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
encoding
- Handling high-traffic HTTP requests with JSON payloads
-
Rust vs. Go in 2023
https://github.com/BurntSushi/rebar#summary-of-search-time-b...
Further, Go refusing to have macros means that many libraries use reflection instead, which often makes those parts of the Go program perform no better than Python and in some cases worse. Rust can just generate all of that at compile time with macros, and optimize them with LLVM like any other code. Some Go libraries go to enormous lengths to reduce reflection overhead, but that's hard to justify for most things, and hard to maintain even once done. The legendary https://github.com/segmentio/encoding seems to be abandoned now and progress on Go JSON in general seems to have died with https://github.com/go-json-experiment/json .
Many people claiming their projects are IO-bound are just assuming that's the case because most of the time is spent in their input reader. If they actually measured they'd see it's not even saturating a 100Mbps link, let alone 1-100Gbps, so by definition it is not IO-bound. Even if they didn't need more throughput than that, they still could have put those cycles to better use or at worst saved energy. Isn't that what people like to say about Go vs Python, that Go saves energy? Sure, but it still burns a lot more energy than it would if it had macros.
Rust can use state-of-the-art memory allocators like mimalloc, while Go is still stuck on an old fork of tcmalloc, and not just tcmalloc in its original C, but transpiled to Go so it optimizes much less than LLVM would optimize it. (Many people benchmarking them forget to even try substitute allocators in Rust, so they're actually underestimating just how much faster Rust is)
Finally, even Go Generics have failed to improve performance, and in many cases can make it unimaginably worse through -- I kid you not -- global lock contention hidden behind innocent type assertion syntax: https://planetscale.com/blog/generics-can-make-your-go-code-...
It's not even close. There are many reasons Go is a lot slower than Rust and many of them are likely to remain forever. Most of them have not seen meaningful progress in a decade or more. The GC has improved, which is great, but that's not even a factor on the Rust side.
-
Quickly checking that a string belongs to a small set
We took a similar approach in our JSON decoder. We needed to support sets (JSON object keys) that aren't necessarily known until runtime, and strings that are up to 16 bytes in length.
We got better performance with a linear scan and SIMD matching than with a hash table or a perfect hashing scheme.
See https://github.com/segmentio/asm/pull/57 (AMD64) and https://github.com/segmentio/asm/pull/65 (ARM64). Here's how it's used in the JSON decoder: https://github.com/segmentio/encoding/pull/101
-
80x improvements in caching by moving from JSON to gob
Binary formats work well for some cases but JSON is often unavoidable since it is so widely used for APIs. However, you can make it faster in golang with this https://github.com/segmentio/encoding.
-
Speeding up Go's builtin JSON encoder up to 55% for large arrays of objects
Would love to see results from incorporating https://github.com/segmentio/encoding/tree/master/json!
-
Fastest JSON parser for large (~888kB) API response?
Try this one out https://github.com/segmentio/encoding it's always worked well for me
-
📖 Go Fiber by Examples: Delving into built-in functions
Converts any interface or string to JSON using the segmentio/encoding package. Also, the JSON method sets the content header to application/json.
-
In-memory caching solutions
If you're interested in super fast & easy JSON for that cache give this a try I've used it in prod & never had a problem.
What are some alternatives?
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
sonic - A blazingly fast JSON serializing & deserializing library
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
groupcache - Clone of golang/groupcache with TTL and Item Removal support
mph - (Fork) Minimal Perfect Hash
parquet-go - Go library to read/write Parquet files
robin-hood-hashing - Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
base64 - Faster base64 encoding for Go
sourcery - 🧙 A simple but very fast recursive source code spell checker made in C
buntdb - BuntDB is an embeddable, in-memory key/value database for Go with custom indexing and geospatial support
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.
hilbert - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.