The algorithm is hardware agnostic.
"No architecture-specific code was used, and the implementation relies on branchless instruction-level parallelism instead of auto-vectorization to saturate wide out-of-order (OoO) CPU micro-architectures." (2/2)
Link: github.com/Voultapher/s...
driftsort - introduced in Rust 1.81.0. Here’s a component level overview of the sorting algorithm (link to the research document : 👇) .. 🧵(1/2)
TIL a 3-week course that will teach u to design and implement LSM tree storage engine in Rust, including implementing MVCC over the LSM engine (link: skyzh.github.io/mini-lsm/)
advanced data structures course by Jeff Erickson -Spring 2025 .. lots of advanced data structures discussed along with analysis (link: jeffe.cs.illinois.edu/teaching/dat...)
Me: what's the WiFi password?
Bartender: you need to buy a drink first
Me: ok, I'll have a Coca-Cola Zero
Bartender: is Diet-Pepsi ok?
Me: Sure. how much?
Bartender: that's $3.00
Me: good. so what's the WiFi password?
Bartender: you need to buy a drink first
no spaces no caps.
(Via Threads)
nice article on branchless binary search in Rust with Eytzinger layout and memory prefetch .. www.bazhenov.me/posts/faster...
In the world of ChatGPTs and Groks some StackOverflow threads still stand out .. stackoverflow.com/questions/50...
Awesome talk nonetheless .. wondering how much of research went into the talk .. (3/3) link: youtu.be/wo84LFzx5nI?...
Opinionated talk - he hits hard at the ubiquitous practice of building compile time hierarchy of encapsulation that matches the domain model as the basis of your object oriented design. Such encapsulation boundaries may work for specific use cases but don’t generalise. (2/3)
Spent a meaningful 2.5 hours on the Casey Muratori talk that instrumented an exponential rise to my reading list. A masterclass in the history of computing and the roots of OO (1/3)
Some things never change, almost a ritual for us .. লুচি (deep-fried flatbread made from refined flour)+ সাদা আলুর তরকারি (potato curry) for a Sunday breakfast ..
Dancing Links is tailor made for linked lists .. the way it sets up the pre-structured grid allows the algorithm to efficiently remove and restore elements during backtracking just by jumping through pointers .. (2/2)
Linked lists often face criticism in the world of data structures, and it’s easy to see why.
I am studying Dancing Links, a technique Knuth developed as part of his Algorithm X, designed to solve Exact Cover problems. (1/2)
Interesting take on cognitive load of learning a programming language. Good post on how Zig has a lower cognitive load than Rust ..
link to the blog post: kevinlynagh.com/rust-zig/
I remember Erik Meijer mention this in one of the Scala reactive programming course long back ..
(paraphrasing)
"flatMap/monad is the dolby for programmers. It allows us to amplify the happy path and itself takes care of the noise in error handling" - anyone remember the exact quote ?
The @tigerbeetle.com team runs a conference like they build their database — with artful craftsmanship, technical precision, and a sprinkle of magic.
Kudos to an amazing SD ‘25 🤩⚡️
Mathematical thinking gets honed with learning how to do proofs .. Sunday reading ..
OCaml and Zig are different languages with different trade offs. Not fair to compare them .. pick your own poison ..
This blog post makes a strong point on feeding the compiler enough *intent* to generate more optimized code. This can be at the expense of added verbosity in the language because nothing beats efficiency when you need it. And Zig does it .. alloc.dev/2025/06/07/z...
Sunday morning surprise from Amazon .. always wanted to dig deep into the computational aspects of database concurrency control. Papadimitriou serves the perfect recipe ..
Amazing talk by Ankush Desai on using formal & semi-formal methods as a thinking tool in the design process. The core message of the talk is Don't fear the Formal Methods, treat them as a thinking tool. Formal methods teach u to think at the proper level of abstraction antithesis.com/blog/2025/bu...
Spent an hour and a half on this interview on a Sunday morning with @ranjitjhala.bsky.social ..absolutely fascinating. Right from philosophical discussions down to a cool demo of refinement types in Rust. Absolutely loved the demo and surely would be playing around with Flux youtu.be/goUZczQAfgk?...
One of the essays of Paul Graham from 2002 that resonated a lot to me when I read back then .. Succinctness is power. I always add a post scriptum - only when not abused .. t.co/MQaDLsEUQe
One of the cool applications of the typestate pattern in Rust is the design of SquirrelFS, a new file system with crash-consistency guarantees that are checked **at compile time**. In Rust the typestate pattern plays nicely with the ownership model semantics .. arxiv.org/abs/2406.09649
Loved this blogpost from matklad and the template for swarm testing an arbitrary data structure .. tigerbeetle.com/blog/2025-04...
It's a generic data structure and can be used for almost everything, not only text. And the best part is, it's a monoid in disguise. No wonder there are more than 20 uses of SumTree in Zed .. (2/2)
link to blogpost: zed.dev/blog/zed-dec...
my data structure lessons on a Friday evening ..
rope in Zed has a very clever implementation. It's implemented in terms of SumTree, a thread-safe, snapshot-friendly, copy-on-write B+ tree. (1/2)
