Lines Matching defs:nToken
58906 int nToken; /* Length of the parameter token */
58917 n = findNextHostParameter(zRawSql, &nToken);
58921 assert( zRawSql[0] || nToken==0 );
58922 if( nToken==0 ) break;
58924 if( nToken>1 ){
58935 idx = sqlite3VdbeParameterIndex(p, zRawSql, nToken);
58938 zRawSql += nToken;
68454 ** EXPR_TOKENONLYSIZE. nToken is set to the number of bytes consumed
68459 int nToken;
68461 nToken = sqlite3Strlen30(p->u.zToken) + 1;
68463 nToken = 0;
68480 if( nToken ){
68482 memcpy(zToken, p->u.zToken, nToken);
106944 ** For a sequence of tokens contained in "...", nToken will be the number
106948 int nToken; /* Number of tokens in the phrase */
108058 ** nToken==1 searches for adjacent positions.
108062 int nToken, /* Maximum difference in token positions */
108101 if( iPos2>iPos1 && iPos2<=iPos1+nToken ){
108114 if( (!isSaveLeft && iPos2<=(iPos1+nToken)) || iPos2<=iPos1 ){
108678 int isTermPos = (pPhrase->nToken>1 || isReqPos);
108680 for(ii=0; ii<pPhrase->nToken; ii++){
108704 if( ii==pPhrase->nToken-1 && !isReqPos ){
108770 pLeft->pPhrase->nToken, pLeft->aDoclist, pLeft->nDoclist,
108771 pRight->pPhrase->nToken, pRight->aDoclist, pRight->nDoclist,
108780 pRight->pPhrase->nToken, pRight->aDoclist, pRight->nDoclist,
108781 pLeft->pPhrase->nToken, pLeft->aDoclist, pLeft->nDoclist,
108850 pLeft->pPhrase->nToken, aLeft, nLeft,
108851 pRight->pPhrase->nToken, aRight, nRight,
109200 int nToken = 15; /* Default number of tokens in snippet */
109215 case 6: nToken = sqlite3_value_int(apVal[5]);
109224 sqlite3Fts3Snippet(pContext, pCsr, zStart, zEnd, zEllipsis, iCol, nToken);
109660 int nToken, iStart, iEnd, iPosition;
109664 rc = pModule->xNext(pCursor, &zToken, &nToken, &iStart, &iEnd, &iPosition);
109667 nByte = sizeof(Fts3Expr) + sizeof(Fts3Phrase) + nToken;
109675 pRet->pPhrase->nToken = 1;
109677 pRet->pPhrase->aToken[0].n = nToken;
109679 memcpy(pRet->pPhrase->aToken[0].z, zToken, nToken);
109744 int nToken, iBegin, iEnd, iPos;
109745 rc = pModule->xNext(pCursor, &zToken, &nToken, &iBegin, &iEnd, &iPos);
109749 zTemp = fts3ReallocOrFree(zTemp, nTemp + nToken);
109758 p->pPhrase->nToken = ii+1;
109759 p->pPhrase->aToken[ii].n = nToken;
109760 memcpy(&zTemp[nTemp], zToken, nToken);
109761 nTemp += nToken;
109779 nByte += (p?(p->pPhrase->nToken-1):0) * sizeof(struct PhraseToken);
109791 for(jj=0; jj<p->pPhrase->nToken; jj++){
110312 for(i=0; i<pPhrase->nToken; i++){
111737 int nToken;
111779 while( SQLITE_OK==p->xNext(pCsr, &zToken, &nToken, &iStart, &iEnd, &iPos) ){
111781 Tcl_ListObjAppendElement(0, pRet, Tcl_NewStringObj(zToken, nToken));
111783 nToken = iEnd-iStart;
111784 Tcl_ListObjAppendElement(0, pRet, Tcl_NewStringObj(zToken, nToken));
112668 int nToken;
112686 && SQLITE_OK==(rc = xNext(pCsr, &zToken, &nToken, &iStart, &iEnd, &iPos))
112695 if( iPos<0 || !zToken || nToken<=0 ){
112700 pList = (PendingList *)fts3HashFind(&p->pendingTerms, zToken, nToken);
112702 p->nPendingData -= (pList->nData + nToken + sizeof(Fts3HashElem));
112705 if( pList==fts3HashInsert(&p->pendingTerms, zToken, nToken, pList) ){
112709 assert( 0==fts3HashFind(&p->pendingTerms, zToken, nToken) );
112715 p->nPendingData += (pList->nData + nToken + sizeof(Fts3HashElem));
114814 int nToken; /* Number of tokens seen so far */
114835 int nToken; /* Number of tokens in phrase */
115003 p->nToken += pExpr->pPhrase->nToken;
115055 if( pnToken ) *pnToken = sCtx.nToken;
115164 for(j=0; j<pPhrase->nToken; j++){
115190 pPhrase->nToken = pExpr->pPhrase->nToken;
115698 int nToken /* Approximate number of tokens in snippet */
115707 ** below attempts to locate a single fragment of text nToken tokens in
115728 if( nToken>=0 ){
115729 nFToken = (nToken+nSnippet-1) / nSnippet;
115731 nFToken = -1 * nToken;
115817 nTerm = pExpr->pPhrase->nToken;
115845 int nToken; /* Number of tokens in query */
115859 rc = fts3ExprLoadDoclists(pCsr, 0, &nToken);
115863 sCtx.aTerm = (TermOffset *)sqlite3_malloc(sizeof(TermOffset)*nToken);
115916 for(i=0; i<nToken; i++){