Lines Matching refs:ii
815 int ii; in nodeOverwriteCell() local
818 for(ii=0; ii<pRtree->nDim2; ii++){ in nodeOverwriteCell()
819 p += writeCoord(p, &pCell->aCoord[ii]); in nodeOverwriteCell()
955 int ii = 0; in nodeGetCell() local
960 readCoord(pData, &pCoord[ii]); in nodeGetCell()
961 readCoord(pData+4, &pCoord[ii+1]); in nodeGetCell()
963 ii += 2; in nodeGetCell()
964 }while( ii<pRtree->nDim2 ); in nodeGetCell()
1095 int ii; in resetCursor() local
1109 for(ii=0; ii<RTREE_CACHE_SZ; ii++) nodeRelease(pRtree, pCsr->aNode[ii]); in resetCursor()
1363 int ii; in nodeRowidIndex() local
1366 for(ii=0; ii<nCell; ii++){ in nodeRowidIndex()
1367 if( nodeGetRowid(pRtree, pNode, ii)==iRowid ){ in nodeRowidIndex()
1368 *piIndex = ii; in nodeRowidIndex()
1444 int ii = 1 - pCur->bPoint; in rtreeNodeOfFirstSearchPoint() local
1445 assert( ii==0 || ii==1 ); in rtreeNodeOfFirstSearchPoint()
1447 if( pCur->aNode[ii]==0 ){ in rtreeNodeOfFirstSearchPoint()
1449 id = ii ? pCur->aPoint[0].id : pCur->sPoint.id; in rtreeNodeOfFirstSearchPoint()
1450 *pRC = nodeAcquire(RTREE_OF_CURSOR(pCur), id, 0, &pCur->aNode[ii]); in rtreeNodeOfFirstSearchPoint()
1452 return pCur->aNode[ii]; in rtreeNodeOfFirstSearchPoint()
1506 int ii; in rtreeSearchPointNew() local
1509 ii = (int)(pNew - pCur->aPoint) + 1; in rtreeSearchPointNew()
1510 assert( ii==1 ); in rtreeSearchPointNew()
1511 if( ALWAYS(ii<RTREE_CACHE_SZ) ){ in rtreeSearchPointNew()
1512 assert( pCur->aNode[ii]==0 ); in rtreeSearchPointNew()
1513 pCur->aNode[ii] = pCur->aNode[0]; in rtreeSearchPointNew()
1544 int ii;
1549 for(ii=0; ii<pCur->nPoint; ii++){
1550 if( ii>0 || pCur->bPoint ) printf(" ");
1551 tracePoint(&pCur->aPoint[ii], ii, pCur);
1617 int ii; in rtreeStepToLeaf() local
1632 for(ii=0; ii<nConstraint; ii++){ in rtreeStepToLeaf()
1633 RtreeConstraint *pConstraint = pCur->aConstraint + ii; in rtreeStepToLeaf()
1654 for(ii=0; ii<pCur->nPoint; ii++){ in rtreeStepToLeaf()
1655 if( pCur->aPoint[ii].id==x.id ){ in rtreeStepToLeaf()
1840 int ii; in rtreeFilter() local
1892 for(ii=0; ii<argc; ii++){ in rtreeFilter()
1893 RtreeConstraint *p = &pCsr->aConstraint[ii]; in rtreeFilter()
1894 int eType = sqlite3_value_numeric_type(argv[ii]); in rtreeFilter()
1895 p->op = idxStr[ii*2]; in rtreeFilter()
1896 p->iCoord = idxStr[ii*2+1]-'0'; in rtreeFilter()
1902 rc = deserializeGeometry(argv[ii], p); in rtreeFilter()
1911 p->u.rValue = sqlite3_value_int64(argv[ii]); in rtreeFilter()
1913 p->u.rValue = sqlite3_value_double(argv[ii]); in rtreeFilter()
1988 int ii; in rtreeBestIndex() local
2000 for(ii=0; ii<pIdxInfo->nConstraint; ii++){ in rtreeBestIndex()
2001 if( pIdxInfo->aConstraint[ii].op==SQLITE_INDEX_CONSTRAINT_MATCH ){ in rtreeBestIndex()
2007 for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){ in rtreeBestIndex()
2008 struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii]; in rtreeBestIndex()
2015 for(jj=0; jj<ii; jj++){ in rtreeBestIndex()
2020 pIdxInfo->aConstraintUsage[ii].argvIndex = 1; in rtreeBestIndex()
2052 pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2); in rtreeBestIndex()
2053 pIdxInfo->aConstraintUsage[ii].omit = 1; in rtreeBestIndex()
2106 int ii = pRtree->nDim2 - 2; in cellMargin() local
2108 margin += (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii])); in cellMargin()
2109 ii -= 2; in cellMargin()
2110 }while( ii>=0 ); in cellMargin()
2118 int ii = 0; in cellUnion() local
2121 p1->aCoord[ii].f = MIN(p1->aCoord[ii].f, p2->aCoord[ii].f); in cellUnion()
2122 p1->aCoord[ii+1].f = MAX(p1->aCoord[ii+1].f, p2->aCoord[ii+1].f); in cellUnion()
2123 ii += 2; in cellUnion()
2124 }while( ii<pRtree->nDim2 ); in cellUnion()
2127 p1->aCoord[ii].i = MIN(p1->aCoord[ii].i, p2->aCoord[ii].i); in cellUnion()
2128 p1->aCoord[ii+1].i = MAX(p1->aCoord[ii+1].i, p2->aCoord[ii+1].i); in cellUnion()
2129 ii += 2; in cellUnion()
2130 }while( ii<pRtree->nDim2 ); in cellUnion()
2139 int ii; in cellContains() local
2141 for(ii=0; ii<pRtree->nDim2; ii+=2){ in cellContains()
2142 RtreeCoord *a1 = &p1->aCoord[ii]; in cellContains()
2143 RtreeCoord *a2 = &p2->aCoord[ii]; in cellContains()
2171 int ii; in cellOverlap() local
2173 for(ii=0; ii<nCell; ii++){ in cellOverlap()
2178 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj])); in cellOverlap()
2179 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1])); in cellOverlap()
2204 int ii; in ChooseLeaf() local
2208 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){ in ChooseLeaf()
2468 int ii; in splitNodeStartree() local
2483 for(ii=0; ii<pRtree->nDim; ii++){ in splitNodeStartree()
2485 aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell]; in splitNodeStartree()
2487 aaSorted[ii][jj] = jj; in splitNodeStartree()
2489 SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare); in splitNodeStartree()
2492 for(ii=0; ii<pRtree->nDim; ii++){ in splitNodeStartree()
2510 memcpy(&left, &aCell[aaSorted[ii][0]], sizeof(RtreeCell)); in splitNodeStartree()
2511 memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell)); in splitNodeStartree()
2514 cellUnion(pRtree, &left, &aCell[aaSorted[ii][kk]]); in splitNodeStartree()
2516 cellUnion(pRtree, &right, &aCell[aaSorted[ii][kk]]); in splitNodeStartree()
2533 if( ii==0 || margin<fBestMargin ){ in splitNodeStartree()
2534 iBestDim = ii; in splitNodeStartree()
2542 for(ii=0; ii<nCell; ii++){ in splitNodeStartree()
2543 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight; in splitNodeStartree()
2544 RtreeCell *pBbox = (ii<iBestSplit)?pBboxLeft:pBboxRight; in splitNodeStartree()
2545 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]]; in splitNodeStartree()
2816 int ii; in fixBoundingBox() local
2820 for(ii=1; ii<nCell; ii++){ in fixBoundingBox()
2822 nodeGetCell(pRtree, pNode, ii, &cell); in fixBoundingBox()
2826 rc = nodeParentIndex(pRtree, pNode, &ii); in fixBoundingBox()
2828 nodeOverwriteCell(pRtree, pParent, &box, ii); in fixBoundingBox()
2883 int ii; in Reinsert() local
2908 for(ii=0; ii<nCell; ii++){ in Reinsert()
2909 if( ii==(nCell-1) ){ in Reinsert()
2910 memcpy(&aCell[ii], pCell, sizeof(RtreeCell)); in Reinsert()
2912 nodeGetCell(pRtree, pNode, ii, &aCell[ii]); in Reinsert()
2914 aOrder[ii] = ii; in Reinsert()
2916 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]); in Reinsert()
2917 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]); in Reinsert()
2924 for(ii=0; ii<nCell; ii++){ in Reinsert()
2925 aDistance[ii] = RTREE_ZERO; in Reinsert()
2927 RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) - in Reinsert()
2928 DCOORD(aCell[ii].aCoord[iDim*2])); in Reinsert()
2929 aDistance[ii] += (coord-aCenterCoord[iDim])*(coord-aCenterCoord[iDim]); in Reinsert()
2936 for(ii=0; rc==SQLITE_OK && ii<(nCell-(RTREE_MINCELLS(pRtree)+1)); ii++){ in Reinsert()
2937 RtreeCell *p = &aCell[aOrder[ii]]; in Reinsert()
2950 for(; rc==SQLITE_OK && ii<nCell; ii++){ in Reinsert()
2955 RtreeCell *p = &aCell[aOrder[ii]]; in Reinsert()
3011 int ii; in reinsertNodeContent() local
3015 for(ii=0; rc==SQLITE_OK && ii<nCell; ii++){ in reinsertNodeContent()
3018 nodeGetCell(pRtree, pNode, ii, &cell); in reinsertNodeContent()
3252 int ii; in rtreeUpdate() local
3267 for(ii=0; ii<nn; ii+=2){ in rtreeUpdate()
3268 cell.aCoord[ii].f = rtreeValueDown(aData[ii+3]); in rtreeUpdate()
3269 cell.aCoord[ii+1].f = rtreeValueUp(aData[ii+4]); in rtreeUpdate()
3270 if( cell.aCoord[ii].f>cell.aCoord[ii+1].f ){ in rtreeUpdate()
3271 rc = rtreeConstraintError(pRtree, ii+1); in rtreeUpdate()
3278 for(ii=0; ii<nn; ii+=2){ in rtreeUpdate()
3279 cell.aCoord[ii].i = sqlite3_value_int(aData[ii+3]); in rtreeUpdate()
3280 cell.aCoord[ii+1].i = sqlite3_value_int(aData[ii+4]); in rtreeUpdate()
3281 if( cell.aCoord[ii].i>cell.aCoord[ii+1].i ){ in rtreeUpdate()
3282 rc = rtreeConstraintError(pRtree, ii+1); in rtreeUpdate()
3541 int ii; in rtreeSqlInit() local
3545 for(ii=0; ii<pRtree->nAux; ii++){ in rtreeSqlInit()
3546 sqlite3_str_appendf(p,",a%d",ii); in rtreeSqlInit()
3605 int ii; in rtreeSqlInit() local
3608 for(ii=0; ii<pRtree->nAux; ii++){ in rtreeSqlInit()
3609 if( ii ) sqlite3_str_append(p, ",", 1); in rtreeSqlInit()
3611 if( ii<pRtree->nAuxNotNull ){ in rtreeSqlInit()
3612 sqlite3_str_appendf(p,"a%d=coalesce(?%d,a%d)",ii,ii+2,ii); in rtreeSqlInit()
3616 sqlite3_str_appendf(p,"a%d=?%d",ii,ii+2); in rtreeSqlInit()
3742 int ii = 4; in rtreeInit() local
3785 for(ii=4; ii<argc; ii++){ in rtreeInit()
3786 const char *zArg = argv[ii]; in rtreeInit()
3803 }else if( ii<argc ){ in rtreeInit()
3867 int ii; in rtreenode() local
3886 for(ii=0; ii<NCELL(&node); ii++){ in rtreenode()
3890 nodeGetCell(&tree, &node, ii, &cell); in rtreenode()
3891 if( ii>0 ) sqlite3_str_append(pOut, " ", 1); in rtreenode()
4108 i64 ii = sqlite3_column_int64(pStmt, 0); in rtreeCheckMapping() local
4109 if( ii!=iVal ){ in rtreeCheckMapping()
4112 iKey, ii, (bLeaf ? "%_rowid" : "%_parent"), iKey, iVal in rtreeCheckMapping()