Use a different file access method for small inputs.

[libucw.git] / lib / sorter / TODO

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index c2b653d5b96f4b2e5a3861befdb1cbbeddc88cd8..79a60204b09ea716c0f99192322586bc62d10d03 100644 (file)
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -9,13 +9,8 @@ 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.
-
-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?
+o  Problems with thread stack limit in radix-sorting of arrays.
 
 Users of lib/sorter/array.h which might use radix-sorting:
 indexer/chewer.c