198c9b8daecc44fbda6a6494c566c723920f030a
lrnassar
  Wed Mar 11 18:25:21 2026 -0700
Fixing a few hundred clear typos with the help of Claude. Some are less important in code comments, but majority of them are in user-facing places. I manually approved 60%+ of the changes and didn't see any that were an incorrect suggestion, at worst it was potentially uncessesary, like a code comment having cant instead of can't. No RM.

diff --git src/lib/trix.c src/lib/trix.c
index f9821c67a50..143d0ea3a01 100644
--- src/lib/trix.c
+++ src/lib/trix.c
@@ -555,31 +555,31 @@
 int firstWordPos = 0;
 struct trixWordResult *twr;
 for (twr = twrList; twr != NULL; twr = twr->next)
     {
     int pos = twr->hit->wordIx;
     if (firstWordPos < pos)
         firstWordPos = pos;
     }
 return firstWordPos;
 }
 
 static int findOrderedSpan(struct trixWordResult *twrList, char *itemId, int **retWordPos)
 /* Find out smallest number of words in doc that will cover
  * all words in search. */
 {
-int minSpan = BIGNUM - 1;  // subtract 1 to accomodate adding 1 below
+int minSpan = BIGNUM - 1;  // subtract 1 to accommodate adding 1 below
 struct trixWordResult *twr;
 
 /* Set up iHit pointers we use to keep track of our 
  * search.  Don't want to mess with hit pointers as they
  * will be used later. */
 for (twr = twrList; twr != NULL; twr = twr->next)
     twr->iHit = twr->hit;
 
 int numWords = slCount(twrList);
 int *orderedWordPositions;
 AllocArray(orderedWordPositions, numWords);
 for (;;)
     {
     int startWord = twrList->iHit->wordIx-1;
     int endWord = startWord;
@@ -599,31 +599,31 @@
             if (hit->wordIx > endWord)
                 break;
             }
         twr->iHit = hit;
         endWord = hit->wordIx;
         orderedWordPositions[i] = hit->wordIx-1;
         }
     span = endWord - startWord;
     if (span < minSpan)
         {
         orderedWordPositions[0] = startWord;
         CopyArray(orderedWordPositions, *retWordPos, numWords);
         minSpan = span;
         }
 
-    /* Advance to next occurence of first word. */
+    /* Advance to next occurrence of first word. */
     hit = twrList->iHit = twrList->iHit->next;
     if (hit == NULL || !sameString(hit->itemId, itemId))
         {
         return minSpan+1;
         }
     }
 }
 
 
 static struct trixSearchResult *findMultipleWordHits(struct trixWordResult *twrList)
 /* Return list of items that are hit by all words. */
 {
 struct trixWordResult *twr;
 struct trixSearchResult *tsList = NULL, *ts;