✳flâneur — a map of the web's best reading

Index 1,600,000,000 Keys with Automata and Rust - Andrew Gallant's Blog

burntsushi.net · 18,899 words · saved by 1 readers

I blog mostly about my own programming projects.

It turns out that finite state machines are useful for things other than expressing computation. Finite state machines can also be used to compactly represent ordered sets or maps of strings that can be searched very quickly. In this article, I will teach you about finite state machines as a data structure for representing ordered sets and maps. This includes introducing an implementation written in Rust called the fst crate . It comes with complete API documentation . I will also show you how to build them using a simple command line tool. Finally, I will discuss a few experiments culminating

Explore this link on the map →

saved by

related reading