Index 1,600,000,000 Keys with Automata and Rust
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 ...
Read more at blog.burntsushi.net