Lines Matching refs:nPointCount
180 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByDistance() local
183 if(nPointCount) in adaptiveSubdivideByDistance()
186 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByDistance()
191 aRetval.reserve(nPointCount*4); in adaptiveSubdivideByDistance()
199 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByDistance()
263 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByAngle() local
266 if(nPointCount) in adaptiveSubdivideByAngle()
269 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByAngle()
274 aRetval.reserve(nPointCount*4); in adaptiveSubdivideByAngle()
296 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByAngle()
336 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByCount() local
339 if(nPointCount) in adaptiveSubdivideByCount()
342 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByCount()
347 aRetval.reserve(nPointCount*4); in adaptiveSubdivideByCount()
361 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByCount()
408 const sal_uInt32 nPointCount(aCandidate.count()); in isInside() local
410 if(nPointCount) in isInside()
412 B2DPoint aCurrentPoint(aCandidate.getB2DPoint(nPointCount - 1L)); in isInside()
414 for(sal_uInt32 a(0L); a < nPointCount; a++) in isInside()
460 const sal_uInt32 nPointCount(aPolygon.count()); in isInside() local
462 for(sal_uInt32 a(0L); a < nPointCount; a++) in isInside()
477 const sal_uInt32 nPointCount(rCandidate.count()); in getRangeWithControlPoints() local
480 if(nPointCount) in getRangeWithControlPoints()
484 for(sal_uInt32 a(0); a < nPointCount; a++) in getRangeWithControlPoints()
509 const sal_uInt32 nPointCount(aCandidate.count()); in getSignedArea() local
511 if(nPointCount > 2) in getSignedArea()
513 for(sal_uInt32 a(0L); a < nPointCount; a++) in getSignedArea()
515 const B2DPoint aPreviousPoint(aCandidate.getB2DPoint((!a) ? nPointCount - 1L : a - 1L)); in getSignedArea()
554 const sal_uInt32 nPointCount(rCandidate.count()); in getEdgeLength() local
555 OSL_ENSURE(nIndex < nPointCount, "getEdgeLength: Access to polygon out of range (!)"); in getEdgeLength()
558 if(nPointCount) in getEdgeLength()
560 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in getEdgeLength()
588 const sal_uInt32 nPointCount(rCandidate.count()); in getLength() local
590 if(nPointCount) in getLength()
592 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getLength()
601 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getLength()
616 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getLength()
631 const sal_uInt32 nPointCount(rCandidate.count()); in getPositionAbsolute() local
633 if( 1L == nPointCount ) in getPositionAbsolute()
638 else if(nPointCount > 1L) in getPositionAbsolute()
640 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in getPositionAbsolute()
719 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in getPositionAbsolute()
730 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in getPositionAbsolute()
781 const sal_uInt32 nPointCount(rCandidate.count()); in getSnippetAbsolute() local
783 if(nPointCount) in getSnippetAbsolute()
817 … const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in getSnippetAbsolute()
853 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
901 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
911 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
952 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSnippetAbsolute()
995 const sal_uInt32 nPointCount(rCandidate.count()); in findCut() local
997 if(nIndex1 < nPointCount && nIndex2 < nPointCount && nIndex1 != nIndex2) in findCut()
1300 const sal_uInt32 nPointCount(rCandidate.count()); in applyLineDashing() local
1308 if(fTools::more(fDotDashLength, 0.0) && (pLineTarget || pGapTarget) && nPointCount) in applyLineDashing()
1323 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in applyLineDashing()
1337 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in applyLineDashing()
1635 const sal_uInt32 nPointCount(aCandidate.count()); in isInEpsilonRange() local
1637 if(nPointCount) in isInEpsilonRange()
1639 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isInEpsilonRange()
1647 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in isInEpsilonRange()
2096 const sal_uInt32 nPointCount(rCandidate.count()); in hasNeutralPoints() local
2098 if(nPointCount > 2L) in hasNeutralPoints()
2100 B2DPoint aPrevPoint(rCandidate.getB2DPoint(nPointCount - 1L)); in hasNeutralPoints()
2103 for(sal_uInt32 a(0L); a < nPointCount; a++) in hasNeutralPoints()
2105 const B2DPoint aNextPoint(rCandidate.getB2DPoint((a + 1) % nPointCount)); in hasNeutralPoints()
2131 const sal_uInt32 nPointCount(rCandidate.count()); in removeNeutralPoints() local
2133 B2DPoint aPrevPoint(rCandidate.getB2DPoint(nPointCount - 1L)); in removeNeutralPoints()
2136 for(sal_uInt32 a(0L); a < nPointCount; a++) in removeNeutralPoints()
2138 const B2DPoint aNextPoint(rCandidate.getB2DPoint((a + 1) % nPointCount)); in removeNeutralPoints()
2178 const sal_uInt32 nPointCount(rCandidate.count()); in isConvex() local
2180 if(nPointCount > 2L) in isConvex()
2182 const B2DPoint aPrevPoint(rCandidate.getB2DPoint(nPointCount - 1L)); in isConvex()
2187 for(sal_uInt32 a(0L); a < nPointCount; a++) in isConvex()
2189 const B2DPoint aNextPoint(rCandidate.getB2DPoint((a + 1) % nPointCount)); in isConvex()
2266 const sal_uInt32 nPointCount(aCandidate.count()); in isPointOnPolygon() local
2268 if(nPointCount > 1L) in isPointOnPolygon()
2270 const sal_uInt32 nLoopCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isPointOnPolygon()
2275 const B2DPoint aNextPoint(aCandidate.getB2DPoint((a + 1L) % nPointCount)); in isPointOnPolygon()
2285 else if(nPointCount && bWithPoints) in isPointOnPolygon()
2582 const sal_uInt32 nPointCount(rCandidate.count()); in getSmallestDistancePointToPolygon() local
2584 if(nPointCount > 1L) in getSmallestDistancePointToPolygon()
2587 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getSmallestDistancePointToPolygon()
2593 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSmallestDistancePointToPolygon()
2679 const sal_uInt32 nPointCount(rCandidate.count()); in distort() local
2681 if(nPointCount && 0.0 != rOriginal.getWidth() && 0.0 != rOriginal.getHeight()) in distort()
2685 for(sal_uInt32 a(0L); a < nPointCount; a++) in distort()
2714 const sal_uInt32 nPointCount(rCandidate.count()); in rotateAroundPoint() local
2717 if(nPointCount) in rotateAroundPoint()
2743 const sal_uInt32 nPointCount(rCandidate.count()); in expandToCurveInPoint() local
2745 if(nPointCount) in expandToCurveInPoint()
2756 const sal_uInt32 nPrevIndex((nIndex + (nPointCount - 1)) % nPointCount); in expandToCurveInPoint()
2765 if(!rCandidate.isClosed() && nIndex + 1 == nPointCount) in expandToCurveInPoint()
2771 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in expandToCurveInPoint()
2797 const sal_uInt32 nPointCount(rCandidate.count()); in setContinuityInPoint() local
2799 if(nPointCount) in setContinuityInPoint()
2816 const sal_uInt32 nPrevIndex((nIndex + (nPointCount - 1)) % nPointCount); in setContinuityInPoint()
2825 if(!rCandidate.isClosed() && nIndex == nPointCount + 1) in setContinuityInPoint()
2832 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in setContinuityInPoint()
2860 const sal_uInt32 nPrevIndex((nIndex + (nPointCount - 1)) % nPointCount); in setContinuityInPoint()
2861 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in setContinuityInPoint()
2958 const sal_uInt32 nPointCount(rCandidate.count()); in growInNormalDirection() local
2960 if(nPointCount) in growInNormalDirection()
2962 B2DPoint aPrev(rCandidate.getB2DPoint(nPointCount - 1L)); in growInNormalDirection()
2965 for(sal_uInt32 a(0L); a < nPointCount; a++) in growInNormalDirection()
2967 const B2DPoint aNext(rCandidate.getB2DPoint(a + 1L == nPointCount ? 0L : a + 1L)); in growInNormalDirection()
2998 const sal_uInt32 nPointCount(rCandidate.count()); in reSegmentPolygon() local
3000 if(nPointCount && nSegments) in reSegmentPolygon()
3003 const sal_uInt32 nSegmentCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in reSegmentPolygon()
3031 const sal_uInt32 nPointCount(rCandidate.count()); in reSegmentPolygonEdges() local
3033 if(nPointCount < 2 || nSubEdges < 2 || (!bHandleCurvedEdges && !bHandleStraightEdges)) in reSegmentPolygonEdges()
3044 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in reSegmentPolygonEdges()
3054 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in reSegmentPolygonEdges()
3273 const sal_uInt32 nPointCount(rCandidate.count()); in simplifyCurveSegments() local
3275 if(nPointCount && rCandidate.areControlPointsUsed()) in simplifyCurveSegments()
3278 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in simplifyCurveSegments()
3292 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in simplifyCurveSegments()
3333 const sal_uInt32 nPointCount(rCandidate.count()); in makeStartPoint() local
3335 if(nPointCount > 2 && nIndexOfNewStatPoint != 0 && nIndexOfNewStatPoint < nPointCount) in makeStartPoint()
3340 for(sal_uInt32 a(0); a < nPointCount; a++) in makeStartPoint()
3342 const sal_uInt32 nSourceIndex((a + nIndexOfNewStatPoint) % nPointCount); in makeStartPoint()
3386 const sal_uInt32 nPointCount(aCandidate.count()); in createEdgesOfGivenLength() local
3388 if(nPointCount > 1) in createEdgesOfGivenLength()
3391 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1); in createEdgesOfGivenLength()
3398 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createEdgesOfGivenLength()
3478 const sal_uInt32 nPointCount(aEqualLenghEdges.count()); in createWaveline() local
3480 if(nPointCount > 1) in createWaveline()
3486 for(sal_uInt32 a(0); a < nPointCount - 1; a++) in createWaveline()
3488 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createWaveline()
3524 const sal_uInt32 nPointCount(rCandidateA.count()); in equal() local
3526 if(nPointCount != rCandidateB.count()) in equal()
3539 for(sal_uInt32 a(0); a < nPointCount; a++) in equal()
3573 const sal_uInt32 nPointCount(rCandidate.count()); in snapPointsOfHorizontalOrVerticalEdges() local
3575 if(nPointCount > 1) in snapPointsOfHorizontalOrVerticalEdges()
3582 B2ITuple aPrevTuple(basegfx::fround(rCandidate.getB2DPoint(nPointCount - 1))); in snapPointsOfHorizontalOrVerticalEdges()
3588 for(sal_uInt32 a(0); a < nPointCount; a++) in snapPointsOfHorizontalOrVerticalEdges()
3591 const bool bLastRun(a + 1 == nPointCount); in snapPointsOfHorizontalOrVerticalEdges()
3637 const sal_uInt32 nPointCount(rCandidate.count()); in containsOnlyHorizontalAndVerticalEdges() local
3639 if(nPointCount < 2) in containsOnlyHorizontalAndVerticalEdges()
3644 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount + 1 : nPointCount); in containsOnlyHorizontalAndVerticalEdges()
3649 const sal_uInt32 nNextIndex(a % nPointCount); in containsOnlyHorizontalAndVerticalEdges()
3788 const sal_uInt32 nPointCount(aPolygon.count()); in B2DPolygonToUnoPointSequence() local
3790 if(nPointCount) in B2DPolygonToUnoPointSequence()
3797 rPointSequenceRetval.realloc(bIsClosed ? nPointCount + 1 : nPointCount); in B2DPolygonToUnoPointSequence()
3800 for(sal_uInt32 b(0); b < nPointCount; b++) in B2DPolygonToUnoPointSequence()
3932 const sal_uInt32 nPointCount(rPolygon.count()); in B2DPolygonToUnoPolygonBezierCoords() local
3934 if(nPointCount) in B2DPolygonToUnoPolygonBezierCoords()
3939 if(nPointCount) in B2DPolygonToUnoPolygonBezierCoords()
3944 … const sal_uInt32 nLoopCount(bClosed ? nPointCount : (nPointCount ? nPointCount - 1 : 0)); in B2DPolygonToUnoPolygonBezierCoords()
3973 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in B2DPolygonToUnoPolygonBezierCoords()
4022 … const B2DPoint aClosingPoint(rPolygon.getB2DPoint(nPointCount - 1L)); in B2DPolygonToUnoPolygonBezierCoords()
4051 const sal_uInt32 nTargetCount(nPointCount + (bClosed ? 1 : 0)); in B2DPolygonToUnoPolygonBezierCoords()
4059 for(sal_uInt32 a(0); a < nPointCount; a++) in B2DPolygonToUnoPolygonBezierCoords()