/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /************************************************************************* * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * Copyright 2000, 2010 Oracle and/or its affiliates. * * OpenOffice.org - a multi-platform office productivity suite * * This file is part of OpenOffice.org. * * 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. * * 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). * * You should have received a copy of the GNU Lesser General Public License * version 3 along with OpenOffice.org. If not, see * * for a copy of the LGPLv3 License. * ************************************************************************/ #ifndef SC_DOCITER_HXX #define SC_DOCITER_HXX #include "address.hxx" #include #include "global.hxx" #include "scdllapi.h" #include "queryparam.hxx" #include #include #include #include class ScDocument; class ScBaseCell; class ScPatternAttr; class ScAttrArray; class ScAttrIterator; class ScRange; class ScFlatBoolRowSegments; class ScDocumentIterator // walk through all non-empty cells { private: ScDocument* pDoc; SCTAB nStartTab; SCTAB nEndTab; const ScPatternAttr* pDefPattern; SCCOL nCol; SCROW nRow; SCTAB nTab; ScBaseCell* pCell; const ScPatternAttr* pPattern; SCSIZE nColPos; SCSIZE nAttrPos; BOOL GetThis(); BOOL GetThisCol(); public: ScDocumentIterator( ScDocument* pDocument, SCTAB nStartTable, SCTAB nEndTable ); ~ScDocumentIterator(); BOOL GetFirst(); BOOL GetNext(); ScBaseCell* GetCell(); const ScPatternAttr* GetPattern(); void GetPos( SCCOL& rCol, SCROW& rRow, SCTAB& rTab ); }; class ScValueIterator // walk through all values in an area { private: double fNextValue; ScDocument* pDoc; const ScAttrArray* pAttrArray; ULONG nNumFormat; // for CalcAsShown ULONG nNumFmtIndex; SCCOL nStartCol; SCROW nStartRow; SCTAB nStartTab; SCCOL nEndCol; SCROW nEndRow; SCTAB nEndTab; SCCOL nCol; SCROW nRow; SCTAB nTab; SCSIZE nColRow; SCROW nNextRow; SCROW nAttrEndRow; short nNumFmtType; BOOL bNumValid; BOOL bSubTotal; BOOL bNextValid; BOOL bCalcAsShown; BOOL bTextAsZero; BOOL GetThis(double& rValue, USHORT& rErr); public: ScValueIterator(ScDocument* pDocument, const ScRange& rRange, BOOL bSTotal = FALSE, BOOL bTextAsZero = FALSE ); void GetCurNumFmtInfo( short& nType, ULONG& nIndex ); /// Does NOT reset rValue if no value found! BOOL GetFirst(double& rValue, USHORT& rErr); /// Does NOT reset rValue if no value found! BOOL GetNext(double& rValue, USHORT& rErr) { return bNextValid ? ( bNextValid = FALSE, rValue = fNextValue, rErr = 0, nRow = nNextRow, ++nColRow, bNumValid = FALSE, TRUE ) : ( ++nRow, GetThis(rValue, rErr) ); } }; class ScDBQueryDataIterator { public: struct Value { ::rtl::OUString maString; double mfValue; sal_uInt16 mnError; bool mbIsNumber; Value(); }; private: static SCROW GetRowByColEntryIndex(ScDocument& rDoc, SCTAB nTab, SCCOL nCol, SCSIZE nColRow); static ScBaseCell* GetCellByColEntryIndex(ScDocument& rDoc, SCTAB nTab, SCCOL nCol, SCSIZE nColRow); static ScAttrArray* GetAttrArrayByCol(ScDocument& rDoc, SCTAB nTab, SCCOL nCol); static bool IsQueryValid(ScDocument& rDoc, const ScQueryParam& rParam, SCTAB nTab, SCROW nRow, ScBaseCell* pCell); static SCSIZE SearchColEntryIndex(ScDocument& rDoc, SCTAB nTab, SCROW nRow, SCCOL nCol); class DataAccess { public: DataAccess(const ScDBQueryDataIterator* pParent); virtual ~DataAccess() = 0; virtual bool getCurrent(Value& rValue) = 0; virtual bool getFirst(Value& rValue) = 0; virtual bool getNext(Value& rValue) = 0; protected: const ScDBQueryDataIterator* mpParent; }; class DataAccessInternal : public DataAccess { public: DataAccessInternal(const ScDBQueryDataIterator* pParent, ScDBQueryParamInternal* pParam, ScDocument* pDoc); virtual ~DataAccessInternal(); virtual bool getCurrent(Value& rValue); virtual bool getFirst(Value& rValue); virtual bool getNext(Value& rValue); private: ScDBQueryParamInternal* mpParam; ScDocument* mpDoc; const ScAttrArray* pAttrArray; ULONG nNumFormat; // for CalcAsShown ULONG nNumFmtIndex; SCCOL nCol; SCROW nRow; SCSIZE nColRow; SCROW nAttrEndRow; SCTAB nTab; short nNumFmtType; bool bCalcAsShown; }; class DataAccessMatrix : public DataAccess { public: DataAccessMatrix(const ScDBQueryDataIterator* pParent, ScDBQueryParamMatrix* pParam); virtual ~DataAccessMatrix(); virtual bool getCurrent(Value& rValue); virtual bool getFirst(Value& rValue); virtual bool getNext(Value& rValue); private: bool isValidQuery(SCROW mnRow, const ScMatrix& rMat) const; ScDBQueryParamMatrix* mpParam; SCROW mnCurRow; SCROW mnRows; SCCOL mnCols; }; ::std::auto_ptr mpParam; ::std::auto_ptr mpData; public: ScDBQueryDataIterator(ScDocument* pDocument, ScDBQueryParamBase* pParam); /// Does NOT reset rValue if no value found! bool GetFirst(Value& rValue); /// Does NOT reset rValue if no value found! bool GetNext(Value& rValue); }; class ScCellIterator // walk through all cells in an area { // for SubTotal no hidden and no sub-total lines private: ScDocument* pDoc; SCCOL nStartCol; SCROW nStartRow; SCTAB nStartTab; SCCOL nEndCol; SCROW nEndRow; SCTAB nEndTab; SCCOL nCol; SCROW nRow; SCTAB nTab; SCSIZE nColRow; BOOL bSubTotal; ScBaseCell* GetThis(); public: ScCellIterator(ScDocument* pDocument, SCCOL nSCol, SCROW nSRow, SCTAB nSTab, SCCOL nECol, SCROW nERow, SCTAB nETab, BOOL bSTotal = FALSE); ScCellIterator(ScDocument* pDocument, const ScRange& rRange, BOOL bSTotal = FALSE); ScBaseCell* GetFirst(); ScBaseCell* GetNext(); SCCOL GetCol() const { return nCol; } SCROW GetRow() const { return nRow; } SCTAB GetTab() const { return nTab; } ScAddress GetPos() const { return ScAddress( nCol, nRow, nTab ); } }; class ScQueryCellIterator // walk through all non-empty cells in an area { enum StopOnMismatchBits { nStopOnMismatchDisabled = 0x00, nStopOnMismatchEnabled = 0x01, nStopOnMismatchOccurred = 0x02, nStopOnMismatchExecuted = nStopOnMismatchEnabled | nStopOnMismatchOccurred }; enum TestEqualConditionBits { nTestEqualConditionDisabled = 0x00, nTestEqualConditionEnabled = 0x01, nTestEqualConditionMatched = 0x02, nTestEqualConditionFulfilled = nTestEqualConditionEnabled | nTestEqualConditionMatched }; private: ScQueryParam aParam; ScDocument* pDoc; const ScAttrArray* pAttrArray; ULONG nNumFormat; SCTAB nTab; SCCOL nCol; SCROW nRow; SCSIZE nColRow; SCROW nAttrEndRow; BYTE nStopOnMismatch; BYTE nTestEqualCondition; BOOL bAdvanceQuery; BOOL bIgnoreMismatchOnLeadingStrings; ScBaseCell* GetThis(); /* Only works if no regular expression is involved, only searches for rows in one column, and only the first query entry is considered with simple conditions SC_LESS_EQUAL (sorted ascending) or SC_GREATER_EQUAL (sorted descending). Check these things before invocation! Delivers a starting point, continue with GetThis() and GetNext() afterwards. Introduced for FindEqualOrSortedLastInRange() */ ScBaseCell* BinarySearch(); public: ScQueryCellIterator(ScDocument* pDocument, SCTAB nTable, const ScQueryParam& aParam, BOOL bMod = TRUE); // for bMod = FALSE the QueryParam has to be filled // (bIsString) ScBaseCell* GetFirst(); ScBaseCell* GetNext(); SCCOL GetCol() { return nCol; } SCROW GetRow() { return nRow; } // increments all Entry.nField, if column // changes, for ScInterpreter ScHLookup() void SetAdvanceQueryParamEntryField( BOOL bVal ) { bAdvanceQuery = bVal; } void AdvanceQueryParamEntryField(); /** If set, iterator stops on first non-matching cell content. May be used in SC_LESS_EQUAL queries where a cell range is assumed to be sorted; stops on first value being greater than the queried value and GetFirst()/GetNext() return NULL. StoppedOnMismatch() returns TRUE then. However, the iterator's conditions are not set to end all queries, GetCol() and GetRow() return values for the non-matching cell, further GetNext() calls may be executed. */ void SetStopOnMismatch( BOOL bVal ) { nStopOnMismatch = sal::static_int_cast(bVal ? nStopOnMismatchEnabled : nStopOnMismatchDisabled); } BOOL StoppedOnMismatch() const { return nStopOnMismatch == nStopOnMismatchExecuted; } /** If set, an additional test for SC_EQUAL condition is executed in ScTable::ValidQuery() if SC_LESS_EQUAL or SC_GREATER_EQUAL conditions are to be tested. May be used where a cell range is assumed to be sorted to stop if an equal match is found. */ void SetTestEqualCondition( BOOL bVal ) { nTestEqualCondition = sal::static_int_cast(bVal ? nTestEqualConditionEnabled : nTestEqualConditionDisabled); } BOOL IsEqualConditionFulfilled() const { return nTestEqualCondition == nTestEqualConditionFulfilled; } /** In a range assumed to be sorted find either the last of a sequence of equal entries or the last being less than (or greater than) the queried value. Used by the interpreter for [HV]?LOOKUP() and MATCH(). Column and row position of the found entry are returned, otherwise invalid. @param bSearchForEqualAfterMismatch Continue searching for an equal entry even if the last entry matching the range was found, in case the data is not sorted. Is always done if regular expressions are involved. @param bIgnoreMismatchOnLeadingStrings Normally strings are sorted behind numerical values. If this parameter is TRUE, the search does not stop when encountering a string and does not assume that no values follow anymore. If querying for a string a mismatch on the first entry, e.g. column header, is ignored. @ATTENTION! StopOnMismatch, TestEqualCondition and the internal IgnoreMismatchOnLeadingStrings and query params are in an undefined state upon return! The iterator is not usable anymore except for obtaining the number format! */ BOOL FindEqualOrSortedLastInRange( SCCOL& nFoundCol, SCROW& nFoundRow, BOOL bSearchForEqualAfterMismatch = FALSE, BOOL bIgnoreMismatchOnLeadingStrings = TRUE ); }; class ScDocAttrIterator // all attribute areas { private: ScDocument* pDoc; SCTAB nTab; SCCOL nEndCol; SCROW nStartRow; SCROW nEndRow; SCCOL nCol; ScAttrIterator* pColIter; public: ScDocAttrIterator(ScDocument* pDocument, SCTAB nTable, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2); ~ScDocAttrIterator(); const ScPatternAttr* GetNext( SCCOL& rCol, SCROW& rRow1, SCROW& rRow2 ); }; class ScAttrRectIterator // all attribute areas, including areas stretching // across more then one column { private: ScDocument* pDoc; SCTAB nTab; SCCOL nEndCol; SCROW nStartRow; SCROW nEndRow; SCCOL nIterStartCol; SCCOL nIterEndCol; ScAttrIterator* pColIter; public: ScAttrRectIterator(ScDocument* pDocument, SCTAB nTable, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2); ~ScAttrRectIterator(); void DataChanged(); const ScPatternAttr* GetNext( SCCOL& rCol1, SCCOL& rCol2, SCROW& rRow1, SCROW& rRow2 ); }; class ScHorizontalCellIterator // walk through all non empty cells in an area { // row by row private: ScDocument* pDoc; SCTAB nTab; SCCOL nStartCol; SCCOL nEndCol; SCROW nEndRow; SCROW* pNextRows; SCSIZE* pNextIndices; SCCOL nCol; SCROW nRow; BOOL bMore; public: ScHorizontalCellIterator(ScDocument* pDocument, SCTAB nTable, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2); ~ScHorizontalCellIterator(); ScBaseCell* GetNext( SCCOL& rCol, SCROW& rRow ); BOOL ReturnNext( SCCOL& rCol, SCROW& rRow ); private: void Advance(); }; // // returns all areas with non-default formatting (horizontal) // class ScHorizontalAttrIterator { private: ScDocument* pDoc; SCTAB nTab; SCCOL nStartCol; SCROW nStartRow; SCCOL nEndCol; SCROW nEndRow; SCROW* pNextEnd; SCSIZE* pIndices; const ScPatternAttr** ppPatterns; SCCOL nCol; SCROW nRow; BOOL bRowEmpty; public: ScHorizontalAttrIterator( ScDocument* pDocument, SCTAB nTable, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2 ); ~ScHorizontalAttrIterator(); const ScPatternAttr* GetNext( SCCOL& rCol1, SCCOL& rCol2, SCROW& rRow ); }; // // returns non-empty cells and areas with formatting (horizontal) // class SC_DLLPUBLIC ScUsedAreaIterator { private: ScHorizontalCellIterator aCellIter; ScHorizontalAttrIterator aAttrIter; SCCOL nNextCol; SCROW nNextRow; SCCOL nCellCol; SCROW nCellRow; const ScBaseCell* pCell; SCCOL nAttrCol1; SCCOL nAttrCol2; SCROW nAttrRow; const ScPatternAttr* pPattern; SCCOL nFoundStartCol; // results after GetNext SCCOL nFoundEndCol; SCROW nFoundRow; const ScPatternAttr* pFoundPattern; const ScBaseCell* pFoundCell; public: ScUsedAreaIterator( ScDocument* pDocument, SCTAB nTable, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2 ); ~ScUsedAreaIterator(); BOOL GetNext(); SCCOL GetStartCol() const { return nFoundStartCol; } SCCOL GetEndCol() const { return nFoundEndCol; } SCROW GetRow() const { return nFoundRow; } const ScPatternAttr* GetPattern() const { return pFoundPattern; } const ScBaseCell* GetCell() const { return pFoundCell; } }; class ScRowBreakIterator { public: static SCROW NOT_FOUND; explicit ScRowBreakIterator(::std::set& rBreaks); SCROW first(); SCROW next(); private: ::std::set& mrBreaks; ::std::set::const_iterator maItr; ::std::set::const_iterator maEnd; }; class ScDocRowHeightUpdater { public: struct TabRanges { SCTAB mnTab; ::boost::shared_ptr mpRanges; TabRanges(); TabRanges(SCTAB nTab); }; /** * Passing a NULL pointer to pTabRangesArray forces the heights of all * rows in all tables to be updated. */ explicit ScDocRowHeightUpdater( ScDocument& rDoc, OutputDevice* pOutDev, double fPPTX, double fPPTY, const ::std::vector* pTabRangesArray = NULL); void update(); private: void updateAll(); private: ScDocument& mrDoc; OutputDevice* mpOutDev; double mfPPTX; double mfPPTY; const ::std::vector* mpTabRangesArray; }; #endif /* vim:set shiftwidth=4 softtabstop=4 expandtab: */