Searched refs:nPolygonCount (Results 1 – 14 of 14) sorted by relevance
129 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByDistance()158 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByAngle()187 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByCount()213 if(1L == nPolygonCount) in isInside()241 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRangeWithControlPoints()255 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRange()269 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getSignedArea()324 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in isInEpsilonRange()342 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in createB3DPolyPolygonFromB2DPolyPolygon()562 if(nPolygonCount != rCandidateB.count()) in equal()[all …]
51 const sal_uInt32 nPolygonCount(rCandidate.count()); in getRange() local53 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRange()491 const sal_uInt32 nPolygonCount(rCandidate.count()); in isInside() local493 if(1L == nPolygonCount) in isInside()501 for(sal_uInt32 a(0); a < nPolygonCount; a++) in isInside()521 const sal_uInt32 nPolygonCount(rCandidateA.count()); in equal() local523 if(nPolygonCount != rCandidateB.count()) in equal()526 for(sal_uInt32 a(0); a < nPolygonCount; a++) in equal()601 const sal_uInt32 nPolygonCount(rPolyPolygonSource.count()); in B3DPolyPolygonToUnoPolyPolygonShape3D() local603 if(nPolygonCount) in B3DPolyPolygonToUnoPolyPolygonShape3D()[all …]
177 const sal_uInt32 nPolygonCount(rCandidate.count()); in clipPolyPolygonOnParallelAxis() local180 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in clipPolyPolygonOnParallelAxis()299 const sal_uInt32 nPolygonCount(rCandidate.count()); in clipPolyPolygonOnRange() local302 if(!nPolygonCount) in clipPolyPolygonOnRange()324 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in clipPolyPolygonOnRange()
457 const sal_uInt32 nPolygonCount(rSourcePolyPolygon.count()); in TrapezoidSubdivider() local468 for(a = 0; a < nPolygonCount; a++) in TrapezoidSubdivider()486 for(a = 0; a < nPolygonCount; a++) in TrapezoidSubdivider()507 for(a = 0; a < nPolygonCount; a++) in TrapezoidSubdivider()
686 const sal_uInt32 nPolygonCount(maOriginal.count()); in getB2DPolyPolygon() local689 for(sal_uInt32 a(0); a < nPolygonCount; a++) in getB2DPolyPolygon()
292 int nPolygonCount = 50; in Demo_PolyPolygonBezier() local293 aCoords.Coordinates = new Point[ nPolygonCount ][ ]; in Demo_PolyPolygonBezier()294 aCoords.Flags = new PolygonFlags[ nPolygonCount ][ ]; in Demo_PolyPolygonBezier()297 for ( nY = 0, i = 0; i < nPolygonCount; i++, nY += nPageHeight / nPolygonCount ) in Demo_PolyPolygonBezier()
119 const sal_uInt32 nPolygonCount(::std::min(rPolA.count(), rPolB.count())); in impAddInBetweenFill() local121 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in impAddInBetweenFill()216 const sal_uInt32 nPolygonCount(::std::min(rPolA.count(), rPolB.count())); in impCreateInBetweenNormals() local218 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in impCreateInBetweenNormals()300 const sal_uInt32 nPolygonCount(::std::min(rPolA.count(), rPolB.count())); in impMixNormals() local302 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in impMixNormals()
65 const sal_uInt32 nPolygonCount(aPolyPolygon.count()); in createViewIndependentPrimitive3DSequence() local68 for(sal_uInt32 a(0); a < nPolygonCount; a++) in createViewIndependentPrimitive3DSequence()
371 const sal_uInt16 nPolygonCount(rPolyPolygon.Count()); in ImplWriteExtendedPolyPolygonAction() local373 if(nPolygonCount) in ImplWriteExtendedPolyPolygonAction()380 for(a = 0; a < nPolygonCount; a++) in ImplWriteExtendedPolyPolygonAction()412 for(a = 0; a < nPolygonCount; a++) in ImplWriteExtendedPolyPolygonAction()454 sal_uInt16 nPolygonCount(0); in ImplReadExtendedPolyPolygonAction() local455 rIStm >> nPolygonCount; in ImplReadExtendedPolyPolygonAction()457 for(sal_uInt16 a(0); a < nPolygonCount; a++) in ImplReadExtendedPolyPolygonAction()
9208 const sal_uInt32 nPolygonCount(aPolyPoly.count()); in drawPolyLine() local9210 for( sal_uInt32 nPoly = 0; nPoly < nPolygonCount; nPoly++ ) in drawPolyLine()
496 const sal_uInt16 nPolygonCount(aPathPolyPolygon.Count()); in IsOpenCloseMarkedObjectsPossible() local498 for(sal_uInt16 b(0); !bRetval && b < nPolygonCount; b++) in IsOpenCloseMarkedObjectsPossible()
1398 const sal_uInt32 nPolygonCount(rPpolyPolygon.count()); in ImpCanDismantle() local1400 if(nPolygonCount >= 2L) in ImpCanDismantle()1405 else if(bMakeLines && 1L == nPolygonCount) in ImpCanDismantle()
1637 const sal_uInt32 nPolygonCount(rPolyPolygon.count()); in streamOutB2DPolyPolygon() local1638 rOut << nPolygonCount; in streamOutB2DPolyPolygon()1640 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in streamOutB2DPolyPolygon()1679 sal_uInt32 nPolygonCount; in streamInB2DPolyPolygon() local1680 rIn >> nPolygonCount; in streamInB2DPolyPolygon()1682 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in streamInB2DPolyPolygon()
2899 const sal_uInt32 nPolygonCount(aPolyPolygon.count()); in exportContour() local2901 if(!nPolygonCount) in exportContour()2945 if(1 == nPolygonCount ) in exportContour()
Completed in 301 milliseconds