matchgen VS rust-phf

I’ve been enabling most of the pedantic lints on most of my projects. I was kind of surprised this isn’t part of the pedantic lint group, but it’s part of the restriction group. Looking through that list there are some other lints I’ll probably want to enable.

I’m experimenting with generating code that matches sequences at the start of an iterator. Basically, I give it a bunch of byte strings and what they map to, and it produces a giant match block that evaluates them.

could you create compile-time maps with https://github.com/rust-phf/rust-phf ? that way you don't pay the performance penalty of reading the ron files at runtime

However I'm still stuck for the matching between packet and handler. Phf map (static maps) doesn't support mapping to enum so I have to make a matching clause :

Have you seen the crate phf?

Maybe phf will come handy?

This is sort of an aside, but turning a not small index into a match statement is probably going to use more memory than the base data and suck for compile time. Might be smarter to include the index as bytes for ex with include! and interpret it directly. You could precompile a hash table with something like rust-phf: https://github.com/rust-phf/rust-phf.

A great example of how this is typically done is the phf crate: https://github.com/rust-phf/rust-phf

https://github.com/rust-phf/rust-phf comes to mind.

If you’re looking for something like gperf: https://github.com/rust-phf/rust-phf

Are all the keys known at compile-time? If so https://github.com/rust-phf/rust-phf might be best.