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

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index 79a60204..d78ef9b9 100644
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -1,16 +1,12 @@
-Testing:
-o  Giant runs.
-o  Records of odd lengths.
-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  Buffer sizing in shep-export.
-o  Problems with thread stack limit in radix-sorting of arrays.
+
+Improvements:
+o  When quicksorting a large input (especially in threaded case), invest more
+   time to picking a good pivot.
 
 Users of lib/sorter/array.h which might use radix-sorting:
 indexer/chewer.c