Files
libreoffice/sw/inc/cellfml.hxx
Christian Lohmaier ab465b90f6 bin/rename-sw-abbreviations.sh
renames the most annoying abbreviations in Writer (and partially
in the shared code too).

Change-Id: I9a62759138126c1537cc5c985ba05cf54d6132d9
2015-05-20 13:05:49 +02:00

151 lines
5.7 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 .
*/
#ifndef INCLUDED_SW_INC_CELLFML_HXX
#define INCLUDED_SW_INC_CELLFML_HXX
#include <rtl/ustring.hxx>
class SwTable;
class SwNode;
class SwTableSortBoxes;
class SwSelBoxes;
class SwCalc;
class SwTableBox;
class SwTableFormulaUpdate;
class SwDoc;
class SwTableCalcPara
{
const SwTableBox* pLastTableBox;
sal_uInt16 nStackCnt, nMaxSize;
public:
SwTableSortBoxes *pBoxStk; ///< stack for recognizing recursion
SwCalc& rCalc; ///< current Calculator
const SwTable* pTable; ///< current table
SwTableCalcPara( SwCalc& rCalculator, const SwTable& rTable );
~SwTableCalcPara();
bool CalcWithStackOverflow();
bool IsStackOverflow() const { return nMaxSize == nStackCnt; }
bool IncStackCnt() { return nMaxSize == ++nStackCnt; }
void DecStackCnt() { if( nStackCnt ) --nStackCnt; }
void SetLastTableBox( const SwTableBox* pBox ) { pLastTableBox = pBox; }
};
class SwTableFormula
{
typedef void (SwTableFormula:: *FnScanFormula)( const SwTable&, OUString&,
OUString&, OUString*, void* ) const;
void BoxNmsToPtr( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void PtrToBoxNms( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void RelNmsToBoxNms( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void RelBoxNmsToPtr( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void BoxNmsToRelNm( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void _MakeFormula( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void _GetFormulaBoxes( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void _HasValidBoxes( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
void _SplitMergeBoxNm( const SwTable&, OUString&, OUString&, OUString* = 0,
void* pPara = 0 ) const;
static void GetBoxes( const SwTableBox& rStt, const SwTableBox& rEnd,
SwSelBoxes& rBoxes );
OUString ScanString( FnScanFormula fnFormula, const SwTable& rTable,
void* = 0 ) const;
static const SwTable* FindTable( SwDoc& rDoc, const OUString& rNm );
protected:
enum NameType { EXTRNL_NAME, INTRNL_NAME, REL_NAME };
OUString m_sFormula; ///< current formula
NameType m_eNmType; ///< current display method
bool m_bValidValue; ///< true: recalculate formula
// find the node in which the formula is located
// TextFeld -> TextNode,
// BoxAttribut -> BoxStartNode
// !!! every derived class must override this !!!
virtual const SwNode* GetNodeOfFormula() const = 0;
SwTableFormula( const OUString& rFormula );
OUString MakeFormula( SwTableCalcPara& rCalcPara ) const
{
return ScanString( &SwTableFormula::_MakeFormula,
*rCalcPara.pTable, &rCalcPara );
}
static sal_uInt16 GetLnPosInTable( const SwTable& rTable, const SwTableBox* pBox );
public:
SwTableFormula( const SwTableFormula& rCpy ) { *this = rCpy; }
virtual ~SwTableFormula();
SwTableFormula& operator=( const SwTableFormula& rCpy )
{
m_sFormula = rCpy.m_sFormula;
m_eNmType = rCpy.m_eNmType;
m_bValidValue = rCpy.m_bValidValue;
return *this;
}
/// create from the internal formula (for CORE) the external formula (for UI)
void PtrToBoxNm( const SwTable* pTable );
/// create from the external formula the internal
void BoxNmToPtr( const SwTable* pTable );
/// create from the external/internal formula the relative formula
void ToRelBoxNm( const SwTable* pTable );
/// gets called before/after merging/splitting of tables
void ToSplitMergeBoxNm( SwTableFormulaUpdate& rTableUpd );
bool IsIntrnlName() const { return m_eNmType == INTRNL_NAME; }
NameType GetNameType() const { return m_eNmType; }
bool IsValid() const { return m_bValidValue; }
void ChgValid( bool bNew ) { m_bValidValue = bNew; }
OUString GetFormula() const { return m_sFormula; }
void SetFormula( const OUString& rNew )
{
m_sFormula = rNew;
m_eNmType = EXTRNL_NAME;
m_bValidValue = false;
}
void GetBoxesOfFormula(const SwTable& rTable, SwSelBoxes& rBoxes);
// are all boxes valid which this formula relies on?
bool HasValidBoxes() const;
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */