2 # Ensure that shuf randomizes its input.
4 # Copyright (C) 2006-2012 Free Software Foundation, Inc.
6 # This program is free software: you can redistribute it and/or modify
7 # it under the terms of the GNU General Public License as published by
8 # the Free Software Foundation, either version 3 of the License, or
9 # (at your option) any later version.
11 # This program is distributed in the hope that it will be useful,
12 # but WITHOUT ANY WARRANTY; without even the implied warranty of
13 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 # GNU General Public License for more details.
16 # You should have received a copy of the GNU General Public License
17 # along with this program. If not, see <http://www.gnu.org/licenses/>.
19 .
"${srcdir=.}/init.sh"; path_prepend_ ..
/src
23 seq 100 > in || framework_failure_
25 shuf
in >out || fail
=1
27 # Fail if the input is the same as the output.
28 # This is a probabilistic test :-)
29 # However, the odds of failure are very low: 1 in 100! (~ 1 in 10^158)
30 compare
in out
> /dev
/null
&& { fail
=1; echo "not random?" 1>&2; }
32 # Fail if the sorted output is not the same as the input.
34 compare
in out1 ||
{ fail
=1; echo "not a permutation" 1>&2; }
36 # Exercise shuf's -i option.
37 shuf
-i 1-100 > out || fail
=1
38 compare
in out
> /dev
/null
&& { fail
=1; echo "not random?" 1>&2; }
40 compare
in out1 ||
{ fail
=1; echo "not a permutation" 1>&2; }
42 # Exercise shuf's -e option.
43 t
=`shuf -e a b c d e | sort | fmt`
44 test "$t" = 'a b c d e' ||
{ fail
=1; echo "not a permutation" 1>&2; }
46 # Before coreutils-6.3, this would infloop.
47 # "seq 1860" produces 8193 (8K + 1) bytes of output.
48 seq 1860 | shuf
> /dev
/null || fail
=1
50 # coreutils-6.12 and earlier would output a newline terminator, not \0.
51 shuf
--zero-terminated -i 1-1 > out || fail
=1
52 printf '1\0' > exp || framework_failure_
53 cmp out exp ||
{ fail
=1; echo "missing NUL terminator?" 1>&2; }
55 # Ensure shuf -n operates efficiently for small n. Before coreutils-8.13
56 # this would try to allocate $SIZE_MAX * sizeof(size_t)
57 timeout
10 shuf
-i1-$SIZE_MAX -n2 >/dev
/null ||
58 { fail
=1; echo "couldn't get a small subset" >&2; }