Andrew Healey

I wrote a very fast disk usage program for macOS most of the popular disk usage CLIs aren't using getattrlistbulk to reduce the number of syscalls required to scan directories (it's free real estate)

read my notes and code snippets and thoughts healeycodes.com/building-a-she…

I built a tiny shell with C so I could learn more about syscalls and pipes great fun I found C to be quite suited for the task (fork, execvp) ... until I had to manage some string lifetime stuff 🥲

glad y'all like this one 🫡

I suggested to my friend that writing a semaphore is fairly trivial but when I sat down to write one I was pretty humbled the edge cases around context cancellation are no joke more notes and my solution below down there ⇣

here's the full post about it healeycodes.com/solving-nyt-pi…

I also made a search-tree view that I used to debug the solver and get a feel for how it behaved with different optimizations

I built a solver for NYT's daily Pips puzzle I started with a brute-force search and optimized it to be 16× more efficient (by the number of nodes that need to be checked)

full post is up! healeycodes.com/compiling-a-fo…

and here's tokens -> bytecode

I made a Forth compiler and VM with some visualizations for the tokenization->bytecode->VM steps here's the VM running (it's calculating the 10th Fib. sequence)

added sheep! they spawn when a chunk is created and then randomly walk around, avoiding obstacles (added very rudimentary 'entity system') added torch flicker (sine wave whose phase is derived from cell coords, scales with light level so cells nearer a torch flicker a bit more)

added stone, and ore veins (based on seed, and placed via biased random walk) added torches/BFS lighting (attenuates by 1 per cell, blocked by stone/ore) I'm cheating a bit with the lighting because there's just a dark overlay that is reduced by the lighting effect

playing around with an idea for an article called 'the algorithms behind minecraft' probably with everything in 2d I've just got terrain generation working in a canvas

@typesanitizer @ballingt yeah! Piet is really cool. I think there are also 3d (!) esolangs but I can't find good docs for them

@healeycodes @ballingt Have you seen Piet? It has similar semantics, but with colors for fun. 😃

I made a small 2d programming language called icepath I wanted the same vibe as the ice puzzles in the johto caves in pokemon gold and silver 🧊 sliding around a cave and hitting opcodes

read about how it works and see more demo programs! healeycodes.com/icepath-a-2d-p…

@geofflangdale thanks @geofflangdale – really appreciate your and @dyaroshev's insights here! I'll play around and see if I can get it faster 🙂

@healeycodes for the last 8 16-wide iterations", since there's no reason to do 8b popcount on those. Intel SIMD allows 64b popcounts, which means you're only getting 6 bits of results and could scan huge amounts of data without overflow. Anyhow, I'll stop now, thx for coming to my Ted talk.

wrote the same word-counting program 5 times, each faster than the last best result: 494× faster than my first Python version — by using SIMD in C all are O(n), but some squeeze far more from the CPU and memory!