2 ms·
While gperf (unlike, say, CMPH[1]) is also intended for small sets of short strings, I expect the difference here is in the definition of “small”: in the articl
by mananaysiempre 4y ago
While gperf (unlike, say, CMPH[1]) is also intended for small sets of short strings, I expect the difference here is in the definition of “small”: in the article, it’s six, whereas in gperf’s intended application, it’s more like six dozen (and CMPH’s “large” is thousands to millions).
[1] https://cmph.sourceforge.net/gperf.html https://cmph.sourceforge.net/gperf.html
- rurban 4y agoI've optimized gperf and nbperf to such small sets. I also add the padding, when it helps in the hash and comparison. cmph has an extremely large constant overhead. https://github.com/rurban/nbperf https://github.com/rurban/nbperf https://github.com/rurban/gperf https://github.com/rurban/gperf