Alternatives
Products that do what C++11 immutable string does
I'm looking for feedback on this approach to an immutable string (istring). The idea is to provide a super fast immutable string that can be efficiently passed to lambdas as well as be 100% thread safe. Another bonus is faster hashing. If a string literal is given to istring, then the hash is computed at compile time! Other strings will have their hashes cached for later use. The istring is designed more or less after the python string in this regard. It should also consume less memory than std::string and perform faster in all other areas.
- 1SA
2018 · github.com
- 2HP
2018 · partow.net
- 3IR
I rewrote the most common core string.h functions in pure C. I mostly did it to learn pointers and string. Would love to get any feedbacks:)
2025 · github.com
- 4NC
Hello, Some time ago I did a data logger for fun, just to check if I could beat the performance of an old C++ project of mine (mini-async-log) and to avoid letting my multithreading-C skills rust when on a non-programming gig (using Yocto/OE, very little programming). This project is a BSD licensed, producer-wait-free (when using thread-local storage) generic message logger with high performance, decent test coverage, and type-safe C strings (requires C11 or C++ compiler). It was a shame to let this project to die unknown, as I think that it has potential to be used on some niches as…
2019
- 5FA
2021 · github.com
- 6OS
I’ve been working on a compression algorithm for fast random access to individual strings in large collections. The problem came up when working with large in-memory database columns (emails, URLs, product titles, etc.), where low-latency point queries are essential. With short strings, LZ77-based compressors don’t perform well. Block compression helps, but block size forces a trade-off between ratio and access speed. Some existing options: - BPE: good ratios, but slow and memory-heavy - FSST (discussed here: https://news.ycombinator.com/item?id=41489047): very fast, but…
2025 · github.com
- 7ST
2019 · github.com
- 8SM
2021 · github.com
- 9CI
Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…
Dec 2025 · github.com
- 10AJ
2016 · github.com
- 11AA
2017 · github.com
- 12ST
- What's different? It's fast. On my machine, the stream decoder is faster than bytedance/sonic which claim to be the fastest even though mine is written in pure Go and Sonic is written in Go + C + Assembly. It also is a drop-in replacement of the standard library. - Why is it fast? technologies used are in my articles (available in English and Japanese) EN: https://sugawarayuuta.medium.com/still-i-wanted-to-build-the... JA: https://zenn.dev/sugawarayuuta/articles/2a5a3cb3f9a504
2023 · github.com
- 13AS
Hi HN, I’ve been working on an experimental programming language called XXML. The project started from a frustration I kept running into across systems languages: Languages with strong ownership tend to avoid runtime reflection. Languages with rich reflection usually rely on GC or give up memory guarantees. Compile-time code generation often requires a separate macro language. I wanted to explore whether those tradeoffs are truly necessary. What XXML is trying to do XXML is a statically-typed, native language that: Uses explicit ownership and borrowing (no garbage collector) Supports runtime…
Dec 2025 · xxml-language.com
- 14XD
XID generates 20-character globally unique IDs (48-bit timestamp + 64-bit entropy + 8-bit counter + 5-bit checksum) in a single C file with zero dependencies. Features built-in timestamp extraction, collision resistance, and portable design for any platform - ideal for databases, IoT, and distributed systems. char id = xid_generate(); // => "01H5Z7K4W9A3B6C8D0F2G" Gists: https://gist.github.com/Ferki-git-creator/17450d52d143f746f0... (Feedback wanted: entropy improvements, embedded use cases, optimizations)*
2025 · gist.github.com
- 15IP
Merry Christmas, everyone! Now you can compile Haskell code on Windows 11 ARM. It will run full speed if you use UTM/QEmu on Apple silicon. :-) It's a very draft version, but it works well. Any ideas?
2024 · gitlab.haskell.org
- 16FA
I was working on optimising Subversion. One of its bottleneck is computing file hashes. First thing I tried was to use OpenSSL for that. It significantly improved its performance. It made it 8x faster in some cases. However, it was not optimal to use it: - OpenSSL is heavy and bloated. It's like a whole operating system on its own. - Since OpenSSL 3.0, low-level digest APIs are deprecated, and instead they recommend to use EVP which might be slow in some cases. So I decided to create a new library for computing cryptographic digests. It basically takes OpenSSL's implementations, but with an…
Feb 2026 · github.com
- 17TA
TYON (typed object notation) is my attempt to address the main frustrations I have with JSON. 1. Key repetition - you can specify the key names once at the start of a list or map, instead of on each object separately. 2. Escaping strings - everything in a string is literal except for " which is escaped as "". This makes writing regexes and multiline text easier without introducing a bunch of different string styles or excess escaping, which I am not a fan of. 3. While not nearly as important as the first two to me, I did reduce symbol clutter when possible. Files are implicitly maps, keys…
2023 · github.com
- 18JA
2015 · hperadin.github.io
- 19SI
2022 · string.is
- 20IB
Hey HN, A CSV parser using Go 1.26's experimental simd/archsimd package. I wanted to see what the new SIMD API looks like in practice. CSV parsing is mostly "find these bytes in a buffer"—load 64 bytes, compare, get a bitmask of positions. The interesting part was handling chunk boundaries correctly (quotes and line endings can split across chunks). - Drop-in replacement for encoding/csv - ~20% faster for unquoted data on AVX-512 - Quoted data is slower (still optimizing) - Scalar fallback for non-AVX-512 Requires GOEXPERIMENT=simd.…
Jan 2026 · github.com
- 21SP
Hi everyone! As a side project I made a tiny static website that helps explain format strings used with Python's `struct` module. Type/paste in a format string and you get a quick explanation of the structure instead of having to look through the docs. It's open source, happy to hear any suggestions how to make it more useful.
2022 · pythonstruct.com
- 22L0
What's your tool chain for data and document processing? - jq is great, but limited to JSON; and jQuery limited to HTML; templating systems get messy for non-trivial logic; TypeScript lacks pattern matching and schema support. So I built Lambda — an expressive functional language that combines the power of Lisp, TypeScript, and many DSLs like jq, jQuery, RelaxNG, etc. It has a lightweight 9 MB runtime, built from scratch in C/C++, that provides an end-to-end document processing pipeline (parse → validate/query/transform → layout → render/view). Internally, Lambda parse…
Mar 2026 · github.com
- 23IE
Quick note on how it works and how I've done my batch embedding engine IgniteMS. The whole thing runs as one process using Rust, reading input, tokenizing, packing batches, keeping the queue full. TensorRT handles inference. Python is only as a wrapper. I built it this way because when you use more than couple of GPUs, the GPUs stop being the problem. CPU cannot feed them fast enough. One A100 can go through batches faster than Python can tokenize and feed, so the GPU just sits there idle waiting for work. Most of my time went into optimizing this. At 8 GPUs that was basically the entire…
Jun 2026 · github.com
- 24BC
btrc is a statically-typed language that transpiles to C11. It adds classes, generics (monomorphized), type inference, lambdas, f-strings, collections (Vector, Map, Set), threads, GPU compute via WebGPU, ARC memory management, exception handling, and a standard library — while generating strict C11 with no runtime, no GC, and no VM. The compiler is a 6-stage Python pipeline (lexer → parser → analyzer → IR gen → optimizer → C emitter) driven by a formal EBNF grammar and an algebraic AST spec (Zephyr ASDL). The generated C is readable and linkable with any C11 compiler. It ships with a VS Code…
Mar 2026 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →