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 250aa9fb98503fbeb08751f61588b96c26d2c816..79a60204b09ea716c0f99192322586bc62d10d03 100644 (file)
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -11,10 +11,6 @@ o  Log messages should show both original and new size of the data. The speed
    should be probably calculated from the former.
 o  Buffer sizing in shep-export.
 o  Problems with thread stack limit in radix-sorting of arrays.
    should be probably calculated from the former.
 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.

 
 Users of lib/sorter/array.h which might use radix-sorting:
 indexer/chewer.c
 
 Users of lib/sorter/array.h which might use radix-sorting:
 indexer/chewer.c