Shaved off a couple of items from the TODO.

[libucw.git] / lib / sorter / TODO

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index f4a802cacbceb191459a33a6bcd864a95aab51e6..f4fe053d8666e01d8f6536b01917fc279c9f4935 100644 (file)
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -4,11 +4,8 @@ o  Records of odd lengths.
 o  Empty files.
 
 Improvements:
-o  Use radix-sort for internal sorting.
-o  Parallelization of internal sorting.
 o  Clean up data types and make sure they cannot overflow. (size_t vs. u64 vs. sh_off_t vs. uns)
-o  Switching between direct and normal I/O.
-o  Deal with too rough range estimates in radix splitting.
+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  Log messages should show both original and new size of the data. The speed