Convert the most important users of arraysort.h to sorter/array.h.

So far, I didn't have used radix-sorting, because I want to save memory,
but if any of these sorters will turn up on the profiles, I will convert it
later.

diff --git a/lib/sorter/TODO b/lib/sorter/TODO
index 52fb6cf523f51562b3fbf06694a58846a292f697..09e4986b50cb6ad85b96dc4e26312f5a13ff71f1 100644 (file)
--- a/lib/sorter/TODO
+++ b/lib/sorter/TODO
@@ -16,17 +16,8 @@ o  How does the speed of radix splitting decrease with increasing number of hash
    Does it help to use more bits than we need, so that we sort less data in memory?
 o  Add automatic joining to the custom presorter interface?
 
-Users of lib/arraysort.h on big arrays (consider conversion to lib/sorter/array.h):
-
-indexer/chewer.c                       fixed           hash + others
-indexer/chewer.c                       u32             id
-indexer/imagesigs.c                    fixed           s32
-indexer/lexfreq.c                      ptr             indirect int
-indexer/lexorder.c                     ptr             complex
-indexer/lexorder.c                     ptr             complex
-indexer/lexsort.c                      ptr             complex
-indexer/mergeimages.c                  fixed           s32
-indexer/mkgraph.c                      u32             indirect int
-indexer/mkgraph.c                      2*u32           complex, but have hash
-indexer/mkgraph.c                      2*u32           complex, but have hash
-indexer/reftexts.c                     fixed           indirect int
+Users of lib/sorter/array.h which might use radix-sorting:
+indexer/chewer.c
+indexer/lexfreq.c
+indexer/mkgraph.c
+indexer/reftexts.c