Quoting and not quoting command substitution in the Bourne shell
Speeding up with SIMD and Go assembly
#528 — October 22, 2024 Unsub | Web Version Go Weekly A Taste of Go Code Generator Magic: A Quick Guide to Getting Started — There aren’t many tutorials on Go code generation, which inspired the author to show how they crea...
A 10-Step Guide to Using Embassy for Embedded Rust
Embassy is a powerful framework for building asynchronous embedded applications in Rust. Embassy focuses on safety, performance, and efficiency makes it an excellent choice for latency-sensitive systems. This guide provides junior and mid-level engineers with a comprehensive unde...
The Go module proxy and forcing Go to actually update module versions
Exploring JSON Encoding and Data Handling in Go - Ep.2
Introduction: Welcome to Episode 2 of JSON for Engineers! In this episode, we explore the unique characteristics of JSON as a schema-less format, discussing both its benefits and challenges. You’ll learn how JSON’s flexibility, while enabling rapid development, can cr...
Optimising and Visualising Go Tests Parallelism: Why more cores don't speed up your Go tests
Recently, I struggled for a couple of hours to understand why the API tests of one project were slow. In theory, we designed tests to run in a fully parallel way – the duration of tests should be close to the longest-running test. Unfortunately, the reality was different. T...
Pure Go HTML view components
#527 — October 15, 2024 Unsub | Web Version Go Weekly ▶ Russ Cox on Passing the Torch — Former Go tech lead Russ Cox went on the Go Time podcast recently to talk about the process of stepping down and handing over the rei...
Topological sort
I was fiddling with graphlib in the Python stdlib and found it quite nifty. It processes a Directed Acyclic Graph (DAG), where tasks (nodes) are connected by directed edges (dependencies), and returns the correct execution order. The “acyclic” part ensures no circular...
Topological sort
I was fiddling with graphlib in the Python stdlib and found it quite nifty. It processes a Directed Acyclic Graph (DAG), where tasks (nodes) are connected by directed edges (dependencies), and returns the correct execution order. The “acyclic” part ensures no circular...
Topological sort
I was fiddling with graphlib in the Python stdlib and found it quite nifty. It processes a Directed Acyclic Graph (DAG), where tasks (nodes) are connected by directed edges (dependencies), and returns the correct execution order. The “acyclic” part ensures no circular...