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

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index 207eefa2..79a60204 100644
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -3,14 +3,17 @@ o  Giant runs.
 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  Switching between direct and normal I/O.
-o  When merging, choose the output file with less runs instead of always switching?
-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  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