diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 09:06:44 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-07 09:06:44 +0000 |
commit | ed5640d8b587fbcfed7dd7967f3de04b37a76f26 (patch) | |
tree | 7a5f7c6c9d02226d7471cb3cc8fbbf631b415303 /sc/source/core/inc/jumpmatrix.hxx | |
parent | Initial commit. (diff) | |
download | libreoffice-upstream.tar.xz libreoffice-upstream.zip |
Adding upstream version 4:7.4.7.upstream/4%7.4.7upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'sc/source/core/inc/jumpmatrix.hxx')
-rw-r--r-- | sc/source/core/inc/jumpmatrix.hxx | 122 |
1 files changed, 122 insertions, 0 deletions
diff --git a/sc/source/core/inc/jumpmatrix.hxx b/sc/source/core/inc/jumpmatrix.hxx new file mode 100644 index 000000000..f0fb9c1ab --- /dev/null +++ b/sc/source/core/inc/jumpmatrix.hxx @@ -0,0 +1,122 @@ +/* -*- 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 . + */ + +#pragma once + +#include <limits.h> +#include <vector> +#include <types.hxx> +#include <address.hxx> +#include <token.hxx> + +namespace formula { class FormulaToken; } + +typedef ::std::vector< const 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 ) const + { + rBool = fBool; + rStart = nStart; + rNext = nNext; + rStop = nStop; + } +}; + +class ScJumpMatrix +{ + std::vector<ScJumpMatrixEntry> mvJump; // the jumps + ScMatrixRef pMat; // the results + ScRefList mvRefList; // array of references result, if any + ScTokenVec mvParams; // parameter stack + SCSIZE nCols; + SCSIZE nRows; + SCSIZE nCurCol; + SCSIZE nCurRow; + SCSIZE nResMatCols; + SCSIZE nResMatRows; + OpCode meOp; + bool bStarted; + + // Buffer result ranges to be able to set a range of identically typed + // values at the result matrix in order to avoid multiple shrinks and + // growths of multi_type_vector segments, which is a major performance + // bottleneck, see fdo#72929 + ::std::vector< svl::SharedString > mvBufferStrings; + ::std::vector< double > mvBufferDoubles; + SCSIZE mnBufferCol; + SCSIZE mnBufferRowStart; + SCSIZE mnBufferEmptyCount; + SCSIZE mnBufferEmptyPathCount; + + enum BufferType + { + BUFFER_NONE, + BUFFER_DOUBLE, + BUFFER_STRING, + BUFFER_EMPTY, + BUFFER_EMPTYPATH + }; + + /** Flush different types or non-consecutive buffers. */ + void FlushBufferOtherThan( BufferType eType, SCSIZE nC, SCSIZE nR ); + + ScJumpMatrix( const ScJumpMatrix& ) = delete; + ScJumpMatrix& operator=( const ScJumpMatrix& ) = delete; + +public: + ScJumpMatrix( OpCode eOp, SCSIZE nColsP, SCSIZE nRowsP ); + ~ScJumpMatrix(); + void GetDimensions( SCSIZE& rCols, SCSIZE& rRows ) const; + void SetJump( SCSIZE nCol, SCSIZE nRow, double fBool, short nStart, short nNext ); + 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 { return mvParams;} + bool HasResultMatrix() const; + ScMatrix* GetResultMatrix(); ///< also applies pending buffered values + 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 ); + ScRefList& GetRefList(); + OpCode GetOpCode() const { return meOp; } + + void PutResultDouble( double fVal, SCSIZE nC, SCSIZE nR ); + void PutResultString( const svl::SharedString& rStr, SCSIZE nC, SCSIZE nR ); + void PutResultEmpty( SCSIZE nC, SCSIZE nR ); + void PutResultEmptyPath( SCSIZE nC, SCSIZE nR ); +}; + +/* vim:set shiftwidth=4 softtabstop=4 expandtab: */ |