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

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index 207eefa2..f4a802ca 100644
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -8,7 +8,6 @@ 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  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?