5 ms·
The cited benchmark is completely bogus. The benchmark compares the different implementations based a single trivial regular expression: /indecipherable|undeci
by alxv 17y ago
The cited benchmark is completely bogus.
The benchmark compares the different implementations based a single trivial regular expression: /indecipherable|undecipherable/. You simply cannot claim a regex engine is faster than another with such a poor experiment. It is evident that Boyer–Moore string search algorithm will outshine any engine on that regular expression.
- mahmud 17y agoOuch! Ineed, it's a lousy benchmark; I only recommended it from memory because it blew me away the first time I saw it. FWIW, if anybody can recommend a good benchmark, I would be happy to do a write up since I am proud of the regex performance of the other CL library (cl-ppcre.)