Searched refs:nDepth (Results 1 – 2 of 2) sorted by relevance
488 int nAvg, nRem, nDepth; in dictHashSummary() local523 nDepth = size * (nAvg * (nAvg+1))/2 + (nAvg+1)*nRem; in dictHashSummary()524 best = (double)nDepth/nWords; in dictHashSummary()
105149 int nDepth = 0;105153 nDepth++;105155 return nDepth;105168 int nDepth, /* Depth of tree according to TreeDepth() */105181 for(i=1; i<nDepth; i++){105185 for(i=1; i<nDepth && rc==SQLITE_OK; i++){105246 int nDepth = vdbeSorterTreeDepth(pTask->nPMA);105263 rc = vdbeSorterAddToTree(pTask, nDepth, iSeq++, pRoot, pMerger);