summaryrefslogtreecommitdiff
path: root/sc/source/core/data/sortparam.cxx
diff options
context:
space:
mode:
Diffstat (limited to 'sc/source/core/data/sortparam.cxx')
-rw-r--r--sc/source/core/data/sortparam.cxx116
1 files changed, 58 insertions, 58 deletions
diff --git a/sc/source/core/data/sortparam.cxx b/sc/source/core/data/sortparam.cxx
index 00f9bc6386a0..9d662659774c 100644
--- a/sc/source/core/data/sortparam.cxx
+++ b/sc/source/core/data/sortparam.cxx
@@ -2,7 +2,7 @@
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
+ *
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
@@ -58,8 +58,8 @@ ScSortParam::ScSortParam( const ScSortParam& r ) :
{
for (USHORT i=0; i<MAXSORT; i++)
{
- bDoSort[i] = r.bDoSort[i];
- nField[i] = r.nField[i];
+ bDoSort[i] = r.bDoSort[i];
+ nField[i] = r.nField[i];
bAscending[i] = r.bAscending[i];
}
}
@@ -74,14 +74,14 @@ void ScSortParam::Clear()
nDestTab = 0;
nUserIndex = 0;
bHasHeader=bCaseSens=bUserDef=bNaturalSort = FALSE;
- bByRow=bIncludePattern=bInplace = TRUE;
+ bByRow=bIncludePattern=bInplace = TRUE;
aCollatorLocale = ::com::sun::star::lang::Locale();
aCollatorAlgorithm.Erase();
for (USHORT i=0; i<MAXSORT; i++)
{
- bDoSort[i] = FALSE;
- nField[i] = 0;
+ bDoSort[i] = FALSE;
+ nField[i] = 0;
bAscending[i] = TRUE;
}
}
@@ -90,29 +90,29 @@ void ScSortParam::Clear()
ScSortParam& ScSortParam::operator=( const ScSortParam& r )
{
- nCol1 = r.nCol1;
- nRow1 = r.nRow1;
- nCol2 = r.nCol2;
- nRow2 = r.nRow2;
- bHasHeader = r.bHasHeader;
- bByRow = r.bByRow;
- bCaseSens = r.bCaseSens;
- bNaturalSort = r.bNaturalSort;
- bUserDef = r.bUserDef;
- nUserIndex = r.nUserIndex;
- bIncludePattern = r.bIncludePattern;
- bInplace = r.bInplace;
- nDestTab = r.nDestTab;
- nDestCol = r.nDestCol;
- nDestRow = r.nDestRow;
- aCollatorLocale = r.aCollatorLocale;
- aCollatorAlgorithm = r.aCollatorAlgorithm;
+ nCol1 = r.nCol1;
+ nRow1 = r.nRow1;
+ nCol2 = r.nCol2;
+ nRow2 = r.nRow2;
+ bHasHeader = r.bHasHeader;
+ bByRow = r.bByRow;
+ bCaseSens = r.bCaseSens;
+ bNaturalSort = r.bNaturalSort;
+ bUserDef = r.bUserDef;
+ nUserIndex = r.nUserIndex;
+ bIncludePattern = r.bIncludePattern;
+ bInplace = r.bInplace;
+ nDestTab = r.nDestTab;
+ nDestCol = r.nDestCol;
+ nDestRow = r.nDestRow;
+ aCollatorLocale = r.aCollatorLocale;
+ aCollatorAlgorithm = r.aCollatorAlgorithm;
nCompatHeader = r.nCompatHeader;
for (USHORT i=0; i<MAXSORT; i++)
{
- bDoSort[i] = r.bDoSort[i];
- nField[i] = r.nField[i];
+ bDoSort[i] = r.bDoSort[i];
+ nField[i] = r.nField[i];
bAscending[i] = r.bAscending[i];
}
@@ -125,38 +125,38 @@ BOOL ScSortParam::operator==( const ScSortParam& rOther ) const
{
BOOL bEqual = FALSE;
// Anzahl der Sorts gleich?
- USHORT nLast = 0;
+ USHORT nLast = 0;
USHORT nOtherLast = 0;
while ( bDoSort[nLast++] && nLast < MAXSORT ) ;
while ( rOther.bDoSort[nOtherLast++] && nOtherLast < MAXSORT ) ;
nLast--;
nOtherLast--;
- if ( (nLast == nOtherLast)
- && (nCol1 == rOther.nCol1)
- && (nRow1 == rOther.nRow1)
- && (nCol2 == rOther.nCol2)
- && (nRow2 == rOther.nRow2)
- && (bHasHeader == rOther.bHasHeader)
- && (bByRow == rOther.bByRow)
- && (bCaseSens == rOther.bCaseSens)
- && (bNaturalSort == rOther.bNaturalSort)
- && (bUserDef == rOther.bUserDef)
- && (nUserIndex == rOther.nUserIndex)
+ if ( (nLast == nOtherLast)
+ && (nCol1 == rOther.nCol1)
+ && (nRow1 == rOther.nRow1)
+ && (nCol2 == rOther.nCol2)
+ && (nRow2 == rOther.nRow2)
+ && (bHasHeader == rOther.bHasHeader)
+ && (bByRow == rOther.bByRow)
+ && (bCaseSens == rOther.bCaseSens)
+ && (bNaturalSort == rOther.bNaturalSort)
+ && (bUserDef == rOther.bUserDef)
+ && (nUserIndex == rOther.nUserIndex)
&& (bIncludePattern == rOther.bIncludePattern)
- && (bInplace == rOther.bInplace)
- && (nDestTab == rOther.nDestTab)
- && (nDestCol == rOther.nDestCol)
- && (nDestRow == rOther.nDestRow)
- && (aCollatorLocale.Language == rOther.aCollatorLocale.Language)
- && (aCollatorLocale.Country == rOther.aCollatorLocale.Country)
- && (aCollatorLocale.Variant == rOther.aCollatorLocale.Variant)
- && (aCollatorAlgorithm == rOther.aCollatorAlgorithm)
+ && (bInplace == rOther.bInplace)
+ && (nDestTab == rOther.nDestTab)
+ && (nDestCol == rOther.nDestCol)
+ && (nDestRow == rOther.nDestRow)
+ && (aCollatorLocale.Language == rOther.aCollatorLocale.Language)
+ && (aCollatorLocale.Country == rOther.aCollatorLocale.Country)
+ && (aCollatorLocale.Variant == rOther.aCollatorLocale.Variant)
+ && (aCollatorAlgorithm == rOther.aCollatorAlgorithm)
)
{
bEqual = TRUE;
for ( USHORT i=0; i<=nLast && bEqual; i++ )
{
- bEqual = (nField[i] == rOther.nField[i]) && (bAscending[i] == rOther.bAscending[i]);
+ bEqual = (nField[i] == rOther.nField[i]) && (bAscending[i] == rOther.bAscending[i]);
}
}
return bEqual;
@@ -176,21 +176,21 @@ ScSortParam::ScSortParam( const ScSubTotalParam& rSub, const ScSortParam& rOld )
USHORT nNewCount = 0;
USHORT i;
- // zuerst die Gruppen aus den Teilergebnissen
+ // zuerst die Gruppen aus den Teilergebnissen
if (rSub.bDoSort)
for (i=0; i<MAXSUBTOTAL; i++)
if (rSub.bGroupActive[i])
{
if (nNewCount < MAXSORT)
{
- bDoSort[nNewCount] = TRUE;
- nField[nNewCount] = rSub.nField[i];
+ bDoSort[nNewCount] = TRUE;
+ nField[nNewCount] = rSub.nField[i];
bAscending[nNewCount] = rSub.bAscending;
++nNewCount;
}
}
- // dann dahinter die alten Einstellungen
+ // dann dahinter die alten Einstellungen
for (i=0; i<MAXSORT; i++)
if (rOld.bDoSort[i])
{
@@ -199,22 +199,22 @@ ScSortParam::ScSortParam( const ScSubTotalParam& rSub, const ScSortParam& rOld )
for (USHORT j=0; j<nNewCount; j++)
if ( nField[j] == nThisField )
bDouble = TRUE;
- if (!bDouble) // ein Feld nicht zweimal eintragen
+ if (!bDouble) // ein Feld nicht zweimal eintragen
{
if (nNewCount < MAXSORT)
{
- bDoSort[nNewCount] = TRUE;
- nField[nNewCount] = nThisField;
+ bDoSort[nNewCount] = TRUE;
+ nField[nNewCount] = nThisField;
bAscending[nNewCount] = rOld.bAscending[i];
++nNewCount;
}
}
}
- for (i=nNewCount; i<MAXSORT; i++) // Rest loeschen
+ for (i=nNewCount; i<MAXSORT; i++) // Rest loeschen
{
- bDoSort[i] = FALSE;
- nField[i] = 0;
+ bDoSort[i] = FALSE;
+ nField[i] = 0;
bAscending[i] = TRUE;
}
}
@@ -235,8 +235,8 @@ ScSortParam::ScSortParam( const ScQueryParam& rParam, SCCOL nCol ) :
bAscending[0] = TRUE;
for (USHORT i=1; i<MAXSORT; i++)
{
- bDoSort[i] = FALSE;
- nField[i] = 0;
+ bDoSort[i] = FALSE;
+ nField[i] = 0;
bAscending[i] = TRUE;
}
}
generated by cgit (git 2.34.1) at 2024-05-17 14:46:43 +0000