dbf64ebe4a5118f6ce418f0beb42fbd20821113a
chmalee
  Fri Oct 28 17:15:59 2022 -0700
Fix erroneous trix prefixing problem. When looking for snippets we use a larger trixPrefixSize for a speedup, but I was forgetting to reset the size when opening up the next trix index later on. Fix missing highlights on search results page. refs #26963

diff --git src/index/trixSearch/trixSearch.c src/index/trixSearch/trixSearch.c
index 831a452..7af816a 100644
--- src/index/trixSearch/trixSearch.c
+++ src/index/trixSearch/trixSearch.c
@@ -1,100 +1,101 @@
 /* trixSearch - search trix free text index from command line. */
 #include "common.h"
 #include "linefile.h"
 #include "hash.h"
 #include "options.h"
 #include "trix.h"
 
 
 int maxReturn = 20;
 boolean full = FALSE;
 
 void usage()
 /* Explain usage and exit. */
 {
 errAbort(
   "trixSearch - search trix free text index from command line.\n"
   "usage:\n"
   "   trixSearch file word(s)\n"
   "options:\n"
   "   -maxReturn=%d - maximum number of matches to return\n"
   "   -full - return additional search information rather than just ordered list of matching IDs\n"
   , maxReturn
   );
 }
 
 static struct optionSpec options[] = {
    {"maxReturn", OPTION_INT},
    {"full", OPTION_BOOLEAN},
    {NULL, 0},
 };
 
 void dumpTsList(struct trixSearchResult *tsList, int showCount, int matchCount)
 /* Dump out contents of tsList to stdout. */
 {
 struct trixSearchResult *ts;
 
 if (full)
     {
     printf("#showing %d of %d matches\n", showCount, matchCount);
     printf("#identifier\tunordered_span\tordered_span\tpos\tsnippet\n");
     }
 for (ts = tsList; ts != NULL; ts = ts->next)
     {
     if (full)
 	{
 	printf("%s\t%d\t", ts->itemId, ts->unorderedSpan);
 	if (ts->orderedSpan == BIGNUM)
 	    printf("n/a");
 	else
 	    printf("%d", ts->orderedSpan);
     int i = 0;
     printf("\t");
     for (i = 0; i < ts->wordPosSize; i++)
         {
         printf("%d", ts->wordPos[i]);
         if (i + 1 < ts->wordPosSize)
             printf(",");
         }
 	printf("\t%s\n",ts->snippet);
 	}
     else
         printf("%s\n", ts->itemId);
     }
 }
 
 void trixSearchCommand(char *inFile, int wordCount, char *words[])
 /* trixSearchCommand - search trix free text index from command line. */
 {
 struct trix *trix;
 char ixFile[PATH_LEN];
 struct trixSearchResult *tsList;
 int i;
 
 safef(ixFile, sizeof(ixFile), "%s.ix", inFile);
 for (i=0; i<wordCount; ++i)
     tolowers(words[i]);
 trix = trixOpen(ixFile);
 tsList = trixSearch(trix, wordCount, words, tsmExpand);
 int matchCount = slCount(tsList);
 int showCount = min(matchCount, maxReturn);
 struct trixSearchResult *tsr = slElementFromIx(tsList, maxReturn-1);
 if (tsr)
     tsr->next = NULL;
+if (full)
     addSnippetsToSearchResults(tsList, trix);
 dumpTsList(tsList, showCount, matchCount);
 trixSearchResultFreeList(&tsList);
 trixClose(&trix);
 }
 
 int main(int argc, char *argv[])
 /* Process command line. */
 {
 optionInit(&argc, argv, options);
 if (argc < 3)
     usage();
 maxReturn = optionInt("maxReturn", maxReturn);
 full = optionExists("full");
 trixSearchCommand(argv[1], argc-2, argv+2);
 return 0;
 }