On Tue, 14 Apr 2020, Florian Obser wrote:
I thought so, too. No context, no explanation just a one-liner.
I mean the algorithm. It seems there is a lot of hard work to do with string routines. Also the regular expressions in OpenBSD seems to be the inefficient, perhaps historical implementation of Henry Spencer. BTW. It would be interesting to have something like memmem, but to search many substrings at the same time. And to have back references in lex/flex would be fantastic! :) Rod.
