On 08/08/10 03:31, Bruno Haible wrote:
>> The point
>> remains, though, that it's confusing that gnulib memxfrm's name begins
>> with "mem", as the mem* functions don't allocate memory. Would you
>> consider a patch that renames gnulib memxfrm to amemxfrm, or to some
>> other such name?
>
> No,
Hello.
I propose to add to bootstrap key --skip-git (analog --skip-po),
completely eliminates the use git in the bootstrap process. Now this
behavior may occur if the directory specified by --gnulib-srcdir (or
specified in the $ GNULIB_SRCDIR) not git repository. But it is
desirable to have the
Paul Eggert writes:
> On 08/06/10 01:22, Paolo Bonzini wrote:
>> ISAAC is a RNG, so wouldn't that have the same problem above? You
>> definitely need to use a hash function, it's just that you do not need a
>> cryptographic one.
>
> I had been thinking of using ISAAC by making the key its seed,
Two suggestions to improve formatting of gnulib.pdf:
. To avoid thousands of overlong lines, replace
POSIX specification: @url{...}
with
POSIX specification:@*
@url{...}
I think this is beneficial even for the HTML version of the gnulib
documentation.
. The patch below (aga
Hi Paul,
> (Ooo! Ooo! Performance measurements! I love this stuff!)
Me too :-)
> It depends on the data. In the typical case, "sort" is applied to
> text data, which does not contain NUL bytes. The data in that
> benchmark contained many NUL bytes. If you take the same benchmark
> and unif
On 08/07/10 04:40, Simon Josefsson wrote:
> I suspect FNV or Xorshift would be faster, since they are so simple:
Yes, they'd be faster, but there may be some collision
problems with those. FNV would seem better suited, since it's
a hash function. I did quick scan for relevant articles and
found
