181319a8467865af984e1b3980ff5124f7a31d6c
galt
  Mon Mar 31 15:30:14 2025 -0700
Fixes for bad slNameSort override in findCutters util. refs #26947

diff --git src/hg/utils/findCutters/findCutters.c src/hg/utils/findCutters/findCutters.c
index effe3f800f0..2bda4b6c804 100644
--- src/hg/utils/findCutters/findCutters.c
+++ src/hg/utils/findCutters/findCutters.c
@@ -89,31 +89,31 @@
     struct bed *bedList = matchEnzymes(cutters, seq, 0);
     if (bedList)
 	{
 	spitBedList(bedList, f);
 	bedFreeList(&bedList);
 	}
     }
 carefulClose(&f);
 }
 
 void writeHashToFile(struct hash *countHash, char *outputFile)
 /* Make an slPair list out of a hashEl list, sort it, output it. */
 {
 FILE *f = mustOpen(outputFile, "w");
 struct hashEl *el, *list = hashElListHash(countHash);
-slNameSort((struct slName **)&list);
+slSort(&list, hashElCmp);
 for (el = list; el != NULL; el = el->next)
     fprintf(f, "%s\t%d\n", el->name, ptToInt(el->val));
 carefulClose(&f);
 hashElFreeList(&list);
 }
 
 void findCounts(struct cutter *cutters, struct dnaSeq *seqs, char *outputFile)
 /* Go through each sequence, and each time add the counts of the enzymes */
 /* encountered to the hash of counts. */
 {
 struct dnaSeq *seq;
 struct hash *countHash = initCutterCountHash(cutters);
 for (seq = seqs; seq != NULL; seq = seq->next)
     {
     struct bed *bedList = matchEnzymes(cutters, seq, 0);