Pádraig Brady 27873f1deb shuf: use memory more efficiently when returning a subset ...

* gl/lib/randperm.c (randperm_new): When the number of items
to return H, is much smaller than the total number of items N,
use a hash to represent the sparse permutations of the set N.
This is currently enabled for N > 128K and N/H > 32.
* tests/misc/shuf: Ensure shuf can quickly return 2 numbers
from a large range.
* gl/modules/randperm: Depend on hash.
* NEWS: Mention the change.

2011-05-14 10:30:12 +01:00

..

fadvise

fadvise: new module providing a simpler interface to posix_fadvise

2010-07-22 01:03:48 +01:00

fadvise-tests

maint: add a missed fadvise-tests module

2010-11-15 14:56:24 +00:00

getloadavg.diff

…

heap

sort: parallelize internal sort

2010-07-13 01:44:46 +01:00

link-tests.diff

…

mbsalign

mbsalign: avoid warning with Solaris 10 cc

2010-10-13 22:41:17 -07:00

mbsalign-tests

maint: update the mbsalign module

2010-03-19 19:23:45 +00:00

randint

…

randperm

shuf: use memory more efficiently when returning a subset

2011-05-14 10:30:12 +01:00

randread

randread: run 2x faster on 64-bit hosts, don't assume no padding bits

2010-07-23 15:08:36 -07:00

randread-tests

tests: randread-tests: use macro.h not "#define ASSERT..."

2011-02-08 08:30:19 +01:00

rename-tests.diff

…

root-dev-ino

…

tempname

…