Searched refs:nDepth (Results 1 – 2 of 2) 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()
98040 int nDepth = 0;98044 nDepth++;98046 return nDepth;98059 int nDepth, /* Depth of tree according to TreeDepth() */98072 for(i=1; i<nDepth; i++){98076 for(i=1; i<nDepth && rc==SQLITE_OK; i++){98137 int nDepth = vdbeSorterTreeDepth(pTask->nPMA);98154 rc = vdbeSorterAddToTree(pTask, nDepth, iSeq++, pRoot, pMerger);