Bump version to 4.3-4
[LibreOffice.git] / sc / inc / attarray.hxx
blob9b6464b3724746f0b7fa4e5313f0ad7cb3efc8f8
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
20 #ifndef INCLUDED_SC_INC_ATTARRAY_HXX
21 #define INCLUDED_SC_INC_ATTARRAY_HXX
23 #include "global.hxx"
24 #include "attrib.hxx"
26 class ScDocument;
27 class ScEditDataArray;
28 class ScMarkArray;
29 class ScPatternAttr;
30 class ScStyleSheet;
31 class ScFlatBoolRowSegments;
33 class SfxItemPoolCache;
34 class SfxStyleSheetBase;
35 class SvxBoxItem;
36 class SvxBoxInfoItem;
38 namespace editeng { class SvxBorderLine; }
40 #define SC_LINE_EMPTY 0
41 #define SC_LINE_SET 1
42 #define SC_LINE_DONTCARE 2
44 #define SC_ATTRARRAY_DELTA 4
46 struct ScLineFlags
48 sal_uInt8 nLeft;
49 sal_uInt8 nRight;
50 sal_uInt8 nTop;
51 sal_uInt8 nBottom;
52 sal_uInt8 nHori;
53 sal_uInt8 nVert;
55 ScLineFlags() : nLeft(SC_LINE_EMPTY),nRight(SC_LINE_EMPTY),nTop(SC_LINE_EMPTY),
56 nBottom(SC_LINE_EMPTY),nHori(SC_LINE_EMPTY),nVert(SC_LINE_EMPTY) {}
59 struct ScMergePatternState
61 SfxItemSet* pItemSet; ///< allocated in MergePatternArea, used for resulting ScPatternAttr
62 const ScPatternAttr* pOld1; ///< existing objects, temporary
63 const ScPatternAttr* pOld2;
65 ScMergePatternState() : pItemSet(NULL), pOld1(NULL), pOld2(NULL) {}
68 struct ScAttrEntry
70 SCROW nRow;
71 const ScPatternAttr* pPattern;
74 class ScAttrArray
76 private:
77 SCCOL nCol;
78 SCTAB nTab;
79 ScDocument* pDocument;
81 SCSIZE nCount;
82 SCSIZE nLimit;
83 ScAttrEntry* pData;
85 friend class ScDocument; // for FillInfo
86 friend class ScDocumentIterator;
87 friend class ScAttrIterator;
88 friend class ScHorizontalAttrIterator;
90 bool ApplyFrame( const SvxBoxItem* pLineOuter, const SvxBoxInfoItem* pLineInner,
91 SCROW nStartRow, SCROW nEndRow,
92 bool bLeft, SCCOL nDistRight, bool bTop, SCROW nDistBottom );
94 void RemoveCellCharAttribs( SCROW nStartRow, SCROW nEndRow,
95 const ScPatternAttr* pPattern, ScEditDataArray* pDataArray );
97 // prevent the copy c'tor and operator=
98 // this is just to prevent accidental use
99 ScAttrArray(const ScAttrArray&);
100 ScAttrArray& operator=(const ScAttrArray&);
102 public:
103 ScAttrArray( SCCOL nNewCol, SCTAB nNewTab, ScDocument* pDoc );
104 ~ScAttrArray();
106 void SetTab(SCTAB nNewTab) { nTab = nNewTab; }
107 void SetCol(SCCOL nNewCol) { nCol = nNewCol; }
108 #if OSL_DEBUG_LEVEL > 1
109 void TestData() const;
110 #endif
111 void Reset( const ScPatternAttr* pPattern);
112 bool Concat(SCSIZE nPos);
114 const ScPatternAttr* GetPattern( SCROW nRow ) const;
115 const ScPatternAttr* GetPatternRange( SCROW& rStartRow, SCROW& rEndRow, SCROW nRow ) const;
116 void MergePatternArea( SCROW nStartRow, SCROW nEndRow, ScMergePatternState& rState, bool bDeep ) const;
118 void MergeBlockFrame( SvxBoxItem* pLineOuter, SvxBoxInfoItem* pLineInner, ScLineFlags& rFlags,
119 SCROW nStartRow, SCROW nEndRow, bool bLeft, SCCOL nDistRight ) const;
120 void ApplyBlockFrame( const SvxBoxItem* pLineOuter, const SvxBoxInfoItem* pLineInner,
121 SCROW nStartRow, SCROW nEndRow, bool bLeft, SCCOL nDistRight );
123 void SetPattern( SCROW nRow, const ScPatternAttr* pPattern, bool bPutToPool = false );
124 void SetPatternArea( SCROW nStartRow, SCROW nEndRow, const ScPatternAttr* pPattern,
125 bool bPutToPool = false, ScEditDataArray* pDataArray = NULL );
126 void ApplyStyleArea( SCROW nStartRow, SCROW nEndRow, ScStyleSheet* pStyle );
127 void ApplyCacheArea( SCROW nStartRow, SCROW nEndRow, SfxItemPoolCache* pCache,
128 ScEditDataArray* pDataArray = NULL );
129 bool SetAttrEntries(ScAttrEntry* pNewData, SCSIZE nSize);
130 void ApplyLineStyleArea( SCROW nStartRow, SCROW nEndRow,
131 const ::editeng::SvxBorderLine* pLine, bool bColorOnly );
133 void AddCondFormat( SCROW nStartRow, SCROW nEndRow, sal_uInt32 nIndex );
134 void RemoveCondFormat( SCROW nStartRow, SCROW nEndRow, sal_uInt32 nIndex );
136 void ClearItems( SCROW nStartRow, SCROW nEndRow, const sal_uInt16* pWhich );
137 void ChangeIndent( SCROW nStartRow, SCROW nEndRow, bool bIncrement );
139 /// Including current, may return -1
140 SCsROW GetNextUnprotected( SCsROW nRow, bool bUp ) const;
142 /// May return -1 if not found
143 SCsROW SearchStyle(
144 SCsROW nRow, const ScStyleSheet* pSearchStyle, bool bUp,
145 const ScMarkArray* pMarkArray = NULL) const;
147 bool SearchStyleRange(
148 SCsROW& rRow, SCsROW& rEndRow, const ScStyleSheet* pSearchStyle, bool bUp,
149 const ScMarkArray* pMarkArray = NULL) const;
151 bool ApplyFlags( SCROW nStartRow, SCROW nEndRow, sal_Int16 nFlags );
152 bool RemoveFlags( SCROW nStartRow, SCROW nEndRow, sal_Int16 nFlags );
154 bool Search( SCROW nRow, SCSIZE& nIndex ) const;
156 bool HasAttrib( SCROW nRow1, SCROW nRow2, sal_uInt16 nMask ) const;
157 bool IsMerged( SCROW nRow ) const;
158 bool ExtendMerge( SCCOL nThisCol, SCROW nStartRow, SCROW nEndRow,
159 SCCOL& rPaintCol, SCROW& rPaintRow,
160 bool bRefresh );
161 bool RemoveAreaMerge( SCROW nStartRow, SCROW nEndRow );
163 void FindStyleSheet( const SfxStyleSheetBase* pStyleSheet, ScFlatBoolRowSegments& rUsedRows, bool bReset );
164 bool IsStyleSheetUsed( const ScStyleSheet& rStyle, bool bGatherAllStyles ) const;
166 void DeleteAreaSafe(SCROW nStartRow, SCROW nEndRow);
167 void SetPatternAreaSafe( SCROW nStartRow, SCROW nEndRow,
168 const ScPatternAttr* pWantedPattern, bool bDefault );
169 void CopyAreaSafe( SCROW nStartRow, SCROW nEndRow, long nDy, ScAttrArray& rAttrArray );
171 bool IsEmpty() const;
173 bool GetFirstVisibleAttr( SCROW& rFirstRow ) const;
174 bool GetLastVisibleAttr( SCROW& rLastRow, SCROW nLastData, bool bFullFormattedArea = false ) const;
175 bool HasVisibleAttrIn( SCROW nStartRow, SCROW nEndRow ) const;
176 bool IsVisibleEqual( const ScAttrArray& rOther,
177 SCROW nStartRow, SCROW nEndRow ) const;
178 bool IsAllEqual( const ScAttrArray& rOther, SCROW nStartRow, SCROW nEndRow ) const;
180 bool TestInsertCol( SCROW nStartRow, SCROW nEndRow) const;
181 bool TestInsertRow( SCSIZE nSize ) const;
182 void InsertRow( SCROW nStartRow, SCSIZE nSize );
183 void DeleteRow( SCROW nStartRow, SCSIZE nSize );
184 void DeleteRange( SCSIZE nStartIndex, SCSIZE nEndIndex );
185 void DeleteArea( SCROW nStartRow, SCROW nEndRow );
186 void MoveTo( SCROW nStartRow, SCROW nEndRow, ScAttrArray& rAttrArray );
187 void CopyArea(
188 SCROW nStartRow, SCROW nEndRow, long nDy, ScAttrArray& rAttrArray, sal_Int16 nStripFlags = 0) const;
190 void DeleteHardAttr( SCROW nStartRow, SCROW nEndRow );
192 /* i123909: Pre-calculate needed memory, and pre-reserve enough memory */
193 bool Reserve( SCSIZE nReserve );
194 SCSIZE Count() const { return nCount; }
195 SCSIZE Count( SCROW nRow1, SCROW nRow2 ) const;
198 // Iterator for attributes
200 class ScAttrIterator
202 const ScAttrArray* pArray;
203 SCSIZE nPos;
204 SCROW nRow;
205 SCROW nEndRow;
206 public:
207 inline ScAttrIterator( const ScAttrArray* pNewArray, SCROW nStart, SCROW nEnd );
208 inline const ScPatternAttr* Next( SCROW& rTop, SCROW& rBottom );
209 inline const ScPatternAttr* Resync( SCROW nRow, SCROW& rTop, SCROW& rBottom );
210 SCROW GetNextRow() const { return nRow; }
213 inline ScAttrIterator::ScAttrIterator( const ScAttrArray* pNewArray, SCROW nStart, SCROW nEnd ) :
214 pArray( pNewArray ),
215 nRow( nStart ),
216 nEndRow( nEnd )
218 if ( nStart > 0 )
219 pArray->Search( nStart, nPos );
220 else
221 nPos = 0;
224 inline const ScPatternAttr* ScAttrIterator::Next( SCROW& rTop, SCROW& rBottom )
226 const ScPatternAttr* pRet;
227 if ( nPos < pArray->nCount && nRow <= nEndRow )
229 rTop = nRow;
230 rBottom = std::min( pArray->pData[nPos].nRow, nEndRow );
231 pRet = pArray->pData[nPos].pPattern;
232 nRow = rBottom + 1;
233 ++nPos;
235 else
236 pRet = NULL;
237 return pRet;
240 inline const ScPatternAttr* ScAttrIterator::Resync( SCROW nRowP, SCROW& rTop, SCROW& rBottom )
242 nRow = nRowP;
243 // Chances are high that the pattern changed on nRowP introduced a span
244 // starting right there. Assume that Next() was called so nPos already
245 // advanced. Another high chance is that the change extended a previous or
246 // next pattern. In all these cases we don't need to search.
247 if (3 <= nPos && nPos <= pArray->nCount && pArray->pData[nPos-3].nRow < nRowP &&
248 nRowP <= pArray->pData[nPos-2].nRow)
249 nPos -= 2;
250 else if (2 <= nPos && nPos <= pArray->nCount && pArray->pData[nPos-2].nRow < nRowP &&
251 nRowP <= pArray->pData[nPos-1].nRow)
252 --nPos;
253 else if (pArray->nCount > 0 && nRowP <= pArray->pData[0].nRow)
254 nPos = 0;
255 else
256 pArray->Search( nRowP, nPos );
257 return Next( rTop, rBottom);
260 #endif
262 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */