From 2051ed5fa51957070c6c3eeb161ddd7ad08f75de Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Tue, 11 Sep 2007 15:17:38 +0200 Subject: [PATCH] Sweeping over TODO. --- lib/sorter/TODO | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/lib/sorter/TODO b/lib/sorter/TODO index c2b653d5..250aa9fb 100644 --- a/lib/sorter/TODO +++ b/lib/sorter/TODO @@ -9,13 +9,12 @@ o Clean up log levels. o Clean up introductory comments. o Log messages should show both original and new size of the data. The speed should be probably calculated from the former. -o Automatically tune ASORT_MIN_RADIX, ASORT_MIN_SHIFT and especially ASORT_RADIX_BITS. o Buffer sizing in shep-export. +o Problems with thread stack limit in radix-sorting of arrays. +o Prediction of destination buffer in array radix-sorts. Improvements: o Switching between direct and normal I/O. Should use normal I/O if the input is small enough. -o How does the speed of radix splitting decrease with increasing number of hash bits? - Does it help to use more bits than we need, so that we sort less data in memory? Users of lib/sorter/array.h which might use radix-sorting: indexer/chewer.c -- 2.39.2