2 ms·

If you claim it's the fastest, how does it compare to one-more-re-nightmare? - https://github.com/telekons/one-more-re-nightmare https://github.com/telekons/on

If you claim it's the fastest, how does it compare to one-more-re-nightmare? - https://github.com/telekons/one-more-re-nightmare https://github.com/telekons/one-more-re-nightmare - https://applied-langua.ge/posts/omrn-compiler.html https://applied-langua.ge/posts/omrn-compiler.html OMRN is a regex compiler that leverages Common Lisp's compiler to produce optimized assembly to match the given regex. It's incredibly fast. It does omit some features to achieve that, though.

mananaysiempre 8mo ago
As a potential user (not the author), what jumps out at me about the two is: OMRN: No lookaround, eager compilation, can output first match RE#: No submatches, lazy compilation, must accumulate all matches Both lookaround and submatch extraction are hard problems, but for practical purposes the lack of lazy compilation feels like it would be the most consequential, as it essentially disqualifies the engine from potentially adversarial REs (or I guess not with the state limit, but then it’s questionable if it actually counts as a full RE engine in such an application).