Lines Matching full:sort

6 #include "radix-sort.h"
20 /* Piles smaller than this are handled with a simple insertion sort. */
23 /* Sort keys are pointers to immutable fixed-length arrays of bytes. */
46 	/* Pointer to the first key to sort. */
48 	/* Pointer to the last key to sort. */
52 	/* The number of bytes remaining in the sort keys. */
87  * Sort a range of key segments using an insertion sort. This simple sort is faster than the
88  * 256-way radix sort when the number of keys to sort is small.
118  * Count the number of times each byte value appears in the arrays of keys to sort at the current
157  * After the keys are moved to the appropriate pile, we'll need to sort each of the piles by the
167  * @offset: the next radix position to sort by
168  * @length: the number of bytes remaining in the sort keys
187 		/* There's no need to sort empty keys. */  in push_bins()
231  * Sort pointers to fixed-length keys (arrays of bytes) using a radix sort. The sort implementation
246 	/* The initial task is to sort the entire length of all the keys. */  in uds_radix_sort()
279 		 * and push a new task to sort each pile by the next radix byte.  in uds_radix_sort()
323 		 * insertion sort than to keep subdividing into tiny piles.  in uds_radix_sort()