/************************************************************** * * 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 * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY * KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. * *************************************************************/ #ifndef SC_SEGMENTTREE_HXX #define SC_SEGMENTTREE_HXX #include "address.hxx" #include class ScFlatBoolSegmentsImpl; class ScFlatBoolRowSegments { public: struct RangeData { SCROW mnRow1; SCROW mnRow2; bool mbValue; }; class ForwardIterator { public: explicit ForwardIterator(ScFlatBoolRowSegments& rSegs); bool getValue(SCROW nPos, bool& rVal); SCROW getLastPos() const; private: ScFlatBoolRowSegments& mrSegs; SCROW mnCurPos; SCROW mnLastPos; bool mbCurValue; }; class RangeIterator { public: explicit RangeIterator(ScFlatBoolRowSegments& rSegs); bool getFirst(RangeData& rRange); bool getNext(RangeData& rRange); private: ScFlatBoolRowSegments& mrSegs; }; ScFlatBoolRowSegments(); ScFlatBoolRowSegments(const ScFlatBoolRowSegments& r); ~ScFlatBoolRowSegments(); void setTrue(SCROW nRow1, SCROW nRow2); void setFalse(SCROW nRow1, SCROW nRow2); bool getValue(SCROW nRow); bool getRangeData(SCROW nRow, RangeData& rData); void removeSegment(SCROW nRow1, SCROW nRow2); void insertSegment(SCROW nRow, SCROW nSize, bool bSkipStartBoundary); SCROW findLastNotOf(bool bValue) const; void enableTreeSearch(bool bEnable); void setInsertFromBack(bool bInsertFromBack); private: ::std::auto_ptr mpImpl; }; // ============================================================================ class ScFlatBoolColSegments { public: struct RangeData { SCCOL mnCol1; SCCOL mnCol2; bool mbValue; }; ScFlatBoolColSegments(); ScFlatBoolColSegments(const ScFlatBoolColSegments& r); ~ScFlatBoolColSegments(); void setTrue(SCCOL nCol1, SCCOL nCol2); void setFalse(SCCOL nCol1, SCCOL nCol2); bool getValue(SCCOL nCol); bool getRangeData(SCCOL nCol, RangeData& rData); void removeSegment(SCCOL nCol1, SCCOL nCol2); void insertSegment(SCCOL nCol, SCCOL nSize, bool bSkipStartBoundary); void enableTreeSearch(bool bEnable); void setInsertFromBack(bool bInsertFromBack); private: ::std::auto_ptr mpImpl; }; // ============================================================================ class ScFlatUInt16SegmentsImpl; class ScFlatUInt16RowSegments { public: struct RangeData { SCROW mnRow1; SCROW mnRow2; sal_uInt16 mnValue; }; class ForwardIterator { public: explicit ForwardIterator(ScFlatUInt16RowSegments& rSegs); bool getValue(SCROW nPos, sal_uInt16& rVal); SCROW getLastPos() const; private: ScFlatUInt16RowSegments& mrSegs; SCROW mnCurPos; SCROW mnLastPos; sal_uInt16 mnCurValue; }; ScFlatUInt16RowSegments(sal_uInt16 nDefault); ScFlatUInt16RowSegments(const ScFlatUInt16RowSegments& r); ~ScFlatUInt16RowSegments(); void setValue(SCROW nRow1, SCROW nRow2, sal_uInt16 nValue); sal_uInt16 getValue(SCROW nRow); sal_uInt32 getSumValue(SCROW nRow1, SCROW nRow2); bool getRangeData(SCROW nRow, RangeData& rData); void removeSegment(SCROW nRow1, SCROW nRow2); void insertSegment(SCROW nRow, SCROW nSize, bool bSkipStartBoundary); SCROW findLastNotOf(sal_uInt16 nValue) const; void enableTreeSearch(bool bEnable); void setInsertFromBack(bool bInsertFromBack); private: ::std::auto_ptr mpImpl; }; #endif