Home
last modified time | relevance | path

Searched refs:bMatch (Results 1 – 7 of 7) sorted by relevance

/sqlite-3.40.0/ext/fts5/
H A Dfts5_expr.c587 int bMatch; in fts5ExprPhraseIsMatch() local
590 bMatch = 1; in fts5ExprPhraseIsMatch()
595 bMatch = 0; in fts5ExprPhraseIsMatch()
685 int bMatch; in fts5ExprNearIsMatch() local
726 bMatch = 1; in fts5ExprNearIsMatch()
731 bMatch = 0; in fts5ExprNearIsMatch()
1059 bMatch = 1; in fts5ExprNodeTest_STRING()
1274 int bMatch; in fts5ExprNodeTest_AND() local
1279 bMatch = 1; in fts5ExprNodeTest_AND()
1299 bMatch = 1; in fts5ExprNodeTest_AND()
[all …]
/sqlite-3.40.0/src/
H A Dfunc.c726 int bMatch = patternCompare(&zPattern[-1],zString,pInfo,matchOther); in patternCompare() local
727 if( bMatch!=SQLITE_NOMATCH ) return bMatch; in patternCompare()
745 int bMatch; in patternCompare() local
758 bMatch = patternCompare(zPattern,zString,pInfo,matchOther); in patternCompare()
759 if( bMatch!=SQLITE_NOMATCH ) return bMatch; in patternCompare()
762 int bMatch; in patternCompare() local
765 bMatch = patternCompare(zPattern,zString,pInfo,matchOther); in patternCompare()
766 if( bMatch!=SQLITE_NOMATCH ) return bMatch; in patternCompare()
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5_common.tcl299 set bMatch 1
301 if {[nearset_match aDict $tok $term]==0} { set bMatch 0 ; break }
303 if {$bMatch} { lappend B($iPhrase) $i }
H A Dfts5ad.test200 set bMatch 1
203 set bMatch 0
207 if {$bMatch} { lappend ret $rowid }
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c899 int bMatch = 1; in idxFindCompatible() local
923 bMatch = 0; in idxFindCompatible()
929 bMatch = 0; in idxFindCompatible()
938 if( rc==SQLITE_OK && bMatch ){ in idxFindCompatible()
/sqlite-3.40.0/ext/fts3/
H A Dfts3.c5968 int bMatch; in sqlite3Fts3EvalPhrasePoslist() local
6005 bMatch = 1; in sqlite3Fts3EvalPhrasePoslist()
6038 if( bEof || iDocid!=pCsr->iPrevId ) bMatch = 0; in sqlite3Fts3EvalPhrasePoslist()
6041 if( bMatch ){ in sqlite3Fts3EvalPhrasePoslist()
/sqlite-3.40.0/ext/rtree/
H A Drtree.c1989 int bMatch = 0; /* True if there exists a MATCH constraint */ in rtreeBestIndex() local
2002 bMatch = 1; in rtreeBestIndex()
2010 if( bMatch==0 && p->usable in rtreeBestIndex()