From f08c91407f0ccdcc07cee4a49ccb4bddd4c35988 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sat, 8 Sep 2007 20:25:00 +0200 Subject: [PATCH] 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. --- lib/sorter/TODO | 19 +++++-------------- 1 file changed, 5 insertions(+), 14 deletions(-) diff --git a/lib/sorter/TODO b/lib/sorter/TODO index 52fb6cf5..09e4986b 100644 --- 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 -- 2.39.2