Writing a minimal Lua implementation
By the end of this guide we'll have a minimal, working implementation of a small part of Lua from scratch.
Source: Writing a minimal Lua implementation with a virtual machine from scratch in Rust.
By the end of this guide we'll have a minimal, working implementation of a small part of Lua from scratch.
Source: Writing a minimal Lua implementation with a virtual machine from scratch in Rust.
I remember a brief time in the mid-2000s insisting on so-called “Yoda conditions” in my Perl. I would place constants to the left of equality comparisons. In case I accidentally typed a single = instead of ==, the compiler would catch it instead of blithely assigning a variable.
Source: Avoid Yoda conditions in Perl you should, an article by Mark Gardner.
I just found out that Uncle Bob wrote an article about TDDing the Diamond Square algorithm (yea, I’m slow on catching up sometimes).
In the article, Uncle Bob leads us through a way to TDD an algorithm. It’s pretty nice and gave me a few insights as to how to mock and test in intervals until the algorithm emerges.
Problem is – Uncle Bob’s code is not JavaScript!!!
So I set down and reimplemented the algorithm. This time, I used the lessons learned from Uncle Bob’s article.
Source: 5 lessons learned when I TDD an algorithm in JavaScript, an article by Yonatan Kra.
Heap's thousands of customers can build queries in the Heap UI to answer almost any question about how users are using their product. Optimizing all of these queries across all our customers presents special challenges you wouldn't typically encounter if you were optimizing the performance of a small set of queries within a typical app.
This post is about why this scale requires us to conduct performance experiments to optimize our SQL, and it details how we conduct those experiments.
Source: Optimizing Postgres Queries at Scale, an article by Matt Dupree.