I'm having a problem building the Gnulib getdate module as part of CVS
when building in a directory other than the source directory:
test -f getdate.c || /bin/sh
/u/scjones/cvs-nightly/build-aux/ylwrap /u/scjones/cvs-nightly/lib/getdate.y
y.tab.c getdate.c y.tab.h getdate.h y.out
I ran into this build failure in m4 when cross-compiling to mingw:
gcc -mno-cygwin -std=gnu99 -gdwarf-2 -Wall -Werror -o test-avltree_oset.exe
test-avltree_oset.o libtests.a ../lib/libm4.a libtests.a
libtests.a(progname.o): In function `set_program_name':
../../tests/progname.c:44: undefin
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
According to Jim Meyering on 12/20/2007 12:33 AM:
> Eric Blake <[EMAIL PROTECTED]> wrote:
> ...
>> - The implementation was naively quadratic in the worst-case complexity. I
>> lifted Bruno's KMP ideas in mbsstr to make it linear+delayed allocation.
On Dec 20, 2007 1:27 PM, Eric Blake <[EMAIL PROTECTED]> wrote:
> Also, I wonder if Boyer-Moore would be any more effective than KMP in the
> average case (both have worst-case linear complexity, but we know that in
> general, we aren't always dealing with worst-case).
>
> http://en.wikipedia.org/wi
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
According to James Youngman on 12/20/2007 3:59 AM:
> I've been fiddling around with Bruno's KMP code recently. I like it a
> lot. I wish though there was some way for the caller to indicate
> that they are willing to amortise the cost of the KMP ini
On Dec 19, 2007 11:15 PM, Eric Blake <[EMAIL PROTECTED]> wrote:
> - The implementation was naively quadratic in the worst-case complexity. I
> lifted Bruno's KMP ideas in mbsstr to make it linear+delayed allocation.
> glibc
> still uses the naive implementation - should we file a bug with them
Eric Blake <[EMAIL PROTECTED]> writes:
> Several issues with memmem:
>
> - It uses memcmp without depending on the memcmp module, making it needlessly
> fail on some older platforms. But memcmp is currently licensed LGPL; is it
> okay with everyone that this patch relicenses it as LGPLv2+? (Or
