Lines Matching defs:aFirst
224537 int nFirstAlloc; /* Allocated size of aFirst[] */
224538 int nFirst; /* Number of entries in aFirst[] */
224539 int *aFirst; /* Array of first token in each sentence */
224544 ** Add an entry to the Fts5SFinder.aFirst[] array. Grow the array if
224553 aNew = (int*)sqlite3_realloc64(p->aFirst, nNew*sizeof(int));
224555 p->aFirst = aNew;
224558 p->aFirst[p->nFirst++] = iAdd;
224565 ** For each such token, an entry is added to the SFinder.aFirst[] array.
224744 if( sFinder.aFirst[jj+1]>io ) break;
224747 if( sFinder.aFirst[jj]<io ){
224750 sFinder.aFirst[jj], nToken, &nScore, 0
224753 nScore += (sFinder.aFirst[jj]==0 ? 120 : 100);
224757 iBestStart = sFinder.aFirst[jj];
224806 sqlite3_free(sFinder.aFirst);
230494 ** aFirst[] arrays are sized at nSeg entries. The aSeg[] array is padded
230499 ** even number, is stored in aFirst[(nSeg+N)/2]. The "result" of the
230504 ** aFirst[1] contains the index in aSeg[] of the iterator that points to
230505 ** the smallest key overall. aFirst[0] is unused.
230525 i64 iSwitchRowid; /* Firstest rowid of other than aFirst[1] */
230526 Fts5CResult *aFirst; /* Current merge state (see above) */
231918 Fts5SegIter *pSeg = &pIter->aSeg[pIter->aFirst[1].iFirst];
232630 ** statement used to verify that the contents of the pIter->aFirst[] array
232635 Fts5SegIter *pFirst = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
232654 Fts5CResult *pRes = &pIter->aFirst[(pIter->nSeg + i) / 2];
232659 Fts5SegIter *p1 = &pIter->aSeg[ pIter->aFirst[i*2].iFirst ];
232660 Fts5SegIter *p2 = &pIter->aSeg[ pIter->aFirst[i*2+1].iFirst ];
232661 Fts5CResult *pRes = &pIter->aFirst[i];
232671 ** Do the comparison necessary to populate pIter->aFirst[iOut].
232684 Fts5CResult *pRes = &pIter->aFirst[iOut];
232693 i1 = pIter->aFirst[iOut*2].iFirst;
232694 i2 = pIter->aFirst[iOut*2+1].iFirst;
232837 Fts5Iter *pIter, /* Iterator to update aFirst[] array for */
232839 int iMinset /* Minimum entry in aFirst[] to set */
232856 ** attempts to update the contents of the pIter->aFirst[] accordingly.
232864 Fts5Iter *pIter, /* Iterator to update aFirst[] array for */
232877 Fts5CResult *pRes = &pIter->aFirst[i];
232895 pOther = &pIter->aSeg[ pIter->aFirst[i ^ 0x0001].iFirst ];
232907 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
232928 int iFirst = pIter->aFirst[1].iFirst;
232943 pSeg = &pIter->aSeg[pIter->aFirst[1].iFirst];
232948 assert( pSeg==&pIter->aSeg[pIter->aFirst[1].iFirst] && pSeg->pLeaf );
232966 int iFirst = pIter->aFirst[1].iFirst;
233000 sizeof(Fts5CResult) * nSlot /* pNew->aFirst[] */
233004 pNew->aFirst = (Fts5CResult*)&pNew->aSeg[nSlot];
233522 ** aFirst[] array. Or, if an error has occurred, free the iterator
233539 Fts5SegIter *pSeg = &pNew->aSeg[pNew->aFirst[1].iFirst];
233573 pNew->aFirst[1].iFirst = 1;
233600 || (pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf==0)==pIter->base.bEof
233611 assert( pIter->aSeg[ pIter->aFirst[1].iFirst ].pLeaf );
233612 return pIter->aSeg[ pIter->aFirst[1].iFirst ].iRowid;
233638 Fts5SegIter *p = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
234359 Fts5SegIter *pSegIter = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
235256 Fts5SegIter *pSeg = &p1->aSeg[ p1->aFirst[1].iFirst ];
235273 Fts5SegIter *pSeg = &p1->aSeg[ p1->aFirst[1].iFirst ];
235622 Fts5SegIter *pSeg = &pRet->aSeg[pRet->aFirst[1].iFirst];
235664 Fts5SegIter *pSeg = &pIter->aSeg[ pIter->aFirst[1].iFirst ];
236294 fts5SegiterPoslist(p, &pIter->aSeg[pIter->aFirst[1].iFirst], 0, &poslist);