Home
last modified time | relevance | path

Searched refs:nPhrase (Results 1 – 13 of 13) sorted by relevance

/sqlite-3.40.0/ext/fts5/
H A Dfts5_test_mi.c99 case 'x': ret = 3 * nCol * nPhrase; break; in fts5MatchinfoFlagsize()
100 case 'y': ret = nCol * nPhrase; break; in fts5MatchinfoFlagsize()
123 n += fts5MatchinfoFlagsize(p->nCol, p->nPhrase, f); in fts5MatchinfoIter()
160 aOut[0] = p->nPhrase; in fts5MatchinfoGlobalCb()
169 for(i=0; i<p->nPhrase && rc==SQLITE_OK; i++){ in fts5MatchinfoGlobalCb()
218 int nInt = ((p->nCol + 31) / 32) * p->nPhrase; in fts5MatchinfoLocalCb()
221 for(iPhrase=0; iPhrase<p->nPhrase; iPhrase++){ in fts5MatchinfoLocalCb()
242 for(iPhrase=0; iPhrase<p->nPhrase; iPhrase++){ in fts5MatchinfoLocalCb()
309 int nPhrase; in fts5MatchinfoNew() local
316 nPhrase = pApi->xPhraseCount(pFts); in fts5MatchinfoNew()
[all …]
H A Dfts5_expr.c279 pNew->nPhrase = sParse.nPhrase; in sqlite3Fts5ExprNew()
398 int nPhrase = p1->nPhrase + p2->nPhrase; in sqlite3Fts5ExprAnd() local
411 memmove(&ap[p2->nPhrase], ap, p1->nPhrase*sizeof(Fts5ExprPhrase*)); in sqlite3Fts5ExprAnd()
415 p1->nPhrase = nPhrase; in sqlite3Fts5ExprAnd()
1636 pRet->nPhrase--; in sqlite3Fts5ParseNearset()
1643 pRet->nPhrase--; in sqlite3Fts5ParseNearset()
1801 pParse->nPhrase++; in sqlite3Fts5ParseTerm()
1885 pNew->nPhrase = 1; in sqlite3Fts5ExprClonePhrase()
2234 pParse->nPhrase--; in fts5ParsePhraseToAnd()
2389 pParse->nPhrase--; in sqlite3Fts5ParseImplicitAnd()
[all …]
H A Dfts5_aux.c413 nPhrase = pApi->xPhraseCount(pFts); in fts5SnippetFunction()
414 aSeen = sqlite3_malloc(nPhrase); in fts5SnippetFunction()
449 memset(aSeen, 0, nPhrase); in fts5SnippetFunction()
466 memset(aSeen, 0, nPhrase); in fts5SnippetFunction()
578 nPhrase = pApi->xPhraseCount(pFts); in fts5Bm25GetData()
579 nByte = sizeof(Fts5Bm25Data) + nPhrase*2*sizeof(double); in fts5Bm25GetData()
585 p->nPhrase = nPhrase; in fts5Bm25GetData()
587 p->aFreq = &p->aIDF[nPhrase]; in fts5Bm25GetData()
597 for(i=0; rc==SQLITE_OK && i<nPhrase; i++){ in fts5Bm25GetData()
656 memset(aFreq, 0, sizeof(double) * pData->nPhrase); in fts5Bm25Function()
[all …]
H A Dfts5_main.c987 int nPhrase; in fts5CursorFirstSorted() local
993 nPhrase = sqlite3Fts5ExprPhraseCount(pCsr->pExpr); in fts5CursorFirstSorted()
994 nByte = sizeof(Fts5Sorter) + sizeof(int) * (nPhrase-1); in fts5CursorFirstSorted()
998 pSorter->nIdx = nPhrase; in fts5CursorFirstSorted()
2417 int nPhrase = sqlite3Fts5ExprPhraseCount(pCsr->pExpr); in fts5PoslistBlob() local
2425 for(i=0; i<(nPhrase-1); i++){ in fts5PoslistBlob()
2432 for(i=0; i<nPhrase; i++){ in fts5PoslistBlob()
2443 for(i=0; rc==SQLITE_OK && i<(nPhrase-1); i++){ in fts5PoslistBlob()
2451 for(i=0; rc==SQLITE_OK && i<nPhrase; i++){ in fts5PoslistBlob()
H A Dfts5_tcl.c309 int nPhrase; in xF5tApi() local
310 nPhrase = p->pApi->xPhraseCount(p->pFts); in xF5tApi()
312 Tcl_SetObjResult(interp, Tcl_NewIntObj(nPhrase)); in xF5tApi()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_test.c84 int nPhrase, /* Size of phrase array */ in nm_near_chain() argument
99 if( (iPhrase+1)==nPhrase ) return 1; in nm_near_chain()
126 int nPhrase, /* Size of phrase array */ in nm_match_count() argument
162 int nPhrase; in fts3_near_match_cmd() local
214 nPhrase = (nExprToken + 1) / 2; in fts3_near_match_cmd()
215 aPhrase = (NearPhrase *)ckalloc(nPhrase * sizeof(NearPhrase)); in fts3_near_match_cmd()
216 memset(aPhrase, 0, nPhrase * sizeof(NearPhrase)); in fts3_near_match_cmd()
217 for(ii=0; ii<nPhrase; ii++){ in fts3_near_match_cmd()
236 for(ii=1; ii<nPhrase; ii++){ in fts3_near_match_cmd()
246 for(ii=0; ii<nPhrase; ii++){ in fts3_near_match_cmd()
[all …]
H A Dfts3_snippet.c303 p->nPhrase++; in fts3ExprLoadDoclistsCb()
339 int nPhrase = 0; in fts3ExprPhraseCount() local
341 return nPhrase; in fts3ExprPhraseCount()
384 for(i=0; i<pIter->nPhrase; i++){ in fts3SnippetNextCandidate()
392 for(i=0; i<pIter->nPhrase; i++){ in fts3SnippetNextCandidate()
403 for(i=0; i<pIter->nPhrase; i++){ in fts3SnippetNextCandidate()
431 for(i=0; i<pIter->nPhrase; i++){ in fts3SnippetDetails()
557 sIter.nPhrase = nList; in fts3BestSnippet()
1156 for(i=0; i<pInfo->nPhrase; i++){ in fts3MatchinfoLcs()
1388 sInfo.nPhrase = pCsr->nPhrase; in fts3GetMatchinfo()
[all …]
H A Dfts3Int.h338 int nPhrase; /* Number of matchable phrases in query */ member
/sqlite-3.40.0/src/
H A Dtest_func.c853 int nPhrase = 0; /* Number of phrases in the query */ in rankfunc() local
870 nPhrase = aMatchinfo[0]; in rankfunc()
873 if( nMatchinfo!=(2+3*nCol*nPhrase) ){ in rankfunc()
881 for(iPhrase=0; iPhrase<nPhrase; iPhrase++){ in rankfunc()
/sqlite-3.40.0/ext/fts1/
H A Dfts1.c952 short int nPhrase; /* How many following terms are part of the same phrase */ member
2602 for(i=1; i<=pQTerm->nPhrase; i++){ in docListOfTerm()
2609 pNew = docListNew(i<pQTerm->nPhrase ? DL_POSITIONS : DL_DOCIDS); in docListOfTerm()
2717 pQuery->pTerms[firstIndex].nPhrase = pQuery->nTerms - firstIndex - 1; in tokenizeSegment()
2798 iNext = i + aTerm[i].nPhrase+1; in fulltextQuery()
2801 iNext = i + aTerm[i].nPhrase + 1; in fulltextQuery()
2809 iNext += aTerm[iNext].nPhrase + 1; in fulltextQuery()
2837 for(i=0; i<pQuery->nTerms; i += aTerm[i].nPhrase + 1){ in fulltextQuery()
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5_common.tcl238 set nPhrase [llength $lPhrase]
254 for {set i 0} {$i < $nPhrase} {incr i} {
/sqlite-3.40.0/test/
H A Dfts3auto.test228 set nPhrase [expr ([llength $expr]+1)/2]
240 for {set iPhrase 0} {$iPhrase < $nPhrase} {incr iPhrase} {
294 for {set iPhrase 0} {$iPhrase<$nPhrase} {incr iPhrase} {
307 for {set iPhrase 0} {$iPhrase<$nPhrase} {incr iPhrase} {
/sqlite-3.40.0/ext/fts2/
H A Dfts2.c1694 short int nPhrase; /* How many following terms are part of the same phrase */ member
3453 assert( pQTerm->nPhrase==0 || DL_DEFAULT!=DL_DOCIDS ); in docListOfTerm()
3460 0<pQTerm->nPhrase ? DL_POSITIONS : DL_DOCIDS, &left); in docListOfTerm()
3462 for(i=1; i<=pQTerm->nPhrase && left.nData>0; i++){ in docListOfTerm()
3472 i<pQTerm->nPhrase ? DL_POSITIONS : DL_DOCIDS, &new); in docListOfTerm()
3583 pQuery->pTerms[firstIndex].nPhrase = pQuery->nTerms - firstIndex - 1; in tokenizeSegment()
3688 iNext = i + aTerm[i].nPhrase+1; in fulltextQuery()
3691 iNext = i + aTerm[i].nPhrase + 1; in fulltextQuery()
3700 iNext += aTerm[iNext].nPhrase + 1; in fulltextQuery()
3730 for(i=0; i<pQuery->nTerms; i += aTerm[i].nPhrase + 1){ in fulltextQuery()