Lines Matching refs:pIndexOrder
3494 …reter::GetSortArray( sal_uInt8 nParamCount, vector<double>& rSortArray, vector<long>* pIndexOrder ) in GetSortArray() argument
3504 QuickSort( rSortArray, pIndexOrder); in GetSortArray()
3507 …tic void lcl_QuickSort( long nLo, long nHi, vector<double>& rSortArray, vector<long>* pIndexOrder ) in lcl_QuickSort() argument
3518 if (pIndexOrder) in lcl_QuickSort()
3519 swap(pIndexOrder->at(nLo), pIndexOrder->at(nHi)); in lcl_QuickSort()
3536 if (pIndexOrder) in lcl_QuickSort()
3537 swap(pIndexOrder->at(ni), pIndexOrder->at(nj)); in lcl_QuickSort()
3548 if (nLo < nj) lcl_QuickSort(nLo, nj, rSortArray, pIndexOrder); in lcl_QuickSort()
3549 if (ni < nHi) lcl_QuickSort(ni, nHi, rSortArray, pIndexOrder); in lcl_QuickSort()
3553 if (ni < nHi) lcl_QuickSort(ni, nHi, rSortArray, pIndexOrder); in lcl_QuickSort()
3554 if (nLo < nj) lcl_QuickSort(nLo, nj, rSortArray, pIndexOrder); in lcl_QuickSort()
3558 void ScInterpreter::QuickSort( vector<double>& rSortArray, vector<long>* pIndexOrder ) in QuickSort() argument
3563 if (pIndexOrder) in QuickSort()
3565 pIndexOrder->clear(); in QuickSort()
3566 pIndexOrder->reserve(n); in QuickSort()
3568 pIndexOrder->push_back(i); in QuickSort()
3579 if (pIndexOrder) in QuickSort()
3580 ::std::swap( pIndexOrder->at(i), pIndexOrder->at(nInd)); in QuickSort()
3583 lcl_QuickSort(0, n-1, rSortArray, pIndexOrder); in QuickSort()