X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=lib%2Fsorter%2FTODO;h=a3193083089ef4d7fc45c406cc3515161b4085d9;hb=09108be37909fd087b301c221881fd11601e88b5;hp=ed0af57b3de5a42cdd31a7111a79e082f96b6412;hpb=280892f550b5e98870fc1de117891212f32d4749;p=libucw.git

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index ed0af57b..a3193083 100644
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -1,20 +1,8 @@
-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  Automatically tune ASORT_MIN_RADIX, ASORT_MIN_SHIFT and especially ASORT_RADIX_BITS.
-
-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.
 
 Users of lib/sorter/array.h which might use radix-sorting:
 indexer/chewer.c