Home
last modified time | relevance | path

Searched refs:jj (Results 1 – 25 of 40) sorted by relevance

12

/sqlite-3.40.0/ext/fts5/test/
H A Dfts5multi.test29 INSERT INTO t1 VALUES('dd dd hh kk','jj' ,'aa');
30 INSERT INTO t1 VALUES('kk gg ee' ,'hh cc' ,'hh jj aa cc');
31 INSERT INTO t1 VALUES('hh' ,'bb jj cc' ,'kk ii');
34 INSERT INTO t1 VALUES('ff jj' ,'gg ee' ,'kk ee gg kk');
40 INSERT INTO t1 VALUES('ff aa cc jj','kk' ,'ii dd');
45 INSERT INTO t1 VALUES('ii' ,'bb ii' ,'jj kk');
47 INSERT INTO t1 VALUES('jj kk' ,'jj' ,'gg ff cc');
51 INSERT INTO t1 VALUES('aa' ,'ee bb jj jj','dd');
52 INSERT INTO t1 VALUES('kk dd cc' ,'aa jj' ,'ee aa ff');
54 INSERT INTO t1 VALUES('ff hh aa' ,'jj ii' ,'hh dd bb jj');
[all …]
H A Dfts5fault4.test51 CREATE VIRTUAL TABLE jj USING fts5(j);
52 INSERT INTO jj(rowid, j) VALUES(101, 'm t w t f s s');
53 INSERT INTO jj(rowid, j) VALUES(202, 't w t f s');
54 INSERT INTO jj(rowid, j) VALUES(303, 'w t f');
55 INSERT INTO jj(rowid, j) VALUES(404, 't');
61 execsql { SELECT * FROM jj }
64 db eval { SELECT rowid FROM jj WHERE jj MATCH 't' } {
67 execsql { DELETE FROM jj WHERE rowid=404 }
H A Dfts5prefix.test319 INSERT INTO tt VALUES('jjj hh eee c e b gg', 'j bbb jj ddd jj');
325 INSERT INTO tt VALUES('jj hh hh bb bbb gg', 'j c jjj bb iii f');
328 INSERT INTO tt VALUES('jj ii hh c ii h gg', 'hhh bbb ddd bbb hh g ggg');
329 INSERT INTO tt VALUES('aa hhh ccc h ggg ccc', 'iii d jj a ff ii');
/sqlite-3.40.0/test/
H A Dspeedtest1.c1949 for(jj=1; jj<=3; jj++){ in testset_trigger()
1981 for(jj=1; jj<=3; jj++){ in testset_trigger()
1991 for(jj=1; jj<=3; jj++){ in testset_trigger()
2001 for(jj=1; jj<=3; jj++){ in testset_trigger()
2016 for(jj=0; jj<NROW2; jj++){ in testset_trigger()
2025 for(jj=0; jj<NROW2; jj++){ in testset_trigger()
2054 for(jj=0; jj<NROW2; jj++){ in testset_trigger()
2069 for(jj=1; jj<=NROW2*2; jj+=2){ in testset_trigger()
2083 for(jj=1; jj<=NROW2*2; jj+=2){ in testset_trigger()
2105 for(jj=0; jj<NROW2; jj++){ in testset_trigger()
[all …]
H A Dmemjournal2.test35 for {set jj 200} {$jj <= 300} {incr jj} {
36 do_execsql_test 1.2.$jj.1 {
38 UPDATE t1 SET b=randomblob(700) WHERE a<=$jj;
40 do_execsql_test 1.2.$jj.2 {
46 do_execsql_test 1.2.$jj.3 {
53 do_execsql_test 1.2.$jj.4 {
H A Dcrash5.test32 for {set jj 1} {$jj < 100} {incr jj} {
47 do_test crash5-$ii.$jj.1 {
49 [list set iFail $jj] {
116 do_test crash5-$ii.$jj.2 {
119 do_test crash5-$ii.$jj.3 {
H A Dfuzz_malloc.test49 set jj 0
51 expr srand($jj)
52 incr jj
H A Dspeed4.test102 for {set jj 1} {$jj <= 3} {incr jj} {
103 set stmt [string map "%T% t$jj" {INSERT INTO %T% VALUES(NULL, $i, $t)}]
H A Dspeed4p.explain105 for {set jj 1} {$jj <= 3} {incr jj} {
106 set stmt [string map "%T% t$jj" {INSERT INTO %T% VALUES(NULL, $i, $t)}]
H A Dspeed4p.test105 for {set jj 1} {$jj <= 3} {incr jj} {
106 set stmt [string map "%T% t$jj" {INSERT INTO %T% VALUES(NULL, $i, $t)}]
H A Dincrvacuum.test363 for {set jj 0} {$jj < 10} {incr jj} {
372 do_test incrvacuum-6.${jj}.1 {
392 # Run a linear scan query on tbl2. After reading ($jj*100) rows,
395 do_test incrvacuum-6.${jj}.2 {
398 if {$a == [expr $jj*100]} {
/sqlite-3.40.0/mptest/
H A Dmptest.c981 int jj; in runScript() local
983 for(jj=7; jj<len-1 && ISSPACE(zAns[jj]); jj++){} in runScript()
984 zAns += jj; in runScript()
1001 int jj; in runScript() local
1005 for(jj=9-3*isGlob; jj<len-1 && ISSPACE(zAns[jj]); jj++){} in runScript()
1006 zAns += jj; in runScript()
1056 int jj; in runScript() local
1057 for(jj=7; jj<len && ISSPACE(zScript[ii+jj]); jj++){} in runScript()
1058 logMessage("%.*s", len-jj, zScript+ii+jj); in runScript()
1069 for(jj=4; jj<len && ISSPACE(zScript[ii+jj]); jj++){} in runScript()
[all …]
/sqlite-3.40.0/ext/rtree/
H A Drtree.c2015 for(jj=0; jj<ii; jj++){ in rtreeBestIndex()
2174 int jj; in cellOverlap() local
2176 for(jj=0; jj<pRtree->nDim2; jj+=2){ in cellOverlap()
2377 for(jj=1; jj<nIdx; jj++){ in SortByDistance()
2442 for(jj=1; jj<nIdx; jj++){ in SortByDimension()
2484 int jj; in splitNodeStartree() local
2486 for(jj=0; jj<nCell; jj++){ in splitNodeStartree()
2487 aaSorted[ii][jj] = jj; in splitNodeStartree()
3350 for(jj=0; jj<pRtree->nAux; jj++){ in rtreeUpdate()
3888 int jj; in rtreenode() local
[all …]
H A Drtree_util.tcl65 for {set jj 1} {$jj <= $nCoord} {incr jj} {
66 set newval [format "%.${iPrec}f" [lindex $node $ii $jj]]
67 lset node $ii $jj $newval
H A Dgeopoly.c542 int ii, jj; in geopolyCcwFunc() local
543 for(ii=1, jj=p->nVertex-1; ii<jj; ii++, jj--){ in geopolyCcwFunc()
545 GeoX(p,ii) = GeoX(p,jj); in geopolyCcwFunc()
546 GeoX(p,jj) = t; in geopolyCcwFunc()
548 GeoY(p,ii) = GeoY(p,jj); in geopolyCcwFunc()
549 GeoY(p,jj) = t; in geopolyCcwFunc()
1679 int jj; in geopolyUpdate() local
1698 for(jj=1; jj<nData-2; jj++){ in geopolyUpdate()
1700 sqlite3_bind_value(pUp, jj+2, aData[jj+2]); in geopolyUpdate()
H A Drtree2.test56 for {set jj 0} {$jj<$nDim*2} {incr jj} {
/sqlite-3.40.0/src/
H A Dupsert.c152 int ii, jj, nn; in sqlite3UpsertAnalyzeTarget() local
180 for(jj=0; jj<nn; jj++){ in sqlite3UpsertAnalyzeTarget()
181 if( sqlite3ExprCompare(pParse,pTarget->a[jj].pExpr,pExpr,iCursor)<2 ){ in sqlite3UpsertAnalyzeTarget()
185 if( jj>=nn ){ in sqlite3UpsertAnalyzeTarget()
H A Dwhere.c1123 int jj; in sqlite3ConstructBloomFilter() local
1124 for(jj=0; jj<n; jj++){ in sqlite3ConstructBloomFilter()
3192 int ii, jj; in indexMightHelpWithOrderBy() local
3201 for(jj=0; jj<pIndex->nKeyCol; jj++){ in indexMightHelpWithOrderBy()
3205 for(jj=0; jj<pIndex->nKeyCol; jj++){ in indexMightHelpWithOrderBy()
4942 for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){ in wherePathSolver()
4950 if( jj>=nTo ){ in wherePathSolver()
4974 jj = mxI; in wherePathSolver()
5043 for(jj=1, pTo=&aTo[1]; jj<mxChoice; jj++, pTo++){ in wherePathSolver()
6104 int ii, jj; in sqlite3WhereBegin() local
[all …]
H A Dinsert.c303 int ii, jj; in sqlite3ComputeGeneratedColumns() local
307 for(ii=jj=0; zP4[jj]; ii++){ in sqlite3ComputeGeneratedColumns()
312 zP4[jj] = SQLITE_AFF_NONE; in sqlite3ComputeGeneratedColumns()
314 jj++; in sqlite3ComputeGeneratedColumns()
1925 int nIdx, jj; in sqlite3GenerateConstraintChecks() local
1942 jj = 0; in sqlite3GenerateConstraintChecks()
1946 jj++; in sqlite3GenerateConstraintChecks()
1949 bUsed[jj] = 1; in sqlite3GenerateConstraintChecks()
1951 sIdxIter.u.ax.aIdx[i].ix = jj; in sqlite3GenerateConstraintChecks()
1954 for(jj=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, jj++){ in sqlite3GenerateConstraintChecks()
[all …]
H A Dtrigger.c924 int jj; in sqlite3ExpandReturning() local
925 for(jj=0; jj<pTab->nCol; jj++){ in sqlite3ExpandReturning()
927 if( IsHiddenColumn(pTab->aCol+jj) ) continue; in sqlite3ExpandReturning()
928 pNewExpr = sqlite3Expr(db, TK_ID, pTab->aCol[jj].zCnName); in sqlite3ExpandReturning()
932 pItem->zEName = sqlite3DbStrDup(db, pTab->aCol[jj].zCnName); in sqlite3ExpandReturning()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_aux.c443 int jj; in fts5SnippetFunction() local
461 for(jj=0; jj<(sFinder.nFirst-1); jj++){ in fts5SnippetFunction()
462 if( sFinder.aFirst[jj+1]>io ) break; in fts5SnippetFunction()
465 if( sFinder.aFirst[jj]<io ){ in fts5SnippetFunction()
468 sFinder.aFirst[jj], nToken, &nScore, 0 in fts5SnippetFunction()
471 nScore += (sFinder.aFirst[jj]==0 ? 120 : 100); in fts5SnippetFunction()
475 iBestStart = sFinder.aFirst[jj]; in fts5SnippetFunction()
/sqlite-3.40.0/tool/
H A Dshowdb.c602 int ii, jj; in decodeCell() local
607 for(ii=2, jj=0; jj<szCol[i] && ii<24; jj++, ii+=2){ in decodeCell()
608 sprintf(zConst+ii, "%02x", pData[jj]); in decodeCell()
612 for(ii=1, jj=0; jj<szCol[i] && ii<24; jj++, ii++){ in decodeCell()
613 zConst[ii] = ISPRINT(pData[jj]) ? pData[jj] : '.'; in decodeCell()
617 if( jj<szCol[i] ){ in decodeCell()
H A Dfuzzershell.c828 int jj; /* Loop counter for azInFile[] */ in main() local
984 for(jj=0; jj<nInFile; jj++){ in main()
990 in = fopen(azInFile[jj],"rb"); in main()
992 abendError("cannot open %s for reading", azInFile[jj]); in main()
994 zPrompt = azInFile[jj]; in main()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_test.c221 int jj; in fts3_near_match_cmd() local
230 for(jj=0; jj<nToken; jj++){ in fts3_near_match_cmd()
231 NearToken *pT = &aPhrase[ii].aToken[jj]; in fts3_near_match_cmd()
232 pT->z = Tcl_GetStringFromObj(apToken[jj], &pT->n); in fts3_near_match_cmd()
H A Dfts3_expr.c346 int jj; in getNextString() local
365 for(jj=0; jj<p->pPhrase->nToken; jj++){ in getNextString()
366 p->pPhrase->aToken[jj].z = zBuf; in getNextString()
367 zBuf += p->pPhrase->aToken[jj].n; in getNextString()

12