Lines Matching refs:bFirst

148859   int bFirst;                     /* True if token must appear at position 0 */
151883         | (pTok->bFirst ? FTS3_SEGMENT_FIRST : 0)
153121     if( pToken->bFirst || (pToken->pSegcsr!=0 && !pToken->pSegcsr->bLookup) ){
155571             pRet->pPhrase->aToken[0].bFirst = 1;
155677         pToken->bFirst = (iBegin>0 && zInput[iBegin-1]=='^');
162635   int bFirst = (p->term.n==0);    /* True for first term on the node */
162641   if( p->iChild && bFirst==0 ) p->iChild++;
162646     if( bFirst==0 ){
162824   int bFirst = (pPrev->n==0);     /* True if this is the first term written */
162841   if( bFirst==0 ){
164315                 && (pPT->bFirst==0 || iPos==0)
190195     int bFirst = 1;
190206       if( bFirst==0 && p[0]==',' ){
190239       bFirst = 0;
191002   u8 bFirst;                      /* True if token must be first in column */
191343   int bFirst = pPhrase->aTerm[0].bFirst;
191398     if( bFirst==0 || FTS5_POS2OFFSET(iPos)==0 ){
191656        || pNear->pColset || pPhrase->aTerm[0].bFirst
191838        || pNear->apPhrase[0]->aTerm[0].bFirst
192369     pPhrase->aTerm[0].bFirst = 1;
192651         sCtx.pPhrase->aTerm[i].bFirst = pOrig->aTerm[i].bFirst;
192672      && pOrig->aTerm[0].bFirst==0 
192947        && pNear->apPhrase[0]->aTerm[0].bFirst==0
193038            || (pPhrase->nTerm>0 && pPhrase->aTerm[0].bFirst)
200684       int bFirst = (iPgidxOff==szLeaf);     /* True for first term on page */
200699       if( bFirst==0 ){