Merge with git+ssh://git.ucw.cz/projects/sherlock/GIT/sherlock.git

[libucw.git] / lib / sorter / TODO

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index c2b653d5b96f4b2e5a3861befdb1cbbeddc88cd8..bd399e2a0d6884cac7df928cae615ffc7eb5378e 100644 (file)
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -1,21 +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  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  When quicksorting a large input (especially in threaded case), invest more
+   time to picking a good pivot.
+o  Overlay presorter I/O with internal sorting.
 
 Users of lib/sorter/array.h which might use radix-sorting:
 indexer/chewer.c