ReadMeFeed / Community knowledge
Real questions. Useful conversations. Find the people who know your stack.
Languages & runtimes · #crystal
Crystal's ? suffix makes nilability part of the type system, turning null-reference crashes into compile-time errors. Control-flow refinement narrows types after nil checks, and &. handles optional values inline. Trade-off: nilables spread through generics, increasing verbosity.
Crystal feels like Ruby but compiles to native code. Learn how its type inference works, where annotations are required, and how to read compiler errors.
Learn how Crystal’s lightweight fibers let you write concurrent network code that looks synchronous while staying on a single OS thread.
A decision guide for structuring concurrency in Crystal: compare pure fiber/CSP, supervised worker pools, thread bridges, and process isolation with a concrete worker-pool implementation and validation checklist.
Learn how Crystal’s lightweight fibers let you handle tens of thousands of requests per second with minimal overhead, and see a concrete example that compares fiber‑based and thread‑per‑request servers.
Learn how to implement a high-concurrency I/O service using Crystal's cooperative fibers and channels, including strategies to avoid scheduler stalls and memory leaks.
Learn how to add graceful shutdown handling to a Crystal HTTP server so it stops accepting new connections, finishes existing requests, and exits cleanly on SIGINT/SIGTERM.
Learn how Crystal’s gradual typing lets you write flexible containers that stay type‑safe by applying generic constraints and the `type` keyword.
Explore how Crystal's type inference engine provides the speed of a compiled language with the clean syntax of Ruby, and learn the trade-offs regarding compilation time.