It was quite a journey, at first I thought I invented a novel concurrency schema. However, it turns out that it was simply a mix of my ignorance and hubris! :-)
Still, I had a lot of fun while designing this data structure and I believe it made a nice story. Ask me anything!
[0] https://github.com/BurntSushi/fst
[1] https://blog.burntsushi.net/transducers/
The main limitation of it is that it doesn't support removal, but if removals are infrequent you can workaround that with another fst with removed items (and periodically rebuild the whole thing)
The regex crate has multiple implementations of regex matching algorithms, which is exposed as a library [1]. The implementations are selected at runtime based on which is faster and works right for a given regex. See also [2]
[0] https://blog.burntsushi.net/ripgrep/
[1] https://blog.burntsushi.net/regex-internals/
[2] https://docs.rs/regex-automata/latest/regex_automata/#availa...
No, it isn't. The only similarity between them is finite state machines. Cox's article is about regexes. The fst crate is a data structure for storing keys and optional values. Two completely different things.