Lines Matching defs:iDepth
55146 ** tree with depth of iDepth. A depth of 1 means the tree contains a single
55159 int iDepth
55167 if( iDepth>1 ){ /*OPTIMIZATION-IF-TRUE*/
55171 pLeft = rowSetNDeepTree(ppList, iDepth-1);
55180 p->pRight = rowSetNDeepTree(ppList, iDepth-1);
55194 int iDepth; /* Depth of the tree so far */
55202 for(iDepth=1; pList; iDepth++){
55207 p->pRight = rowSetNDeepTree(&pList, iDepth);
198379 u16 iDepth; /* Nesting depth */
199023 if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
199026 pParse->iDepth--;
199039 pParse->iDepth--;
199057 if( ++pParse->iDepth > JSON_MAX_DEPTH ) return -1;
199059 pParse->iDepth--;
199182 assert( pParse->iDepth==0 );
201107 int iDepth; /* Current depth of the r-tree structure */
201707 /* If the root node was just loaded, set pRtree->iDepth to the height
201714 pRtree->iDepth = readInt16(pNode->zData);
201715 if( pRtree->iDepth>RTREE_MAX_DEPTH ){
201847 pRtree->iDepth = -1;
202835 memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
202854 p->pInfo->mxLevel = pRtree->iDepth + 1;
202877 pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));
203154 for(ii=0; rc==SQLITE_OK && ii<(pRtree->iDepth-iHeight); ii++){
203565 pRtree->iDepth++;
203567 writeInt16(pNode->zData, pRtree->iDepth);
204005 /* Obtain a reference to the root node to initialize Rtree.iDepth */
204047 if( rc==SQLITE_OK && pRtree->iDepth>0 && NCELL(pRoot)==1 ){
204053 rc = removeNode(pRtree, pChild, pRtree->iDepth-1);
204058 pRtree->iDepth--;
204059 writeInt16(pRoot->zData, pRtree->iDepth);
205116 ** Run rtreecheck() checks on node iNode, which is at depth iDepth within
205125 int iDepth, /* Depth of iNode (0==leaf) */
205145 iDepth = readInt16(aNode);
205146 if( iDepth>RTREE_MAX_DEPTH ){
205147 rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
205164 if( iDepth>0 ){
205166 rtreeCheckNode(pCheck, iDepth-1, &pCell[8], iVal);
206748 memset(pCsr->anQueue, 0, sizeof(u32)*(pRtree->iDepth + 1));
206788 pNew = rtreeSearchPointNew(pCsr, RTREE_ZERO, (u8)(pRtree->iDepth+1));