Conrad Meyer f20b149b45 sort(1): Memoize MD5 computation to reduce repeated computation ... Experimentally, reduces sort -R time of a 148160 line corpus from about 3.15s to about 0.93s on this particular system. There's probably room for improvement using some digest other than md5, but I don't want to look at sort(1) anymore. Some discussion of other possible improvements in the Test Plan section of the Differential. PR: 230792 Reviewed by: jhb (earlier version) Differential Revision: https://reviews.freebsd.org/D19885		2019-04-13 04:42:17 +00:00
..
nls
tests	sort(1): Add bits to allow easy checking against NetBSD tests	2018-06-20 03:10:49 +00:00
bwstring.c
bwstring.h
coll.c	sort(1): Memoize MD5 computation to reduce repeated computation	2019-04-13 04:42:17 +00:00
coll.h	sort(1): Memoize MD5 computation to reduce repeated computation	2019-04-13 04:42:17 +00:00
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	Fix the WITH_SORT_THREADS build.	2018-02-07 20:36:37 +00:00
radixsort.h
sort.1.in
sort.c	sort(1): Memoize MD5 computation to reduce repeated computation	2019-04-13 04:42:17 +00:00
sort.h
vsort.c
vsort.h