1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/* -*- 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: */
|
