ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Languages & runtimes · #zig
Zig's comptime feature runs functions at compile time, letting you embed pre‑computed tables directly in the binary.
Decision guide for using Zig's comptime for generic algorithms: constraints, trade-offs table, and a verified quicksort implementation showing zero-cost specialization.
Learn how to write Zig unit tests with the built‑in `zig test` command, from setup to execution and debugging.
Learn how Zig's comptime lets you write generic data structures with zero runtime overhead, plus trade‑offs and a worked example.
Learn how to choose between Zig's GeneralPurposeAllocator for safety and FixedBufferAllocator for performance, including a comparison of trade-offs and a concrete implementation.
A decision guide for Zig error handling: compare error unions, optionals, and custom result types, then see a concrete parsing example.
Pick the right Zig allocator: use PageAllocator for debug builds to catch memory bugs, and switch to GeneralPurposeAllocator in release for speed and low memory usage. Follow this decision guide and sample build.zig code.
Zig's allocator interface makes the choice local and reversible. Match the allocator to allocation lifetimes: arena for scoped work, the checked general-purpose allocator for independent frees, fixed-buffer for syscall-free determinism — then prove it with a leak-checking test.
I'm designing a small HTTP service in Zig built on the documented blocking std.http.Server with request handling dispatched through std.Thread.Pool (using spawnWg and a std.Thread.WaitGroup ). Assume a recent pre-1.0 release, since async/await was removed and explicit threads are the supported concurrency model. The design goal is predictable tail latency: s