Hacker News Reader

Right. Out of curiosity I looked into what code gperf generates and it seems it would end up O(1) for misses (it's always three lookups into a generated table) and O(L) for hits, as a potential hit has to be confirmed by essentially a strcmp. Not sure how something like https://github.com/rust-phf/rust-phf would work, but probably similar?

They don't know all the data that's being hashed, though. They know everything that's in the map, but not all the keys they're trying to lookup.

if all your internal headers start with cf- and most non-internal headers don't (but not all) and most headers are non-internal a trie might be hard to beat

Isn't the sticky wicket collisions with external to CF defined headers?