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
|
/* -*- 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 SC_JUMPMATRIX_HXX
#define SC_JUMPMATRIX_HXX
#include "formula/token.hxx"
#include "formula/errorcodes.hxx"
#include <tools/solar.h>
#include <vector>
#include "types.hxx"
#include "address.hxx"
typedef ::std::vector< formula::FormulaToken*> ScTokenVec;
struct ScJumpMatrixEntry
{
double fBool; // 0:= false 1:= true also if no-path
// other values may contain error conditions like NAN and INF
short nStart; // start of path (actually start-1, see formula::FormulaTokenIterator)
short nNext; // next after path
// jump path exists if nStart != nNext, else no path
short nStop; // optional stop of path (nPC < nStop)
void SetJump( double fBoolP, short nStartP, short nNextP, short nStopP )
{
fBool = fBoolP;
nStart = nStartP;
nNext = nNextP;
nStop = nStopP;
}
void GetJump( double& rBool, short& rStart, short& rNext, short& rStop )
{
rBool = fBool;
rStart = nStart;
rNext = nNext;
rStop = nStop;
}
};
class ScJumpMatrix
{
ScJumpMatrixEntry* pJump; // the jumps
ScMatrixRef pMat; // the results
ScTokenVec* pParams; // parameter stack
SCSIZE nCols;
SCSIZE nRows;
SCSIZE nCurCol;
SCSIZE nCurRow;
SCSIZE nResMatCols;
SCSIZE nResMatRows;
bool bStarted;
// not implemented, prevent usage
ScJumpMatrix( const ScJumpMatrix& );
ScJumpMatrix& operator=( const ScJumpMatrix& );
public:
ScJumpMatrix( SCSIZE nColsP, SCSIZE nRowsP );
~ScJumpMatrix();
void GetDimensions( SCSIZE& rCols, SCSIZE& rRows ) const;
void SetJump( SCSIZE nCol, SCSIZE nRow, double fBool, short nStart, short nNext, short nStop = SHRT_MAX );
void GetJump( SCSIZE nCol, SCSIZE nRow, double& rBool, short& rStart, short& rNext, short& rStop ) const;
void SetAllJumps( double fBool, short nStart, short nNext, short nStop = SHRT_MAX );
void SetJumpParameters( ScTokenVec* p );
const ScTokenVec* GetJumpParameters() const;
ScMatrix* GetResultMatrix() const;
void GetPos( SCSIZE& rCol, SCSIZE& rRow ) const;
bool Next( SCSIZE& rCol, SCSIZE& rRow );
void GetResMatDimensions( SCSIZE& rCols, SCSIZE& rRows );
void SetNewResMat( SCSIZE nNewCols, SCSIZE nNewRows );
};
#endif // SC_JUMPMATRIX_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|