Lines 19-31
Link Here
|
19 |
* |
19 |
* |
20 |
*************************************************************/ |
20 |
*************************************************************/ |
21 |
|
21 |
|
22 |
|
|
|
23 |
|
24 |
// MARKER(update_precomp.py): autogen include statement, do not remove |
22 |
// MARKER(update_precomp.py): autogen include statement, do not remove |
25 |
#include "precompiled_sc.hxx" |
23 |
#include "precompiled_sc.hxx" |
26 |
|
24 |
|
27 |
|
|
|
28 |
|
29 |
//------------------------------------------------------------------------ |
25 |
//------------------------------------------------------------------------ |
30 |
|
26 |
|
31 |
#include "scitems.hxx" |
27 |
#include "scitems.hxx" |
Lines 295-300
Link Here
|
295 |
SetPatternArea( nRow, nRow, pPattern, bPutToPool ); |
291 |
SetPatternArea( nRow, nRow, pPattern, bPutToPool ); |
296 |
} |
292 |
} |
297 |
|
293 |
|
|
|
294 |
bool ScAttrArray::Reserve( SCSIZE nReserve ) |
295 |
{ |
296 |
if ( nCount <= nReserve ) |
297 |
{ |
298 |
if( ScAttrEntry* pNewData = new (std::nothrow) ScAttrEntry[nReserve] ) |
299 |
{ |
300 |
nLimit = nReserve; |
301 |
memcpy( pNewData, pData, nCount*sizeof(ScAttrEntry) ); |
302 |
delete[] pData; |
303 |
pData = pNewData; |
304 |
return true; |
305 |
} |
306 |
else |
307 |
return false; |
308 |
} |
309 |
else |
310 |
return false; |
311 |
} |
298 |
|
312 |
|
299 |
void ScAttrArray::SetPatternArea(SCROW nStartRow, SCROW nEndRow, const ScPatternAttr *pPattern, sal_Bool bPutToPool ) |
313 |
void ScAttrArray::SetPatternArea(SCROW nStartRow, SCROW nEndRow, const ScPatternAttr *pPattern, sal_Bool bPutToPool ) |
300 |
{ |
314 |
{ |
Lines 2647-2649
Link Here
|
2647 |
//UNUSED2008-05 } |
2661 |
//UNUSED2008-05 } |
2648 |
//UNUSED2008-05 } |
2662 |
//UNUSED2008-05 } |
2649 |
|
2663 |
|
|
|
2664 |
SCSIZE ScAttrArray::Count( SCROW nStartRow, SCROW nEndRow ) |
2665 |
{ |
2666 |
SCSIZE nIndex1, nIndex2; |
2667 |
|
2668 |
if( !Search( nStartRow, nIndex1 ) ) |
2669 |
return 0; |
2670 |
|
2671 |
if( !Search( nEndRow, nIndex2 ) ) |
2672 |
nIndex2 = this->nCount - 1; |
2673 |
|
2674 |
return nIndex2 - nIndex1 + 1; |
2675 |
} |