Lines Matching refs:a
45 for(sal_uInt32 a(0L); a < nCount; a++) in correctOrientations() local
47 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in correctOrientations()
53 if(b != a) in correctOrientations()
71 aRetval.setB2DPolygon(a, aFlipped); in correctOrientations()
84 for(sal_uInt32 a(0L); a < nCount; a++) in correctOutmostPolygon() local
86 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in correctOutmostPolygon()
91 if(b != a) in correctOutmostPolygon()
106 if(a != 0L) in correctOutmostPolygon()
110 aRetval.setB2DPolygon(a, rCandidate.getB2DPolygon(0L)); in correctOutmostPolygon()
129 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByDistance() local
131 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in adaptiveSubdivideByDistance()
158 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByAngle() local
160 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in adaptiveSubdivideByAngle()
187 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByCount() local
189 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in adaptiveSubdivideByCount()
221 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in isInside() local
223 const B2DPolygon aPolygon(rCandidate.getB2DPolygon(a)); in isInside()
241 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRangeWithControlPoints() local
243 B2DPolygon aCandidate = rCandidate.getB2DPolygon(a); in getRangeWithControlPoints()
255 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRange() local
257 B2DPolygon aCandidate = rCandidate.getB2DPolygon(a); in getRange()
269 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getSignedArea() local
271 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in getSignedArea()
296 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in applyLineDashing() local
298 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in applyLineDashing()
324 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in isInEpsilonRange() local
326 B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in isInEpsilonRange()
342 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in createB3DPolyPolygonFromB2DPolyPolygon() local
344 B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in createB3DPolyPolygonFromB2DPolyPolygon()
357 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in createB2DPolyPolygonFromB3DPolyPolygon() local
359 B3DPolygon aCandidate(rCandidate.getB3DPolygon(a)); in createB2DPolyPolygonFromB3DPolyPolygon()
373 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getSmallestDistancePointToPolyPolygon() local
375 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in getSmallestDistancePointToPolyPolygon()
383 rPolygonIndex = a; in getSmallestDistancePointToPolyPolygon()
404 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in distort() local
406 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in distort()
419 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in rotateAroundPoint() local
421 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in rotateAroundPoint()
434 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in expandToCurve() local
436 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in expandToCurve()
451 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in setContinuity() local
453 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in setContinuity()
472 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in growInNormalDirection() local
474 aRetval.append(growInNormalDirection(rCandidate.getB2DPolygon(a), fValue)); in growInNormalDirection()
493 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in reSegmentPolyPolygon() local
495 aRetval.append(reSegmentPolygon(rCandidate.getB2DPolygon(a), nSegments)); in reSegmentPolyPolygon()
506 for(sal_uInt32 a(0L); a < rOld1.count(); a++) in interpolate() local
508 aRetval.append(interpolate(rOld1.getB2DPolygon(a), rOld2.getB2DPolygon(a), t)); in interpolate()
530 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in simplifyCurveSegments() local
532 aRetval.append(simplifyCurveSegments(rCandidate.getB2DPolygon(a))); in simplifyCurveSegments()
547 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in reSegmentPolyPolygonEdges() local
549 …aRetval.append(reSegmentPolygonEdges(rCandidate.getB2DPolygon(a), nSubEdges, bHandleCurvedEdges, b… in reSegmentPolyPolygonEdges()
565 for(sal_uInt32 a(0); a < nPolygonCount; a++) in equal() local
567 const B2DPolygon aCandidate(rCandidateA.getB2DPolygon(a)); in equal()
569 if(!equal(aCandidate, rCandidateB.getB2DPolygon(a), rfSmallValue)) in equal()
587 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in snapPointsOfHorizontalOrVerticalEdges() local
589 aRetval.append(snapPointsOfHorizontalOrVerticalEdges(rCandidate.getB2DPolygon(a))); in snapPointsOfHorizontalOrVerticalEdges()
602 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in containsOnlyHorizontalAndVerticalEdges() local
604 if(!containsOnlyHorizontalAndVerticalEdges(rCandidate.getB2DPolygon(a))) in containsOnlyHorizontalAndVerticalEdges()
644 for(sal_uInt32 a(0); a < nCount; a++) in B2DPolyPolygonToUnoPointSequenceSequence() local
646 const B2DPolygon aPolygon(rPolyPolygon.getB2DPolygon(a)); in B2DPolyPolygonToUnoPointSequenceSequence()
675 for(sal_uInt32 a(0); a < nSequenceCount; a++) in UnoPolyPolygonBezierCoordsToB2DPolyPolygon() local
707 for(sal_uInt32 a(0); a < nCount; a++) in B2DPolyPolygonToUnoPolyPolygonBezierCoords() local
709 const B2DPolygon aSource(rPolyPolygon.getB2DPolygon(a)); in B2DPolyPolygonToUnoPolyPolygonBezierCoords()