Lines Matching refs:pArray
135 ScSortInfoArray* pArray = new ScSortInfoArray( nUsedSorts, nInd1, nInd2 ); in CreateSortInfoArray() local
145 ScSortInfo* pInfo = pArray->Get( nSort, nRow ); in CreateSortInfoArray()
159 ScSortInfo* pInfo = pArray->Get( nSort, nCol ); in CreateSortInfoArray()
165 return pArray; in CreateSortInfoArray()
205 void ScTable::SortReorder( ScSortInfoArray* pArray, ScProgress& rProgress ) in SortReorder() argument
208 SCSIZE nCount = pArray->GetCount(); in SortReorder()
209 SCCOLROW nStart = pArray->GetStart(); in SortReorder()
210 ScSortInfo** ppInfo = pArray->GetFirstArray(); in SortReorder()
342 short ScTable::Compare( ScSortInfoArray* pArray, SCCOLROW nIndex1, SCCOLROW nIndex2 ) in Compare() argument
348 ScSortInfo* pInfo1 = pArray->Get( nSort, nIndex1 ); in Compare()
349 ScSortInfo* pInfo2 = pArray->Get( nSort, nIndex2 ); in Compare()
358 } while ( nRes == 0 && ++nSort < pArray->GetUsedSorts() ); in Compare()
361 ScSortInfo* pInfo1 = pArray->Get( 0, nIndex1 ); in Compare()
362 ScSortInfo* pInfo2 = pArray->Get( 0, nIndex2 ); in Compare()
371 void ScTable::QuickSort( ScSortInfoArray* pArray, SCsCOLROW nLo, SCsCOLROW nHi ) in QuickSort() argument
375 if (Compare(pArray, nLo, nHi) > 0) in QuickSort()
376 pArray->Swap( nLo, nHi ); in QuickSort()
384 while ((ni <= nHi) && (Compare(pArray, ni, nLo)) < 0) in QuickSort()
386 while ((nj >= nLo) && (Compare(pArray, nLo, nj)) < 0) in QuickSort()
391 pArray->Swap( ni, nj ); in QuickSort()
399 QuickSort(pArray, nLo, nj); in QuickSort()
401 QuickSort(pArray, ni, nHi); in QuickSort()
406 QuickSort(pArray, ni, nHi); in QuickSort()
408 QuickSort(pArray, nLo, nj); in QuickSort()
506 void ScTable::DecoladeRow( ScSortInfoArray* pArray, SCROW nRow1, SCROW nRow2 ) in DecoladeRow() argument
513 pArray->Swap(i, nRow1 + nRow); in DecoladeRow()
534 ScSortInfoArray* pArray = CreateSortInfoArray( nRow1, nLastRow ); in Sort() local
536 DecoladeRow( pArray, nRow1, nLastRow ); in Sort()
537 QuickSort( pArray, nRow1, nLastRow ); in Sort()
538 SortReorder( pArray, aProgress ); in Sort()
539 delete pArray; in Sort()
557 ScSortInfoArray* pArray = CreateSortInfoArray( nCol1, nLastCol ); in Sort() local
558 QuickSort( pArray, nCol1, nLastCol ); in Sort()
559 SortReorder( pArray, aProgress ); in Sort()
560 delete pArray; in Sort()
1303 ScSortInfoArray* pArray = CreateSortInfoArray( nRow1, rParam.nRow2 ); in TopTenQuery() local
1304 DecoladeRow( pArray, nRow1, rParam.nRow2 ); in TopTenQuery()
1305 QuickSort( pArray, nRow1, rParam.nRow2 ); in TopTenQuery()
1306 ScSortInfo** ppInfo = pArray->GetFirstArray(); in TopTenQuery()
1389 delete pArray; in TopTenQuery()