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()
108906 int nDepth = 0; local108910 nDepth++;108912 return nDepth;108925 int nDepth, /* Depth of tree according to TreeDepth() */ argument108938 for(i=1; i<nDepth; i++){108942 for(i=1; i<nDepth && rc==SQLITE_OK; i++){109003 int nDepth = vdbeSorterTreeDepth(pTask->nPMA); local109020 rc = vdbeSorterAddToTree(pTask, nDepth, iSeq++, pRoot, pMerger);159419 int nDepth; /* Trigger depth */ local159426 for(nDepth=0; pTop->pOuterParse; pTop = pTop->pOuterParse, nDepth++){}[all …]