Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@fanf@mendeddrum.org
2026-01-19 21:42:01

from my link log —
Of donkeys, mules, and horses: data structures for network prefixes in Rust.
blog.nlnetlabs.nl/donkeys-mule
saved 2021-05-27

Of Donkeys, Mules & Horses
A quest for the perfect data-structure to store and retrieve a full table of IP Prefixes, while maintaining the hierarchical relations.

@fanf@mendeddrum.org
2026-01-29 12:42:02

from my link log —
From Pratt parsing to the Dijkstra shunting yard.
matklad.github.io/2020/04/15/f
saved 2020-04-23

From Pratt to Dijkstra
This is a sequel to the previous post about Pratt parsing. Here, we'll study the relationship between top-down operator precedence (Pratt parsing) and the more famous shunting yard algorithm. Spoiler: they are the same algorithm, the difference is implementation style with recursion (Pratt) or a manual stack (Dijkstra).