Lines Matching refs:a
196 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByDistance() local
199 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByDistance()
201 aBezier.setControlPointA(rCandidate.getNextControlPoint(a)); in adaptiveSubdivideByDistance()
293 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByAngle() local
296 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByAngle()
298 aBezier.setControlPointA(rCandidate.getNextControlPoint(a)); in adaptiveSubdivideByAngle()
358 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByCount() local
361 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByCount()
363 aBezier.setControlPointA(rCandidate.getNextControlPoint(a)); in adaptiveSubdivideByCount()
414 for(sal_uInt32 a(0L); a < nPointCount; a++) in isInside() local
417 aCurrentPoint = aCandidate.getB2DPoint(a); in isInside()
462 for(sal_uInt32 a(0L); a < nPointCount; a++) in isInside() local
464 const B2DPoint aTestPoint(aPolygon.getB2DPoint(a)); in isInside()
484 for(sal_uInt32 a(0); a < nPointCount; a++) in getRangeWithControlPoints() local
486 aRetval.expand(rCandidate.getB2DPoint(a)); in getRangeWithControlPoints()
490 aRetval.expand(rCandidate.getNextControlPoint(a)); in getRangeWithControlPoints()
491 aRetval.expand(rCandidate.getPrevControlPoint(a)); in getRangeWithControlPoints()
513 for(sal_uInt32 a(0L); a < nPointCount; a++) in getSignedArea() local
515 const B2DPoint aPreviousPoint(aCandidate.getB2DPoint((!a) ? nPointCount - 1L : a - 1L)); in getSignedArea()
516 const B2DPoint aCurrentPoint(aCandidate.getB2DPoint(a)); in getSignedArea()
599 for(sal_uInt32 a(0); a < nEdgeCount; a++) in getLength() local
601 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getLength()
602 aEdge.setControlPointA(rCandidate.getNextControlPoint(a)); in getLength()
614 for(sal_uInt32 a(0); a < nEdgeCount; a++) in getLength() local
616 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getLength()
822 for(sal_uInt32 a(0L); !(bStartDone && bEndDone) && a < nEdgeCount; a++) in getSnippetAbsolute() local
824 const double fEdgeLength(getEdgeLength(rCandidate, a)); in getSnippetAbsolute()
830 aRetval.append(rCandidate.getB2DPoint(a)); in getSnippetAbsolute()
834 … aRetval.setNextControlPoint(aRetval.count() - 1, rCandidate.getNextControlPoint(a)); in getSnippetAbsolute()
844 aRetval.append(rCandidate.getB2DPoint(a)); in getSnippetAbsolute()
848 … aRetval.setNextControlPoint(aRetval.count() - 1, rCandidate.getNextControlPoint(a)); in getSnippetAbsolute()
853 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
854 const B2DPoint aStart(rCandidate.getB2DPoint(a)); in getSnippetAbsolute()
861 aStart, rCandidate.getNextControlPoint(a), in getSnippetAbsolute()
901 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
911 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
912 const B2DPoint aStart(rCandidate.getB2DPoint(a)); in getSnippetAbsolute()
919 aStart, rCandidate.getNextControlPoint(a), in getSnippetAbsolute()
952 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
1333 for(sal_uInt32 a(0); a < nEdgeCount; a++) in applyLineDashing() local
1337 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in applyLineDashing()
1338 aCurrentEdge.setControlPointA(rCandidate.getNextControlPoint(a)); in applyLineDashing()
1645 for(sal_uInt32 a(0); a < nEdgeCount; a++) in isInEpsilonRange() local
1647 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in isInEpsilonRange()
1876 for(sal_uInt32 a(0); a < STEPSPERQUARTER * 4; a++) in impCreateUnitCircle() local
1905 for(sal_uInt32 a(0); a < STEPSPERQUARTER * 2; a++) in createHalfUnitCircle() local
2103 for(sal_uInt32 a(0L); a < nPointCount; a++) in hasNeutralPoints() local
2105 const B2DPoint aNextPoint(rCandidate.getB2DPoint((a + 1) % nPointCount)); in hasNeutralPoints()
2136 for(sal_uInt32 a(0L); a < nPointCount; a++) in removeNeutralPoints() local
2138 const B2DPoint aNextPoint(rCandidate.getB2DPoint((a + 1) % nPointCount)); in removeNeutralPoints()
2187 for(sal_uInt32 a(0L); a < nPointCount; a++) in isConvex() local
2189 const B2DPoint aNextPoint(rCandidate.getB2DPoint((a + 1) % nPointCount)); in isConvex()
2273 for(sal_uInt32 a(0L); a < nLoopCount; a++) in isPointOnPolygon() local
2275 const B2DPoint aNextPoint(aCandidate.getB2DPoint((a + 1L) % nPointCount)); in isPointOnPolygon()
2343 for(sal_uInt32 a(2L); a < nCount; a++) in addTriangleFan() local
2345 const B2DPoint aCurrent(rCandidate.getB2DPoint(a)); in addTriangleFan()
2477 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in createB3DPolygonFromB2DPolygon() local
2479 B2DPoint aPoint(rCandidate.getB2DPoint(a)); in createB3DPolygonFromB2DPolygon()
2496 for(sal_uInt32 a(0L); a < nCount; a++) in createB2DPolygonFromB3DPolygon() local
2498 B3DPoint aCandidate(rCandidate.getB3DPoint(a)); in createB2DPolygonFromB3DPolygon()
2591 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in getSmallestDistancePointToPolygon() local
2593 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSmallestDistancePointToPolygon()
2601 aBezier.setControlPointA(rCandidate.getNextControlPoint(a)); in getSmallestDistancePointToPolygon()
2619 rEdgeIndex = a; in getSmallestDistancePointToPolygon()
2685 for(sal_uInt32 a(0L); a < nPointCount; a++) in distort() local
2687 …aRetval.append(distort(rCandidate.getB2DPoint(a), rOriginal, rTopLeft, rTopRight, rBottomLeft, rBo… in distort()
2691 if(!rCandidate.getPrevControlPoint(a).equalZero()) in distort()
2693 …aRetval.setPrevControlPoint(a, distort(rCandidate.getPrevControlPoint(a), rOriginal, rTopLeft, rTo… in distort()
2696 if(!rCandidate.getNextControlPoint(a).equalZero()) in distort()
2698 …aRetval.setNextControlPoint(a, distort(rCandidate.getNextControlPoint(a), rOriginal, rTopLeft, rTo… in distort()
2731 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in expandToCurve() local
2733 expandToCurveInPoint(aRetval, a); in expandToCurve()
2785 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in setContinuity() local
2787 setContinuityInPoint(aRetval, a, eContinuity); in setContinuity()
2965 for(sal_uInt32 a(0L); a < nPointCount; a++) in growInNormalDirection() local
2967 const B2DPoint aNext(rCandidate.getB2DPoint(a + 1L == nPointCount ? 0L : a + 1L)); in growInNormalDirection()
3014 for(sal_uInt32 a(0L); a < nLoopCount; a++) in reSegmentPolygon() local
3016 const double fRelativePos((double)a / (double)nSegments); // 0.0 .. 1.0 in reSegmentPolygon()
3051 for(sal_uInt32 a(0); a < nEdgeCount; a++) in reSegmentPolygonEdges() local
3054 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in reSegmentPolygonEdges()
3055 aCurrentEdge.setControlPointA(rCandidate.getNextControlPoint(a)); in reSegmentPolygonEdges()
3122 for(sal_uInt32 a(0L); a < rOld1.count(); a++) in interpolate() local
3124 aRetval.append(interpolate(rOld1.getB2DPoint(a), rOld2.getB2DPoint(a), t)); in interpolate()
3128 …aRetval.setPrevControlPoint(a, interpolate(rOld1.getPrevControlPoint(a), rOld2.getPrevControlPoint… in interpolate()
3129 …aRetval.setNextControlPoint(a, interpolate(rOld1.getNextControlPoint(a), rOld2.getNextControlPoint… in interpolate()
3206 for(sal_uInt32 a(0); a < nEdgeCount; a++) in createSimplifiedPolygon() local
3209 const sal_uInt32 nNextIndex((a + 1) % nCount); in createSimplifiedPolygon()
3210 aSegment.setControlPointA(rCandidate.getNextControlPoint(a)); in createSimplifiedPolygon()
3289 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in simplifyCurveSegments() local
3292 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in simplifyCurveSegments()
3294 aBezier.setControlPointA(rCandidate.getNextControlPoint(a)); in simplifyCurveSegments()
3340 for(sal_uInt32 a(0); a < nPointCount; a++) in makeStartPoint() local
3342 const sal_uInt32 nSourceIndex((a + nIndexOfNewStatPoint) % nPointCount); in makeStartPoint()
3347 aRetval.setPrevControlPoint(a, rCandidate.getPrevControlPoint(nSourceIndex)); in makeStartPoint()
3348 aRetval.setNextControlPoint(a, rCandidate.getNextControlPoint(nSourceIndex)); in makeStartPoint()
3396 for(sal_uInt32 a(0); a < nEdgeCount; a++) in createEdgesOfGivenLength() local
3398 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createEdgesOfGivenLength()
3486 for(sal_uInt32 a(0); a < nPointCount - 1; a++) in createWaveline() local
3488 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createWaveline()
3539 for(sal_uInt32 a(0); a < nPointCount; a++) in equal() local
3541 const B2DPoint aPoint(rCandidateA.getB2DPoint(a)); in equal()
3543 if(!aPoint.equal(rCandidateB.getB2DPoint(a), rfSmallValue)) in equal()
3548 const basegfx::B2DPoint aPrev(rCandidateA.getPrevControlPoint(a)); in equal()
3550 if(!aPrev.equal(rCandidateB.getPrevControlPoint(a), rfSmallValue)) in equal()
3553 const basegfx::B2DPoint aNext(rCandidateA.getNextControlPoint(a)); in equal()
3555 if(!aNext.equal(rCandidateB.getNextControlPoint(a), rfSmallValue)) in equal()
3588 for(sal_uInt32 a(0); a < nPointCount; a++) in snapPointsOfHorizontalOrVerticalEdges() local
3591 const bool bLastRun(a + 1 == nPointCount); in snapPointsOfHorizontalOrVerticalEdges()
3592 const sal_uInt32 nNextIndex(bLastRun ? 0 : a + 1); in snapPointsOfHorizontalOrVerticalEdges()
3610 aRetval.setB2DPoint(a, aSnappedPoint); in snapPointsOfHorizontalOrVerticalEdges()
3647 for(sal_uInt32 a(1); a < nEdgeCount; a++) in containsOnlyHorizontalAndVerticalEdges() local
3649 const sal_uInt32 nNextIndex(a % nPointCount); in containsOnlyHorizontalAndVerticalEdges()
3962 for(sal_uInt32 a(0); a < nLoopCount; a++) in B2DPolygonToUnoPolygonBezierCoords() local
3973 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in B2DPolygonToUnoPolygonBezierCoords()
3975 aBezierSegment.setControlPointA(rPolygon.getNextControlPoint(a)); in B2DPolygonToUnoPolygonBezierCoords()
3995 … if(aBezierSegment.getControlPointA() != aBezierSegment.getStartPoint() && (bClosed || a)) in B2DPolygonToUnoPolygonBezierCoords()
3997 … const B2VectorContinuity eCont(rPolygon.getContinuityInPoint(a)); in B2DPolygonToUnoPolygonBezierCoords()
4039 for(sal_uInt32 a(0); a < nTargetCount; a++) in B2DPolygonToUnoPolygonBezierCoords() local
4041 *pPointSequence = aCollectPoints[a]; in B2DPolygonToUnoPolygonBezierCoords()
4042 *pFlagSequence = aCollectFlags[a]; in B2DPolygonToUnoPolygonBezierCoords()
4059 for(sal_uInt32 a(0); a < nPointCount; a++) in B2DPolygonToUnoPolygonBezierCoords() local
4061 const B2DPoint aB2DPoint(rPolygon.getB2DPoint(a)); in B2DPolygonToUnoPolygonBezierCoords()