Searched refs:nDepth (Results 1 – 3 of 3) sorted by relevance
489 int nAvg, nRem, nDepth; in dictHashSummary() local524 nDepth = size * (nAvg * (nAvg+1))/2 + (nAvg+1)*nRem; in dictHashSummary()525 best = (double)nDepth/nWords; in dictHashSummary()
81562 int nDepth = 0;81566 nDepth++;81568 return nDepth;81581 int nDepth, /* Depth of tree according to TreeDepth() */81594 for(i=1; i<nDepth; i++){81598 for(i=1; i<nDepth && rc==SQLITE_OK; i++){81659 int nDepth = vdbeSorterTreeDepth(pTask->nPMA);81676 rc = vdbeSorterAddToTree(pTask, nDepth, iSeq++, pRoot, pMerger);
10664 int nDepth; /* Depth of subquery recursion. 1 for no recursion */ member76632 if( pNC->nDepth==0 ){76677 if( pNC->nDepth==0 ){76678 pNC->nDepth++;76680 pNC->nDepth--;