Searched refs:nMatch (Results 1 - 2 of 2) sorted by relevance

/external/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dfts1.c1005 int nMatch; /* Total number of matches */ member in struct:Snippet
2184 if( p->nMatch+1>=p->nAlloc ){
2188 p->nMatch = 0;
2193 i = p->nMatch++;
2290 if( p->snippet.nMatch ) return;
2322 for(i=0; i<p->nMatch; i++){
2335 ** zDoc[0..nDoc-1] is phrase of text. aMatch[0..nMatch-1] are a set
2348 int nMatch, /* Number of entries in aMatch[] */
2358 for(i=0; i<nMatch && aMatch[i].iCol<iCol; i++){}
2359 while( i<nMatch
2343 wordBoundary( int iBreak, const char *zDoc, int nDoc, struct snippetMatch *aMatch, int nMatch, int iCol ) argument
2417 int nMatch; local
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts2/
H A Dfts2.c1925 int nMatch; /* Total number of matches */ member in struct:Snippet
3227 if( p->nMatch+1>=p->nAlloc ){
3231 p->nMatch = 0;
3236 i = p->nMatch++;
3335 if( p->snippet.nMatch ) return;
3367 for(i=0; i<p->nMatch; i++){
3380 ** zDoc[0..nDoc-1] is phrase of text. aMatch[0..nMatch-1] are a set
3393 int nMatch, /* Number of entries in aMatch[] */
3403 for(i=0; i<nMatch && aMatch[i].iCol<iCol; i++){}
3404 while( i<nMatch
3388 wordBoundary( int iBreak, const char *zDoc, int nDoc, struct snippetMatch *aMatch, int nMatch, int iCol ) argument
3443 int nMatch; local
[all...]

Completed in 454 milliseconds