Use a different file access method for small inputs.

[libucw.git] / lib / sorter / TODO

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index 679649929abe3ac86c64546c45ea1377ae9ef7a3..79a60204b09ea716c0f99192322586bc62d10d03 100644 (file)
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -3,13 +3,17 @@ o  Giant runs.
 o  Records of odd lengths.
 o  Empty files.
 
 o  Records of odd lengths.
 o  Empty files.
 

-Improvements:
-o  Use radix-sort for internal sorting.
-o  Parallelization of internal sorting.
+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 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. Should use normal I/O if the input is small enough.
-o  Deal with too rough range estimates in radix splitting.
-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  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  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.
+
+Users of lib/sorter/array.h which might use radix-sorting:
+indexer/chewer.c
+indexer/lexfreq.c
+indexer/mkgraph.c
+indexer/reftexts.c