Cyril Zhang 68d3790ba0 sort: Change default algorithm to mergesort ...

This results in a significant improvement in the runtime of sort(1) when
radix sort cannot be used.  This comes at the expense of increased
memory usage, but this is small relative to sort's overall memory usage.

PR:		255551
Reviewed by:	markj
Sponsored by:	The FreeBSD Foundation
Differential Revision:	https://reviews.freebsd.org/D30319

2021-06-17 13:53:03 -04:00

..

nls

…

tests

…

bwstring.c

sort: Cache value of MB_CUR_MAX

2021-05-13 09:33:19 -04:00

bwstring.h

sort: Cache value of MB_CUR_MAX

2021-05-13 09:33:19 -04:00

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): Remove duplicate option check

2020-09-08 15:01:49 +00:00

file.h

sort: Change default algorithm to mergesort

2021-06-17 13:53:03 -04:00

Makefile

sort: Hook NetBSD tests up to the build

2021-05-13 09:34:01 -04:00

Makefile.depend

Update Makefile.depend files

2019-12-11 17:37:53 +00:00

Makefile.depend.options

Add Makefile.depend.options

2019-12-11 17:37:37 +00:00

mem.c

…

mem.h

…

radixsort.c

sort: Cache value of MB_CUR_MAX

2021-05-13 09:33:19 -04:00

radixsort.h

…

sort.1.in

Adjust history, info source from v1's manuals

2019-09-04 13:44:46 +00:00

sort.c

sort: Cache value of MB_CUR_MAX

2021-05-13 09:33:19 -04:00

sort.h

sort: Cache value of MB_CUR_MAX

2021-05-13 09:33:19 -04:00

vsort.c

…

vsort.h

…