Conrad Meyer fff4eaebbf sort(1): randomcoll: Skip the memory allocation entirely ... There's no reason to order based on strcmp of ASCII digests instead of memcmp of the raw digests. While here, remove collision fallback. If you collide two MD5s, they're probably the same string anyway. If robustness against MD5 collisions is desired, maybe we shouldn't use MD5. None of the behavior of sort -R is specified by POSIX, so we're free to implement this however we like. E.g., using a 128-bit counter and block cipher to generate unique indices for each line of input. PR: 230792 (2/many) Relnotes: This will change the sort order for a given dataset with a given seed. Other similarly breaking changes are planned. Sponsored by: Dell EMC Isilon		2019-04-04 23:32:27 +00:00
..
nls
tests
bwstring.c
bwstring.h
coll.c	sort(1): randomcoll: Skip the memory allocation entirely	2019-04-04 23:32:27 +00:00
coll.h
file.c	sort(1): Fix -m when only implicit stdin is used for input	2018-06-20 03:31:19 +00:00
file.h	sort(1): Fix -m when only implicit stdin is used for input	2018-06-20 03:31:19 +00:00
Makefile	Don't use absolute path to sed when building usr.bin/join	2018-08-23 18:18:43 +00:00
Makefile.depend
mem.c
mem.h
radixsort.c
radixsort.h
sort.1.in
sort.c	sort(1): Fix -m when only implicit stdin is used for input	2018-06-20 03:31:19 +00:00
sort.h
vsort.c
vsort.h