Searched refs:nCurrPoly (Results 1 – 5 of 5) sorted by path
233 for( sal_Int32 nCurrPoly=0; nCurrPoly<points.getLength(); ++nCurrPoly ) in polyPolygonFromPoint2DSequenceSequence() local235 aRes.append( polygonFromPoint2DSequence( points[nCurrPoly] ) ); in polyPolygonFromPoint2DSequenceSequence()281 for( sal_Int32 nCurrPoly=0; nCurrPoly<curves.getLength(); ++nCurrPoly ) in polyPolygonFromBezier2DSequenceSequence() local283 aRes.append( polygonFromBezier2DSequence( curves[nCurrPoly] ) ); in polyPolygonFromBezier2DSequenceSequence()
441 sal_Int32 nCurrPoly; in graphicsPathFromRealPoint2DSequence() local442 for( nCurrPoly=0; nCurrPoly<points.getLength(); ++nCurrPoly ) in graphicsPathFromRealPoint2DSequence()444 const sal_Int32 nCurrSize( points[nCurrPoly].getLength() ); in graphicsPathFromRealPoint2DSequence()452 …d::transform( const_cast< uno::Sequence< geometry::RealPoint2D >& >(points[nCurrPoly]).getArray(), in graphicsPathFromRealPoint2DSequence()453 … const_cast< uno::Sequence< geometry::RealPoint2D >& >(points[nCurrPoly]).getArray()+nCurrSize, in graphicsPathFromRealPoint2DSequence()480 for( sal_uInt32 nCurrPoly=0; nCurrPoly<nPolies; ++nCurrPoly ) in graphicsPathFromB2DPolyPolygon() local484 rPoly.getB2DPolygon( nCurrPoly ), in graphicsPathFromB2DPolyPolygon()
518 … for( sal_Int32 nCurrPoly=0; nCurrPoly<pOuterSequence->getLength(); ++nCurrPoly, ++pInnerSequence ) in importPolygons() local
134 int nCurrPoly; in polyPolygonFromPoint2DSequenceSequence() local135 for( nCurrPoly=0; nCurrPoly<points.getLength(); ++nCurrPoly ) in polyPolygonFromPoint2DSequenceSequence()137 aRes.Insert( polygonFromPoint2DSequence( points[nCurrPoly] ) ); in polyPolygonFromPoint2DSequenceSequence()
631 sal_uLong nCurrPoly; in ImplPreparePolyDraw() local632 for( nCurrPoly=0; nCurrPoly<nPoly; ++nCurrPoly ) in ImplPreparePolyDraw()1603 sal_uLong nCurrPoly, nTotalPoints; in drawPolyPolygonBezier() local1605 for( nCurrPoly=0, nTotalPoints=0; nCurrPoly<nPoly; ++nCurrPoly ) in drawPolyPolygonBezier()
Completed in 52 milliseconds