The README.md says RegExpRouter uses no loops and just regular expressions, presumably it maps a route to a hashmap matched entry?
Related but slightly different:
I am curious because NFAs, deterministic automata are interesting to me. I remember one person on HN talked to me about using regular expressions to match event sequences. (That is: don't match against strings but match against tokens)
I am not a Rust developer, but the pattern of using Rust sum types and pattern matching or OCaml dispatch based on types are similar to me intuitively.
What are your thoughts on this style of programming?
I feel so much of modern business programming is dispatch logic!
If you think of Redux and state machines and event sequences in GUIs for behaviour, I feel there is a lot of untapped potential ideaspace here.