James Youngman wrote:
> I notice that the gnulib fnmatch implementation is slower than the
> regex implementation, at least in those cases where a pattern can be
> compiled once and offered thousands of times. Very roughly, I'd guess
> that the fnmatch implementation takes about 1.4x the time that
On Dec 7, 2007 6:57 AM, Jim Meyering <[EMAIL PROTECTED]> wrote:
> This is news to me.
> What type of patterns/regexps are you comparing?
Writing a test program shows me that it seems to be the other way
around, which is less surprising. More careful testing with find
shows a result consistent wi
"James Youngman" <[EMAIL PROTECTED]> wrote:
> I notice that the gnulib fnmatch implementation is slower than the
> regex implementation, at least in those cases where a pattern can be
> compiled once and offered thousands of times. Very roughly, I'd guess
> that the fnmatch implementation takes a
I notice that the gnulib fnmatch implementation is slower than the
regex implementation, at least in those cases where a pattern can be
compiled once and offered thousands of times. Very roughly, I'd guess
that the fnmatch implementation takes about 1.4x the time that the
regex implementation take
