X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=inline;f=lib%2Fsorter%2FTODO;h=79a60204b09ea716c0f99192322586bc62d10d03;hb=a5ff98a53789157a6c96e58b2385bb898d688a22;hp=a86acf1e42cd3897ca1d69b5a3632851a3853b1c;hpb=6ba042cf64e2de2e21ecc8713e737392ba19a45a;p=libucw.git

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index a86acf1e..79a60204 100644
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -5,15 +5,12 @@ o  Empty files.
 
 Cleanups:
 o  Clean up data types and make sure they cannot overflow. (size_t vs. u64 vs. sh_off_t vs. uns)
+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  Check undefs in sorter.h and array.h.
-
-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  Buffer sizing in shep-export.
+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