Searched refs:rSortArray (Results 1 – 2 of 2) sorted by relevance
3498 if (rSortArray.size() > MAX_ANZ_DOUBLE_FOR_SORT) in GetSortArray()3500 else if (rSortArray.empty()) in GetSortArray()3504 QuickSort( rSortArray, pIndexOrder); in GetSortArray()3515 if (rSortArray[nLo] > rSortArray[nHi]) in lcl_QuickSort()3517 swap(rSortArray[nLo], rSortArray[nHi]); in lcl_QuickSort()3528 double fLo = rSortArray[nLo]; in lcl_QuickSort()3535 swap(rSortArray[ni], rSortArray[nj]); in lcl_QuickSort()3561 long n = static_cast<long>(rSortArray.size()); in QuickSort()3574 size_t nValCount = rSortArray.size(); in QuickSort()3578 ::std::swap( rSortArray[i], rSortArray[nInd]); in QuickSort()[all …]
798 void GetSortArray(sal_uInt8 nParamCount, ::std::vector<double>& rSortArray, ::std::vector<long>* pI…799 void QuickSort(::std::vector<double>& rSortArray, ::std::vector<long>* pIndexOrder = NULL);
Completed in 60 milliseconds