Lines Matching refs:pData
72 pData = new ScAttrEntry[1]; in ScAttrArray()
73 if (pData) in ScAttrArray()
75 pData[0].nRow = MAXROW; in ScAttrArray()
76 pData[0].pPattern = pDocument->GetDefPattern(); // ohne Put !!! in ScAttrArray()
88 if (pData) in ~ScAttrArray()
92 pDocPool->Remove(*pData[i].pPattern); in ~ScAttrArray()
94 delete[] pData; in ~ScAttrArray()
104 if (pData) in TestData()
110 if (pData[nPos].pPattern == pData[nPos-1].pPattern || pData[nPos].nRow <= pData[nPos-1].nRow) in TestData()
112 if (pData[nPos].pPattern->Which() != ATTR_PATTERN) in TestData()
115 if ( nPos && pData[nPos-1].nRow != MAXROW ) in TestData()
132 if (pData) in Reset()
142 pOldPattern = pData[i].pPattern; in Reset()
147 aAdrStart.SetRow( i ? pData[i-1].nRow+1 : 0 ); in Reset()
148 aAdrEnd .SetRow( pData[i].nRow ); in Reset()
164 delete[] pData; in Reset()
172 pData = new ScAttrEntry[1]; in Reset()
173 if (pData) in Reset()
176 pData[0].nRow = MAXROW; in Reset()
177 pData[0].pPattern = pNewPattern; in Reset()
183 pData = NULL; // muss sofort wieder belegt werden ! in Reset()
192 if (pData && (nPos < nCount)) in Concat()
196 if (pData[nPos - 1].pPattern == pData[nPos].pPattern) in Concat()
198 pData[nPos - 1].nRow = pData[nPos].nRow; in Concat()
199 pDocument->GetPool()->Remove(*pData[nPos].pPattern); in Concat()
200 memmove(&pData[nPos], &pData[nPos + 1], (nCount - nPos - 1) * sizeof(ScAttrEntry)); in Concat()
201 pData[nCount - 1].pPattern = NULL; in Concat()
202 pData[nCount - 1].nRow = 0; in Concat()
210 if (pData[nPos + 1].pPattern == pData[nPos].pPattern) in Concat()
212 pData[nPos].nRow = pData[nPos + 1].nRow; in Concat()
213 pDocument->GetPool()->Remove(*pData[nPos].pPattern); in Concat()
214 memmove(&pData[nPos + 1], &pData[nPos + 2], (nCount - nPos - 2) * sizeof(ScAttrEntry)); in Concat()
215 pData[nCount - 1].pPattern = NULL; in Concat()
216 pData[nCount - 1].nRow = 0; in Concat()
235 if (pData) in Search()
241 nStartRow = (long) pData[i - 1].nRow; in Search()
244 nEndRow = (long) pData[i].nRow; in Search()
269 return pData[i].pPattern; in GetPattern()
282 rStartRow = pData[nIndex-1].nRow + 1; in GetPatternRange()
285 rEndRow = pData[nIndex].nRow; in GetPatternRange()
286 return pData[nIndex].pPattern; in GetPatternRange()
305 memcpy( pNewData, pData, nCount*sizeof(ScAttrEntry) ); in Reserve()
306 delete[] pData; in Reserve()
307 pData = pNewData; in Reserve()
335 memcpy( pNewData, pData, nCount*sizeof(ScAttrEntry) ); in SetPatternArea()
336 delete[] pData; in SetPatternArea()
337 pData = pNewData; in SetPatternArea()
356 ns = pData[ni-1].nRow+1; in SetPatternArea()
365 const SfxItemSet& rOldSet = pData[nx].pPattern->GetItemSet(); in SetPatternArea()
372 aAdrEnd .SetRow( Min(nEndRow,pData[nx].nRow) ); in SetPatternArea()
385 ns = pData[nx].nRow + 1; in SetPatternArea()
397 if ( pData[ni].pPattern != pPattern ) in SetPatternArea()
399 if ( ni == 0 || (pData[ni-1].nRow < nStartRow - 1) ) in SetPatternArea()
402 if ( pData[ni].nRow > nEndRow ) in SetPatternArea()
407 else if ( ni > 0 && pData[ni-1].nRow == nStartRow - 1 ) in SetPatternArea()
410 if ( ni > 0 && pData[ni-1].pPattern == pPattern ) in SetPatternArea()
412 pData[ni-1].nRow = nEndRow; in SetPatternArea()
421 while ( nj < nCount && pData[nj].nRow <= nEndRow ) in SetPatternArea()
425 if ( nj < nCount && pData[nj].pPattern == pPattern ) in SetPatternArea()
429 if ( pData[ni-1].pPattern == pPattern ) in SetPatternArea()
431 pData[ni-1].nRow = pData[nj].nRow; in SetPatternArea()
435 pData[ni-1].nRow = nStartRow - 1; // shrink in SetPatternArea()
441 pData[ni-1].nRow = nStartRow - 1; // shrink in SetPatternArea()
446 pDocPool->Put( *pData[ni-1].pPattern ); in SetPatternArea()
452 pDocPool->Remove( *pData[nk].pPattern ); in SetPatternArea()
456 pData[ni].nRow = nEndRow; in SetPatternArea()
457 pData[ni].pPattern = pPattern; in SetPatternArea()
463 memmove( pData + ni, pData + nj, (nCount - nj) * sizeof(ScAttrEntry) ); in SetPatternArea()
473 memmove( pData + nInsert + 1, pData + nInsert, in SetPatternArea()
477 memmove( pData + nInsert + 2, pData + nInsert, in SetPatternArea()
479 pData[nInsert+1] = pData[nInsert-1]; in SetPatternArea()
484 pData[nInsert-1].nRow = nStartRow - 1; in SetPatternArea()
485 pData[nInsert].nRow = nEndRow; in SetPatternArea()
486 pData[nInsert].pPattern = pPattern; in SetPatternArea()
519 const ScPatternAttr* pOldPattern = pData[nPos].pPattern; in ApplyStyleArea()
523 SCROW nY2 = pData[nPos].nRow; in ApplyStyleArea()
524 nStart = pData[nPos].nRow + 1; in ApplyStyleArea()
551 aAdrStart.SetRow( nPos ? pData[nPos-1].nRow+1 : 0 ); in ApplyStyleArea()
552 aAdrEnd .SetRow( pData[nPos].nRow ); in ApplyStyleArea()
559 pDocument->GetPool()->Remove(*pData[nPos].pPattern); in ApplyStyleArea()
560 pData[nPos].pPattern = (const ScPatternAttr*) in ApplyStyleArea()
616 const ScPatternAttr* pOldPattern = pData[nPos].pPattern; in ApplyLineStyleArea()
630 SCROW nY2 = pData[nPos].nRow; in ApplyLineStyleArea()
688 nStart = pData[nPos].nRow + 1; in ApplyLineStyleArea()
700 pDocument->GetPool()->Remove(*pData[nPos].pPattern); in ApplyLineStyleArea()
701 pData[nPos].pPattern = (const ScPatternAttr*) in ApplyLineStyleArea()
716 nStart = pData[nPos].nRow + 1; in ApplyLineStyleArea()
749 const ScPatternAttr* pOldPattern = pData[nPos].pPattern; in ApplyCacheArea()
756 SCROW nY2 = pData[nPos].nRow; in ApplyCacheArea()
757 nStart = pData[nPos].nRow + 1; in ApplyCacheArea()
777 aAdrStart.SetRow( nPos ? pData[nPos-1].nRow+1 : 0 ); in ApplyCacheArea()
778 aAdrEnd .SetRow( pData[nPos].nRow ); in ApplyCacheArea()
795 pDocument->GetPool()->Remove(*pData[nPos].pPattern); in ApplyCacheArea()
796 pData[nPos].pPattern = pNewPattern; in ApplyCacheArea()
807 nStart = pData[nPos].nRow + 1; in ApplyCacheArea()
877 const ScPatternAttr* pPattern = pData[nPos].pPattern; in MergePatternArea()
902 nStart = pData[nPos].nRow + 1; in MergePatternArea()
1032 pPattern = (ScPatternAttr*) pData[i].pPattern; in MergeBlockFrame()
1034 nEndRow - Min( pData[i].nRow, (SCROW)(nEndRow-1) ) ); in MergeBlockFrame()
1122 nTmpEnd = Min( (SCROW)(nEndRow-1), (SCROW)(pData[i].nRow) ); in ApplyBlockFrame()
1183 pItem = (const SvxBoxItem*) &pData[nStartIndex].pPattern->GetItem(ATTR_BORDER); in HasLines()
1196 pItem = (const SvxBoxItem*) &pData[nEndIndex].pPattern->GetItem(ATTR_BORDER); in HasLines()
1209 pItem = (const SvxBoxItem*) &pData[i].pPattern->GetItem(ATTR_BORDER); in HasLines()
1255 const ScPatternAttr* pPattern = pData[i].pPattern; in HasAttrib()
1375 pPattern = pData[i].pPattern; in ExtendMerge()
1381 SCROW nThisRow = (i>0) ? pData[i-1].nRow+1 : 0; in ExtendMerge()
1406 pDocument->ApplyFlagsTab( nThisCol+1, nThisRow, nMergeEndCol, pData[i].nRow, in ExtendMerge()
1434 SCROW nThisStart = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in RemoveAreaMerge()
1440 SCROW nThisEnd = pData[nIndex].nRow; in RemoveAreaMerge()
1444 pPattern = pData[nIndex].pPattern; in RemoveAreaMerge()
1478 nThisStart = pData[nIndex-1].nRow+1; in RemoveAreaMerge()
1506 nThisRow = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in SetPatternAreaSafe()
1509 pOldPattern = pData[nIndex].pPattern; in SetPatternAreaSafe()
1513 nRow = pData[nIndex].nRow; in SetPatternAreaSafe()
1545 nThisRow = pData[nIndex-1].nRow+1; in SetPatternAreaSafe()
1561 nThisRow = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in ApplyFlags()
1566 pOldPattern = pData[nIndex].pPattern; in ApplyFlags()
1570 nRow = pData[nIndex].nRow; in ApplyFlags()
1580 nThisRow = pData[nIndex-1].nRow+1; in ApplyFlags()
1598 nThisRow = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in RemoveFlags()
1603 pOldPattern = pData[nIndex].pPattern; in RemoveFlags()
1607 nRow = pData[nIndex].nRow; in RemoveFlags()
1617 nThisRow = pData[nIndex-1].nRow+1; in RemoveFlags()
1633 nThisRow = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in ClearItems()
1638 pOldPattern = pData[nIndex].pPattern; in ClearItems()
1644 nRow = pData[nIndex].nRow; in ClearItems()
1651 nThisRow = pData[nIndex-1].nRow+1; in ClearItems()
1660 SCROW nThisStart = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in ChangeIndent()
1665 const ScPatternAttr* pOldPattern = pData[nIndex].pPattern; in ChangeIndent()
1694 SCROW nThisEnd = pData[nIndex].nRow; in ChangeIndent()
1708 nThisStart = pData[nIndex].nRow + 1; // weiterzaehlen... in ChangeIndent()
1722 while (((const ScProtectionAttr&)pData[nIndex].pPattern-> in GetNextUnprotected()
1730 nRet = pData[nIndex].nRow; in GetNextUnprotected()
1734 nRet = pData[nIndex].nRow+1; in GetNextUnprotected()
1750 SCROW nEnd = pData[nPos].nRow; in FindStyleSheet()
1751 if (pData[nPos].pPattern->GetStyleSheet() == pStyleSheet) in FindStyleSheet()
1760 ScPatternAttr* pNewPattern = new ScPatternAttr(*pData[nPos].pPattern); in FindStyleSheet()
1761 pDocument->GetPool()->Remove(*pData[nPos].pPattern); in FindStyleSheet()
1767 pData[nPos].pPattern = (const ScPatternAttr*) in FindStyleSheet()
1792 const ScStyleSheet* pStyle = pData[nPos].pPattern->GetStyleSheet(); in IsStyleSheetUsed()
1814 if ( pData[0].pPattern != pDocument->GetDefPattern() ) in IsEmpty()
1870 …while ( nVisStart < nCount && pData[nVisStart].pPattern->IsVisibleEqual(*pData[nVisStart-1].pPatte… in GetFirstVisibleAttr()
1872 if ( nVisStart >= nCount || pData[nVisStart-1].nRow > 0 ) // more than 1 row? in GetFirstVisibleAttr()
1877 if ( pData[nStart].pPattern->IsVisible() ) in GetFirstVisibleAttr()
1879 rFirstRow = nStart ? ( pData[nStart-1].nRow + 1 ) : 0; in GetFirstVisibleAttr()
1912 while ( nPos > 0 && pData[nPos-1].nRow > nLastData ) in GetLastVisibleAttr()
1917 pData[nStartPos-1].nRow > nLastData && in GetLastVisibleAttr()
1918 pData[nStartPos-1].pPattern->IsVisibleEqual(*pData[nStartPos].pPattern) ) in GetLastVisibleAttr()
1921 SCROW nAttrStartRow = ( nStartPos > 0 ) ? ( pData[nStartPos-1].nRow + 1 ) : 0; in GetLastVisibleAttr()
1924 SCROW nAttrSize = pData[nEndPos].nRow + 1 - nAttrStartRow; in GetLastVisibleAttr()
1929 else if ( !bFound && pData[nEndPos].pPattern->IsVisible() ) in GetLastVisibleAttr()
1931 rLastRow = pData[nEndPos].nRow; in GetLastVisibleAttr()
1954 while ( nPos > 0 && pData[nPos - 1].nRow > nLastData ) in GetLastAttr()
1958 while ( nStartPos > 0 && pData[nStartPos - 1].nRow > nLastData && in GetLastAttr()
1959 pData[nStartPos - 1].pPattern->IsEqual( *pData[nStartPos].pPattern ) ) in GetLastAttr()
1962 SCROW nAttrStartRow = ( nStartPos > 0 ) ? ( pData[nStartPos - 1].nRow + 1 ) : 0; in GetLastAttr()
1965 SCROW nAttrSize = pData[nEndPos].nRow + 1 - nAttrStartRow; in GetLastAttr()
1972 rLastRow = pData[nEndPos].nRow; in GetLastAttr()
1992 if ( pData[nIndex].pPattern->IsVisible() ) in HasVisibleAttrIn()
1995 nThisStart = pData[nIndex].nRow + 1; in HasVisibleAttrIn()
2017 SCROW nThisRow = pData[nThisPos].nRow; in IsVisibleEqual()
2018 SCROW nOtherRow = rOther.pData[nOtherPos].nRow; in IsVisibleEqual()
2019 const ScPatternAttr* pThisPattern = pData[nThisPos].pPattern; in IsVisibleEqual()
2020 const ScPatternAttr* pOtherPattern = rOther.pData[nOtherPos].pPattern; in IsVisibleEqual()
2055 SCROW nThisRow = pData[nThisPos].nRow; in IsAllEqual()
2056 SCROW nOtherRow = rOther.pData[nOtherPos].nRow; in IsAllEqual()
2057 const ScPatternAttr* pThisPattern = pData[nThisPos].pPattern; in IsAllEqual()
2058 const ScPatternAttr* pOtherPattern = rOther.pData[nOtherPos].pPattern; in IsAllEqual()
2091 if ( ((const ScMergeFlagAttr&)pData[nIndex].pPattern-> in TestInsertCol()
2097 if ( pData[nIndex].nRow >= nEndRow ) // Ende des Bereichs in TestInsertCol()
2110 if (pData) in TestInsertRow()
2115 …while ( nFirstLost && pData[nFirstLost-1].nRow >= sal::static_int_cast<SCROW>(MAXROW + 1 - nSize) ) in TestInsertRow()
2118 if ( ((const ScMergeFlagAttr&)pData[nFirstLost].pPattern-> in TestInsertRow()
2129 if (!pData) in InsertRow()
2139 sal_Bool bDoMerge = ((const ScMergeAttr&) pData[nIndex].pPattern->GetItem(ATTR_MERGE)).IsMerged(); in InsertRow()
2145 SCROW nNew = pData[i].nRow + nSize; in InsertRow()
2152 pData[i].nRow = nNew; in InsertRow()
2179 if (pData) in DeleteRow()
2187 … if (pData[i].nRow >= nStartRow && pData[i].nRow <= sal::static_int_cast<SCROW>(nStartRow+nSize-1)) in DeleteRow()
2202 nStart = pData[nStartIndex-1].nRow + 1; in DeleteRow()
2206 pData[nStartIndex].nRow = nStartRow - 1; in DeleteRow()
2213 if ( pData[nStartIndex-1].pPattern == pData[nStartIndex].pPattern ) in DeleteRow()
2218 if (pData[i].nRow >= nStartRow) in DeleteRow()
2219 pData[i].nRow -= nSize; in DeleteRow()
2233 pDocPool->Remove(*pData[i].pPattern); in DeleteRange()
2235 …memmove( &pData[nStartIndex], &pData[nEndIndex + 1], (nCount - nEndIndex - 1) * sizeof(ScAttrEntry… in DeleteRange()
2261 nThisRow = (nIndex>0) ? pData[nIndex-1].nRow+1 : 0; in DeleteHardAttr()
2266 pOldPattern = pData[nIndex].pPattern; in DeleteHardAttr()
2270 nRow = pData[nIndex].nRow; in DeleteHardAttr()
2288 nThisRow = pData[nIndex-1].nRow+1; in DeleteHardAttr()
2299 if ((pData[i].nRow >= nStartRow) && ((i==0) ? sal_True : pData[i-1].nRow < nEndRow)) in MoveTo()
2302 rAttrArray.SetPatternArea( nStart, Min( (SCROW)pData[i].nRow, (SCROW)nEndRow ), in MoveTo()
2303 pData[i].pPattern, sal_True ); in MoveTo()
2305 nStart = Max( (SCROW)nStart, (SCROW)(pData[i].nRow + 1) ); in MoveTo()
2328 if (pData[i].nRow >= nStartRow) in CopyArea()
2330 const ScPatternAttr* pOldPattern = pData[i].pPattern; in CopyArea()
2368 Min((SCROW)(pData[i].nRow + nDy), nDestEnd), pNewPattern); in CopyArea()
2373 nDestStart = Max((long)nDestStart, (long)(pData[i].nRow + nDy + 1)); in CopyArea()
2400 if (pData[i].nRow >= nStartRow) in CopyAreaSafe()
2402 const ScPatternAttr* pOldPattern = pData[i].pPattern; in CopyAreaSafe()
2411 Min((SCROW)(pData[i].nRow + nDy), nDestEnd), pNewPattern, sal_False); in CopyAreaSafe()
2416 nDestStart = Max((long)nDestStart, (long)(pData[i].nRow + nDy + 1)); in CopyAreaSafe()
2435 const ScPatternAttr* pPattern = pData[nIndex].pPattern; in SearchStyle()
2444 SCROW nStart = nIndex ? pData[nIndex-1].nRow+1 : 0; in SearchStyle()
2445 if (nRow >= nStart && nRow <= pData[nIndex].nRow) in SearchStyle()
2464 nRow = pData[nIndex].nRow; in SearchStyle()
2465 pPattern = pData[nIndex].pPattern; in SearchStyle()
2470 nRow = pData[nIndex].nRow+1; in SearchStyle()
2473 pPattern = pData[nIndex].pPattern; in SearchStyle()
2497 rEndRow = pData[nIndex-1].nRow + 1; in SearchStyleRange()
2509 rEndRow = pData[nIndex].nRow; in SearchStyleRange()
2543 if ( nSaveCount > 1 && pData[nSaveCount-2].nRow >= nSaveMaxRow )
2548 while ( nSaveCount > 1 && pData[nSaveCount-2].nRow >= nSaveMaxRow );
2557 rStream << Min( pData[i].nRow, nSaveMaxRow );
2559 const ScPatternAttr* pPattern = pData[i].pPattern;
2591 pData = new ScAttrEntry[nNewCount]; // neu anlegen
2594 rStream >> pData[i].nRow;
2606 pData[i].pPattern = pNewPattern;
2612 if ( nCount > 1 && pData[nCount-2].nRow >= MAXROW ) // faengt ein Attribut hinter MAXROW an?
2623 DBG_ASSERT( pData[nCount-1].nRow == pDocument->GetSrcMaxRow(), "Attribut-Ende ?!?" );
2624 pData[nCount-1].nRow = MAXROW;