b31907d700c1fe956e4e4c20e64d91de027d7c84
markd
  Tue May 14 02:03:33 2024 -0700
merge blatHuge implementation

diff --git src/jkOwnLib/patSpace.c src/jkOwnLib/patSpace.c
index 80f1de7..2e73ecc 100644
--- src/jkOwnLib/patSpace.c
+++ src/jkOwnLib/patSpace.c
@@ -249,31 +249,31 @@
     int seedSize,	            /* Alignment seed size - 10 or 11. Must match oocFileName */
     char *oocFileName,              /* File with tiles to filter out, may be NULL. */
     int minMatch,                   /* Minimum # of matching tiles.  4 is good. */
     int maxGap                      /* Maximum gap size - 32k is good for 
                                        cDNA (introns), 500 is good for DNA assembly. */
     )
 /* Allocate a pattern space and fill from sequences.  (Each element of
    seqArray is a list of sequences. */
 {
 struct patSpace *ps = newPatSpace(minMatch, maxGap,seedSize);
 int i;
 int startIx = 0;
 int total = 0;
 struct dnaSeq *seq;
 psBits maxPat;
-psBits *listSizes;
+bits32 *listSizes;
 int seedSpaceSize = ps->seedSpaceSize;
 
 maxPat = ps->maxPat = maxPatCount;
 for (i=0; i<seqArrayCount; ++i)
     {
     for (seq = seqArray[i]; seq != NULL; seq = seq->next)
         {
         total += seq->size;
         countPatSpace(ps, seq);
         }
     }
 
 listSizes = ps->listSizes;
 
 /* Scan through over-popular patterns and set their count to value