Applicative Sorting: On using Applicative to sort any collection. #haskell

/me is listening to “The Rip” by Portishead

Folding in Parallel: The input sequence can be arbitrarily partitioned (and recursively sub-partitioned, if desired) among workers, which would run in parallel with no races, dependencies or even memory bank conflicts. Such embarrassing parallelism is ideal for multi-core, GPU or distributed processing.

Modern perfect hashing for strings.

Homebrew nice update: download in progress now showing like other cli tools (npm, deno).

/me is listening to “And No More Shall We Part” by Nick Cave & The Bad Seeds

The biggest misconception about Rust is that it’s “harder” than other languages. But that’s only true if you measure difficulty by how fast you can start writing code. If you measure difficulty by how long it takes to debug, maintain, and make a system reliable, the playing field levels out. — Rust is not harder than other languages

Python 3.14 Is Here. How Fast Is It?: The 3.14 JIT interpreter does not appear to provide any significant gains in speed, at least not with my test scripts. #python

Zippers: Making Functional “Updates” Efficient

Using deno as my game engine.