2010-10-14 08:30:41 +02:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2000-09-18 16:15:01 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2008-04-10 09:51:29 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2010-02-12 15:01:35 +01:00
|
|
|
* Copyright 2000, 2010 Oracle and/or its affiliates.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:51:29 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:51:29 +00:00
|
|
|
* This file is part of OpenOffice.org.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:51:29 +00:00
|
|
|
* 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.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:51:29 +00:00
|
|
|
* 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).
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:51:29 +00:00
|
|
|
* 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.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
|
|
|
#ifndef _CELLFML_HXX
|
|
|
|
#define _CELLFML_HXX
|
|
|
|
|
|
|
|
#include <tools/string.hxx>
|
|
|
|
|
|
|
|
class SwTable;
|
|
|
|
class SwNode;
|
|
|
|
class SwTableSortBoxes;
|
|
|
|
class SwSelBoxes;
|
|
|
|
class SwCalc;
|
|
|
|
class SwTableBox;
|
|
|
|
class SwTableFmlUpdate;
|
2007-09-27 06:56:52 +00:00
|
|
|
class SwDoc;
|
|
|
|
class String;
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
class SwTblCalcPara
|
|
|
|
{
|
|
|
|
const SwTableBox* pLastTblBox;
|
2011-01-17 15:06:54 +01:00
|
|
|
sal_uInt16 nStackCnt, nMaxSize;
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
public:
|
2012-07-22 11:29:48 +03:00
|
|
|
SwTableSortBoxes *pBoxStk; ///< stack for recognizing recursion
|
|
|
|
SwCalc& rCalc; ///< current Calculator
|
|
|
|
const SwTable* pTbl; ///< current table
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
SwTblCalcPara( SwCalc& rCalculator, const SwTable& rTable );
|
|
|
|
~SwTblCalcPara();
|
|
|
|
|
2011-01-17 15:06:54 +01:00
|
|
|
sal_Bool CalcWithStackOverflow();
|
|
|
|
sal_Bool IsStackOverFlow() const { return nMaxSize == nStackCnt; }
|
|
|
|
sal_Bool IncStackCnt() { return nMaxSize == ++nStackCnt; }
|
2000-09-18 16:15:01 +00:00
|
|
|
void DecStackCnt() { if( nStackCnt ) --nStackCnt; }
|
|
|
|
void SetLastTblBox( const SwTableBox* pBox ) { pLastTblBox = pBox; }
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
class SwTableFormula
|
|
|
|
{
|
|
|
|
typedef void (SwTableFormula:: *FnScanFormel)( const SwTable&, String&,
|
|
|
|
String&, String*, void* ) const;
|
|
|
|
|
|
|
|
void BoxNmsToPtr( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void PtrToBoxNms( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void RelNmsToBoxNms( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void RelBoxNmsToPtr( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void BoxNmsToRelNm( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
2012-06-30 23:49:55 +02:00
|
|
|
void _MakeFormula( const SwTable&, String&, String&, String* = 0,
|
2000-09-18 16:15:01 +00:00
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void _GetFmlBoxes( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void _HasValidBoxes( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
void _SplitMergeBoxNm( const SwTable&, String&, String&, String* = 0,
|
|
|
|
void* pPara = 0 ) const;
|
|
|
|
|
|
|
|
void GetBoxes( const SwTableBox& rStt, const SwTableBox& rEnd,
|
|
|
|
SwSelBoxes& rBoxes ) const;
|
|
|
|
String ScanString( FnScanFormel fnFormel, const SwTable& rTbl,
|
|
|
|
void* = 0 ) const;
|
|
|
|
|
|
|
|
const SwTable* FindTable( SwDoc& rDoc, const String& rNm ) const;
|
|
|
|
|
|
|
|
protected:
|
|
|
|
enum NameType { EXTRNL_NAME, INTRNL_NAME, REL_NAME };
|
|
|
|
|
2012-07-22 11:29:48 +03:00
|
|
|
String sFormel; ///< current formula
|
|
|
|
NameType eNmType; ///< current display method
|
2012-11-17 19:04:02 +09:00
|
|
|
bool bValidValue; ///< true: recalculate formula
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2010-11-15 23:37:49 +01:00
|
|
|
// find the node in which the formula is located
|
2000-09-18 16:15:01 +00:00
|
|
|
// TextFeld -> TextNode,
|
|
|
|
// BoxAttribut -> BoxStartNode
|
2010-11-15 23:37:49 +01:00
|
|
|
// !!! has to be overloaded by every derivation !!!
|
2000-09-18 16:15:01 +00:00
|
|
|
virtual const SwNode* GetNodeOfFormula() const = 0;
|
|
|
|
|
|
|
|
SwTableFormula( const String& rFormel );
|
|
|
|
|
2012-06-30 23:49:55 +02:00
|
|
|
String MakeFormula( SwTblCalcPara& rCalcPara ) const
|
2000-09-18 16:15:01 +00:00
|
|
|
{
|
2012-06-30 23:49:55 +02:00
|
|
|
return ScanString( &SwTableFormula::_MakeFormula,
|
2000-09-18 16:15:01 +00:00
|
|
|
*rCalcPara.pTbl, &rCalcPara );
|
|
|
|
}
|
|
|
|
|
2011-01-17 15:06:54 +01:00
|
|
|
static sal_uInt16 GetLnPosInTbl( const SwTable& rTbl, const SwTableBox* pBox );
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
SwTableFormula( const SwTableFormula& rCpy ) { *this = rCpy; }
|
2004-01-13 15:31:58 +00:00
|
|
|
virtual ~SwTableFormula();
|
2000-09-18 16:15:01 +00:00
|
|
|
SwTableFormula& operator=( const SwTableFormula& rCpy )
|
|
|
|
{
|
|
|
|
sFormel = rCpy.sFormel;
|
|
|
|
eNmType = rCpy.eNmType;
|
|
|
|
bValidValue = rCpy.bValidValue;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2012-07-22 11:29:48 +03:00
|
|
|
/// create from the internal formula (for CORE) the external formula (for UI)
|
2000-09-18 16:15:01 +00:00
|
|
|
void PtrToBoxNm( const SwTable* pTbl );
|
2012-07-22 11:29:48 +03:00
|
|
|
/// create from the external formula the internal
|
2000-09-18 16:15:01 +00:00
|
|
|
void BoxNmToPtr( const SwTable* pTbl );
|
2012-07-22 11:29:48 +03:00
|
|
|
/// create from the external/internal formula the relative formula
|
2000-09-18 16:15:01 +00:00
|
|
|
void ToRelBoxNm( const SwTable* pTbl );
|
2012-07-22 11:29:48 +03:00
|
|
|
/// gets called before/after merging/splitting of tables
|
2000-09-18 16:15:01 +00:00
|
|
|
void ToSplitMergeBoxNm( SwTableFmlUpdate& rTblUpd );
|
|
|
|
|
2010-09-30 18:29:08 +02:00
|
|
|
bool IsIntrnlName() const { return eNmType == INTRNL_NAME; }
|
2000-09-18 16:15:01 +00:00
|
|
|
NameType GetNameType() const { return eNmType; }
|
|
|
|
|
2010-09-30 18:29:08 +02:00
|
|
|
bool IsValid() const { return bValidValue; }
|
|
|
|
inline void ChgValid( bool bNew ) { bValidValue = bNew; }
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
const String& GetFormula() const { return sFormel; }
|
|
|
|
void SetFormula( const String& rNew )
|
|
|
|
{
|
|
|
|
sFormel = rNew;
|
2010-09-30 18:29:08 +02:00
|
|
|
bValidValue = false;
|
2000-09-18 16:15:01 +00:00
|
|
|
eNmType = EXTRNL_NAME;
|
|
|
|
}
|
|
|
|
|
2012-09-21 15:18:23 +02:00
|
|
|
void GetBoxesOfFormula(const SwTable& rTbl, SwSelBoxes& rBoxes);
|
2010-11-15 23:37:49 +01:00
|
|
|
// are all boxes valid which this formula relies on?
|
2010-09-30 18:29:08 +02:00
|
|
|
bool HasValidBoxes() const;
|
2000-09-18 16:15:01 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|
2010-10-14 08:30:41 +02:00
|
|
|
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|