Lines Matching refs:nLo
3507 static void lcl_QuickSort( long nLo, long nHi, vector<double>& rSortArray, vector<long>* pIndexOrde… in lcl_QuickSort() argument
3513 if (nHi - nLo == 1) in lcl_QuickSort()
3515 if (rSortArray[nLo] > rSortArray[nHi]) in lcl_QuickSort()
3517 swap(rSortArray[nLo], rSortArray[nHi]); in lcl_QuickSort()
3519 swap(pIndexOrder->at(nLo), pIndexOrder->at(nHi)); in lcl_QuickSort()
3524 long ni = nLo; in lcl_QuickSort()
3528 double fLo = rSortArray[nLo]; in lcl_QuickSort()
3530 while (nj >= nLo && fLo < rSortArray[nj]) nj--; in lcl_QuickSort()
3546 if ((nj - nLo) < (nHi - ni)) in lcl_QuickSort()
3548 if (nLo < nj) lcl_QuickSort(nLo, nj, rSortArray, pIndexOrder); in lcl_QuickSort()
3554 if (nLo < nj) lcl_QuickSort(nLo, nj, rSortArray, pIndexOrder); in lcl_QuickSort()