Lines Matching refs:mpImplPolyPolygon
106 mpImplPolyPolygon = new ImplPolyPolygon( nInitSize, nResize ); in PolyPolygon()
117 mpImplPolyPolygon = new ImplPolyPolygon( 1 ); in PolyPolygon()
118 mpImplPolyPolygon->mpPolyAry[0] = new Polygon( rPoly ); in PolyPolygon()
121 mpImplPolyPolygon = new ImplPolyPolygon( 16, 16 ); in PolyPolygon()
130 …DBG_ASSERT( rPolyPoly.mpImplPolyPolygon->mnRefCount < 0xFFFFFFFE, "PolyPolygon: RefCount overflow"… in PolyPolygon()
132 mpImplPolyPolygon = rPolyPoly.mpImplPolyPolygon; in PolyPolygon()
133 mpImplPolyPolygon->mnRefCount++; in PolyPolygon()
142 if ( mpImplPolyPolygon->mnRefCount > 1 ) in ~PolyPolygon()
143 mpImplPolyPolygon->mnRefCount--; in ~PolyPolygon()
145 delete mpImplPolyPolygon; in ~PolyPolygon()
154 if ( mpImplPolyPolygon->mnCount >= MAX_POLYGONS ) in Insert()
157 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Insert()
159 mpImplPolyPolygon->mnRefCount--; in Insert()
160 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Insert()
163 if ( nPos > mpImplPolyPolygon->mnCount ) in Insert()
164 nPos = mpImplPolyPolygon->mnCount; in Insert()
166 if ( !mpImplPolyPolygon->mpPolyAry ) in Insert()
167 mpImplPolyPolygon->mpPolyAry = new SVPPOLYGON[mpImplPolyPolygon->mnSize]; in Insert()
168 else if ( mpImplPolyPolygon->mnCount == mpImplPolyPolygon->mnSize ) in Insert()
170 sal_uInt16 nOldSize = mpImplPolyPolygon->mnSize; in Insert()
171 sal_uInt16 nNewSize = nOldSize + mpImplPolyPolygon->mnResize; in Insert()
177 memcpy( pNewAry, mpImplPolyPolygon->mpPolyAry, nPos*sizeof(SVPPOLYGON) ); in Insert()
178 memcpy( pNewAry+nPos+1, mpImplPolyPolygon->mpPolyAry+nPos, in Insert()
180 delete[] mpImplPolyPolygon->mpPolyAry; in Insert()
181 mpImplPolyPolygon->mpPolyAry = pNewAry; in Insert()
182 mpImplPolyPolygon->mnSize = nNewSize; in Insert()
184 else if ( nPos < mpImplPolyPolygon->mnCount ) in Insert()
186 memmove( mpImplPolyPolygon->mpPolyAry+nPos+1, in Insert()
187 mpImplPolyPolygon->mpPolyAry+nPos, in Insert()
188 (mpImplPolyPolygon->mnCount-nPos)*sizeof(SVPPOLYGON) ); in Insert()
191 mpImplPolyPolygon->mpPolyAry[nPos] = new Polygon( rPoly ); in Insert()
192 mpImplPolyPolygon->mnCount++; in Insert()
203 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Remove()
205 mpImplPolyPolygon->mnRefCount--; in Remove()
206 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Remove()
209 delete mpImplPolyPolygon->mpPolyAry[nPos]; in Remove()
210 mpImplPolyPolygon->mnCount--; in Remove()
211 memmove( mpImplPolyPolygon->mpPolyAry+nPos, in Remove()
212 mpImplPolyPolygon->mpPolyAry+nPos+1, in Remove()
213 (mpImplPolyPolygon->mnCount-nPos)*sizeof(SVPPOLYGON) ); in Remove()
224 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Replace()
226 mpImplPolyPolygon->mnRefCount--; in Replace()
227 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Replace()
230 delete mpImplPolyPolygon->mpPolyAry[nPos]; in Replace()
231 mpImplPolyPolygon->mpPolyAry[nPos] = new Polygon( rPoly ); in Replace()
241 return *(mpImplPolyPolygon->mpPolyAry[nPos]); in GetObject()
250 bIsRect = mpImplPolyPolygon->mpPolyAry[ 0 ]->IsRect(); in IsRect()
260 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Clear()
262 mpImplPolyPolygon->mnRefCount--; in Clear()
263 mpImplPolyPolygon = new ImplPolyPolygon( mpImplPolyPolygon->mnResize, in Clear()
264 mpImplPolyPolygon->mnResize ); in Clear()
268 if ( mpImplPolyPolygon->mpPolyAry ) in Clear()
270 for ( sal_uInt16 i = 0; i < mpImplPolyPolygon->mnCount; i++ ) in Clear()
271 delete mpImplPolyPolygon->mpPolyAry[i]; in Clear()
272 delete[] mpImplPolyPolygon->mpPolyAry; in Clear()
273 mpImplPolyPolygon->mpPolyAry = NULL; in Clear()
274 mpImplPolyPolygon->mnCount = 0; in Clear()
275 mpImplPolyPolygon->mnSize = mpImplPolyPolygon->mnResize; in Clear()
324 if( mpImplPolyPolygon->mnRefCount > 1 ) in Optimize()
326 mpImplPolyPolygon->mnRefCount--; in Optimize()
327 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Optimize()
331 for( sal_uInt16 i = 0, nPolyCount = mpImplPolyPolygon->mnCount; i < nPolyCount; i++ ) in Optimize()
335 mpImplPolyPolygon->mpPolyAry[ i ]->Optimize( POLY_OPTIMIZE_NO_SAME ); in Optimize()
336 Polygon::ImplReduceEdges( *( mpImplPolyPolygon->mpPolyAry[ i ] ), fArea, nPercent ); in Optimize()
340 mpImplPolyPolygon->mpPolyAry[ i ]->Optimize( nOptimizeFlags, pData ); in Optimize()
356 for( sal_uInt16 i = 0; i < mpImplPolyPolygon->mnCount; i++ ) in AdaptiveSubdivide()
358 mpImplPolyPolygon->mpPolyAry[ i ]->AdaptiveSubdivide( aPolygon, d ); in AdaptiveSubdivide()
449 return mpImplPolyPolygon->mnCount; in Count()
462 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Move()
464 mpImplPolyPolygon->mnRefCount--; in Move()
465 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Move()
469 sal_uInt16 nPolyCount = mpImplPolyPolygon->mnCount; in Move()
471 mpImplPolyPolygon->mpPolyAry[i]->Move( nHorzMove, nVertMove ); in Move()
482 if( mpImplPolyPolygon->mnRefCount > 1 ) in Translate()
484 mpImplPolyPolygon->mnRefCount--; in Translate()
485 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Translate()
489 for ( sal_uInt16 i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ ) in Translate()
490 mpImplPolyPolygon->mpPolyAry[ i ]->Translate( rTrans ); in Translate()
500 if( mpImplPolyPolygon->mnRefCount > 1 ) in Scale()
502 mpImplPolyPolygon->mnRefCount--; in Scale()
503 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Scale()
507 for ( sal_uInt16 i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ ) in Scale()
508 mpImplPolyPolygon->mpPolyAry[ i ]->Scale( fScaleX, fScaleY ); in Scale()
532 if( mpImplPolyPolygon->mnRefCount > 1 ) in Rotate()
534 mpImplPolyPolygon->mnRefCount--; in Rotate()
535 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Rotate()
539 for ( sal_uInt16 i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ ) in Rotate()
540 mpImplPolyPolygon->mpPolyAry[ i ]->Rotate( rCenter, fSin, fCos ); in Rotate()
550 if( mpImplPolyPolygon->mnRefCount > 1 ) in SlantX()
552 mpImplPolyPolygon->mnRefCount--; in SlantX()
553 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in SlantX()
557 for ( sal_uInt16 i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ ) in SlantX()
558 mpImplPolyPolygon->mpPolyAry[ i ]->SlantX( nYRef, fSin, fCos ); in SlantX()
568 if( mpImplPolyPolygon->mnRefCount > 1 ) in SlantY()
570 mpImplPolyPolygon->mnRefCount--; in SlantY()
571 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in SlantY()
575 for ( sal_uInt16 i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ ) in SlantY()
576 mpImplPolyPolygon->mpPolyAry[ i ]->SlantY( nXRef, fSin, fCos ); in SlantY()
586 if( mpImplPolyPolygon->mnRefCount > 1 ) in Distort()
588 mpImplPolyPolygon->mnRefCount--; in Distort()
589 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Distort()
593 for ( sal_uInt16 i = 0, nCount = mpImplPolyPolygon->mnCount; i < nCount; i++ ) in Distort()
594 mpImplPolyPolygon->mpPolyAry[ i ]->Distort( rRefRect, rDistortedRect ); in Distort()
603 sal_uInt16 nPolyCount = mpImplPolyPolygon->mnCount; in Clip()
610 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Clip()
612 mpImplPolyPolygon->mnRefCount--; in Clip()
613 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in Clip()
618 mpImplPolyPolygon->mpPolyAry[i]->Clip( rRect ); in Clip()
635 sal_uInt16 nPolyCount = mpImplPolyPolygon->mnCount; in GetBoundRect()
639 const Polygon* pPoly = mpImplPolyPolygon->mpPolyAry[n]; in GetBoundRect()
680 if ( mpImplPolyPolygon->mnRefCount > 1 ) in operator []()
682 mpImplPolyPolygon->mnRefCount--; in operator []()
683 mpImplPolyPolygon = new ImplPolyPolygon( *mpImplPolyPolygon ); in operator []()
686 return *(mpImplPolyPolygon->mpPolyAry[nPos]); in operator []()
695 …DBG_ASSERT( rPolyPoly.mpImplPolyPolygon->mnRefCount < 0xFFFFFFFE, "PolyPolygon: RefCount overflow"… in operator =()
697 rPolyPoly.mpImplPolyPolygon->mnRefCount++; in operator =()
699 if ( mpImplPolyPolygon->mnRefCount > 1 ) in operator =()
700 mpImplPolyPolygon->mnRefCount--; in operator =()
702 delete mpImplPolyPolygon; in operator =()
704 mpImplPolyPolygon = rPolyPoly.mpImplPolyPolygon; in operator =()
715 if ( rPolyPoly.mpImplPolyPolygon == mpImplPolyPolygon ) in operator ==()
760 if ( rPolyPoly.mpImplPolyPolygon->mnRefCount > 1 ) in operator >>()
761 rPolyPoly.mpImplPolyPolygon->mnRefCount--; in operator >>()
763 delete rPolyPoly.mpImplPolyPolygon; in operator >>()
765 rPolyPoly.mpImplPolyPolygon = new ImplPolyPolygon( nPolyCount ); in operator >>()
771 rPolyPoly.mpImplPolyPolygon->mpPolyAry[i] = pPoly; in operator >>()
788 sal_uInt16 nPolyCount = rPolyPoly.mpImplPolyPolygon->mnCount; in operator <<()
793 rOStream << *(rPolyPoly.mpImplPolyPolygon->mpPolyAry[i]); in operator <<()
817 if ( mpImplPolyPolygon->mnRefCount > 1 ) in Read()
818 mpImplPolyPolygon->mnRefCount--; in Read()
820 delete mpImplPolyPolygon; in Read()
822 mpImplPolyPolygon = new ImplPolyPolygon( nPolyCount ); in Read()
828 mpImplPolyPolygon->mpPolyAry[i] = pPoly; in Read()
845 sal_uInt16 nPolyCount = mpImplPolyPolygon->mnCount; in Write()
850 mpImplPolyPolygon->mpPolyAry[i]->ImplWrite( rOStream );; in Write()
859 for(sal_uInt16 a(0); a < mpImplPolyPolygon->mnCount; a++) in getB2DPolyPolygon()
861 Polygon* pCandidate = mpImplPolyPolygon->mpPolyAry[a]; in getB2DPolyPolygon()
879 mpImplPolyPolygon = new ImplPolyPolygon( nCount ); in PolyPolygon()
884 mpImplPolyPolygon->mpPolyAry[a] = new Polygon( aCandidate ); in PolyPolygon()
889 mpImplPolyPolygon = new ImplPolyPolygon( 16, 16 ); in PolyPolygon()