2010-10-12 15:59:00 +02:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2009-09-09 10:57:16 -04:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
|
*
|
|
|
|
* Copyright 2008 by Sun Microsystems, Inc.
|
|
|
|
*
|
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
|
|
|
*
|
|
|
|
* This file is part of OpenOffice.org.
|
|
|
|
*
|
|
|
|
* OpenOffice.org is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Lesser General Public License version 3
|
|
|
|
* only, as published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* OpenOffice.org is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU Lesser General Public License version 3 for more details
|
|
|
|
* (a copy is included in the LICENSE file that accompanied this code).
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
|
|
* version 3 along with OpenOffice.org. If not, see
|
|
|
|
* <http://www.openoffice.org/license.html>
|
|
|
|
* for a copy of the LGPLv3 License.
|
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
|
|
|
// MARKER(update_precomp.py): autogen include statement, do not remove
|
|
|
|
#include "precompiled_sc.hxx"
|
|
|
|
|
|
|
|
// INCLUDE ---------------------------------------------------------------
|
|
|
|
|
|
|
|
#include "queryparam.hxx"
|
2011-11-05 00:56:38 -04:00
|
|
|
#include "queryentry.hxx"
|
2009-09-16 17:38:14 -04:00
|
|
|
|
2011-11-03 22:05:12 -04:00
|
|
|
namespace {
|
|
|
|
|
2011-11-05 00:56:38 -04:00
|
|
|
const size_t MAXQUERY = 8;
|
2011-11-04 01:03:27 -04:00
|
|
|
|
2011-11-03 22:57:31 -04:00
|
|
|
}
|
|
|
|
|
2011-11-05 00:56:38 -04:00
|
|
|
ScQueryParamBase::ScQueryParamBase()
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
2011-11-05 00:56:38 -04:00
|
|
|
for (size_t i = 0; i < MAXQUERY; ++i)
|
|
|
|
maEntries.push_back(new ScQueryEntry);
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
ScQueryParamBase::ScQueryParamBase(const ScQueryParamBase& r) :
|
|
|
|
bHasHeader(r.bHasHeader), bByRow(r.bByRow), bInplace(r.bInplace), bCaseSens(r.bCaseSens),
|
2011-11-11 12:16:06 -05:00
|
|
|
bRegExp(r.bRegExp), bDuplicate(r.bDuplicate), bMixedComparison(r.bMixedComparison),
|
2009-09-16 17:38:14 -04:00
|
|
|
maEntries(r.maEntries)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
ScQueryParamBase::~ScQueryParamBase()
|
|
|
|
{
|
2009-09-16 17:38:14 -04:00
|
|
|
}
|
|
|
|
|
2011-01-19 13:05:27 -05:00
|
|
|
bool ScQueryParamBase::IsValidFieldIndex() const
|
|
|
|
{
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-09-16 17:38:14 -04:00
|
|
|
SCSIZE ScQueryParamBase::GetEntryCount() const
|
|
|
|
{
|
|
|
|
return maEntries.size();
|
|
|
|
}
|
|
|
|
|
2011-11-03 22:45:31 -04:00
|
|
|
const ScQueryEntry& ScQueryParamBase::GetEntry(SCSIZE n) const
|
|
|
|
{
|
|
|
|
return maEntries[n];
|
|
|
|
}
|
|
|
|
|
|
|
|
ScQueryEntry& ScQueryParamBase::GetEntry(SCSIZE n)
|
2009-09-16 17:38:14 -04:00
|
|
|
{
|
|
|
|
return maEntries[n];
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
|
2011-11-05 00:56:38 -04:00
|
|
|
void ScQueryParamBase::Resize(size_t nNew)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
2011-11-05 00:56:38 -04:00
|
|
|
if (nNew < MAXQUERY)
|
2011-05-10 15:10:28 -04:00
|
|
|
nNew = MAXQUERY; // never less than MAXQUERY
|
2009-09-09 10:57:16 -04:00
|
|
|
|
2011-11-05 00:56:38 -04:00
|
|
|
if (nNew < maEntries.size())
|
|
|
|
{
|
|
|
|
size_t n = maEntries.size() - nNew;
|
|
|
|
for (size_t i = 0; i < n; ++i)
|
|
|
|
maEntries.pop_back();
|
|
|
|
}
|
|
|
|
else if (nNew > maEntries.size())
|
|
|
|
{
|
|
|
|
size_t n = nNew - maEntries.size();
|
|
|
|
for (size_t i = 0; i < n; ++i)
|
|
|
|
maEntries.push_back(new ScQueryEntry);
|
|
|
|
}
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
|
2011-11-05 00:56:38 -04:00
|
|
|
void ScQueryParamBase::DeleteQuery(size_t nPos)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
2009-09-16 17:38:14 -04:00
|
|
|
if (nPos >= maEntries.size())
|
|
|
|
return;
|
2009-09-09 10:57:16 -04:00
|
|
|
|
2011-11-05 00:56:38 -04:00
|
|
|
boost::ptr_vector<ScQueryEntry>::iterator itr = maEntries.begin();
|
|
|
|
std::advance(itr, nPos);
|
|
|
|
maEntries.erase(itr);
|
2009-09-16 17:38:14 -04:00
|
|
|
|
2009-11-26 00:25:40 -05:00
|
|
|
// Don't forget to append an empty entry to make up for the removed one.
|
|
|
|
// The size of the entries is not supposed to change.
|
2011-11-05 00:56:38 -04:00
|
|
|
maEntries.push_back(new ScQueryEntry);
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
|
2011-11-06 18:11:43 +01:00
|
|
|
void ScQueryParamBase::FillInExcelSyntax(const rtl::OUString& rStr, SCSIZE nIndex)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
2011-11-06 18:11:43 +01:00
|
|
|
const String aCellStr = rStr;
|
2009-09-09 10:57:16 -04:00
|
|
|
if (aCellStr.Len() > 0)
|
|
|
|
{
|
2009-09-16 17:38:14 -04:00
|
|
|
if ( nIndex >= maEntries.size() )
|
2009-09-09 10:57:16 -04:00
|
|
|
Resize( nIndex+1 );
|
|
|
|
|
2009-09-16 17:38:14 -04:00
|
|
|
ScQueryEntry& rEntry = GetEntry(nIndex);
|
2011-11-07 17:40:38 -05:00
|
|
|
ScQueryEntry::Item& rItem = rEntry.GetQueryItem();
|
2009-09-09 10:57:16 -04:00
|
|
|
|
2011-01-17 13:20:22 +01:00
|
|
|
rEntry.bDoQuery = sal_True;
|
2009-09-09 10:57:16 -04:00
|
|
|
// Operatoren herausfiltern
|
|
|
|
if (aCellStr.GetChar(0) == '<')
|
|
|
|
{
|
|
|
|
if (aCellStr.GetChar(1) == '>')
|
|
|
|
{
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr.Copy(2);
|
2009-09-09 10:57:16 -04:00
|
|
|
rEntry.eOp = SC_NOT_EQUAL;
|
|
|
|
}
|
|
|
|
else if (aCellStr.GetChar(1) == '=')
|
|
|
|
{
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr.Copy(2);
|
2009-09-09 10:57:16 -04:00
|
|
|
rEntry.eOp = SC_LESS_EQUAL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr.Copy(1);
|
2009-09-09 10:57:16 -04:00
|
|
|
rEntry.eOp = SC_LESS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (aCellStr.GetChar(0) == '>')
|
|
|
|
{
|
|
|
|
if (aCellStr.GetChar(1) == '=')
|
|
|
|
{
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr.Copy(2);
|
2009-09-09 10:57:16 -04:00
|
|
|
rEntry.eOp = SC_GREATER_EQUAL;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr.Copy(1);
|
2009-09-09 10:57:16 -04:00
|
|
|
rEntry.eOp = SC_GREATER;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (aCellStr.GetChar(0) == '=')
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr.Copy(1);
|
2009-09-09 10:57:16 -04:00
|
|
|
else
|
2011-11-07 17:40:38 -05:00
|
|
|
rItem.maString = aCellStr;
|
2009-09-09 10:57:16 -04:00
|
|
|
rEntry.eOp = SC_EQUAL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-09 23:58:50 -04:00
|
|
|
// ============================================================================
|
|
|
|
|
|
|
|
ScQueryParamTable::ScQueryParamTable()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
ScQueryParamTable::ScQueryParamTable(const ScQueryParamTable& r) :
|
|
|
|
nCol1(r.nCol1),nRow1(r.nRow1),nCol2(r.nCol2),nRow2(r.nRow2),nTab(r.nTab)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
ScQueryParamTable::~ScQueryParamTable()
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// ============================================================================
|
|
|
|
|
|
|
|
ScQueryParam::ScQueryParam() :
|
2009-09-09 23:58:50 -04:00
|
|
|
ScQueryParamBase(),
|
2010-03-05 18:23:10 -05:00
|
|
|
ScQueryParamTable(),
|
|
|
|
bDestPers(true),
|
|
|
|
nDestTab(0),
|
|
|
|
nDestCol(0),
|
|
|
|
nDestRow(0)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
|
|
|
Clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
ScQueryParam::ScQueryParam( const ScQueryParam& r ) :
|
|
|
|
ScQueryParamBase(r),
|
2009-09-09 23:58:50 -04:00
|
|
|
ScQueryParamTable(r),
|
2011-04-01 15:24:18 -04:00
|
|
|
bDestPers(r.bDestPers), nDestTab(r.nDestTab), nDestCol(r.nDestCol), nDestRow(r.nDestRow)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2009-09-16 16:18:38 -04:00
|
|
|
ScQueryParam::ScQueryParam( const ScDBQueryParamInternal& r ) :
|
|
|
|
ScQueryParamBase(r),
|
|
|
|
ScQueryParamTable(r),
|
|
|
|
bDestPers(true),
|
|
|
|
nDestTab(0),
|
|
|
|
nDestCol(0),
|
2011-04-01 15:24:18 -04:00
|
|
|
nDestRow(0)
|
2009-09-16 16:18:38 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-09-09 10:57:16 -04:00
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
ScQueryParam::~ScQueryParam()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
void ScQueryParam::Clear()
|
|
|
|
{
|
2009-09-16 16:18:38 -04:00
|
|
|
nCol1=nCol2 = 0;
|
|
|
|
nRow1=nRow2 = 0;
|
2009-09-09 10:57:16 -04:00
|
|
|
nTab = SCTAB_MAX;
|
2011-11-11 12:16:06 -05:00
|
|
|
bHasHeader = bCaseSens = bRegExp = bMixedComparison = false;
|
2011-01-17 13:20:22 +01:00
|
|
|
bInplace = bByRow = bDuplicate = sal_True;
|
2009-09-09 10:57:16 -04:00
|
|
|
|
2011-11-07 19:04:15 -05:00
|
|
|
boost::ptr_vector<ScQueryEntry>::iterator itr = maEntries.begin(), itrEnd = maEntries.end();
|
|
|
|
for (; itr != itrEnd; ++itr)
|
|
|
|
itr->Clear();
|
2009-09-16 16:18:38 -04:00
|
|
|
|
|
|
|
ClearDestParams();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ScQueryParam::ClearDestParams()
|
|
|
|
{
|
|
|
|
bDestPers = true;
|
|
|
|
nDestTab = 0;
|
|
|
|
nDestCol = 0;
|
|
|
|
nDestRow = 0;
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
ScQueryParam& ScQueryParam::operator=( const ScQueryParam& r )
|
|
|
|
{
|
|
|
|
nCol1 = r.nCol1;
|
|
|
|
nRow1 = r.nRow1;
|
|
|
|
nCol2 = r.nCol2;
|
|
|
|
nRow2 = r.nRow2;
|
|
|
|
nTab = r.nTab;
|
|
|
|
nDestTab = r.nDestTab;
|
|
|
|
nDestCol = r.nDestCol;
|
|
|
|
nDestRow = r.nDestRow;
|
|
|
|
bHasHeader = r.bHasHeader;
|
|
|
|
bInplace = r.bInplace;
|
|
|
|
bCaseSens = r.bCaseSens;
|
|
|
|
bRegExp = r.bRegExp;
|
2011-11-11 12:16:06 -05:00
|
|
|
bMixedComparison = r.bMixedComparison;
|
2009-09-09 10:57:16 -04:00
|
|
|
bDuplicate = r.bDuplicate;
|
|
|
|
bByRow = r.bByRow;
|
|
|
|
bDestPers = r.bDestPers;
|
|
|
|
|
2009-09-16 17:38:14 -04:00
|
|
|
maEntries = r.maEntries;
|
2009-09-09 10:57:16 -04:00
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
2011-11-03 22:45:31 -04:00
|
|
|
bool ScQueryParam::operator==( const ScQueryParam& rOther ) const
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
2011-11-03 22:45:31 -04:00
|
|
|
bool bEqual = false;
|
2009-09-09 10:57:16 -04:00
|
|
|
|
|
|
|
// Anzahl der Queries gleich?
|
2009-09-16 17:38:14 -04:00
|
|
|
SCSIZE nUsed = 0;
|
|
|
|
SCSIZE nOtherUsed = 0;
|
|
|
|
SCSIZE nEntryCount = GetEntryCount();
|
|
|
|
SCSIZE nOtherEntryCount = rOther.GetEntryCount();
|
|
|
|
|
|
|
|
while ( nUsed<nEntryCount && maEntries[nUsed].bDoQuery ) ++nUsed;
|
|
|
|
while ( nOtherUsed<nOtherEntryCount && rOther.maEntries[nOtherUsed].bDoQuery )
|
2009-09-09 10:57:16 -04:00
|
|
|
++nOtherUsed;
|
|
|
|
|
|
|
|
if ( (nUsed == nOtherUsed)
|
|
|
|
&& (nCol1 == rOther.nCol1)
|
|
|
|
&& (nRow1 == rOther.nRow1)
|
|
|
|
&& (nCol2 == rOther.nCol2)
|
|
|
|
&& (nRow2 == rOther.nRow2)
|
|
|
|
&& (nTab == rOther.nTab)
|
|
|
|
&& (bHasHeader == rOther.bHasHeader)
|
|
|
|
&& (bByRow == rOther.bByRow)
|
|
|
|
&& (bInplace == rOther.bInplace)
|
|
|
|
&& (bCaseSens == rOther.bCaseSens)
|
|
|
|
&& (bRegExp == rOther.bRegExp)
|
2011-11-11 12:16:06 -05:00
|
|
|
&& (bMixedComparison == rOther.bMixedComparison)
|
2009-09-09 10:57:16 -04:00
|
|
|
&& (bDuplicate == rOther.bDuplicate)
|
|
|
|
&& (bDestPers == rOther.bDestPers)
|
|
|
|
&& (nDestTab == rOther.nDestTab)
|
|
|
|
&& (nDestCol == rOther.nDestCol)
|
2011-04-01 15:24:18 -04:00
|
|
|
&& (nDestRow == rOther.nDestRow) )
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
2011-11-03 22:45:31 -04:00
|
|
|
bEqual = true;
|
2009-09-16 17:38:14 -04:00
|
|
|
for ( SCSIZE i=0; i<nUsed && bEqual; i++ )
|
|
|
|
bEqual = maEntries[i] == rOther.maEntries[i];
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
return bEqual;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------
|
|
|
|
|
|
|
|
void ScQueryParam::MoveToDest()
|
|
|
|
{
|
|
|
|
if (!bInplace)
|
|
|
|
{
|
|
|
|
SCsCOL nDifX = ((SCsCOL) nDestCol) - ((SCsCOL) nCol1);
|
|
|
|
SCsROW nDifY = ((SCsROW) nDestRow) - ((SCsROW) nRow1);
|
|
|
|
SCsTAB nDifZ = ((SCsTAB) nDestTab) - ((SCsTAB) nTab);
|
|
|
|
|
|
|
|
nCol1 = sal::static_int_cast<SCCOL>( nCol1 + nDifX );
|
|
|
|
nRow1 = sal::static_int_cast<SCROW>( nRow1 + nDifY );
|
|
|
|
nCol2 = sal::static_int_cast<SCCOL>( nCol2 + nDifX );
|
|
|
|
nRow2 = sal::static_int_cast<SCROW>( nRow2 + nDifY );
|
|
|
|
nTab = sal::static_int_cast<SCTAB>( nTab + nDifZ );
|
2009-09-16 17:38:14 -04:00
|
|
|
size_t n = maEntries.size();
|
|
|
|
for (size_t i=0; i<n; i++)
|
|
|
|
maEntries[i].nField += nDifX;
|
2009-09-09 10:57:16 -04:00
|
|
|
|
2011-01-17 13:20:22 +01:00
|
|
|
bInplace = sal_True;
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2011-03-01 19:05:02 +01:00
|
|
|
OSL_FAIL("MoveToDest, bInplace == TRUE");
|
2009-09-09 10:57:16 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// ============================================================================
|
|
|
|
|
2009-09-09 23:58:50 -04:00
|
|
|
ScDBQueryParamBase::ScDBQueryParamBase(DataType eType) :
|
|
|
|
ScQueryParamBase(),
|
|
|
|
mnField(-1),
|
2009-09-16 10:58:37 -04:00
|
|
|
mbSkipString(true),
|
2009-09-09 23:58:50 -04:00
|
|
|
meType(eType)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
ScDBQueryParamBase::~ScDBQueryParamBase()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
ScDBQueryParamBase::DataType ScDBQueryParamBase::GetType() const
|
|
|
|
{
|
|
|
|
return meType;
|
|
|
|
}
|
|
|
|
|
|
|
|
// ============================================================================
|
|
|
|
|
|
|
|
ScDBQueryParamInternal::ScDBQueryParamInternal() :
|
|
|
|
ScDBQueryParamBase(ScDBQueryParamBase::INTERNAL),
|
|
|
|
ScQueryParamTable()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
ScDBQueryParamInternal::~ScDBQueryParamInternal()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-01-19 13:05:27 -05:00
|
|
|
bool ScDBQueryParamInternal::IsValidFieldIndex() const
|
|
|
|
{
|
|
|
|
return nCol1 <= mnField && mnField <= nCol2;
|
|
|
|
}
|
|
|
|
|
2009-09-09 23:58:50 -04:00
|
|
|
// ============================================================================
|
|
|
|
|
|
|
|
ScDBQueryParamMatrix::ScDBQueryParamMatrix() :
|
|
|
|
ScDBQueryParamBase(ScDBQueryParamBase::MATRIX)
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-01-19 13:05:27 -05:00
|
|
|
bool ScDBQueryParamMatrix::IsValidFieldIndex() const
|
|
|
|
{
|
|
|
|
SCSIZE nC, nR;
|
|
|
|
mpMatrix->GetDimensions(nC, nR);
|
|
|
|
return 0 <= mnField && mnField <= static_cast<SCCOL>(nC);
|
|
|
|
}
|
|
|
|
|
2009-09-09 23:58:50 -04:00
|
|
|
ScDBQueryParamMatrix::~ScDBQueryParamMatrix()
|
2009-09-09 10:57:16 -04:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2010-10-12 15:59:00 +02:00
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|