2010-10-12 15:59:00 +02:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2012-11-30 12:23:25 +00:00
|
|
|
/*
|
|
|
|
* 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 .
|
|
|
|
*/
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "reffind.hxx"
|
|
|
|
#include "global.hxx"
|
|
|
|
#include "compiler.hxx"
|
2008-05-14 08:53:47 +00:00
|
|
|
#include "document.hxx"
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
// STATIC DATA -----------------------------------------------------------
|
|
|
|
|
2011-04-15 16:25:33 -04:00
|
|
|
namespace {
|
|
|
|
|
2012-09-08 13:15:19 +02:00
|
|
|
// include colon -> duplicate referenced are handled individual
|
2011-04-15 16:25:33 -04:00
|
|
|
const sal_Unicode pDelimiters[] = {
|
2010-10-01 22:35:15 -04:00
|
|
|
'=','(',')','+','-','*','/','^','&',' ','{','}','<','>',':', 0
|
2000-09-18 23:16:46 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
// =======================================================================
|
|
|
|
|
2011-04-15 16:25:33 -04:00
|
|
|
inline bool IsText( sal_Unicode c )
|
2000-09-18 23:16:46 +00:00
|
|
|
{
|
2011-04-15 16:25:33 -04:00
|
|
|
bool bFound = ScGlobal::UnicodeStrChr( pDelimiters, c );
|
2010-10-01 22:35:15 -04:00
|
|
|
if (bFound)
|
|
|
|
// This is one of delimiters, therefore not text.
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// argument separator is configurable.
|
|
|
|
const sal_Unicode sep = ScCompiler::GetNativeSymbol(ocSep).GetChar(0);
|
|
|
|
return c != sep;
|
2000-09-18 23:16:46 +00:00
|
|
|
}
|
|
|
|
|
2011-04-15 16:25:33 -04:00
|
|
|
inline bool IsText( bool& bQuote, sal_Unicode c )
|
2000-09-18 23:16:46 +00:00
|
|
|
{
|
2011-04-15 16:25:33 -04:00
|
|
|
if (c == '\'')
|
2000-09-18 23:16:46 +00:00
|
|
|
{
|
|
|
|
bQuote = !bQuote;
|
2011-04-15 16:25:33 -04:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if (bQuote)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return IsText(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Find first character position that is considered text. A character is
|
|
|
|
* considered a text when it's within the ascii range and when it's not a
|
|
|
|
* delimiter.
|
|
|
|
*/
|
|
|
|
xub_StrLen FindStartPos(const sal_Unicode* p, xub_StrLen nStartPos, xub_StrLen nEndPos)
|
|
|
|
{
|
|
|
|
while (nStartPos <= nEndPos && !IsText(p[nStartPos]))
|
|
|
|
++nStartPos;
|
|
|
|
|
|
|
|
return nStartPos;
|
|
|
|
}
|
|
|
|
|
|
|
|
xub_StrLen FindEndPosA1(const sal_Unicode* p, xub_StrLen nStartPos, xub_StrLen nEndPos)
|
|
|
|
{
|
|
|
|
bool bQuote = false;
|
|
|
|
xub_StrLen nNewEnd = nStartPos;
|
|
|
|
while (nNewEnd <= nEndPos && IsText(bQuote, p[nNewEnd]))
|
|
|
|
++nNewEnd;
|
|
|
|
|
|
|
|
return nNewEnd;
|
|
|
|
}
|
|
|
|
|
|
|
|
xub_StrLen FindEndPosR1C1(const sal_Unicode* p, xub_StrLen nStartPos, xub_StrLen nEndPos)
|
|
|
|
{
|
|
|
|
xub_StrLen nNewEnd = nStartPos;
|
|
|
|
p = &p[nStartPos];
|
|
|
|
for (; nNewEnd <= nEndPos; ++p, ++nNewEnd)
|
|
|
|
{
|
|
|
|
if (*p == '\'')
|
|
|
|
{
|
|
|
|
// Skip until the closing quote.
|
|
|
|
for (; nNewEnd <= nEndPos; ++p, ++nNewEnd)
|
|
|
|
if (*p == '\'')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if (*p == '[')
|
|
|
|
{
|
|
|
|
// Skip until the closing braket.
|
|
|
|
for (; nNewEnd <= nEndPos; ++p, ++nNewEnd)
|
|
|
|
if (*p == ']')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else if (!IsText(*p))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return nNewEnd;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Find last character position that is considred text, from the specified
|
|
|
|
* start position.
|
|
|
|
*/
|
|
|
|
xub_StrLen FindEndPos(const sal_Unicode* p, xub_StrLen nStartPos, xub_StrLen nEndPos,
|
|
|
|
formula::FormulaGrammar::AddressConvention eConv)
|
|
|
|
{
|
|
|
|
switch (eConv)
|
|
|
|
{
|
|
|
|
case formula::FormulaGrammar::CONV_XL_R1C1:
|
|
|
|
return FindEndPosR1C1(p, nStartPos, nEndPos);
|
|
|
|
case formula::FormulaGrammar::CONV_OOO:
|
|
|
|
case formula::FormulaGrammar::CONV_XL_A1:
|
|
|
|
default:
|
|
|
|
return FindEndPosA1(p, nStartPos, nEndPos);
|
2000-09-18 23:16:46 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-15 16:25:33 -04:00
|
|
|
void ExpandToTextA1(const sal_Unicode* p, xub_StrLen nLen, xub_StrLen& rStartPos, xub_StrLen& rEndPos)
|
|
|
|
{
|
|
|
|
while (rStartPos > 0 && IsText(p[rStartPos - 1]) )
|
|
|
|
--rStartPos;
|
|
|
|
if (rEndPos)
|
|
|
|
--rEndPos;
|
|
|
|
while (rEndPos+1 < nLen && IsText(p[rEndPos + 1]) )
|
|
|
|
++rEndPos;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExpandToTextR1C1(const sal_Unicode* p, xub_StrLen nLen, xub_StrLen& rStartPos, xub_StrLen& rEndPos)
|
|
|
|
{
|
|
|
|
// move back the start position to the first text character.
|
|
|
|
if (rStartPos > 0)
|
|
|
|
{
|
|
|
|
for (--rStartPos; rStartPos > 0; --rStartPos)
|
|
|
|
{
|
|
|
|
sal_Unicode c = p[rStartPos];
|
|
|
|
if (c == '\'')
|
|
|
|
{
|
|
|
|
// Skip until the opening quote.
|
|
|
|
for (--rStartPos; rStartPos > 0; --rStartPos)
|
|
|
|
{
|
|
|
|
c = p[rStartPos];
|
|
|
|
if (c == '\'')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (c == ']')
|
|
|
|
{
|
|
|
|
// Skip until the opening braket.
|
|
|
|
for (--rStartPos; rStartPos > 0; --rStartPos)
|
|
|
|
{
|
|
|
|
if (c == '[')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (!IsText(c))
|
|
|
|
{
|
|
|
|
++rStartPos;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// move forward the end position to the last text character.
|
|
|
|
rEndPos = FindEndPosR1C1(p, rEndPos, nLen-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ExpandToText(const sal_Unicode* p, xub_StrLen nLen, xub_StrLen& rStartPos, xub_StrLen& rEndPos,
|
|
|
|
formula::FormulaGrammar::AddressConvention eConv)
|
|
|
|
{
|
|
|
|
switch (eConv)
|
|
|
|
{
|
|
|
|
case formula::FormulaGrammar::CONV_XL_R1C1:
|
|
|
|
ExpandToTextR1C1(p, nLen, rStartPos, rEndPos);
|
|
|
|
break;
|
|
|
|
case formula::FormulaGrammar::CONV_OOO:
|
|
|
|
case formula::FormulaGrammar::CONV_XL_A1:
|
|
|
|
default:
|
|
|
|
ExpandToTextA1(p, nLen, rStartPos, rEndPos);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
ScRefFinder::ScRefFinder(
|
|
|
|
const String& rFormula, const ScAddress& rPos,
|
|
|
|
ScDocument* pDocument, formula::FormulaGrammar::AddressConvention eConvP) :
|
2000-09-18 23:16:46 +00:00
|
|
|
aFormula( rFormula ),
|
2007-02-27 11:18:37 +00:00
|
|
|
eConv( eConvP ),
|
2011-04-15 16:25:33 -04:00
|
|
|
pDoc( pDocument ),
|
|
|
|
maPos(rPos)
|
2000-09-18 23:16:46 +00:00
|
|
|
{
|
|
|
|
nSelStart = nSelEnd = nFound = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
ScRefFinder::~ScRefFinder()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2012-10-12 13:26:46 +02:00
|
|
|
static sal_uInt16 lcl_NextFlags( sal_uInt16 nOld )
|
2000-09-18 23:16:46 +00:00
|
|
|
{
|
2011-01-17 13:20:22 +01:00
|
|
|
sal_uInt16 nNew = nOld & 7; // die drei Abs-Flags
|
2000-09-18 23:16:46 +00:00
|
|
|
nNew = ( nNew - 1 ) & 7; // weiterzaehlen
|
|
|
|
|
|
|
|
if (!(nOld & SCA_TAB_3D))
|
2012-09-08 13:15:19 +02:00
|
|
|
nNew &= ~SCA_TAB_ABSOLUTE; // not 3D -> never absolute!
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
return ( nOld & 0xfff8 ) | nNew;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ScRefFinder::ToggleRel( xub_StrLen nStartPos, xub_StrLen nEndPos )
|
|
|
|
{
|
|
|
|
xub_StrLen nLen = aFormula.Len();
|
|
|
|
if (!nLen)
|
|
|
|
return;
|
2012-09-08 13:15:19 +02:00
|
|
|
const sal_Unicode* pSource = aFormula.GetBuffer(); // for quick access
|
2000-09-18 23:16:46 +00:00
|
|
|
|
2012-09-08 13:15:19 +02:00
|
|
|
// expand selection, and instead of selection start- and end-index
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
if ( nEndPos < nStartPos )
|
2011-04-15 16:25:33 -04:00
|
|
|
::std::swap(nEndPos, nStartPos);
|
|
|
|
|
|
|
|
ExpandToText(pSource, nLen, nStartPos, nEndPos, eConv);
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
String aResult;
|
|
|
|
String aExpr;
|
|
|
|
String aSep;
|
|
|
|
ScAddress aAddr;
|
|
|
|
nFound = 0;
|
|
|
|
|
|
|
|
xub_StrLen nLoopStart = nStartPos;
|
|
|
|
while ( nLoopStart <= nEndPos )
|
|
|
|
{
|
2011-04-15 16:25:33 -04:00
|
|
|
// Determine the stard and end positions of a text segment.
|
|
|
|
xub_StrLen nEStart = FindStartPos(pSource, nLoopStart, nEndPos);
|
|
|
|
xub_StrLen nEEnd = FindEndPos(pSource, nEStart, nEndPos, eConv);
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
aSep = aFormula.Copy( nLoopStart, nEStart-nLoopStart );
|
|
|
|
aExpr = aFormula.Copy( nEStart, nEEnd-nEStart );
|
|
|
|
|
2011-04-15 16:25:33 -04:00
|
|
|
// Check the validity of the expression, and toggle the relative flag.
|
|
|
|
ScAddress::Details aDetails(eConv, maPos.Row(), maPos.Col());
|
|
|
|
sal_uInt16 nResult = aAddr.Parse(aExpr, pDoc, aDetails);
|
2000-09-18 23:16:46 +00:00
|
|
|
if ( nResult & SCA_VALID )
|
|
|
|
{
|
2011-01-17 13:20:22 +01:00
|
|
|
sal_uInt16 nFlags = lcl_NextFlags( nResult );
|
2011-04-15 16:25:33 -04:00
|
|
|
aAddr.Format(aExpr, nFlags, pDoc, aDetails);
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
xub_StrLen nAbsStart = nStartPos+aResult.Len()+aSep.Len();
|
|
|
|
|
2012-09-08 13:15:19 +02:00
|
|
|
if (!nFound) // first reference ?
|
2000-09-18 23:16:46 +00:00
|
|
|
nSelStart = nAbsStart;
|
2012-09-08 13:15:19 +02:00
|
|
|
nSelEnd = nAbsStart+aExpr.Len(); // selection, no indizes
|
2000-09-18 23:16:46 +00:00
|
|
|
++nFound;
|
|
|
|
}
|
|
|
|
|
2012-09-08 13:15:19 +02:00
|
|
|
// assemble
|
2000-09-18 23:16:46 +00:00
|
|
|
|
|
|
|
aResult += aSep;
|
|
|
|
aResult += aExpr;
|
|
|
|
|
|
|
|
nLoopStart = nEEnd;
|
|
|
|
}
|
|
|
|
|
|
|
|
String aTotal = aFormula.Copy( 0, nStartPos );
|
|
|
|
aTotal += aResult;
|
|
|
|
aTotal += aFormula.Copy( nEndPos+1 );
|
|
|
|
|
|
|
|
aFormula = aTotal;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-10-12 15:59:00 +02:00
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|