forked from amazingfate/loongoffice
8f436d3de7
and automatically seed from time on first use coverity#1242393 Don't call rand coverity#1242404 Don't call rand coverity#1242410 Don't call rand and additionally allow 0xFF as a value coverity#1242409 Don't call rand coverity#1242399 Don't call rand coverity#1242372 Don't call rand coverity#1242377 Don't call rand coverity#1242378 Don't call rand coverity#1242379 Don't call rand coverity#1242382 Don't call rand coverity#1242383 Don't call rand coverity#1242402 Don't call rand coverity#1242397 Don't call rand coverity#1242390 Don't call rand coverity#1242389 Don't call rand coverity#1242388 Don't call rand coverity#1242386 Don't call rand coverity#1242384 Don't call rand coverity#1242394 Don't call rand Change-Id: I241feab9cb370e091fd6ccaba2af941eb95bc7cf
3014 lines
102 KiB
C++
3014 lines
102 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*
|
|
* This file is part of the LibreOffice project.
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
*
|
|
* This file incorporates work covered by the following license notice:
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed
|
|
* with this work for additional information regarding copyright
|
|
* ownership. The ASF licenses this file to you under the Apache
|
|
* License, Version 2.0 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
|
|
*/
|
|
|
|
#include <rtl/math.hxx>
|
|
#include <comphelper/random.hxx>
|
|
#include <unotools/textsearch.hxx>
|
|
#include <svl/zforlist.hxx>
|
|
#include <svl/zformat.hxx>
|
|
#include <unotools/charclass.hxx>
|
|
#include <unotools/collatorwrapper.hxx>
|
|
#include <com/sun/star/i18n/CollatorOptions.hpp>
|
|
#include <stdlib.h>
|
|
#include <unotools/transliterationwrapper.hxx>
|
|
|
|
#include "table.hxx"
|
|
#include "scitems.hxx"
|
|
#include "attrib.hxx"
|
|
#include "formulacell.hxx"
|
|
#include "document.hxx"
|
|
#include "globstr.hrc"
|
|
#include "global.hxx"
|
|
#include "stlpool.hxx"
|
|
#include "compiler.hxx"
|
|
#include "patattr.hxx"
|
|
#include "subtotal.hxx"
|
|
#include "docoptio.hxx"
|
|
#include "markdata.hxx"
|
|
#include "rangelst.hxx"
|
|
#include "attarray.hxx"
|
|
#include "userlist.hxx"
|
|
#include "progress.hxx"
|
|
#include "cellform.hxx"
|
|
#include "postit.hxx"
|
|
#include "queryparam.hxx"
|
|
#include "queryentry.hxx"
|
|
#include "segmenttree.hxx"
|
|
#include "subtotalparam.hxx"
|
|
#include "docpool.hxx"
|
|
#include "cellvalue.hxx"
|
|
#include "tokenarray.hxx"
|
|
#include "mtvcellfunc.hxx"
|
|
#include "columnspanset.hxx"
|
|
#include <fstalgorithm.hxx>
|
|
#include <listenercontext.hxx>
|
|
#include <sharedformula.hxx>
|
|
#include <refhint.hxx>
|
|
#include <listenerquery.hxx>
|
|
#include <bcaslot.hxx>
|
|
#include "rangelst.hxx"
|
|
|
|
#include <svl/sharedstringpool.hxx>
|
|
|
|
#include <vector>
|
|
#include <boost/checked_delete.hpp>
|
|
#include <boost/scoped_ptr.hpp>
|
|
#include <boost/scoped_array.hpp>
|
|
#include <boost/unordered_set.hpp>
|
|
#include <boost/noncopyable.hpp>
|
|
#include <boost/ptr_container/ptr_vector.hpp>
|
|
#include <mdds/flat_segment_tree.hpp>
|
|
|
|
using namespace ::com::sun::star;
|
|
|
|
namespace naturalsort {
|
|
|
|
using namespace ::com::sun::star::i18n;
|
|
|
|
/** Splits a given string into three parts: the prefix, number string, and
|
|
the suffix.
|
|
|
|
@param sWhole
|
|
Original string to be split into pieces
|
|
|
|
@param sPrefix
|
|
Prefix string that consists of the part before the first number token
|
|
|
|
@param sSuffix
|
|
String after the last number token. This may still contain number strings.
|
|
|
|
@param fNum
|
|
Number converted from the middle number string
|
|
|
|
@return Returns TRUE if a numeral element is found in a given string, or
|
|
FALSE if no numeral element is found.
|
|
*/
|
|
bool SplitString( const OUString &sWhole,
|
|
OUString &sPrefix, OUString &sSuffix, double &fNum )
|
|
{
|
|
i18n::LocaleDataItem aLocaleItem = ScGlobal::pLocaleData->getLocaleItem();
|
|
|
|
// Get prefix element
|
|
OUString sEmpty, sUser = "-";
|
|
ParseResult aPRPre = ScGlobal::pCharClass->parsePredefinedToken(
|
|
KParseType::IDENTNAME, sWhole, 0,
|
|
KParseTokens::ANY_LETTER, sUser, KParseTokens::ANY_LETTER, sUser );
|
|
sPrefix = sWhole.copy( 0, aPRPre.EndPos );
|
|
|
|
// Return FALSE if no numeral element is found
|
|
if ( aPRPre.EndPos == sWhole.getLength() )
|
|
return false;
|
|
|
|
// Get numeral element
|
|
sUser = aLocaleItem.decimalSeparator;
|
|
ParseResult aPRNum = ScGlobal::pCharClass->parsePredefinedToken(
|
|
KParseType::ANY_NUMBER, sWhole, aPRPre.EndPos,
|
|
KParseTokens::ANY_NUMBER, sEmpty, KParseTokens::ANY_NUMBER, sUser );
|
|
|
|
if ( aPRNum.EndPos == aPRPre.EndPos )
|
|
return false;
|
|
|
|
fNum = aPRNum.Value;
|
|
sSuffix = sWhole.copy( aPRNum.EndPos );
|
|
|
|
return true;
|
|
}
|
|
|
|
/** Naturally compares two given strings.
|
|
|
|
This is the main function that should be called externally. It returns
|
|
either 1, 0, or -1 depending on the comparison result of given two strings.
|
|
|
|
@param sInput1
|
|
Input string 1
|
|
|
|
@param sInput2
|
|
Input string 2
|
|
|
|
@param bCaseSens
|
|
Boolean value for case sensitivity
|
|
|
|
@param pData
|
|
Pointer to user defined sort list
|
|
|
|
@param pCW
|
|
Pointer to collator wrapper for normal string comparison
|
|
|
|
@return Returnes 1 if sInput1 is greater, 0 if sInput1 == sInput2, and -1 if
|
|
sInput2 is greater.
|
|
*/
|
|
short Compare( const OUString &sInput1, const OUString &sInput2,
|
|
const bool bCaseSens, const ScUserListData* pData, const CollatorWrapper *pCW )
|
|
{
|
|
OUString sStr1( sInput1 ), sStr2( sInput2 ), sPre1, sSuf1, sPre2, sSuf2;
|
|
|
|
do
|
|
{
|
|
double nNum1, nNum2;
|
|
bool bNumFound1 = SplitString( sStr1, sPre1, sSuf1, nNum1 );
|
|
bool bNumFound2 = SplitString( sStr2, sPre2, sSuf2, nNum2 );
|
|
|
|
short nPreRes; // Prefix comparison result
|
|
if ( pData )
|
|
{
|
|
if ( bCaseSens )
|
|
{
|
|
if ( !bNumFound1 || !bNumFound2 )
|
|
return static_cast<short>(pData->Compare( sStr1, sStr2 ));
|
|
else
|
|
nPreRes = pData->Compare( sPre1, sPre2 );
|
|
}
|
|
else
|
|
{
|
|
if ( !bNumFound1 || !bNumFound2 )
|
|
return static_cast<short>(pData->ICompare( sStr1, sStr2 ));
|
|
else
|
|
nPreRes = pData->ICompare( sPre1, sPre2 );
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if ( !bNumFound1 || !bNumFound2 )
|
|
return static_cast<short>(pCW->compareString( sStr1, sStr2 ));
|
|
else
|
|
nPreRes = static_cast<short>(pCW->compareString( sPre1, sPre2 ));
|
|
}
|
|
|
|
// Prefix strings differ. Return immediately.
|
|
if ( nPreRes != 0 ) return nPreRes;
|
|
|
|
if ( nNum1 != nNum2 )
|
|
{
|
|
if ( nNum1 < nNum2 ) return -1;
|
|
return static_cast<short>( nNum1 > nNum2 );
|
|
}
|
|
|
|
// The prefix and the first numerical elements are equal, but the suffix
|
|
// strings may still differ. Stay in the loop.
|
|
|
|
sStr1 = sSuf1;
|
|
sStr2 = sSuf2;
|
|
|
|
} while (true);
|
|
|
|
return 0;
|
|
}
|
|
|
|
}
|
|
|
|
// STATIC DATA -----------------------------------------------------------
|
|
|
|
struct ScSortInfo
|
|
{
|
|
ScRefCellValue maCell;
|
|
SCCOLROW nOrg;
|
|
DECL_FIXEDMEMPOOL_NEWDEL( ScSortInfo );
|
|
};
|
|
IMPL_FIXEDMEMPOOL_NEWDEL( ScSortInfo )
|
|
|
|
// END OF STATIC DATA -----------------------------------------------------
|
|
|
|
class ScSortInfoArray : boost::noncopyable
|
|
{
|
|
public:
|
|
|
|
struct Cell
|
|
{
|
|
ScRefCellValue maCell;
|
|
const sc::CellTextAttr* mpAttr;
|
|
const SvtBroadcaster* mpBroadcaster;
|
|
const ScPostIt* mpNote;
|
|
const ScPatternAttr* mpPattern;
|
|
|
|
Cell() : mpAttr(NULL), mpBroadcaster(NULL), mpNote(NULL), mpPattern(NULL) {}
|
|
};
|
|
|
|
struct Row
|
|
{
|
|
std::vector<Cell> maCells;
|
|
|
|
bool mbHidden:1;
|
|
bool mbFiltered:1;
|
|
|
|
Row( size_t nColSize ) : maCells(nColSize, Cell()), mbHidden(false), mbFiltered(false) {}
|
|
};
|
|
|
|
typedef std::vector<Row*> RowsType;
|
|
|
|
private:
|
|
boost::scoped_ptr<RowsType> mpRows; /// row-wise data table for sort by row operation.
|
|
|
|
ScSortInfo*** pppInfo;
|
|
SCSIZE nCount;
|
|
SCCOLROW nStart;
|
|
SCCOLROW mnLastIndex; /// index of last non-empty cell position.
|
|
sal_uInt16 nUsedSorts;
|
|
|
|
std::vector<SCCOLROW> maOrderIndices;
|
|
bool mbKeepQuery;
|
|
bool mbUpdateRefs;
|
|
|
|
public:
|
|
ScSortInfoArray( sal_uInt16 nSorts, SCCOLROW nInd1, SCCOLROW nInd2 ) :
|
|
pppInfo(NULL),
|
|
nCount( nInd2 - nInd1 + 1 ), nStart( nInd1 ),
|
|
mnLastIndex(nInd2),
|
|
nUsedSorts(nSorts),
|
|
mbKeepQuery(false),
|
|
mbUpdateRefs(false)
|
|
{
|
|
if (nUsedSorts)
|
|
{
|
|
pppInfo = new ScSortInfo**[nUsedSorts];
|
|
for ( sal_uInt16 nSort = 0; nSort < nUsedSorts; nSort++ )
|
|
{
|
|
ScSortInfo** ppInfo = new ScSortInfo* [nCount];
|
|
for ( SCSIZE j = 0; j < nCount; j++ )
|
|
ppInfo[j] = new ScSortInfo;
|
|
pppInfo[nSort] = ppInfo;
|
|
}
|
|
}
|
|
|
|
for (size_t i = 0; i < nCount; ++i)
|
|
maOrderIndices.push_back(i+nStart);
|
|
}
|
|
|
|
~ScSortInfoArray()
|
|
{
|
|
if (pppInfo)
|
|
{
|
|
for ( sal_uInt16 nSort = 0; nSort < nUsedSorts; nSort++ )
|
|
{
|
|
ScSortInfo** ppInfo = pppInfo[nSort];
|
|
for ( SCSIZE j = 0; j < nCount; j++ )
|
|
delete ppInfo[j];
|
|
delete [] ppInfo;
|
|
}
|
|
delete[] pppInfo;
|
|
}
|
|
|
|
if (mpRows)
|
|
std::for_each(mpRows->begin(), mpRows->end(), boost::checked_deleter<Row>());
|
|
}
|
|
|
|
void SetKeepQuery( bool b ) { mbKeepQuery = b; }
|
|
|
|
bool IsKeepQuery() const { return mbKeepQuery; }
|
|
|
|
void SetUpdateRefs( bool b ) { mbUpdateRefs = b; }
|
|
|
|
bool IsUpdateRefs() const { return mbUpdateRefs; }
|
|
|
|
/**
|
|
* Call this only during normal sorting, not from reordering.
|
|
*/
|
|
ScSortInfo** GetFirstArray() const
|
|
{
|
|
OSL_ASSERT(pppInfo);
|
|
return pppInfo[0];
|
|
}
|
|
|
|
/**
|
|
* Call this only during normal sorting, not from reordering.
|
|
*/
|
|
ScSortInfo* Get( sal_uInt16 nSort, SCCOLROW nInd )
|
|
{
|
|
OSL_ASSERT(pppInfo);
|
|
return (pppInfo[nSort])[ nInd - nStart ];
|
|
}
|
|
|
|
/**
|
|
* Call this only during normal sorting, not from reordering.
|
|
*/
|
|
void Swap( SCCOLROW nInd1, SCCOLROW nInd2 )
|
|
{
|
|
OSL_ASSERT(pppInfo);
|
|
SCSIZE n1 = static_cast<SCSIZE>(nInd1 - nStart);
|
|
SCSIZE n2 = static_cast<SCSIZE>(nInd2 - nStart);
|
|
for ( sal_uInt16 nSort = 0; nSort < nUsedSorts; nSort++ )
|
|
{
|
|
ScSortInfo** ppInfo = pppInfo[nSort];
|
|
ScSortInfo* pTmp = ppInfo[n1];
|
|
ppInfo[n1] = ppInfo[n2];
|
|
ppInfo[n2] = pTmp;
|
|
}
|
|
|
|
std::swap(maOrderIndices[n1], maOrderIndices[n2]);
|
|
|
|
if (mpRows)
|
|
{
|
|
// Swap rows in data table.
|
|
RowsType& rRows = *mpRows;
|
|
std::swap(rRows[n1], rRows[n2]);
|
|
}
|
|
}
|
|
|
|
void SetOrderIndices( const std::vector<SCCOLROW>& rIndices )
|
|
{
|
|
maOrderIndices = rIndices;
|
|
}
|
|
|
|
/**
|
|
* @param rIndices indices are actual row positions on the sheet, not an
|
|
* offset from the top row.
|
|
*/
|
|
void ReorderByRow( const std::vector<SCCOLROW>& rIndices )
|
|
{
|
|
if (!mpRows)
|
|
return;
|
|
|
|
RowsType& rRows = *mpRows;
|
|
|
|
std::vector<SCCOLROW> aOrderIndices2;
|
|
aOrderIndices2.reserve(rIndices.size());
|
|
|
|
RowsType aRows2;
|
|
aRows2.reserve(rRows.size());
|
|
|
|
std::vector<SCCOLROW>::const_iterator it = rIndices.begin(), itEnd = rIndices.end();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
size_t nPos = *it - nStart; // switch to an offset to top row.
|
|
aRows2.push_back(rRows[nPos]);
|
|
aOrderIndices2.push_back(maOrderIndices[nPos]);
|
|
}
|
|
|
|
rRows.swap(aRows2);
|
|
maOrderIndices.swap(aOrderIndices2);
|
|
}
|
|
|
|
sal_uInt16 GetUsedSorts() const { return nUsedSorts; }
|
|
|
|
SCCOLROW GetStart() const { return nStart; }
|
|
SCCOLROW GetLast() const { return mnLastIndex; }
|
|
|
|
const std::vector<SCCOLROW>& GetOrderIndices() const { return maOrderIndices; }
|
|
|
|
RowsType& InitDataRows( size_t nRowSize, size_t nColSize )
|
|
{
|
|
mpRows.reset(new RowsType);
|
|
mpRows->reserve(nRowSize);
|
|
for (size_t i = 0; i < nRowSize; ++i)
|
|
mpRows->push_back(new Row(nColSize));
|
|
|
|
return *mpRows;
|
|
}
|
|
|
|
RowsType* GetDataRows()
|
|
{
|
|
return mpRows.get();
|
|
}
|
|
};
|
|
|
|
namespace {
|
|
|
|
void initDataRows(
|
|
ScSortInfoArray& rArray, ScTable& rTab, ScColumn* pCols,
|
|
SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2,
|
|
bool bPattern, bool bHiddenFiltered )
|
|
{
|
|
// Fill row-wise data table.
|
|
ScSortInfoArray::RowsType& rRows = rArray.InitDataRows(nRow2-nRow1+1, nCol2-nCol1+1);
|
|
|
|
for (SCCOL nCol = nCol1; nCol <= nCol2; ++nCol)
|
|
{
|
|
ScColumn& rCol = pCols[nCol];
|
|
|
|
// Skip reordering of cell formats if the whole span is on the same pattern entry.
|
|
bool bUniformPattern = rCol.GetPatternCount(nRow1, nRow2) < 2u;
|
|
|
|
sc::ColumnBlockConstPosition aBlockPos;
|
|
rCol.InitBlockPosition(aBlockPos);
|
|
for (SCROW nRow = nRow1; nRow <= nRow2; ++nRow)
|
|
{
|
|
ScSortInfoArray::Row& rRow = *rRows[nRow-nRow1];
|
|
ScSortInfoArray::Cell& rCell = rRow.maCells[nCol-nCol1];
|
|
|
|
rCell.maCell = rCol.GetCellValue(aBlockPos, nRow);
|
|
rCell.mpAttr = rCol.GetCellTextAttr(aBlockPos, nRow);
|
|
rCell.mpBroadcaster = rCol.GetBroadcaster(aBlockPos, nRow);
|
|
rCell.mpNote = rCol.GetCellNote(aBlockPos, nRow);
|
|
|
|
if (!bUniformPattern && bPattern)
|
|
rCell.mpPattern = rCol.GetPattern(nRow);
|
|
}
|
|
}
|
|
|
|
if (bHiddenFiltered)
|
|
{
|
|
for (SCROW nRow = nRow1; nRow <= nRow2; ++nRow)
|
|
{
|
|
ScSortInfoArray::Row& rRow = *rRows[nRow-nRow1];
|
|
rRow.mbHidden = rTab.RowHidden(nRow);
|
|
rRow.mbFiltered = rTab.RowFiltered(nRow);
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
ScSortInfoArray* ScTable::CreateSortInfoArray( const sc::ReorderParam& rParam )
|
|
{
|
|
ScSortInfoArray* pArray = NULL;
|
|
|
|
if (rParam.mbByRow)
|
|
{
|
|
// Create a sort info array with just the data table.
|
|
SCROW nRow1 = rParam.maSortRange.aStart.Row();
|
|
SCROW nRow2 = rParam.maSortRange.aEnd.Row();
|
|
SCCOL nCol1 = rParam.maSortRange.aStart.Col();
|
|
SCCOL nCol2 = rParam.maSortRange.aEnd.Col();
|
|
|
|
pArray = new ScSortInfoArray(0, nRow1, nRow2);
|
|
pArray->SetKeepQuery(rParam.mbHiddenFiltered);
|
|
pArray->SetUpdateRefs(rParam.mbUpdateRefs);
|
|
|
|
initDataRows(
|
|
*pArray, *this, aCol, nCol1, nRow1, nCol2, nRow2,
|
|
rParam.mbPattern, rParam.mbHiddenFiltered);
|
|
}
|
|
else
|
|
{
|
|
SCCOLROW nCol1 = rParam.maSortRange.aStart.Col();
|
|
SCCOLROW nCol2 = rParam.maSortRange.aEnd.Col();
|
|
|
|
pArray = new ScSortInfoArray(0, nCol1, nCol2);
|
|
pArray->SetKeepQuery(rParam.mbHiddenFiltered);
|
|
pArray->SetUpdateRefs(rParam.mbUpdateRefs);
|
|
}
|
|
|
|
return pArray;
|
|
}
|
|
|
|
ScSortInfoArray* ScTable::CreateSortInfoArray(
|
|
const ScSortParam& rSortParam, SCCOLROW nInd1, SCCOLROW nInd2,
|
|
bool bKeepQuery, bool bUpdateRefs )
|
|
{
|
|
sal_uInt16 nUsedSorts = 1;
|
|
while ( nUsedSorts < rSortParam.GetSortKeyCount() && rSortParam.maKeyState[nUsedSorts].bDoSort )
|
|
nUsedSorts++;
|
|
ScSortInfoArray* pArray = new ScSortInfoArray( nUsedSorts, nInd1, nInd2 );
|
|
pArray->SetKeepQuery(bKeepQuery);
|
|
pArray->SetUpdateRefs(bUpdateRefs);
|
|
|
|
if ( rSortParam.bByRow )
|
|
{
|
|
for ( sal_uInt16 nSort = 0; nSort < nUsedSorts; nSort++ )
|
|
{
|
|
SCCOL nCol = static_cast<SCCOL>(rSortParam.maKeyState[nSort].nField);
|
|
ScColumn* pCol = &aCol[nCol];
|
|
sc::ColumnBlockConstPosition aBlockPos;
|
|
pCol->InitBlockPosition(aBlockPos);
|
|
for ( SCROW nRow = nInd1; nRow <= nInd2; nRow++ )
|
|
{
|
|
ScSortInfo* pInfo = pArray->Get( nSort, nRow );
|
|
pInfo->maCell = pCol->GetCellValue(aBlockPos, nRow);
|
|
pInfo->nOrg = nRow;
|
|
}
|
|
}
|
|
|
|
initDataRows(
|
|
*pArray, *this, aCol, rSortParam.nCol1, nInd1, rSortParam.nCol2, nInd2,
|
|
rSortParam.bIncludePattern, bKeepQuery);
|
|
}
|
|
else
|
|
{
|
|
for ( sal_uInt16 nSort = 0; nSort < nUsedSorts; nSort++ )
|
|
{
|
|
SCROW nRow = rSortParam.maKeyState[nSort].nField;
|
|
for ( SCCOL nCol = static_cast<SCCOL>(nInd1);
|
|
nCol <= static_cast<SCCOL>(nInd2); nCol++ )
|
|
{
|
|
ScSortInfo* pInfo = pArray->Get( nSort, nCol );
|
|
pInfo->maCell = GetCellValue(nCol, nRow);
|
|
pInfo->nOrg = nCol;
|
|
}
|
|
}
|
|
}
|
|
return pArray;
|
|
}
|
|
|
|
namespace {
|
|
|
|
struct SortedColumn : boost::noncopyable
|
|
{
|
|
typedef mdds::flat_segment_tree<SCROW, const ScPatternAttr*> PatRangeType;
|
|
|
|
sc::CellStoreType maCells;
|
|
sc::CellTextAttrStoreType maCellTextAttrs;
|
|
sc::BroadcasterStoreType maBroadcasters;
|
|
sc::CellNoteStoreType maCellNotes;
|
|
|
|
PatRangeType maPatterns;
|
|
PatRangeType::const_iterator miPatternPos;
|
|
|
|
SortedColumn( size_t nTopEmptyRows ) :
|
|
maCells(nTopEmptyRows),
|
|
maCellTextAttrs(nTopEmptyRows),
|
|
maBroadcasters(nTopEmptyRows),
|
|
maCellNotes(nTopEmptyRows),
|
|
maPatterns(0, MAXROWCOUNT, NULL),
|
|
miPatternPos(maPatterns.begin()) {}
|
|
|
|
void setPattern( SCROW nRow, const ScPatternAttr* pPat )
|
|
{
|
|
miPatternPos = maPatterns.insert(miPatternPos, nRow, nRow+1, pPat).first;
|
|
}
|
|
};
|
|
|
|
struct SortedRowFlags
|
|
{
|
|
typedef mdds::flat_segment_tree<SCROW,bool> FlagsType;
|
|
|
|
FlagsType maRowsHidden;
|
|
FlagsType maRowsFiltered;
|
|
FlagsType::const_iterator miPosHidden;
|
|
FlagsType::const_iterator miPosFiltered;
|
|
|
|
SortedRowFlags() :
|
|
maRowsHidden(0, MAXROWCOUNT, false),
|
|
maRowsFiltered(0, MAXROWCOUNT, false),
|
|
miPosHidden(maRowsHidden.begin()),
|
|
miPosFiltered(maRowsFiltered.begin()) {}
|
|
|
|
void setRowHidden( SCROW nRow, bool b )
|
|
{
|
|
miPosHidden = maRowsHidden.insert(miPosHidden, nRow, nRow+1, b).first;
|
|
}
|
|
|
|
void setRowFiltered( SCROW nRow, bool b )
|
|
{
|
|
miPosFiltered = maRowsFiltered.insert(miPosFiltered, nRow, nRow+1, b).first;
|
|
}
|
|
};
|
|
|
|
struct PatternSpan
|
|
{
|
|
SCROW mnRow1;
|
|
SCROW mnRow2;
|
|
const ScPatternAttr* mpPattern;
|
|
|
|
PatternSpan( SCROW nRow1, SCROW nRow2, const ScPatternAttr* pPat ) :
|
|
mnRow1(nRow1), mnRow2(nRow2), mpPattern(pPat) {}
|
|
};
|
|
|
|
}
|
|
|
|
bool ScTable::IsSortCollatorGlobal() const
|
|
{
|
|
return pSortCollator == ScGlobal::GetCollator() ||
|
|
pSortCollator == ScGlobal::GetCaseCollator();
|
|
}
|
|
|
|
void ScTable::InitSortCollator( const ScSortParam& rPar )
|
|
{
|
|
if ( !rPar.aCollatorLocale.Language.isEmpty() )
|
|
{
|
|
if ( !pSortCollator || IsSortCollatorGlobal() )
|
|
pSortCollator = new CollatorWrapper( comphelper::getProcessComponentContext() );
|
|
pSortCollator->loadCollatorAlgorithm( rPar.aCollatorAlgorithm,
|
|
rPar.aCollatorLocale, (rPar.bCaseSens ? 0 : SC_COLLATOR_IGNORES) );
|
|
}
|
|
else
|
|
{ // SYSTEM
|
|
DestroySortCollator();
|
|
pSortCollator = (rPar.bCaseSens ? ScGlobal::GetCaseCollator() :
|
|
ScGlobal::GetCollator());
|
|
}
|
|
}
|
|
|
|
void ScTable::DestroySortCollator()
|
|
{
|
|
if ( pSortCollator )
|
|
{
|
|
if ( !IsSortCollatorGlobal() )
|
|
delete pSortCollator;
|
|
pSortCollator = NULL;
|
|
}
|
|
}
|
|
|
|
namespace {
|
|
|
|
template<typename _Hint, typename _ReorderMap, typename _Index>
|
|
class ReorderNotifier : std::unary_function<SvtListener*, void>
|
|
{
|
|
_Hint maHint;
|
|
public:
|
|
ReorderNotifier( const _ReorderMap& rMap, SCTAB nTab, _Index nPos1, _Index nPos2 ) :
|
|
maHint(rMap, nTab, nPos1, nPos2) {}
|
|
|
|
void operator() ( SvtListener* p )
|
|
{
|
|
p->Notify(maHint);
|
|
}
|
|
};
|
|
|
|
typedef ReorderNotifier<sc::RefColReorderHint, sc::ColRowReorderMapType, SCCOL> ColReorderNotifier;
|
|
typedef ReorderNotifier<sc::RefRowReorderHint, sc::ColRowReorderMapType, SCROW> RowReorderNotifier;
|
|
|
|
class FormulaGroupPosCollector : std::unary_function<SvtListener*, void>
|
|
{
|
|
sc::RefQueryFormulaGroup& mrQuery;
|
|
|
|
public:
|
|
FormulaGroupPosCollector( sc::RefQueryFormulaGroup& rQuery ) : mrQuery(rQuery) {}
|
|
|
|
void operator() ( SvtListener* p )
|
|
{
|
|
p->Query(mrQuery);
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
void ScTable::SortReorderByColumn(
|
|
ScSortInfoArray* pArray, SCROW nRow1, SCROW nRow2, bool bPattern, ScProgress* pProgress )
|
|
{
|
|
SCCOLROW nStart = pArray->GetStart();
|
|
SCCOLROW nLast = pArray->GetLast();
|
|
|
|
std::vector<SCCOLROW> aIndices = pArray->GetOrderIndices();
|
|
size_t nCount = aIndices.size();
|
|
|
|
// Cut formula grouping at row and reference boundaries before the reordering.
|
|
ScRange aSortRange(nStart, nRow1, nTab, nLast, nRow2, nTab);
|
|
for (SCCOL nCol = nStart; nCol <= nLast; ++nCol)
|
|
aCol[nCol].SplitFormulaGroupByRelativeRef(aSortRange);
|
|
|
|
// table to keep track of column index to position in the index table.
|
|
std::vector<SCCOLROW> aPosTable(nCount);
|
|
for (size_t i = 0; i < nCount; ++i)
|
|
aPosTable[aIndices[i]-nStart] = i;
|
|
|
|
SCCOLROW nDest = nStart;
|
|
for (size_t i = 0; i < nCount; ++i, ++nDest)
|
|
{
|
|
SCCOLROW nSrc = aIndices[i];
|
|
if (nDest != nSrc)
|
|
{
|
|
aCol[nDest].Swap(aCol[nSrc], nRow1, nRow2, bPattern);
|
|
|
|
// Update the position of the index that was originally equal to nDest.
|
|
size_t nPos = aPosTable[nDest-nStart];
|
|
aIndices[nPos] = nSrc;
|
|
aPosTable[nSrc-nStart] = nPos;
|
|
}
|
|
|
|
if (pProgress)
|
|
pProgress->SetStateOnPercent(i);
|
|
}
|
|
|
|
// Reset formula cell positions which became out-of-sync after column reordering.
|
|
for (SCCOL nCol = nStart; nCol <= nLast; ++nCol)
|
|
aCol[nCol].ResetFormulaCellPositions(nRow1, nRow2);
|
|
|
|
// Set up column reorder map (for later broadcasting of reference updates).
|
|
sc::ColRowReorderMapType aColMap;
|
|
const std::vector<SCCOLROW>& rOldIndices = pArray->GetOrderIndices();
|
|
for (size_t i = 0, n = rOldIndices.size(); i < n; ++i)
|
|
{
|
|
SCCOL nNew = i + nStart;
|
|
SCCOL nOld = rOldIndices[i];
|
|
aColMap.insert(sc::ColRowReorderMapType::value_type(nOld, nNew));
|
|
}
|
|
|
|
// Collect all listeners within sorted range ahead of time.
|
|
std::vector<SvtListener*> aListeners;
|
|
|
|
// Get all area listeners that listen on one column within the range and
|
|
// end their listening.
|
|
ScRange aMoveRange( nStart, nRow1, nTab, nLast, nRow2, nTab);
|
|
std::vector<sc::AreaListener> aAreaListeners = pDocument->GetBASM()->GetAllListeners(
|
|
aMoveRange, sc::OneColumnInsideArea);
|
|
{
|
|
std::vector<sc::AreaListener>::iterator it = aAreaListeners.begin(), itEnd = aAreaListeners.end();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
pDocument->EndListeningArea(it->maArea, it->mpListener);
|
|
aListeners.push_back( it->mpListener);
|
|
}
|
|
}
|
|
|
|
if (pArray->IsUpdateRefs())
|
|
{
|
|
for (SCCOL nCol = nStart; nCol <= nLast; ++nCol)
|
|
aCol[nCol].CollectListeners(aListeners, nRow1, nRow2);
|
|
|
|
// Remove any duplicate listener entries and notify all listeners
|
|
// afterward. We must ensure that we notify each unique listener only
|
|
// once.
|
|
std::sort(aListeners.begin(), aListeners.end());
|
|
aListeners.erase(std::unique(aListeners.begin(), aListeners.end()), aListeners.end());
|
|
ColReorderNotifier aFunc(aColMap, nTab, nRow1, nRow2);
|
|
std::for_each(aListeners.begin(), aListeners.end(), aFunc);
|
|
}
|
|
|
|
// Re-start area listeners on the reordered columns.
|
|
{
|
|
std::vector<sc::AreaListener>::iterator it = aAreaListeners.begin(), itEnd = aAreaListeners.end();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
ScRange aNewRange = it->maArea;
|
|
sc::ColRowReorderMapType::const_iterator itCol = aColMap.find( aNewRange.aStart.Col());
|
|
if (itCol != aColMap.end())
|
|
{
|
|
aNewRange.aStart.SetCol( itCol->second);
|
|
aNewRange.aEnd.SetCol( itCol->second);
|
|
}
|
|
pDocument->StartListeningArea(aNewRange, it->mpListener);
|
|
}
|
|
}
|
|
|
|
// Re-join formulas at row boundaries now that all the references have
|
|
// been adjusted for column reordering.
|
|
for (SCCOL nCol = nStart; nCol <= nLast; ++nCol)
|
|
{
|
|
sc::CellStoreType& rCells = aCol[nCol].maCells;
|
|
sc::CellStoreType::position_type aPos = rCells.position(nRow1);
|
|
sc::SharedFormulaUtil::joinFormulaCellAbove(aPos);
|
|
if (nRow2 < MAXROW)
|
|
{
|
|
aPos = rCells.position(aPos.first, nRow2+1);
|
|
sc::SharedFormulaUtil::joinFormulaCellAbove(aPos);
|
|
}
|
|
}
|
|
}
|
|
|
|
void ScTable::SortReorderByRow(
|
|
ScSortInfoArray* pArray, SCCOL nCol1, SCCOL nCol2, ScProgress* pProgress )
|
|
{
|
|
if (nCol2 < nCol1)
|
|
return;
|
|
|
|
SCROW nRow1 = pArray->GetStart();
|
|
SCROW nRow2 = pArray->GetLast();
|
|
ScSortInfoArray::RowsType* pRows = pArray->GetDataRows();
|
|
assert(pRows); // In sort-by-row mode we must have data rows already populated.
|
|
|
|
// Split formula groups at the sort range boundaries (if applicable).
|
|
std::vector<SCROW> aRowBounds;
|
|
aRowBounds.reserve(2);
|
|
aRowBounds.push_back(nRow1);
|
|
aRowBounds.push_back(nRow2+1);
|
|
for (SCCOL nCol = nCol1; nCol <= nCol2; ++nCol)
|
|
SplitFormulaGroups(nCol, aRowBounds);
|
|
|
|
// Cells in the data rows only reference values in the document. Make
|
|
// a copy before updating the document.
|
|
|
|
size_t nColCount = nCol2 - nCol1 + 1;
|
|
boost::ptr_vector<SortedColumn> aSortedCols; // storage for copied cells.
|
|
SortedRowFlags aRowFlags;
|
|
aSortedCols.reserve(nColCount);
|
|
for (size_t i = 0; i < nColCount; ++i)
|
|
{
|
|
// In the sorted column container, element positions and row
|
|
// positions must match, else formula cells may mis-behave during
|
|
// grouping.
|
|
aSortedCols.push_back(new SortedColumn(nRow1));
|
|
}
|
|
|
|
for (size_t i = 0; i < pRows->size(); ++i)
|
|
{
|
|
ScSortInfoArray::Row* pRow = (*pRows)[i];
|
|
for (size_t j = 0; j < pRow->maCells.size(); ++j)
|
|
{
|
|
ScAddress aCellPos(nCol1 + j, nRow1 + i, nTab);
|
|
|
|
ScSortInfoArray::Cell& rCell = pRow->maCells[j];
|
|
|
|
sc::CellStoreType& rCellStore = aSortedCols.at(j).maCells;
|
|
switch (rCell.maCell.meType)
|
|
{
|
|
case CELLTYPE_STRING:
|
|
assert(rCell.mpAttr);
|
|
rCellStore.push_back(*rCell.maCell.mpString);
|
|
break;
|
|
case CELLTYPE_VALUE:
|
|
assert(rCell.mpAttr);
|
|
rCellStore.push_back(rCell.maCell.mfValue);
|
|
break;
|
|
case CELLTYPE_EDIT:
|
|
assert(rCell.mpAttr);
|
|
rCellStore.push_back(rCell.maCell.mpEditText->Clone());
|
|
break;
|
|
case CELLTYPE_FORMULA:
|
|
{
|
|
assert(rCell.mpAttr);
|
|
ScAddress aOldPos = rCell.maCell.mpFormula->aPos;
|
|
|
|
ScFormulaCell* pNew = rCell.maCell.mpFormula->Clone( aCellPos, SC_CLONECELL_DEFAULT);
|
|
pNew->CopyAllBroadcasters(*rCell.maCell.mpFormula);
|
|
pNew->GetCode()->AdjustReferenceOnMovedOrigin(aOldPos, aCellPos);
|
|
|
|
rCellStore.push_back(pNew);
|
|
}
|
|
break;
|
|
default:
|
|
assert(!rCell.mpAttr);
|
|
rCellStore.push_back_empty();
|
|
}
|
|
|
|
sc::CellTextAttrStoreType& rAttrStore = aSortedCols.at(j).maCellTextAttrs;
|
|
if (rCell.mpAttr)
|
|
rAttrStore.push_back(*rCell.mpAttr);
|
|
else
|
|
rAttrStore.push_back_empty();
|
|
|
|
// At this point each broadcaster instance is managed by 2
|
|
// containers. We will release those in the original storage
|
|
// below before transferring them to the document.
|
|
sc::BroadcasterStoreType& rBCStore = aSortedCols.at(j).maBroadcasters;
|
|
if (rCell.mpBroadcaster)
|
|
// A const pointer would be implicitly converted to a bool type.
|
|
rBCStore.push_back(const_cast<SvtBroadcaster*>(rCell.mpBroadcaster));
|
|
else
|
|
rBCStore.push_back_empty();
|
|
|
|
// The same with cell note instances ...
|
|
sc::CellNoteStoreType& rNoteStore = aSortedCols.at(j).maCellNotes;
|
|
if (rCell.mpNote)
|
|
rNoteStore.push_back(const_cast<ScPostIt*>(rCell.mpNote));
|
|
else
|
|
rNoteStore.push_back_empty();
|
|
|
|
if (rCell.mpPattern)
|
|
aSortedCols.at(j).setPattern(aCellPos.Row(), rCell.mpPattern);
|
|
}
|
|
|
|
if (pArray->IsKeepQuery())
|
|
{
|
|
// Hidden and filtered flags are first converted to segments.
|
|
SCROW nRow = nRow1 + i;
|
|
aRowFlags.setRowHidden(nRow, pRow->mbHidden);
|
|
aRowFlags.setRowFiltered(nRow, pRow->mbFiltered);
|
|
}
|
|
|
|
if (pProgress)
|
|
pProgress->SetStateOnPercent(i);
|
|
}
|
|
|
|
for (size_t i = 0, n = aSortedCols.size(); i < n; ++i)
|
|
{
|
|
SCCOL nThisCol = i + nCol1;
|
|
|
|
{
|
|
sc::CellStoreType& rDest = aCol[nThisCol].maCells;
|
|
sc::CellStoreType& rSrc = aSortedCols[i].maCells;
|
|
rSrc.transfer(nRow1, nRow2, rDest, nRow1);
|
|
}
|
|
|
|
{
|
|
sc::CellTextAttrStoreType& rDest = aCol[nThisCol].maCellTextAttrs;
|
|
sc::CellTextAttrStoreType& rSrc = aSortedCols[i].maCellTextAttrs;
|
|
rSrc.transfer(nRow1, nRow2, rDest, nRow1);
|
|
}
|
|
|
|
{
|
|
sc::BroadcasterStoreType& rSrc = aSortedCols[i].maBroadcasters;
|
|
sc::BroadcasterStoreType& rDest = aCol[nThisCol].maBroadcasters;
|
|
|
|
// Release current broadcasters first, to prevent them from getting deleted.
|
|
rDest.release_range(nRow1, nRow2);
|
|
|
|
// Transfer sorted broadcaster segment to the document.
|
|
rSrc.transfer(nRow1, nRow2, rDest, nRow1);
|
|
}
|
|
|
|
{
|
|
sc::CellNoteStoreType& rSrc = aSortedCols[i].maCellNotes;
|
|
sc::CellNoteStoreType& rDest = aCol[nThisCol].maCellNotes;
|
|
|
|
// Do the same as broadcaster storage transfer (to prevent double deletion).
|
|
rDest.release_range(nRow1, nRow2);
|
|
rSrc.transfer(nRow1, nRow2, rDest, nRow1);
|
|
aCol[nThisCol].UpdateNoteCaptions(nRow1, nRow2);
|
|
}
|
|
|
|
{
|
|
// Get all row spans where the pattern is not NULL.
|
|
std::vector<PatternSpan> aSpans =
|
|
sc::toSpanArrayWithValue<SCROW,const ScPatternAttr*,PatternSpan>(
|
|
aSortedCols[i].maPatterns);
|
|
|
|
std::vector<PatternSpan>::iterator it = aSpans.begin(), itEnd = aSpans.end();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
assert(it->mpPattern); // should never be NULL.
|
|
pDocument->GetPool()->Put(*it->mpPattern);
|
|
}
|
|
|
|
for (it = aSpans.begin(); it != itEnd; ++it)
|
|
{
|
|
aCol[nThisCol].SetPatternArea(it->mnRow1, it->mnRow2, *it->mpPattern, true);
|
|
pDocument->GetPool()->Remove(*it->mpPattern);
|
|
}
|
|
}
|
|
|
|
aCol[nThisCol].CellStorageModified();
|
|
}
|
|
|
|
if (pArray->IsKeepQuery())
|
|
{
|
|
aRowFlags.maRowsHidden.build_tree();
|
|
aRowFlags.maRowsFiltered.build_tree();
|
|
|
|
// Remove all flags in the range first.
|
|
SetRowHidden(nRow1, nRow2, false);
|
|
SetRowFiltered(nRow1, nRow2, false);
|
|
|
|
std::vector<sc::RowSpan> aSpans =
|
|
sc::toSpanArray<SCROW,sc::RowSpan>(aRowFlags.maRowsHidden, nRow1);
|
|
|
|
std::vector<sc::RowSpan>::const_iterator it = aSpans.begin(), itEnd = aSpans.end();
|
|
for (; it != itEnd; ++it)
|
|
SetRowHidden(it->mnRow1, it->mnRow2, true);
|
|
|
|
aSpans = sc::toSpanArray<SCROW,sc::RowSpan>(aRowFlags.maRowsFiltered, nRow1);
|
|
|
|
it = aSpans.begin(), itEnd = aSpans.end();
|
|
for (; it != itEnd; ++it)
|
|
SetRowFiltered(it->mnRow1, it->mnRow2, true);
|
|
}
|
|
|
|
// Set up row reorder map (for later broadcasting of reference updates).
|
|
sc::ColRowReorderMapType aRowMap;
|
|
const std::vector<SCCOLROW>& rOldIndices = pArray->GetOrderIndices();
|
|
for (size_t i = 0, n = rOldIndices.size(); i < n; ++i)
|
|
{
|
|
SCROW nNew = i + nRow1;
|
|
SCROW nOld = rOldIndices[i];
|
|
aRowMap.insert(sc::ColRowReorderMapType::value_type(nOld, nNew));
|
|
}
|
|
|
|
// Collect all listeners within sorted range ahead of time.
|
|
std::vector<SvtListener*> aListeners;
|
|
|
|
// Get all area listeners that listen on one row within the range and end
|
|
// their listening.
|
|
ScRange aMoveRange( nCol1, nRow1, nTab, nCol2, nRow2, nTab);
|
|
std::vector<sc::AreaListener> aAreaListeners = pDocument->GetBASM()->GetAllListeners(
|
|
aMoveRange, sc::OneRowInsideArea);
|
|
{
|
|
std::vector<sc::AreaListener>::iterator it = aAreaListeners.begin(), itEnd = aAreaListeners.end();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
pDocument->EndListeningArea(it->maArea, it->mpListener);
|
|
aListeners.push_back( it->mpListener);
|
|
}
|
|
}
|
|
|
|
if (pArray->IsUpdateRefs())
|
|
{
|
|
// Collect listeners of cell broadcasters.
|
|
for (SCCOL nCol = nCol1; nCol <= nCol2; ++nCol)
|
|
aCol[nCol].CollectListeners(aListeners, nRow1, nRow2);
|
|
|
|
// Remove any duplicate listener entries. We must ensure that we notify
|
|
// each unique listener only once.
|
|
std::sort(aListeners.begin(), aListeners.end());
|
|
aListeners.erase(std::unique(aListeners.begin(), aListeners.end()), aListeners.end());
|
|
|
|
// Collect positions of all shared formula cells outside the sorted range,
|
|
// and make them unshared before notifying them.
|
|
sc::RefQueryFormulaGroup aFormulaGroupPos;
|
|
aFormulaGroupPos.setSkipRange(ScRange(nCol1, nRow1, nTab, nCol2, nRow2, nTab));
|
|
|
|
std::for_each(aListeners.begin(), aListeners.end(), FormulaGroupPosCollector(aFormulaGroupPos));
|
|
const sc::RefQueryFormulaGroup::TabsType& rGroupTabs = aFormulaGroupPos.getAllPositions();
|
|
sc::RefQueryFormulaGroup::TabsType::const_iterator itGroupTab = rGroupTabs.begin(), itGroupTabEnd = rGroupTabs.end();
|
|
for (; itGroupTab != itGroupTabEnd; ++itGroupTab)
|
|
{
|
|
const sc::RefQueryFormulaGroup::ColsType& rCols = itGroupTab->second;
|
|
sc::RefQueryFormulaGroup::ColsType::const_iterator itCol = rCols.begin(), itColEnd = rCols.end();
|
|
for (; itCol != itColEnd; ++itCol)
|
|
{
|
|
const sc::RefQueryFormulaGroup::ColType& rCol = itCol->second;
|
|
std::vector<SCROW> aBounds(rCol);
|
|
pDocument->UnshareFormulaCells(itGroupTab->first, itCol->first, aBounds);
|
|
}
|
|
}
|
|
|
|
// Notify the listeners.
|
|
RowReorderNotifier aFunc(aRowMap, nTab, nCol1, nCol2);
|
|
std::for_each(aListeners.begin(), aListeners.end(), aFunc);
|
|
|
|
// Re-group formulas in affected columns.
|
|
for (itGroupTab = rGroupTabs.begin(); itGroupTab != itGroupTabEnd; ++itGroupTab)
|
|
{
|
|
const sc::RefQueryFormulaGroup::ColsType& rCols = itGroupTab->second;
|
|
sc::RefQueryFormulaGroup::ColsType::const_iterator itCol = rCols.begin(), itColEnd = rCols.end();
|
|
for (; itCol != itColEnd; ++itCol)
|
|
pDocument->RegroupFormulaCells(itGroupTab->first, itCol->first);
|
|
}
|
|
}
|
|
|
|
// Re-start area listeners on the reordered rows.
|
|
{
|
|
std::vector<sc::AreaListener>::iterator it = aAreaListeners.begin(), itEnd = aAreaListeners.end();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
ScRange aNewRange = it->maArea;
|
|
sc::ColRowReorderMapType::const_iterator itRow = aRowMap.find( aNewRange.aStart.Row());
|
|
if (itRow != aRowMap.end())
|
|
{
|
|
aNewRange.aStart.SetRow( itRow->second);
|
|
aNewRange.aEnd.SetRow( itRow->second);
|
|
}
|
|
pDocument->StartListeningArea(aNewRange, it->mpListener);
|
|
}
|
|
}
|
|
|
|
// Re-group columns in the sorted range too.
|
|
for (SCCOL i = nCol1; i <= nCol2; ++i)
|
|
aCol[i].RegroupFormulaCells();
|
|
}
|
|
|
|
short ScTable::CompareCell(
|
|
sal_uInt16 nSort,
|
|
ScRefCellValue& rCell1, SCCOL nCell1Col, SCROW nCell1Row,
|
|
ScRefCellValue& rCell2, SCCOL nCell2Col, SCROW nCell2Row ) const
|
|
{
|
|
short nRes = 0;
|
|
|
|
CellType eType1 = rCell1.meType, eType2 = rCell2.meType;
|
|
|
|
if (!rCell1.isEmpty())
|
|
{
|
|
if (!rCell2.isEmpty())
|
|
{
|
|
bool bStr1 = ( eType1 != CELLTYPE_VALUE );
|
|
if (eType1 == CELLTYPE_FORMULA && rCell1.mpFormula->IsValue())
|
|
bStr1 = false;
|
|
bool bStr2 = ( eType2 != CELLTYPE_VALUE );
|
|
if (eType2 == CELLTYPE_FORMULA && rCell2.mpFormula->IsValue())
|
|
bStr2 = false;
|
|
|
|
if ( bStr1 && bStr2 ) // nur Strings untereinander als String vergleichen!
|
|
{
|
|
OUString aStr1;
|
|
OUString aStr2;
|
|
if (eType1 == CELLTYPE_STRING)
|
|
aStr1 = rCell1.mpString->getString();
|
|
else
|
|
GetString(nCell1Col, nCell1Row, aStr1);
|
|
if (eType2 == CELLTYPE_STRING)
|
|
aStr2 = rCell2.mpString->getString();
|
|
else
|
|
GetString(nCell2Col, nCell2Row, aStr2);
|
|
|
|
bool bUserDef = aSortParam.bUserDef; // custom sort order
|
|
bool bNaturalSort = aSortParam.bNaturalSort; // natural sort
|
|
bool bCaseSens = aSortParam.bCaseSens; // case sensitivity
|
|
|
|
if (bUserDef)
|
|
{
|
|
ScUserList* pList = ScGlobal::GetUserList();
|
|
const ScUserListData* pData = (*pList)[aSortParam.nUserIndex];
|
|
|
|
if (pData)
|
|
{
|
|
if ( bNaturalSort )
|
|
nRes = naturalsort::Compare( aStr1, aStr2, bCaseSens, pData, pSortCollator );
|
|
else
|
|
{
|
|
if ( bCaseSens )
|
|
nRes = sal::static_int_cast<short>( pData->Compare(aStr1, aStr2) );
|
|
else
|
|
nRes = sal::static_int_cast<short>( pData->ICompare(aStr1, aStr2) );
|
|
}
|
|
}
|
|
else
|
|
bUserDef = false;
|
|
|
|
}
|
|
if (!bUserDef)
|
|
{
|
|
if ( bNaturalSort )
|
|
nRes = naturalsort::Compare( aStr1, aStr2, bCaseSens, NULL, pSortCollator );
|
|
else
|
|
nRes = static_cast<short>( pSortCollator->compareString( aStr1, aStr2 ) );
|
|
}
|
|
}
|
|
else if ( bStr1 ) // String <-> Zahl
|
|
nRes = 1; // Zahl vorne
|
|
else if ( bStr2 ) // Zahl <-> String
|
|
nRes = -1; // Zahl vorne
|
|
else // Zahlen untereinander
|
|
{
|
|
double nVal1 = rCell1.getValue();
|
|
double nVal2 = rCell2.getValue();
|
|
if (nVal1 < nVal2)
|
|
nRes = -1;
|
|
else if (nVal1 > nVal2)
|
|
nRes = 1;
|
|
}
|
|
if ( !aSortParam.maKeyState[nSort].bAscending )
|
|
nRes = -nRes;
|
|
}
|
|
else
|
|
nRes = -1;
|
|
}
|
|
else
|
|
{
|
|
if (!rCell2.isEmpty())
|
|
nRes = 1;
|
|
else
|
|
nRes = 0; // beide leer
|
|
}
|
|
return nRes;
|
|
}
|
|
|
|
short ScTable::Compare( ScSortInfoArray* pArray, SCCOLROW nIndex1, SCCOLROW nIndex2 ) const
|
|
{
|
|
short nRes;
|
|
sal_uInt16 nSort = 0;
|
|
do
|
|
{
|
|
ScSortInfo* pInfo1 = pArray->Get( nSort, nIndex1 );
|
|
ScSortInfo* pInfo2 = pArray->Get( nSort, nIndex2 );
|
|
if ( aSortParam.bByRow )
|
|
nRes = CompareCell( nSort,
|
|
pInfo1->maCell, static_cast<SCCOL>(aSortParam.maKeyState[nSort].nField), pInfo1->nOrg,
|
|
pInfo2->maCell, static_cast<SCCOL>(aSortParam.maKeyState[nSort].nField), pInfo2->nOrg );
|
|
else
|
|
nRes = CompareCell( nSort,
|
|
pInfo1->maCell, static_cast<SCCOL>(pInfo1->nOrg), aSortParam.maKeyState[nSort].nField,
|
|
pInfo2->maCell, static_cast<SCCOL>(pInfo2->nOrg), aSortParam.maKeyState[nSort].nField );
|
|
} while ( nRes == 0 && ++nSort < pArray->GetUsedSorts() );
|
|
if( nRes == 0 )
|
|
{
|
|
ScSortInfo* pInfo1 = pArray->Get( 0, nIndex1 );
|
|
ScSortInfo* pInfo2 = pArray->Get( 0, nIndex2 );
|
|
if( pInfo1->nOrg < pInfo2->nOrg )
|
|
nRes = -1;
|
|
else if( pInfo1->nOrg > pInfo2->nOrg )
|
|
nRes = 1;
|
|
}
|
|
return nRes;
|
|
}
|
|
|
|
void ScTable::QuickSort( ScSortInfoArray* pArray, SCsCOLROW nLo, SCsCOLROW nHi )
|
|
{
|
|
if ((nHi - nLo) == 1)
|
|
{
|
|
if (Compare(pArray, nLo, nHi) > 0)
|
|
pArray->Swap( nLo, nHi );
|
|
}
|
|
else
|
|
{
|
|
SCsCOLROW ni = nLo;
|
|
SCsCOLROW nj = nHi;
|
|
do
|
|
{
|
|
while ((ni <= nHi) && (Compare(pArray, ni, nLo)) < 0)
|
|
ni++;
|
|
while ((nj >= nLo) && (Compare(pArray, nLo, nj)) < 0)
|
|
nj--;
|
|
if (ni <= nj)
|
|
{
|
|
if (ni != nj)
|
|
pArray->Swap( ni, nj );
|
|
ni++;
|
|
nj--;
|
|
}
|
|
} while (ni < nj);
|
|
if ((nj - nLo) < (nHi - ni))
|
|
{
|
|
if (nLo < nj)
|
|
QuickSort(pArray, nLo, nj);
|
|
if (ni < nHi)
|
|
QuickSort(pArray, ni, nHi);
|
|
}
|
|
else
|
|
{
|
|
if (ni < nHi)
|
|
QuickSort(pArray, ni, nHi);
|
|
if (nLo < nj)
|
|
QuickSort(pArray, nLo, nj);
|
|
}
|
|
}
|
|
}
|
|
|
|
short ScTable::Compare(SCCOLROW nIndex1, SCCOLROW nIndex2) const
|
|
{
|
|
short nRes;
|
|
sal_uInt16 nSort = 0;
|
|
const sal_uInt32 nMaxSorts = aSortParam.GetSortKeyCount();
|
|
if (aSortParam.bByRow)
|
|
{
|
|
do
|
|
{
|
|
SCCOL nCol = static_cast<SCCOL>(aSortParam.maKeyState[nSort].nField);
|
|
ScRefCellValue aCell1 = aCol[nCol].GetCellValue(nIndex1);
|
|
ScRefCellValue aCell2 = aCol[nCol].GetCellValue(nIndex2);
|
|
nRes = CompareCell(nSort, aCell1, nCol, nIndex1, aCell2, nCol, nIndex2);
|
|
} while ( nRes == 0 && ++nSort < nMaxSorts && aSortParam.maKeyState[nSort].bDoSort );
|
|
}
|
|
else
|
|
{
|
|
do
|
|
{
|
|
SCROW nRow = aSortParam.maKeyState[nSort].nField;
|
|
ScRefCellValue aCell1 = aCol[nIndex1].GetCellValue(nRow);
|
|
ScRefCellValue aCell2 = aCol[nIndex2].GetCellValue(nRow);
|
|
nRes = CompareCell( nSort, aCell1, static_cast<SCCOL>(nIndex1),
|
|
nRow, aCell2, static_cast<SCCOL>(nIndex2), nRow );
|
|
} while ( nRes == 0 && ++nSort < nMaxSorts && aSortParam.maKeyState[nSort].bDoSort );
|
|
}
|
|
return nRes;
|
|
}
|
|
|
|
bool ScTable::IsSorted( SCCOLROW nStart, SCCOLROW nEnd ) const // ueber aSortParam
|
|
{
|
|
for (SCCOLROW i=nStart; i<nEnd; i++)
|
|
{
|
|
if (Compare( i, i+1 ) > 0)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void ScTable::DecoladeRow( ScSortInfoArray* pArray, SCROW nRow1, SCROW nRow2 )
|
|
{
|
|
SCROW nRow;
|
|
int nMax = nRow2 - nRow1;
|
|
for (SCROW i = nRow1; (i + 4) <= nRow2; i += 4)
|
|
{
|
|
nRow = comphelper::rng::uniform_int_distribution(0, nMax-1);
|
|
pArray->Swap(i, nRow1 + nRow);
|
|
}
|
|
}
|
|
|
|
void ScTable::Sort(
|
|
const ScSortParam& rSortParam, bool bKeepQuery, bool bUpdateRefs,
|
|
ScProgress* pProgress, sc::ReorderParam* pUndo )
|
|
{
|
|
aSortParam = rSortParam;
|
|
InitSortCollator( rSortParam );
|
|
bGlobalKeepQuery = bKeepQuery;
|
|
|
|
if (pUndo)
|
|
{
|
|
// Copy over the basic sort parameters.
|
|
pUndo->mbByRow = rSortParam.bByRow;
|
|
pUndo->mbPattern = rSortParam.bIncludePattern;
|
|
pUndo->mbHiddenFiltered = bKeepQuery;
|
|
pUndo->mbUpdateRefs = bUpdateRefs;
|
|
}
|
|
|
|
if (rSortParam.bByRow)
|
|
{
|
|
SCROW nLastRow = 0;
|
|
for (SCCOL nCol = aSortParam.nCol1; nCol <= aSortParam.nCol2; nCol++)
|
|
nLastRow = std::max(nLastRow, aCol[nCol].GetLastDataPos());
|
|
nLastRow = std::min(nLastRow, aSortParam.nRow2);
|
|
SCROW nRow1 = (rSortParam.bHasHeader ?
|
|
aSortParam.nRow1 + 1 : aSortParam.nRow1);
|
|
if (!IsSorted(nRow1, nLastRow))
|
|
{
|
|
if(pProgress)
|
|
pProgress->SetState( 0, nLastRow-nRow1 );
|
|
|
|
boost::scoped_ptr<ScSortInfoArray> pArray(CreateSortInfoArray(aSortParam, nRow1, nLastRow, bKeepQuery, bUpdateRefs));
|
|
|
|
if ( nLastRow - nRow1 > 255 )
|
|
DecoladeRow(pArray.get(), nRow1, nLastRow);
|
|
|
|
QuickSort(pArray.get(), nRow1, nLastRow);
|
|
SortReorderByRow(pArray.get(), aSortParam.nCol1, aSortParam.nCol2, pProgress);
|
|
|
|
if (pUndo)
|
|
{
|
|
pUndo->maSortRange = ScRange(rSortParam.nCol1, nRow1, nTab, rSortParam.nCol2, nLastRow, nTab);
|
|
pUndo->maOrderIndices = pArray->GetOrderIndices();
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
SCCOL nLastCol;
|
|
for (nLastCol = aSortParam.nCol2;
|
|
(nLastCol > aSortParam.nCol1) && aCol[nLastCol].IsEmptyBlock(aSortParam.nRow1, aSortParam.nRow2); nLastCol--)
|
|
{
|
|
}
|
|
SCCOL nCol1 = (rSortParam.bHasHeader ?
|
|
aSortParam.nCol1 + 1 : aSortParam.nCol1);
|
|
if (!IsSorted(nCol1, nLastCol))
|
|
{
|
|
if(pProgress)
|
|
pProgress->SetState( 0, nLastCol-nCol1 );
|
|
|
|
boost::scoped_ptr<ScSortInfoArray> pArray(CreateSortInfoArray(aSortParam, nCol1, nLastCol, bKeepQuery, bUpdateRefs));
|
|
|
|
QuickSort(pArray.get(), nCol1, nLastCol);
|
|
SortReorderByColumn(pArray.get(), aSortParam.nRow1, aSortParam.nRow2, aSortParam.bIncludePattern, pProgress);
|
|
|
|
if (pUndo)
|
|
{
|
|
pUndo->maSortRange = ScRange(nCol1, aSortParam.nRow1, nTab, nLastCol, aSortParam.nRow2, nTab);
|
|
pUndo->maOrderIndices = pArray->GetOrderIndices();
|
|
}
|
|
}
|
|
}
|
|
DestroySortCollator();
|
|
}
|
|
|
|
void ScTable::Reorder( const sc::ReorderParam& rParam, ScProgress* pProgress )
|
|
{
|
|
if (rParam.maOrderIndices.empty())
|
|
return;
|
|
|
|
boost::scoped_ptr<ScSortInfoArray> pArray(CreateSortInfoArray(rParam));
|
|
if (!pArray)
|
|
return;
|
|
|
|
if (rParam.mbByRow)
|
|
{
|
|
// Re-play sorting from the known sort indices.
|
|
pArray->ReorderByRow(rParam.maOrderIndices);
|
|
|
|
SortReorderByRow(
|
|
pArray.get(), rParam.maSortRange.aStart.Col(), rParam.maSortRange.aEnd.Col(), pProgress);
|
|
}
|
|
else
|
|
{
|
|
// Ordering by column is much simpler. Just set the order indices and we are done.
|
|
pArray->SetOrderIndices(rParam.maOrderIndices);
|
|
SortReorderByColumn(
|
|
pArray.get(), rParam.maSortRange.aStart.Row(), rParam.maSortRange.aEnd.Row(),
|
|
rParam.mbPattern, pProgress);
|
|
}
|
|
}
|
|
|
|
namespace {
|
|
|
|
class SubTotalRowFinder
|
|
{
|
|
const ScTable& mrTab;
|
|
const ScSubTotalParam& mrParam;
|
|
|
|
public:
|
|
SubTotalRowFinder(const ScTable& rTab, const ScSubTotalParam& rParam) :
|
|
mrTab(rTab), mrParam(rParam) {}
|
|
|
|
bool operator() (size_t nRow, const ScFormulaCell* pCell)
|
|
{
|
|
if (!pCell->IsSubTotal())
|
|
return false;
|
|
|
|
SCCOL nStartCol = mrParam.nCol1;
|
|
SCCOL nEndCol = mrParam.nCol2;
|
|
|
|
for (SCCOL i = 0; i <= MAXCOL; ++i)
|
|
{
|
|
if (nStartCol <= i && i <= nEndCol)
|
|
continue;
|
|
|
|
if (mrTab.HasData(i, nRow))
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
bool ScTable::TestRemoveSubTotals( const ScSubTotalParam& rParam )
|
|
{
|
|
SCCOL nStartCol = rParam.nCol1;
|
|
SCROW nStartRow = rParam.nRow1 + 1; // Header
|
|
SCCOL nEndCol = rParam.nCol2;
|
|
SCROW nEndRow = rParam.nRow2;
|
|
|
|
for (SCCOL nCol = nStartCol; nCol <= nEndCol; ++nCol)
|
|
{
|
|
const sc::CellStoreType& rCells = aCol[nCol].maCells;
|
|
SubTotalRowFinder aFunc(*this, rParam);
|
|
std::pair<sc::CellStoreType::const_iterator,size_t> aPos =
|
|
sc::FindFormula(rCells, nStartRow, nEndRow, aFunc);
|
|
if (aPos.first != rCells.end())
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
namespace {
|
|
|
|
class RemoveSubTotalsHandler
|
|
{
|
|
std::vector<SCROW> maRemoved;
|
|
public:
|
|
|
|
void operator() (size_t nRow, const ScFormulaCell* p)
|
|
{
|
|
if (p->IsSubTotal())
|
|
maRemoved.push_back(nRow);
|
|
}
|
|
|
|
void getRows(std::vector<SCROW>& rRows)
|
|
{
|
|
// Sort and remove duplicates.
|
|
std::sort(maRemoved.begin(), maRemoved.end());
|
|
std::vector<SCROW>::iterator it = std::unique(maRemoved.begin(), maRemoved.end());
|
|
maRemoved.erase(it, maRemoved.end());
|
|
|
|
maRemoved.swap(rRows);
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
void ScTable::RemoveSubTotals( ScSubTotalParam& rParam )
|
|
{
|
|
SCCOL nStartCol = rParam.nCol1;
|
|
SCROW nStartRow = rParam.nRow1 + 1; // Header
|
|
SCCOL nEndCol = rParam.nCol2;
|
|
SCROW nEndRow = rParam.nRow2; // wird veraendert
|
|
|
|
RemoveSubTotalsHandler aFunc;
|
|
for (SCCOL nCol = nStartCol; nCol <= nEndCol; ++nCol)
|
|
{
|
|
const sc::CellStoreType& rCells = aCol[nCol].maCells;
|
|
sc::ParseFormula(rCells.begin(), rCells, nStartRow, nEndRow, aFunc);
|
|
}
|
|
|
|
std::vector<SCROW> aRows;
|
|
aFunc.getRows(aRows);
|
|
|
|
std::vector<SCROW>::reverse_iterator it = aRows.rbegin(), itEnd = aRows.rend();
|
|
for (; it != itEnd; ++it)
|
|
{
|
|
SCROW nRow = *it;
|
|
RemoveRowBreak(nRow+1, false, true);
|
|
pDocument->DeleteRow(0, nTab, MAXCOL, nTab, nRow, 1);
|
|
}
|
|
|
|
rParam.nRow2 -= aRows.size();
|
|
}
|
|
|
|
// harte Zahlenformate loeschen (fuer Ergebnisformeln)
|
|
|
|
static void lcl_RemoveNumberFormat( ScTable* pTab, SCCOL nCol, SCROW nRow )
|
|
{
|
|
const ScPatternAttr* pPattern = pTab->GetPattern( nCol, nRow );
|
|
if ( pPattern->GetItemSet().GetItemState( ATTR_VALUE_FORMAT, false )
|
|
== SfxItemState::SET )
|
|
{
|
|
ScPatternAttr aNewPattern( *pPattern );
|
|
SfxItemSet& rSet = aNewPattern.GetItemSet();
|
|
rSet.ClearItem( ATTR_VALUE_FORMAT );
|
|
rSet.ClearItem( ATTR_LANGUAGE_FORMAT );
|
|
pTab->SetPattern( nCol, nRow, aNewPattern, true );
|
|
}
|
|
}
|
|
|
|
// at least MSC needs this at linkage level to be able to use it in a template
|
|
typedef struct lcl_ScTable_DoSubTotals_RowEntry
|
|
{
|
|
sal_uInt16 nGroupNo;
|
|
SCROW nSubStartRow;
|
|
SCROW nDestRow;
|
|
SCROW nFuncStart;
|
|
SCROW nFuncEnd;
|
|
} RowEntry;
|
|
|
|
// neue Zwischenergebnisse
|
|
// rParam.nRow2 wird veraendert !
|
|
|
|
bool ScTable::DoSubTotals( ScSubTotalParam& rParam )
|
|
{
|
|
SCCOL nStartCol = rParam.nCol1;
|
|
SCROW nStartRow = rParam.nRow1 + 1; // Header
|
|
SCCOL nEndCol = rParam.nCol2;
|
|
SCROW nEndRow = rParam.nRow2; // wird veraendert
|
|
sal_uInt16 i;
|
|
|
|
// Leerzeilen am Ende weglassen,
|
|
// damit alle Ueberlaeufe (MAXROW) bei InsertRow gefunden werden (#35180#)
|
|
// Wenn sortiert wurde, sind alle Leerzeilen am Ende.
|
|
SCSIZE nEmpty = GetEmptyLinesInBlock( nStartCol, nStartRow, nEndCol, nEndRow, DIR_BOTTOM );
|
|
nEndRow -= nEmpty;
|
|
|
|
sal_uInt16 nLevelCount = 0; // Anzahl Gruppierungen
|
|
bool bDoThis = true;
|
|
for (i=0; i<MAXSUBTOTAL && bDoThis; i++)
|
|
if (rParam.bGroupActive[i])
|
|
nLevelCount = i+1;
|
|
else
|
|
bDoThis = false;
|
|
|
|
if (nLevelCount==0) // nichts tun
|
|
return true;
|
|
|
|
SCCOL* nGroupCol = rParam.nField; // Spalten nach denen
|
|
// gruppiert wird
|
|
|
|
// Durch (leer) als eigene Kategorie muss immer auf
|
|
// Teilergebniszeilen aus den anderen Spalten getestet werden
|
|
// (frueher nur, wenn eine Spalte mehrfach vorkam)
|
|
bool bTestPrevSub = ( nLevelCount > 1 );
|
|
|
|
OUString aSubString;
|
|
OUString aOutString;
|
|
|
|
bool bIgnoreCase = !rParam.bCaseSens;
|
|
|
|
OUString *pCompString[MAXSUBTOTAL]; // Pointer wegen Compiler-Problemen
|
|
for (i=0; i<MAXSUBTOTAL; i++)
|
|
pCompString[i] = new OUString;
|
|
|
|
//! sortieren?
|
|
|
|
ScStyleSheet* pStyle = (ScStyleSheet*) pDocument->GetStyleSheetPool()->Find(
|
|
ScGlobal::GetRscString(STR_STYLENAME_RESULT), SFX_STYLE_FAMILY_PARA );
|
|
|
|
bool bSpaceLeft = true; // Erfolg beim Einfuegen?
|
|
|
|
// For performance reasons collect formula entries so their
|
|
// references don't have to be tested for updates each time a new row is
|
|
// inserted
|
|
RowEntry aRowEntry;
|
|
::std::vector< RowEntry > aRowVector;
|
|
|
|
for (sal_uInt16 nLevel=0; nLevel<=nLevelCount && bSpaceLeft; nLevel++) // incl. Gesamtergebnis
|
|
{
|
|
bool bTotal = ( nLevel == nLevelCount );
|
|
aRowEntry.nGroupNo = bTotal ? 0 : (nLevelCount-nLevel-1);
|
|
|
|
// how many results per level
|
|
SCCOL nResCount = rParam.nSubTotals[aRowEntry.nGroupNo];
|
|
// result functions
|
|
ScSubTotalFunc* eResFunc = rParam.pFunctions[aRowEntry.nGroupNo];
|
|
|
|
if (nResCount > 0) // sonst nur sortieren
|
|
{
|
|
for (i=0; i<=aRowEntry.nGroupNo; i++)
|
|
{
|
|
GetString( nGroupCol[i], nStartRow, aSubString );
|
|
if ( bIgnoreCase )
|
|
*pCompString[i] = ScGlobal::pCharClass->uppercase( aSubString );
|
|
else
|
|
*pCompString[i] = aSubString;
|
|
} // aSubString bleibt auf dem letzten stehen
|
|
|
|
bool bBlockVis = false; // Gruppe eingeblendet?
|
|
aRowEntry.nSubStartRow = nStartRow;
|
|
for (SCROW nRow=nStartRow; nRow<=nEndRow+1 && bSpaceLeft; nRow++)
|
|
{
|
|
bool bChanged;
|
|
if (nRow>nEndRow)
|
|
bChanged = true;
|
|
else
|
|
{
|
|
bChanged = false;
|
|
if (!bTotal)
|
|
{
|
|
OUString aString;
|
|
for (i=0; i<=aRowEntry.nGroupNo && !bChanged; i++)
|
|
{
|
|
GetString( nGroupCol[i], nRow, aString );
|
|
if (bIgnoreCase)
|
|
aString = ScGlobal::pCharClass->uppercase(aString);
|
|
// wenn sortiert, ist "leer" eine eigene Gruppe
|
|
// sonst sind leere Zellen unten erlaubt
|
|
bChanged = ( ( !aString.isEmpty() || rParam.bDoSort ) &&
|
|
aString != *pCompString[i] );
|
|
}
|
|
if ( bChanged && bTestPrevSub )
|
|
{
|
|
// No group change on rows that will contain subtotal formulas
|
|
for ( ::std::vector< RowEntry >::const_iterator
|
|
iEntry( aRowVector.begin());
|
|
iEntry != aRowVector.end(); ++iEntry)
|
|
{
|
|
if ( iEntry->nDestRow == nRow )
|
|
{
|
|
bChanged = false;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if ( bChanged )
|
|
{
|
|
aRowEntry.nDestRow = nRow;
|
|
aRowEntry.nFuncStart = aRowEntry.nSubStartRow;
|
|
aRowEntry.nFuncEnd = nRow-1;
|
|
|
|
bSpaceLeft = pDocument->InsertRow( 0, nTab, MAXCOL, nTab,
|
|
aRowEntry.nDestRow, 1 );
|
|
DBShowRow( aRowEntry.nDestRow, bBlockVis );
|
|
bBlockVis = false;
|
|
if ( rParam.bPagebreak && nRow < MAXROW &&
|
|
aRowEntry.nSubStartRow != nStartRow && nLevel == 0)
|
|
SetRowBreak(aRowEntry.nSubStartRow, false, true);
|
|
|
|
if (bSpaceLeft)
|
|
{
|
|
for ( ::std::vector< RowEntry >::iterator iMove(
|
|
aRowVector.begin() );
|
|
iMove != aRowVector.end(); ++iMove)
|
|
{
|
|
if ( aRowEntry.nDestRow <= iMove->nSubStartRow )
|
|
++iMove->nSubStartRow;
|
|
if ( aRowEntry.nDestRow <= iMove->nDestRow )
|
|
++iMove->nDestRow;
|
|
if ( aRowEntry.nDestRow <= iMove->nFuncStart )
|
|
++iMove->nFuncStart;
|
|
if ( aRowEntry.nDestRow <= iMove->nFuncEnd )
|
|
++iMove->nFuncEnd;
|
|
}
|
|
// collect formula positions
|
|
aRowVector.push_back( aRowEntry );
|
|
|
|
if (bTotal) // "Gesamtergebnis"
|
|
aOutString = ScGlobal::GetRscString( STR_TABLE_GESAMTERGEBNIS );
|
|
else
|
|
{ // " Ergebnis"
|
|
aOutString = aSubString;
|
|
if (aOutString.isEmpty())
|
|
aOutString = ScGlobal::GetRscString( STR_EMPTYDATA );
|
|
aOutString += " ";
|
|
sal_uInt16 nStrId = STR_TABLE_ERGEBNIS;
|
|
if ( nResCount == 1 )
|
|
switch ( eResFunc[0] )
|
|
{
|
|
case SUBTOTAL_FUNC_AVE: nStrId = STR_FUN_TEXT_AVG; break;
|
|
case SUBTOTAL_FUNC_CNT:
|
|
case SUBTOTAL_FUNC_CNT2: nStrId = STR_FUN_TEXT_COUNT; break;
|
|
case SUBTOTAL_FUNC_MAX: nStrId = STR_FUN_TEXT_MAX; break;
|
|
case SUBTOTAL_FUNC_MIN: nStrId = STR_FUN_TEXT_MIN; break;
|
|
case SUBTOTAL_FUNC_PROD: nStrId = STR_FUN_TEXT_PRODUCT; break;
|
|
case SUBTOTAL_FUNC_STD:
|
|
case SUBTOTAL_FUNC_STDP: nStrId = STR_FUN_TEXT_STDDEV; break;
|
|
case SUBTOTAL_FUNC_SUM: nStrId = STR_FUN_TEXT_SUM; break;
|
|
case SUBTOTAL_FUNC_VAR:
|
|
case SUBTOTAL_FUNC_VARP: nStrId = STR_FUN_TEXT_VAR; break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
aOutString += ScGlobal::GetRscString( nStrId );
|
|
}
|
|
SetString( nGroupCol[aRowEntry.nGroupNo], aRowEntry.nDestRow, nTab, aOutString );
|
|
ApplyStyle( nGroupCol[aRowEntry.nGroupNo], aRowEntry.nDestRow, *pStyle );
|
|
|
|
++nRow;
|
|
++nEndRow;
|
|
aRowEntry.nSubStartRow = nRow;
|
|
for (i=0; i<=aRowEntry.nGroupNo; i++)
|
|
{
|
|
GetString( nGroupCol[i], nRow, aSubString );
|
|
if ( bIgnoreCase )
|
|
*pCompString[i] = ScGlobal::pCharClass->uppercase( aSubString );
|
|
else
|
|
*pCompString[i] = aSubString;
|
|
}
|
|
}
|
|
}
|
|
bBlockVis = !RowFiltered(nRow);
|
|
}
|
|
}
|
|
}
|
|
|
|
// now insert the formulas
|
|
ScComplexRefData aRef;
|
|
aRef.InitFlags();
|
|
aRef.Ref1.SetAbsTab(nTab);
|
|
aRef.Ref2.SetAbsTab(nTab);
|
|
for ( ::std::vector< RowEntry >::const_iterator iEntry( aRowVector.begin());
|
|
iEntry != aRowVector.end(); ++iEntry)
|
|
{
|
|
SCCOL nResCount = rParam.nSubTotals[iEntry->nGroupNo];
|
|
SCCOL* nResCols = rParam.pSubTotals[iEntry->nGroupNo];
|
|
ScSubTotalFunc* eResFunc = rParam.pFunctions[iEntry->nGroupNo];
|
|
for ( SCCOL nResult=0; nResult < nResCount; ++nResult )
|
|
{
|
|
aRef.Ref1.SetAbsCol(nResCols[nResult]);
|
|
aRef.Ref1.SetAbsRow(iEntry->nFuncStart);
|
|
aRef.Ref2.SetAbsCol(nResCols[nResult]);
|
|
aRef.Ref2.SetAbsRow(iEntry->nFuncEnd);
|
|
|
|
ScTokenArray aArr;
|
|
aArr.AddOpCode( ocSubTotal );
|
|
aArr.AddOpCode( ocOpen );
|
|
aArr.AddDouble( (double) eResFunc[nResult] );
|
|
aArr.AddOpCode( ocSep );
|
|
aArr.AddDoubleReference( aRef );
|
|
aArr.AddOpCode( ocClose );
|
|
aArr.AddOpCode( ocStop );
|
|
ScFormulaCell* pCell = new ScFormulaCell(
|
|
pDocument, ScAddress(nResCols[nResult], iEntry->nDestRow, nTab), aArr);
|
|
|
|
SetFormulaCell(nResCols[nResult], iEntry->nDestRow, pCell);
|
|
|
|
if ( nResCols[nResult] != nGroupCol[iEntry->nGroupNo] )
|
|
{
|
|
ApplyStyle( nResCols[nResult], iEntry->nDestRow, *pStyle );
|
|
|
|
// Zahlformat loeschen
|
|
lcl_RemoveNumberFormat( this, nResCols[nResult], iEntry->nDestRow );
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
//! je nach Einstellung Zwischensummen-Zeilen nach oben verschieben ?
|
|
|
|
//! Outlines direkt erzeugen?
|
|
|
|
if (bSpaceLeft)
|
|
DoAutoOutline( nStartCol, nStartRow, nEndCol, nEndRow );
|
|
|
|
for (i=0; i<MAXSUBTOTAL; i++)
|
|
delete pCompString[i];
|
|
|
|
rParam.nRow2 = nEndRow; // neues Ende
|
|
return bSpaceLeft;
|
|
}
|
|
|
|
void ScTable::MarkSubTotalCells(
|
|
sc::ColumnSpanSet& rSet, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2, bool bVal ) const
|
|
{
|
|
if (!ValidCol(nCol1) || !ValidCol(nCol2))
|
|
return;
|
|
|
|
// Pick up all subtotal formula cells.
|
|
for (SCCOL nCol = nCol1; nCol <= nCol2; ++nCol)
|
|
aCol[nCol].MarkSubTotalCells(rSet, nRow1, nRow2, bVal);
|
|
|
|
// Pick up all filtered rows.
|
|
ScFlatBoolRowSegments::RangeData aFilteredSpan;
|
|
SCROW nRow = nRow1;
|
|
while (nRow <= nRow2)
|
|
{
|
|
if (!mpFilteredRows->getRangeData(nRow, aFilteredSpan))
|
|
// Failed for whatever reason.
|
|
return;
|
|
|
|
if (aFilteredSpan.mbValue)
|
|
{
|
|
// Filtered span found.
|
|
for (SCCOL nCol = nCol1; nCol <= nCol2; ++nCol)
|
|
rSet.set(nTab, nCol, nRow, aFilteredSpan.mnRow2, bVal);
|
|
}
|
|
|
|
nRow = aFilteredSpan.mnRow2 + 1;
|
|
}
|
|
}
|
|
|
|
namespace {
|
|
|
|
class QueryEvaluator
|
|
{
|
|
ScDocument& mrDoc;
|
|
svl::SharedStringPool& mrStrPool;
|
|
const ScTable& mrTab;
|
|
const ScQueryParam& mrParam;
|
|
const bool* mpTestEqualCondition;
|
|
utl::TransliterationWrapper* mpTransliteration;
|
|
CollatorWrapper* mpCollator;
|
|
const bool mbMatchWholeCell;
|
|
|
|
bool isPartialTextMatchOp(const ScQueryEntry& rEntry) const
|
|
{
|
|
switch (rEntry.eOp)
|
|
{
|
|
// these operators can only be used with textural comparisons.
|
|
case SC_CONTAINS:
|
|
case SC_DOES_NOT_CONTAIN:
|
|
case SC_BEGINS_WITH:
|
|
case SC_ENDS_WITH:
|
|
case SC_DOES_NOT_BEGIN_WITH:
|
|
case SC_DOES_NOT_END_WITH:
|
|
return true;
|
|
default:
|
|
;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool isTextMatchOp(const ScQueryEntry& rEntry) const
|
|
{
|
|
if (isPartialTextMatchOp(rEntry))
|
|
return true;
|
|
|
|
switch (rEntry.eOp)
|
|
{
|
|
// these operators can be used for either textural or value comparison.
|
|
case SC_EQUAL:
|
|
case SC_NOT_EQUAL:
|
|
return true;
|
|
default:
|
|
;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool isRealRegExp(const ScQueryEntry& rEntry) const
|
|
{
|
|
if (!mrParam.bRegExp)
|
|
return false;
|
|
|
|
return isTextMatchOp(rEntry);
|
|
}
|
|
|
|
bool isTestRegExp(const ScQueryEntry& rEntry) const
|
|
{
|
|
if (!mpTestEqualCondition)
|
|
return false;
|
|
|
|
if (!mrParam.bRegExp)
|
|
return false;
|
|
|
|
return (rEntry.eOp == SC_LESS_EQUAL || rEntry.eOp == SC_GREATER_EQUAL);
|
|
}
|
|
|
|
public:
|
|
QueryEvaluator(ScDocument& rDoc, const ScTable& rTab, const ScQueryParam& rParam,
|
|
const bool* pTestEqualCondition) :
|
|
mrDoc(rDoc),
|
|
mrStrPool(rDoc.GetSharedStringPool()),
|
|
mrTab(rTab),
|
|
mrParam(rParam),
|
|
mpTestEqualCondition(pTestEqualCondition),
|
|
mbMatchWholeCell(rDoc.GetDocOptions().IsMatchWholeCell())
|
|
{
|
|
if (rParam.bCaseSens)
|
|
{
|
|
mpTransliteration = ScGlobal::GetCaseTransliteration();
|
|
mpCollator = ScGlobal::GetCaseCollator();
|
|
}
|
|
else
|
|
{
|
|
mpTransliteration = ScGlobal::GetpTransliteration();
|
|
mpCollator = ScGlobal::GetCollator();
|
|
}
|
|
}
|
|
|
|
bool isQueryByValue(
|
|
const ScQueryEntry::Item& rItem, SCCOL nCol, SCROW nRow, ScRefCellValue& rCell)
|
|
{
|
|
if (rItem.meType == ScQueryEntry::ByString)
|
|
return false;
|
|
|
|
if (!rCell.isEmpty())
|
|
{
|
|
if (rCell.meType == CELLTYPE_FORMULA && rCell.mpFormula->GetErrCode())
|
|
// Error values are compared as string.
|
|
return false;
|
|
|
|
return rCell.hasNumeric();
|
|
}
|
|
|
|
return mrTab.HasValueData(nCol, nRow);
|
|
}
|
|
|
|
bool isQueryByString(
|
|
const ScQueryEntry& rEntry, const ScQueryEntry::Item& rItem,
|
|
SCCOL nCol, SCROW nRow, ScRefCellValue& rCell)
|
|
{
|
|
if (isTextMatchOp(rEntry))
|
|
return true;
|
|
|
|
if (rItem.meType != ScQueryEntry::ByString)
|
|
return false;
|
|
|
|
if (!rCell.isEmpty())
|
|
return rCell.hasString();
|
|
|
|
return mrTab.HasStringData(nCol, nRow);
|
|
}
|
|
|
|
std::pair<bool,bool> compareByValue(
|
|
const ScRefCellValue& rCell, SCCOL nCol, SCROW nRow,
|
|
const ScQueryEntry& rEntry, const ScQueryEntry::Item& rItem)
|
|
{
|
|
bool bOk = false;
|
|
bool bTestEqual = false;
|
|
double nCellVal;
|
|
if (!rCell.isEmpty())
|
|
{
|
|
switch (rCell.meType)
|
|
{
|
|
case CELLTYPE_VALUE :
|
|
nCellVal = rCell.mfValue;
|
|
break;
|
|
case CELLTYPE_FORMULA :
|
|
nCellVal = rCell.mpFormula->GetValue();
|
|
break;
|
|
default:
|
|
nCellVal = 0.0;
|
|
}
|
|
|
|
}
|
|
else
|
|
nCellVal = mrTab.GetValue(nCol, nRow);
|
|
|
|
/* NOTE: lcl_PrepareQuery() prepares a filter query such that if a
|
|
* date+time format was queried rEntry.bQueryByDate is not set. In
|
|
* case other queries wanted to use this mechanism they should do
|
|
* the same, in other words only if rEntry.nVal is an integer value
|
|
* rEntry.bQueryByDate should be true and the time fraction be
|
|
* stripped here. */
|
|
if (rItem.meType == ScQueryEntry::ByDate)
|
|
{
|
|
sal_uInt32 nNumFmt = mrTab.GetNumberFormat(nCol, nRow);
|
|
const SvNumberformat* pEntry = mrDoc.GetFormatTable()->GetEntry(nNumFmt);
|
|
if (pEntry)
|
|
{
|
|
short nNumFmtType = pEntry->GetType();
|
|
/* NOTE: Omitting the check for absence of
|
|
* NUMBERFORMAT_TIME would include also date+time formatted
|
|
* values of the same day. That may be desired in some
|
|
* cases, querying all time values of a day, but confusing
|
|
* in other cases. A user can always setup a standard
|
|
* filter query for x >= date AND x < date+1 */
|
|
if ((nNumFmtType & NUMBERFORMAT_DATE) && !(nNumFmtType & NUMBERFORMAT_TIME))
|
|
{
|
|
// The format is of date type. Strip off the time
|
|
// element.
|
|
nCellVal = ::rtl::math::approxFloor(nCellVal);
|
|
}
|
|
}
|
|
}
|
|
|
|
switch (rEntry.eOp)
|
|
{
|
|
case SC_EQUAL :
|
|
bOk = ::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
break;
|
|
case SC_LESS :
|
|
bOk = (nCellVal < rItem.mfVal) && !::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
break;
|
|
case SC_GREATER :
|
|
bOk = (nCellVal > rItem.mfVal) && !::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
break;
|
|
case SC_LESS_EQUAL :
|
|
bOk = (nCellVal < rItem.mfVal) || ::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
if ( bOk && mpTestEqualCondition )
|
|
bTestEqual = ::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
break;
|
|
case SC_GREATER_EQUAL :
|
|
bOk = (nCellVal > rItem.mfVal) || ::rtl::math::approxEqual( nCellVal, rItem.mfVal);
|
|
if ( bOk && mpTestEqualCondition )
|
|
bTestEqual = ::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
break;
|
|
case SC_NOT_EQUAL :
|
|
bOk = !::rtl::math::approxEqual(nCellVal, rItem.mfVal);
|
|
break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
|
|
return std::pair<bool,bool>(bOk, bTestEqual);
|
|
}
|
|
|
|
std::pair<bool,bool> compareByString(
|
|
ScRefCellValue& rCell, SCROW nRow, const ScQueryEntry& rEntry, const ScQueryEntry::Item& rItem)
|
|
{
|
|
bool bOk = false;
|
|
bool bTestEqual = false;
|
|
bool bMatchWholeCell = mbMatchWholeCell;
|
|
svl::SharedString aCellStr;
|
|
if (isPartialTextMatchOp(rEntry))
|
|
// may have to do partial textural comparison.
|
|
bMatchWholeCell = false;
|
|
|
|
if (!rCell.isEmpty())
|
|
{
|
|
if (rCell.meType == CELLTYPE_FORMULA && rCell.mpFormula->GetErrCode())
|
|
{
|
|
// Error cell is evaluated as string (for now).
|
|
aCellStr = mrStrPool.intern(ScGlobal::GetErrorString(rCell.mpFormula->GetErrCode()));
|
|
}
|
|
else if (rCell.meType == CELLTYPE_STRING)
|
|
aCellStr = *rCell.mpString;
|
|
else
|
|
{
|
|
sal_uLong nFormat = mrTab.GetNumberFormat( static_cast<SCCOL>(rEntry.nField), nRow );
|
|
OUString aStr;
|
|
ScCellFormat::GetInputString(rCell, nFormat, aStr, *mrDoc.GetFormatTable(), &mrDoc);
|
|
aCellStr = mrStrPool.intern(aStr);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
OUString aStr;
|
|
mrTab.GetInputString(static_cast<SCCOL>(rEntry.nField), nRow, aStr);
|
|
aCellStr = mrStrPool.intern(aStr);
|
|
}
|
|
|
|
bool bRealRegExp = isRealRegExp(rEntry);
|
|
bool bTestRegExp = isTestRegExp(rEntry);
|
|
|
|
if ( bRealRegExp || bTestRegExp )
|
|
{
|
|
sal_Int32 nStart = 0;
|
|
sal_Int32 nEnd = aCellStr.getLength();
|
|
|
|
// from 614 on, nEnd is behind the found text
|
|
bool bMatch = false;
|
|
if ( rEntry.eOp == SC_ENDS_WITH || rEntry.eOp == SC_DOES_NOT_END_WITH )
|
|
{
|
|
nEnd = 0;
|
|
nStart = aCellStr.getLength();
|
|
bMatch = rEntry.GetSearchTextPtr( mrParam.bCaseSens )
|
|
->SearchBackward(aCellStr.getString(), &nStart, &nEnd);
|
|
}
|
|
else
|
|
{
|
|
bMatch = rEntry.GetSearchTextPtr( mrParam.bCaseSens )
|
|
->SearchForward(aCellStr.getString(), &nStart, &nEnd);
|
|
}
|
|
if ( bMatch && bMatchWholeCell
|
|
&& (nStart != 0 || nEnd != aCellStr.getLength()) )
|
|
bMatch = false; // RegExp must match entire cell string
|
|
if ( bRealRegExp )
|
|
switch (rEntry.eOp)
|
|
{
|
|
case SC_EQUAL:
|
|
case SC_CONTAINS:
|
|
bOk = bMatch;
|
|
break;
|
|
case SC_NOT_EQUAL:
|
|
case SC_DOES_NOT_CONTAIN:
|
|
bOk = !bMatch;
|
|
break;
|
|
case SC_BEGINS_WITH:
|
|
bOk = ( bMatch && (nStart == 0) );
|
|
break;
|
|
case SC_DOES_NOT_BEGIN_WITH:
|
|
bOk = !( bMatch && (nStart == 0) );
|
|
break;
|
|
case SC_ENDS_WITH:
|
|
bOk = ( bMatch && (nEnd == aCellStr.getLength()) );
|
|
break;
|
|
case SC_DOES_NOT_END_WITH:
|
|
bOk = !( bMatch && (nEnd == aCellStr.getLength()) );
|
|
break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
else
|
|
bTestEqual = bMatch;
|
|
}
|
|
if ( !bRealRegExp )
|
|
{
|
|
// Simple string matching i.e. no regexp match.
|
|
if (isTextMatchOp(rEntry))
|
|
{
|
|
if (rItem.meType != ScQueryEntry::ByString && rItem.maString.isEmpty())
|
|
{
|
|
// #i18374# When used from functions (match, countif, sumif, vlookup, hlookup, lookup),
|
|
// the query value is assigned directly, and the string is empty. In that case,
|
|
// don't find any string (isEqual would find empty string results in formula cells).
|
|
bOk = false;
|
|
if ( rEntry.eOp == SC_NOT_EQUAL )
|
|
bOk = !bOk;
|
|
}
|
|
else if ( bMatchWholeCell )
|
|
{
|
|
// Fast string equality check by comparing string identifiers.
|
|
if (mrParam.bCaseSens)
|
|
bOk = aCellStr.getData() == rItem.maString.getData();
|
|
else
|
|
bOk = aCellStr.getDataIgnoreCase() == rItem.maString.getDataIgnoreCase();
|
|
|
|
if ( rEntry.eOp == SC_NOT_EQUAL )
|
|
bOk = !bOk;
|
|
}
|
|
else
|
|
{
|
|
OUString aQueryStr = rItem.maString.getString();
|
|
OUString aCell( mpTransliteration->transliterate(
|
|
aCellStr.getString(), ScGlobal::eLnge, 0, aCellStr.getLength(),
|
|
NULL ) );
|
|
OUString aQuer( mpTransliteration->transliterate(
|
|
aQueryStr, ScGlobal::eLnge, 0, aQueryStr.getLength(),
|
|
NULL ) );
|
|
sal_Int32 nIndex = (rEntry.eOp == SC_ENDS_WITH
|
|
|| rEntry.eOp == SC_DOES_NOT_END_WITH) ? (aCell.getLength()-aQuer.getLength()) : 0;
|
|
sal_Int32 nStrPos = aCell.indexOf( aQuer, nIndex );
|
|
switch (rEntry.eOp)
|
|
{
|
|
case SC_EQUAL:
|
|
case SC_CONTAINS:
|
|
bOk = ( nStrPos != -1 );
|
|
break;
|
|
case SC_NOT_EQUAL:
|
|
case SC_DOES_NOT_CONTAIN:
|
|
bOk = ( nStrPos == -1 );
|
|
break;
|
|
case SC_BEGINS_WITH:
|
|
bOk = ( nStrPos == 0 );
|
|
break;
|
|
case SC_DOES_NOT_BEGIN_WITH:
|
|
bOk = ( nStrPos != 0 );
|
|
break;
|
|
case SC_ENDS_WITH:
|
|
bOk = ( nStrPos + aQuer.getLength() == aCell.getLength() );
|
|
break;
|
|
case SC_DOES_NOT_END_WITH:
|
|
bOk = ( nStrPos + aQuer.getLength() != aCell.getLength() );
|
|
break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{ // use collator here because data was probably sorted
|
|
sal_Int32 nCompare = mpCollator->compareString(
|
|
aCellStr.getString(), rItem.maString.getString());
|
|
switch (rEntry.eOp)
|
|
{
|
|
case SC_LESS :
|
|
bOk = (nCompare < 0);
|
|
break;
|
|
case SC_GREATER :
|
|
bOk = (nCompare > 0);
|
|
break;
|
|
case SC_LESS_EQUAL :
|
|
bOk = (nCompare <= 0);
|
|
if ( bOk && mpTestEqualCondition && !bTestEqual )
|
|
bTestEqual = (nCompare == 0);
|
|
break;
|
|
case SC_GREATER_EQUAL :
|
|
bOk = (nCompare >= 0);
|
|
if ( bOk && mpTestEqualCondition && !bTestEqual )
|
|
bTestEqual = (nCompare == 0);
|
|
break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return std::pair<bool,bool>(bOk, bTestEqual);
|
|
}
|
|
|
|
// To be called only if both isQueryByValue() and isQueryByString()
|
|
// returned false and range lookup is wanted! In range lookup comparison
|
|
// numbers are less than strings. Nothing else is compared.
|
|
std::pair<bool,bool> compareByRangeLookup(
|
|
const ScRefCellValue& rCell, SCCOL nCol, SCROW nRow,
|
|
const ScQueryEntry& rEntry, const ScQueryEntry::Item& rItem)
|
|
{
|
|
bool bTestEqual = false;
|
|
|
|
if (rItem.meType == ScQueryEntry::ByString && rEntry.eOp != SC_LESS && rEntry.eOp != SC_LESS_EQUAL)
|
|
return std::pair<bool,bool>(false, bTestEqual);
|
|
|
|
if (rItem.meType != ScQueryEntry::ByString && rEntry.eOp != SC_GREATER && rEntry.eOp != SC_GREATER_EQUAL)
|
|
return std::pair<bool,bool>(false, bTestEqual);
|
|
|
|
if (!rCell.isEmpty())
|
|
{
|
|
if (rItem.meType == ScQueryEntry::ByString)
|
|
{
|
|
if (rCell.meType == CELLTYPE_FORMULA && rCell.mpFormula->GetErrCode())
|
|
// Error values are compared as string.
|
|
return std::pair<bool,bool>(false, bTestEqual);
|
|
|
|
return std::pair<bool,bool>(rCell.hasNumeric(), bTestEqual);
|
|
}
|
|
|
|
return std::pair<bool,bool>(!rCell.hasNumeric(), bTestEqual);
|
|
}
|
|
|
|
if (rItem.meType == ScQueryEntry::ByString)
|
|
return std::pair<bool,bool>(mrTab.HasValueData(nCol, nRow), bTestEqual);
|
|
|
|
return std::pair<bool,bool>(!mrTab.HasValueData(nCol, nRow), bTestEqual);
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
bool ScTable::ValidQuery(
|
|
SCROW nRow, const ScQueryParam& rParam, ScRefCellValue* pCell, bool* pbTestEqualCondition)
|
|
{
|
|
if (!rParam.GetEntry(0).bDoQuery)
|
|
return true;
|
|
|
|
SCSIZE nEntryCount = rParam.GetEntryCount();
|
|
|
|
typedef std::pair<bool,bool> ResultType;
|
|
static std::vector<ResultType> aResults;
|
|
if (aResults.size() < nEntryCount)
|
|
aResults.resize(nEntryCount);
|
|
|
|
long nPos = -1;
|
|
QueryEvaluator aEval(*pDocument, *this, rParam, pbTestEqualCondition);
|
|
ScQueryParam::const_iterator it, itBeg = rParam.begin(), itEnd = rParam.end();
|
|
for (it = itBeg; it != itEnd && it->bDoQuery; ++it)
|
|
{
|
|
const ScQueryEntry& rEntry = *it;
|
|
SCCOL nCol = static_cast<SCCOL>(rEntry.nField);
|
|
|
|
// we can only handle one single direct query
|
|
ScRefCellValue aCell;
|
|
if (pCell && it == itBeg)
|
|
aCell = *pCell;
|
|
else
|
|
aCell = GetCellValue(nCol, nRow);
|
|
|
|
std::pair<bool,bool> aRes(false, false);
|
|
|
|
const ScQueryEntry::QueryItemsType& rItems = rEntry.GetQueryItems();
|
|
if (rItems.size() == 1 && rItems.front().meType == ScQueryEntry::ByEmpty)
|
|
{
|
|
if (rEntry.IsQueryByEmpty())
|
|
aRes.first = !aCol[rEntry.nField].HasDataAt(nRow);
|
|
else
|
|
{
|
|
OSL_ASSERT(rEntry.IsQueryByNonEmpty());
|
|
aRes.first = aCol[rEntry.nField].HasDataAt(nRow);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
ScQueryEntry::QueryItemsType::const_iterator itr = rItems.begin(), itrEnd = rItems.end();
|
|
|
|
for (; itr != itrEnd; ++itr)
|
|
{
|
|
if (aEval.isQueryByValue(*itr, nCol, nRow, aCell))
|
|
{
|
|
std::pair<bool,bool> aThisRes =
|
|
aEval.compareByValue(aCell, nCol, nRow, rEntry, *itr);
|
|
aRes.first |= aThisRes.first;
|
|
aRes.second |= aThisRes.second;
|
|
}
|
|
else if (aEval.isQueryByString(rEntry, *itr, nCol, nRow, aCell))
|
|
{
|
|
std::pair<bool,bool> aThisRes =
|
|
aEval.compareByString(aCell, nRow, rEntry, *itr);
|
|
aRes.first |= aThisRes.first;
|
|
aRes.second |= aThisRes.second;
|
|
}
|
|
else if (rParam.mbRangeLookup)
|
|
{
|
|
std::pair<bool,bool> aThisRes =
|
|
aEval.compareByRangeLookup(aCell, nCol, nRow, rEntry, *itr);
|
|
aRes.first |= aThisRes.first;
|
|
aRes.second |= aThisRes.second;
|
|
}
|
|
|
|
if (aRes.first && aRes.second)
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (nPos == -1)
|
|
{
|
|
nPos++;
|
|
aResults[nPos] = aRes;
|
|
}
|
|
else
|
|
{
|
|
if (rEntry.eConnect == SC_AND)
|
|
{
|
|
aResults[nPos].first = aResults[nPos].first && aRes.first;
|
|
aResults[nPos].second = aResults[nPos].second && aRes.second;
|
|
}
|
|
else
|
|
{
|
|
nPos++;
|
|
aResults[nPos] = aRes;
|
|
}
|
|
}
|
|
}
|
|
|
|
for ( long j=1; j <= nPos; j++ )
|
|
{
|
|
aResults[0].first = aResults[0].first || aResults[j].first;
|
|
aResults[0].second = aResults[0].second || aResults[j].second;
|
|
}
|
|
|
|
bool bRet = aResults[0].first;
|
|
if ( pbTestEqualCondition )
|
|
*pbTestEqualCondition = aResults[0].second;
|
|
|
|
return bRet;
|
|
}
|
|
|
|
void ScTable::TopTenQuery( ScQueryParam& rParam )
|
|
{
|
|
bool bSortCollatorInitialized = false;
|
|
SCSIZE nEntryCount = rParam.GetEntryCount();
|
|
SCROW nRow1 = (rParam.bHasHeader ? rParam.nRow1 + 1 : rParam.nRow1);
|
|
SCSIZE nCount = static_cast<SCSIZE>(rParam.nRow2 - nRow1 + 1);
|
|
for ( SCSIZE i=0; (i<nEntryCount) && (rParam.GetEntry(i).bDoQuery); i++ )
|
|
{
|
|
ScQueryEntry& rEntry = rParam.GetEntry(i);
|
|
ScQueryEntry::Item& rItem = rEntry.GetQueryItem();
|
|
|
|
switch ( rEntry.eOp )
|
|
{
|
|
case SC_TOPVAL:
|
|
case SC_BOTVAL:
|
|
case SC_TOPPERC:
|
|
case SC_BOTPERC:
|
|
{
|
|
ScSortParam aLocalSortParam( rParam, static_cast<SCCOL>(rEntry.nField) );
|
|
aSortParam = aLocalSortParam; // used in CreateSortInfoArray, Compare
|
|
if ( !bSortCollatorInitialized )
|
|
{
|
|
bSortCollatorInitialized = true;
|
|
InitSortCollator( aLocalSortParam );
|
|
}
|
|
boost::scoped_ptr<ScSortInfoArray> pArray(CreateSortInfoArray(aSortParam, nRow1, rParam.nRow2, bGlobalKeepQuery, false));
|
|
DecoladeRow( pArray.get(), nRow1, rParam.nRow2 );
|
|
QuickSort( pArray.get(), nRow1, rParam.nRow2 );
|
|
ScSortInfo** ppInfo = pArray->GetFirstArray();
|
|
SCSIZE nValidCount = nCount;
|
|
// keine Note-/Leerzellen zaehlen, sind ans Ende sortiert
|
|
while (nValidCount > 0 && ppInfo[nValidCount-1]->maCell.isEmpty())
|
|
nValidCount--;
|
|
// keine Strings zaehlen, sind zwischen Value und Leer
|
|
while (nValidCount > 0 && ppInfo[nValidCount-1]->maCell.hasString())
|
|
nValidCount--;
|
|
if ( nValidCount > 0 )
|
|
{
|
|
if ( rItem.meType == ScQueryEntry::ByString )
|
|
{ // dat wird nix
|
|
rItem.meType = ScQueryEntry::ByValue;
|
|
rItem.mfVal = 10; // 10 bzw. 10%
|
|
}
|
|
SCSIZE nVal = (rItem.mfVal >= 1 ? static_cast<SCSIZE>(rItem.mfVal) : 1);
|
|
SCSIZE nOffset = 0;
|
|
switch ( rEntry.eOp )
|
|
{
|
|
case SC_TOPVAL:
|
|
{
|
|
rEntry.eOp = SC_GREATER_EQUAL;
|
|
if ( nVal > nValidCount )
|
|
nVal = nValidCount;
|
|
nOffset = nValidCount - nVal; // 1 <= nVal <= nValidCount
|
|
}
|
|
break;
|
|
case SC_BOTVAL:
|
|
{
|
|
rEntry.eOp = SC_LESS_EQUAL;
|
|
if ( nVal > nValidCount )
|
|
nVal = nValidCount;
|
|
nOffset = nVal - 1; // 1 <= nVal <= nValidCount
|
|
}
|
|
break;
|
|
case SC_TOPPERC:
|
|
{
|
|
rEntry.eOp = SC_GREATER_EQUAL;
|
|
if ( nVal > 100 )
|
|
nVal = 100;
|
|
nOffset = nValidCount - (nValidCount * nVal / 100);
|
|
if ( nOffset >= nValidCount )
|
|
nOffset = nValidCount - 1;
|
|
}
|
|
break;
|
|
case SC_BOTPERC:
|
|
{
|
|
rEntry.eOp = SC_LESS_EQUAL;
|
|
if ( nVal > 100 )
|
|
nVal = 100;
|
|
nOffset = (nValidCount * nVal / 100);
|
|
if ( nOffset >= nValidCount )
|
|
nOffset = nValidCount - 1;
|
|
}
|
|
break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
ScRefCellValue aCell = ppInfo[nOffset]->maCell;
|
|
if (aCell.hasNumeric())
|
|
rItem.mfVal = aCell.getValue();
|
|
else
|
|
{
|
|
OSL_FAIL( "TopTenQuery: pCell no ValueData" );
|
|
rEntry.eOp = SC_GREATER_EQUAL;
|
|
rItem.mfVal = 0;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
rEntry.eOp = SC_GREATER_EQUAL;
|
|
rItem.meType = ScQueryEntry::ByValue;
|
|
rItem.mfVal = 0;
|
|
}
|
|
}
|
|
break;
|
|
default:
|
|
{
|
|
// added to avoid warnings
|
|
}
|
|
}
|
|
}
|
|
if ( bSortCollatorInitialized )
|
|
DestroySortCollator();
|
|
}
|
|
|
|
namespace {
|
|
|
|
class PrepareQueryItem : public std::unary_function<ScQueryEntry::Item, void>
|
|
{
|
|
const ScDocument& mrDoc;
|
|
public:
|
|
PrepareQueryItem(const ScDocument& rDoc) : mrDoc(rDoc) {}
|
|
|
|
void operator() (ScQueryEntry::Item& rItem)
|
|
{
|
|
if (rItem.meType != ScQueryEntry::ByString && rItem.meType != ScQueryEntry::ByDate)
|
|
return;
|
|
|
|
sal_uInt32 nIndex = 0;
|
|
bool bNumber = mrDoc.GetFormatTable()->
|
|
IsNumberFormat(rItem.maString.getString(), nIndex, rItem.mfVal);
|
|
|
|
// Advanced Filter creates only ByString queries that need to be
|
|
// converted to ByValue if appropriate. rItem.mfVal now holds the value
|
|
// if bNumber==true.
|
|
|
|
if (rItem.meType == ScQueryEntry::ByString)
|
|
{
|
|
if (bNumber)
|
|
rItem.meType = ScQueryEntry::ByValue;
|
|
return;
|
|
}
|
|
|
|
// Double-check if the query by date is really appropriate.
|
|
|
|
if (bNumber && ((nIndex % SV_COUNTRY_LANGUAGE_OFFSET) != 0))
|
|
{
|
|
const SvNumberformat* pEntry = mrDoc.GetFormatTable()->GetEntry(nIndex);
|
|
if (pEntry)
|
|
{
|
|
short nNumFmtType = pEntry->GetType();
|
|
if (!((nNumFmtType & NUMBERFORMAT_DATE) && !(nNumFmtType & NUMBERFORMAT_TIME)))
|
|
rItem.meType = ScQueryEntry::ByValue; // not a date only
|
|
}
|
|
else
|
|
rItem.meType = ScQueryEntry::ByValue; // what the ... not a date
|
|
}
|
|
else
|
|
rItem.meType = ScQueryEntry::ByValue; // not a date
|
|
}
|
|
};
|
|
|
|
void lcl_PrepareQuery( const ScDocument* pDoc, ScTable* pTab, ScQueryParam& rParam )
|
|
{
|
|
bool bTopTen = false;
|
|
SCSIZE nEntryCount = rParam.GetEntryCount();
|
|
|
|
for ( SCSIZE i = 0; i < nEntryCount; ++i )
|
|
{
|
|
ScQueryEntry& rEntry = rParam.GetEntry(i);
|
|
if (!rEntry.bDoQuery)
|
|
continue;
|
|
|
|
ScQueryEntry::QueryItemsType& rItems = rEntry.GetQueryItems();
|
|
std::for_each(rItems.begin(), rItems.end(), PrepareQueryItem(*pDoc));
|
|
|
|
if ( !bTopTen )
|
|
{
|
|
switch ( rEntry.eOp )
|
|
{
|
|
case SC_TOPVAL:
|
|
case SC_BOTVAL:
|
|
case SC_TOPPERC:
|
|
case SC_BOTPERC:
|
|
{
|
|
bTopTen = true;
|
|
}
|
|
break;
|
|
default:
|
|
{
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if ( bTopTen )
|
|
{
|
|
pTab->TopTenQuery( rParam );
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
SCSIZE ScTable::Query(ScQueryParam& rParamOrg, bool bKeepSub)
|
|
{
|
|
ScQueryParam aParam( rParamOrg );
|
|
typedef boost::unordered_set<OUString, OUStringHash> StrSetType;
|
|
StrSetType aStrSet;
|
|
|
|
bool bStarted = false;
|
|
bool bOldResult = true;
|
|
SCROW nOldStart = 0;
|
|
SCROW nOldEnd = 0;
|
|
|
|
SCSIZE nCount = 0;
|
|
SCROW nOutRow = 0;
|
|
SCROW nHeader = aParam.bHasHeader ? 1 : 0;
|
|
|
|
lcl_PrepareQuery(pDocument, this, aParam);
|
|
|
|
if (!aParam.bInplace)
|
|
{
|
|
nOutRow = aParam.nDestRow + nHeader;
|
|
if (nHeader > 0)
|
|
CopyData( aParam.nCol1, aParam.nRow1, aParam.nCol2, aParam.nRow1,
|
|
aParam.nDestCol, aParam.nDestRow, aParam.nDestTab );
|
|
}
|
|
|
|
SCROW nRealRow2 = aParam.nRow2;
|
|
for (SCROW j = aParam.nRow1 + nHeader; j <= nRealRow2; ++j)
|
|
{
|
|
bool bResult; // Filterergebnis
|
|
bool bValid = ValidQuery(j, aParam);
|
|
if (!bValid && bKeepSub) // Subtotals stehenlassen
|
|
{
|
|
for (SCCOL nCol=aParam.nCol1; nCol<=aParam.nCol2 && !bValid; nCol++)
|
|
{
|
|
ScRefCellValue aCell = GetCellValue(nCol, j);
|
|
if (aCell.meType != CELLTYPE_FORMULA)
|
|
continue;
|
|
|
|
if (!aCell.mpFormula->IsSubTotal())
|
|
continue;
|
|
|
|
if (RefVisible(aCell.mpFormula))
|
|
bValid = true;
|
|
}
|
|
}
|
|
if (bValid)
|
|
{
|
|
if (aParam.bDuplicate)
|
|
bResult = true;
|
|
else
|
|
{
|
|
OUString aStr;
|
|
for (SCCOL k=aParam.nCol1; k <= aParam.nCol2; k++)
|
|
{
|
|
OUString aCellStr;
|
|
GetString(k, j, aCellStr);
|
|
OUStringBuffer aBuf(aStr);
|
|
aBuf.append(aCellStr);
|
|
aBuf.append(static_cast<sal_Unicode>(1));
|
|
aStr = aBuf.makeStringAndClear();
|
|
}
|
|
|
|
std::pair<StrSetType::iterator, bool> r = aStrSet.insert(aStr);
|
|
bool bIsUnique = r.second; // unique if inserted.
|
|
bResult = bIsUnique;
|
|
}
|
|
}
|
|
else
|
|
bResult = false;
|
|
|
|
if (aParam.bInplace)
|
|
{
|
|
if (bResult == bOldResult && bStarted)
|
|
nOldEnd = j;
|
|
else
|
|
{
|
|
if (bStarted)
|
|
DBShowRows(nOldStart,nOldEnd, bOldResult);
|
|
nOldStart = nOldEnd = j;
|
|
bOldResult = bResult;
|
|
}
|
|
bStarted = true;
|
|
}
|
|
else
|
|
{
|
|
if (bResult)
|
|
{
|
|
CopyData( aParam.nCol1,j, aParam.nCol2,j, aParam.nDestCol,nOutRow,aParam.nDestTab );
|
|
++nOutRow;
|
|
}
|
|
}
|
|
if (bResult)
|
|
++nCount;
|
|
}
|
|
|
|
if (aParam.bInplace && bStarted)
|
|
DBShowRows(nOldStart,nOldEnd, bOldResult);
|
|
|
|
if (aParam.bInplace)
|
|
SetDrawPageSize();
|
|
|
|
return nCount;
|
|
}
|
|
|
|
bool ScTable::CreateExcelQuery(SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2, ScQueryParam& rQueryParam)
|
|
{
|
|
bool bValid = true;
|
|
boost::scoped_array<SCCOL> pFields(new SCCOL[nCol2-nCol1+1]);
|
|
OUString aCellStr;
|
|
SCCOL nCol = nCol1;
|
|
OSL_ENSURE( rQueryParam.nTab != SCTAB_MAX, "rQueryParam.nTab no value, not bad but no good" );
|
|
SCTAB nDBTab = (rQueryParam.nTab == SCTAB_MAX ? nTab : rQueryParam.nTab);
|
|
SCROW nDBRow1 = rQueryParam.nRow1;
|
|
SCCOL nDBCol2 = rQueryParam.nCol2;
|
|
// Erste Zeile muessen Spaltenkoepfe sein
|
|
while (bValid && (nCol <= nCol2))
|
|
{
|
|
OUString aQueryStr;
|
|
GetUpperCellString(nCol, nRow1, aQueryStr);
|
|
bool bFound = false;
|
|
SCCOL i = rQueryParam.nCol1;
|
|
while (!bFound && (i <= nDBCol2))
|
|
{
|
|
if ( nTab == nDBTab )
|
|
GetUpperCellString(i, nDBRow1, aCellStr);
|
|
else
|
|
pDocument->GetUpperCellString(i, nDBRow1, nDBTab, aCellStr);
|
|
bFound = (aCellStr == aQueryStr);
|
|
if (!bFound) i++;
|
|
}
|
|
if (bFound)
|
|
pFields[nCol - nCol1] = i;
|
|
else
|
|
bValid = false;
|
|
nCol++;
|
|
}
|
|
if (bValid)
|
|
{
|
|
sal_uLong nVisible = 0;
|
|
for ( nCol=nCol1; nCol<=nCol2; nCol++ )
|
|
nVisible += aCol[nCol].VisibleCount( nRow1+1, nRow2 );
|
|
|
|
if ( nVisible > SCSIZE_MAX / sizeof(void*) )
|
|
{
|
|
OSL_FAIL("too many filter criteria");
|
|
nVisible = 0;
|
|
}
|
|
|
|
SCSIZE nNewEntries = nVisible;
|
|
rQueryParam.Resize( nNewEntries );
|
|
|
|
SCSIZE nIndex = 0;
|
|
SCROW nRow = nRow1 + 1;
|
|
svl::SharedStringPool& rPool = pDocument->GetSharedStringPool();
|
|
while (nRow <= nRow2)
|
|
{
|
|
nCol = nCol1;
|
|
while (nCol <= nCol2)
|
|
{
|
|
GetInputString( nCol, nRow, aCellStr );
|
|
if (!aCellStr.isEmpty())
|
|
{
|
|
if (nIndex < nNewEntries)
|
|
{
|
|
rQueryParam.GetEntry(nIndex).nField = pFields[nCol - nCol1];
|
|
rQueryParam.FillInExcelSyntax(rPool, aCellStr, nIndex);
|
|
nIndex++;
|
|
if (nIndex < nNewEntries)
|
|
rQueryParam.GetEntry(nIndex).eConnect = SC_AND;
|
|
}
|
|
else
|
|
bValid = false;
|
|
}
|
|
nCol++;
|
|
}
|
|
nRow++;
|
|
if (nIndex < nNewEntries)
|
|
rQueryParam.GetEntry(nIndex).eConnect = SC_OR;
|
|
}
|
|
}
|
|
return bValid;
|
|
}
|
|
|
|
bool ScTable::CreateStarQuery(SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2, ScQueryParam& rQueryParam)
|
|
{
|
|
// A valid StarQuery must be at least 4 columns wide. To be precise it
|
|
// should be exactly 4 columns ...
|
|
// Additionally, if this wasn't checked, a formula pointing to a valid 1-3
|
|
// column Excel style query range immediately left to itself would result
|
|
// in a circular reference when the field name or operator or value (first
|
|
// to third query range column) is obtained (#i58354#). Furthermore, if the
|
|
// range wasn't sufficiently specified data changes wouldn't flag formula
|
|
// cells for recalculation.
|
|
if (nCol2 - nCol1 < 3)
|
|
return false;
|
|
|
|
bool bValid;
|
|
bool bFound;
|
|
OUString aCellStr;
|
|
SCSIZE nIndex = 0;
|
|
SCROW nRow = nRow1;
|
|
OSL_ENSURE( rQueryParam.nTab != SCTAB_MAX, "rQueryParam.nTab no value, not bad but no good" );
|
|
SCTAB nDBTab = (rQueryParam.nTab == SCTAB_MAX ? nTab : rQueryParam.nTab);
|
|
SCROW nDBRow1 = rQueryParam.nRow1;
|
|
SCCOL nDBCol2 = rQueryParam.nCol2;
|
|
|
|
SCSIZE nNewEntries = static_cast<SCSIZE>(nRow2-nRow1+1);
|
|
rQueryParam.Resize( nNewEntries );
|
|
svl::SharedStringPool& rPool = pDocument->GetSharedStringPool();
|
|
|
|
do
|
|
{
|
|
ScQueryEntry& rEntry = rQueryParam.GetEntry(nIndex);
|
|
|
|
bValid = false;
|
|
// Erste Spalte UND/ODER
|
|
if (nIndex > 0)
|
|
{
|
|
GetUpperCellString(nCol1, nRow, aCellStr);
|
|
if ( aCellStr == ScGlobal::GetRscString(STR_TABLE_UND) )
|
|
{
|
|
rEntry.eConnect = SC_AND;
|
|
bValid = true;
|
|
}
|
|
else if ( aCellStr == ScGlobal::GetRscString(STR_TABLE_ODER) )
|
|
{
|
|
rEntry.eConnect = SC_OR;
|
|
bValid = true;
|
|
}
|
|
}
|
|
// Zweite Spalte FeldName
|
|
if ((nIndex < 1) || bValid)
|
|
{
|
|
bFound = false;
|
|
GetUpperCellString(nCol1 + 1, nRow, aCellStr);
|
|
for (SCCOL i=rQueryParam.nCol1; (i <= nDBCol2) && (!bFound); i++)
|
|
{
|
|
OUString aFieldStr;
|
|
if ( nTab == nDBTab )
|
|
GetUpperCellString(i, nDBRow1, aFieldStr);
|
|
else
|
|
pDocument->GetUpperCellString(i, nDBRow1, nDBTab, aFieldStr);
|
|
bFound = (aCellStr == aFieldStr);
|
|
if (bFound)
|
|
{
|
|
rEntry.nField = i;
|
|
bValid = true;
|
|
}
|
|
else
|
|
bValid = false;
|
|
}
|
|
}
|
|
// Dritte Spalte Operator =<>...
|
|
if (bValid)
|
|
{
|
|
bFound = false;
|
|
GetUpperCellString(nCol1 + 2, nRow, aCellStr);
|
|
if (aCellStr.startsWith("<"))
|
|
{
|
|
if (aCellStr[1] == '>')
|
|
rEntry.eOp = SC_NOT_EQUAL;
|
|
else if (aCellStr[1] == '=')
|
|
rEntry.eOp = SC_LESS_EQUAL;
|
|
else
|
|
rEntry.eOp = SC_LESS;
|
|
}
|
|
else if (aCellStr.startsWith(">"))
|
|
{
|
|
if (aCellStr[1] == '=')
|
|
rEntry.eOp = SC_GREATER_EQUAL;
|
|
else
|
|
rEntry.eOp = SC_GREATER;
|
|
}
|
|
else if (aCellStr.startsWith("="))
|
|
rEntry.eOp = SC_EQUAL;
|
|
|
|
}
|
|
// Vierte Spalte Wert
|
|
if (bValid)
|
|
{
|
|
OUString aStr;
|
|
GetString(nCol1 + 3, nRow, aStr);
|
|
rEntry.GetQueryItem().maString = rPool.intern(aStr);
|
|
rEntry.bDoQuery = true;
|
|
}
|
|
nIndex++;
|
|
nRow++;
|
|
}
|
|
while (bValid && (nRow <= nRow2) /* && (nIndex < MAXQUERY) */ );
|
|
return bValid;
|
|
}
|
|
|
|
bool ScTable::CreateQueryParam(SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2, ScQueryParam& rQueryParam)
|
|
{
|
|
SCSIZE i, nCount;
|
|
PutInOrder(nCol1, nCol2);
|
|
PutInOrder(nRow1, nRow2);
|
|
|
|
nCount = rQueryParam.GetEntryCount();
|
|
for (i=0; i < nCount; i++)
|
|
rQueryParam.GetEntry(i).Clear();
|
|
|
|
// Standard QueryTabelle
|
|
bool bValid = CreateStarQuery(nCol1, nRow1, nCol2, nRow2, rQueryParam);
|
|
// Excel QueryTabelle
|
|
if (!bValid)
|
|
bValid = CreateExcelQuery(nCol1, nRow1, nCol2, nRow2, rQueryParam);
|
|
|
|
nCount = rQueryParam.GetEntryCount();
|
|
if (bValid)
|
|
{
|
|
// bQueryByString muss gesetzt sein
|
|
for (i=0; i < nCount; i++)
|
|
rQueryParam.GetEntry(i).GetQueryItem().meType = ScQueryEntry::ByString;
|
|
}
|
|
else
|
|
{
|
|
// nix
|
|
for (i=0; i < nCount; i++)
|
|
rQueryParam.GetEntry(i).Clear();
|
|
}
|
|
return bValid;
|
|
}
|
|
|
|
bool ScTable::HasColHeader( SCCOL nStartCol, SCROW nStartRow, SCCOL nEndCol, SCROW /* nEndRow */ ) const
|
|
{
|
|
for (SCCOL nCol=nStartCol; nCol<=nEndCol; nCol++)
|
|
{
|
|
CellType eType = GetCellType( nCol, nStartRow );
|
|
if (eType != CELLTYPE_STRING && eType != CELLTYPE_EDIT)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool ScTable::HasRowHeader( SCCOL nStartCol, SCROW nStartRow, SCCOL /* nEndCol */, SCROW nEndRow ) const
|
|
{
|
|
for (SCROW nRow=nStartRow; nRow<=nEndRow; nRow++)
|
|
{
|
|
CellType eType = GetCellType( nStartCol, nRow );
|
|
if (eType != CELLTYPE_STRING && eType != CELLTYPE_EDIT)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
void ScTable::GetFilterEntries(SCCOL nCol, SCROW nRow1, SCROW nRow2, std::vector<ScTypedStrData>& rStrings, bool& rHasDates)
|
|
{
|
|
sc::ColumnBlockConstPosition aBlockPos;
|
|
aCol[nCol].InitBlockPosition(aBlockPos);
|
|
aCol[nCol].GetFilterEntries(aBlockPos, nRow1, nRow2, rStrings, rHasDates);
|
|
}
|
|
|
|
void ScTable::GetFilteredFilterEntries(
|
|
SCCOL nCol, SCROW nRow1, SCROW nRow2, const ScQueryParam& rParam, std::vector<ScTypedStrData>& rStrings, bool& rHasDates)
|
|
{
|
|
sc::ColumnBlockConstPosition aBlockPos;
|
|
aCol[nCol].InitBlockPosition(aBlockPos);
|
|
|
|
// remove the entry for this column from the query parameter
|
|
ScQueryParam aParam( rParam );
|
|
aParam.RemoveEntryByField(nCol);
|
|
|
|
lcl_PrepareQuery(pDocument, this, aParam);
|
|
bool bHasDates = false;
|
|
for ( SCROW j = nRow1; j <= nRow2; ++j )
|
|
{
|
|
if (ValidQuery(j, aParam))
|
|
{
|
|
bool bThisHasDates = false;
|
|
aCol[nCol].GetFilterEntries(aBlockPos, j, j, rStrings, bThisHasDates);
|
|
bHasDates |= bThisHasDates;
|
|
}
|
|
}
|
|
|
|
rHasDates = bHasDates;
|
|
}
|
|
|
|
bool ScTable::GetDataEntries(SCCOL nCol, SCROW nRow, std::set<ScTypedStrData>& rStrings, bool bLimit)
|
|
{
|
|
return aCol[nCol].GetDataEntries( nRow, rStrings, bLimit );
|
|
}
|
|
|
|
sal_uLong ScTable::GetCellCount() const
|
|
{
|
|
sal_uLong nCellCount = 0;
|
|
|
|
for ( SCCOL nCol=0; nCol<=MAXCOL; nCol++ )
|
|
nCellCount += aCol[nCol].GetCellCount();
|
|
|
|
return nCellCount;
|
|
}
|
|
|
|
sal_uLong ScTable::GetWeightedCount() const
|
|
{
|
|
sal_uLong nCellCount = 0;
|
|
|
|
for ( SCCOL nCol=0; nCol<=MAXCOL; nCol++ )
|
|
if ( aCol[nCol].GetCellCount() ) // GetCellCount ist inline
|
|
nCellCount += aCol[nCol].GetWeightedCount();
|
|
|
|
return nCellCount;
|
|
}
|
|
|
|
sal_uLong ScTable::GetCodeCount() const
|
|
{
|
|
sal_uLong nCodeCount = 0;
|
|
|
|
for ( SCCOL nCol=0; nCol<=MAXCOL; nCol++ )
|
|
if ( aCol[nCol].GetCellCount() ) // GetCellCount ist inline
|
|
nCodeCount += aCol[nCol].GetCodeCount();
|
|
|
|
return nCodeCount;
|
|
}
|
|
|
|
sal_Int32 ScTable::GetMaxStringLen( SCCOL nCol, SCROW nRowStart,
|
|
SCROW nRowEnd, rtl_TextEncoding eCharSet ) const
|
|
{
|
|
if ( ValidCol(nCol) )
|
|
return aCol[nCol].GetMaxStringLen( nRowStart, nRowEnd, eCharSet );
|
|
else
|
|
return 0;
|
|
}
|
|
|
|
sal_Int32 ScTable::GetMaxNumberStringLen(
|
|
sal_uInt16& nPrecision, SCCOL nCol, SCROW nRowStart, SCROW nRowEnd ) const
|
|
{
|
|
if ( ValidCol(nCol) )
|
|
return aCol[nCol].GetMaxNumberStringLen( nPrecision, nRowStart, nRowEnd );
|
|
else
|
|
return 0;
|
|
}
|
|
|
|
void ScTable::UpdateSelectionFunction( ScFunctionData& rData, const ScMarkData& rMark )
|
|
{
|
|
ScRangeList aRanges = rMark.GetMarkedRanges();
|
|
for (SCCOL nCol = 0; nCol <= MAXCOL && !rData.bError; ++nCol)
|
|
{
|
|
if (pColFlags && ColHidden(nCol))
|
|
continue;
|
|
|
|
aCol[nCol].UpdateSelectionFunction(aRanges, rData, *mpHiddenRows);
|
|
}
|
|
}
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|