The complexity analysis can be highly nuanced. Sets with many strings
and/or long strings can in fact require more time for matching due
to locality effects, which depends highly on usage patterns. Prefix
matches can be longer for large sets since the depth of branching
in the trie becomes larger.

But these are considerations at the level of micro-optimization.
It's the difference between two- or three-digit nanosecond mean
times for the matches.

So it suffices to claim that matching is fast and scales well.