Lines Matching refs:sal_uInt32
110 sal_uInt32 getIndexOfPredecessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate) in getIndexOfPredecessor()
128 sal_uInt32 getIndexOfSuccessor(sal_uInt32 nIndex, const B2DPolygon& rCandidate) in getIndexOfSuccessor()
171 B2VectorContinuity getContinuityInPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex) in getContinuityInPoint()
180 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByDistance()
186 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByDistance()
196 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByDistance()
199 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByDistance()
263 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByAngle()
269 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByAngle()
293 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByAngle()
296 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByAngle()
332 B2DPolygon adaptiveSubdivideByCount(const B2DPolygon& rCandidate, sal_uInt32 nCount) in adaptiveSubdivideByCount()
336 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByCount()
342 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByCount()
358 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByCount()
361 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByCount()
408 const sal_uInt32 nPointCount(aCandidate.count()); in isInside()
414 for(sal_uInt32 a(0L); a < nPointCount; a++) in isInside()
460 const sal_uInt32 nPointCount(aPolygon.count()); in isInside()
462 for(sal_uInt32 a(0L); a < nPointCount; a++) in isInside()
477 const sal_uInt32 nPointCount(rCandidate.count()); in getRangeWithControlPoints()
484 for(sal_uInt32 a(0); a < nPointCount; a++) in getRangeWithControlPoints()
509 const sal_uInt32 nPointCount(aCandidate.count()); in getSignedArea()
513 for(sal_uInt32 a(0L); a < nPointCount; a++) in getSignedArea()
552 double getEdgeLength(const B2DPolygon& rCandidate, sal_uInt32 nIndex) in getEdgeLength()
554 const sal_uInt32 nPointCount(rCandidate.count()); in getEdgeLength()
560 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in getEdgeLength()
588 const sal_uInt32 nPointCount(rCandidate.count()); in getLength()
592 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getLength()
599 for(sal_uInt32 a(0); a < nEdgeCount; a++) in getLength()
601 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getLength()
614 for(sal_uInt32 a(0); a < nEdgeCount; a++) in getLength()
616 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getLength()
631 const sal_uInt32 nPointCount(rCandidate.count()); in getPositionAbsolute()
640 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in getPositionAbsolute()
641 sal_uInt32 nIndex(0L); in getPositionAbsolute()
656 sal_uInt32 nCount(sal_uInt32(-fDistance / fLength)); in getPositionAbsolute()
672 sal_uInt32 nCount(sal_uInt32(fDistance / fLength)); 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()
817 … const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in getSnippetAbsolute()
822 for(sal_uInt32 a(0L); !(bStartDone && bEndDone) && a < nEdgeCount; a++) 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()
990 sal_uInt32 nIndex1, sal_uInt32 nIndex2, in findCut()
995 const sal_uInt32 nPointCount(rCandidate.count()); in findCut()
999 sal_uInt32 nEnd1(getIndexOfSuccessor(nIndex1, rCandidate)); in findCut()
1000 sal_uInt32 nEnd2(getIndexOfSuccessor(nIndex2, rCandidate)); in findCut()
1019 const B2DPolygon& rCandidate1, sal_uInt32 nIndex1, in findCut()
1020 const B2DPolygon& rCandidate2, sal_uInt32 nIndex2, in findCut()
1025 const sal_uInt32 nPointCount1(rCandidate1.count()); in findCut()
1026 const sal_uInt32 nPointCount2(rCandidate2.count()); in findCut()
1030 sal_uInt32 nEnd1(getIndexOfSuccessor(nIndex1, rCandidate1)); in findCut()
1031 sal_uInt32 nEnd2(getIndexOfSuccessor(nIndex2, rCandidate2)); in findCut()
1300 const sal_uInt32 nPointCount(rCandidate.count()); in applyLineDashing()
1301 const sal_uInt32 nDotDashCount(rDotDashArray.size()); in applyLineDashing()
1323 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in applyLineDashing()
1327 sal_uInt32 nDotDashIndex(0); in applyLineDashing()
1333 for(sal_uInt32 a(0); a < nEdgeCount; a++) in applyLineDashing()
1337 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in applyLineDashing()
1492 const sal_uInt32 nCount(pLineTarget->count()); in applyLineDashing()
1514 const sal_uInt32 nCount(pGapTarget->count()); in applyLineDashing()
1635 const sal_uInt32 nPointCount(aCandidate.count()); in isInEpsilonRange()
1639 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isInEpsilonRange()
1645 for(sal_uInt32 a(0); a < nEdgeCount; a++) in isInEpsilonRange()
1647 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in isInEpsilonRange()
1855 B2DPolygon impCreateUnitCircle(sal_uInt32 nStartQuadrant) in impCreateUnitCircle()
1876 for(sal_uInt32 a(0); a < STEPSPERQUARTER * 4; a++) in impCreateUnitCircle()
1905 for(sal_uInt32 a(0); a < STEPSPERQUARTER * 2; a++) in createHalfUnitCircle()
1917 B2DPolygon createPolygonFromUnitCircle(sal_uInt32 nStartQuadrant) in createPolygonFromUnitCircle()
2015 const sal_uInt32 nSegments(STEPSPERQUARTER * 4); in createPolygonFromUnitEllipseSegment()
2017 const sal_uInt32 nStartSegment(sal_uInt32(fStart / fAnglePerSegment) % nSegments); in createPolygonFromUnitEllipseSegment()
2018 const sal_uInt32 nEndSegment(sal_uInt32(fEnd / fAnglePerSegment) % nSegments); in createPolygonFromUnitEllipseSegment()
2047 sal_uInt32 nSegment((nStartSegment + 1) % nSegments); in createPolygonFromUnitEllipseSegment()
2096 const sal_uInt32 nPointCount(rCandidate.count()); in hasNeutralPoints()
2103 for(sal_uInt32 a(0L); a < nPointCount; a++) in hasNeutralPoints()
2131 const sal_uInt32 nPointCount(rCandidate.count()); in removeNeutralPoints()
2136 for(sal_uInt32 a(0L); a < nPointCount; a++) in removeNeutralPoints()
2178 const sal_uInt32 nPointCount(rCandidate.count()); in isConvex()
2187 for(sal_uInt32 a(0L); a < nPointCount; a++) in isConvex()
2216 B2VectorOrientation getOrientationForIndex(const B2DPolygon& rCandidate, sal_uInt32 nIndex) in getOrientationForIndex()
2266 const sal_uInt32 nPointCount(aCandidate.count()); in isPointOnPolygon()
2270 const sal_uInt32 nLoopCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isPointOnPolygon()
2273 for(sal_uInt32 a(0L); a < nLoopCount; a++) in isPointOnPolygon()
2336 const sal_uInt32 nCount(rCandidate.count()); in addTriangleFan()
2343 for(sal_uInt32 a(2L); a < nCount; a++) in addTriangleFan()
2477 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in createB3DPolygonFromB2DPolygon()
2493 const sal_uInt32 nCount(rCandidate.count()); in createB2DPolygonFromB3DPolygon()
2496 for(sal_uInt32 a(0L); a < nCount; a++) in createB2DPolygonFromB3DPolygon()
2579 …intToPolygon(const B2DPolygon& rCandidate, const B2DPoint& rTestPoint, sal_uInt32& rEdgeIndex, dou… in getSmallestDistancePointToPolygon()
2582 const sal_uInt32 nPointCount(rCandidate.count()); in getSmallestDistancePointToPolygon()
2587 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getSmallestDistancePointToPolygon()
2591 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in getSmallestDistancePointToPolygon()
2593 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in getSmallestDistancePointToPolygon()
2679 const sal_uInt32 nPointCount(rCandidate.count()); in distort()
2685 for(sal_uInt32 a(0L); a < nPointCount; a++) in distort()
2714 const sal_uInt32 nPointCount(rCandidate.count()); in rotateAroundPoint()
2731 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in expandToCurve()
2739 bool expandToCurveInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex) in expandToCurveInPoint()
2743 const sal_uInt32 nPointCount(rCandidate.count()); in expandToCurveInPoint()
2756 const sal_uInt32 nPrevIndex((nIndex + (nPointCount - 1)) % nPointCount); in expandToCurveInPoint()
2771 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in expandToCurveInPoint()
2785 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in setContinuity()
2793 …bool setContinuityInPoint(B2DPolygon& rCandidate, sal_uInt32 nIndex, B2VectorContinuity eContinuit… in setContinuityInPoint()
2797 const sal_uInt32 nPointCount(rCandidate.count()); in setContinuityInPoint()
2816 const sal_uInt32 nPrevIndex((nIndex + (nPointCount - 1)) % nPointCount); 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()
2965 for(sal_uInt32 a(0L); a < nPointCount; a++) in growInNormalDirection()
2995 B2DPolygon reSegmentPolygon(const B2DPolygon& rCandidate, sal_uInt32 nSegments) in reSegmentPolygon()
2998 const sal_uInt32 nPointCount(rCandidate.count()); in reSegmentPolygon()
3003 const sal_uInt32 nSegmentCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in reSegmentPolygon()
3012 const sal_uInt32 nLoopCount(rCandidate.isClosed() ? nSegments : nSegments + 1L); in reSegmentPolygon()
3014 for(sal_uInt32 a(0L); a < nLoopCount; a++) in reSegmentPolygon()
3029 …B2DPolygon reSegmentPolygonEdges(const B2DPolygon& rCandidate, sal_uInt32 nSubEdges, bool bHandleC… in reSegmentPolygonEdges()
3031 const sal_uInt32 nPointCount(rCandidate.count()); in reSegmentPolygonEdges()
3044 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in reSegmentPolygonEdges()
3051 for(sal_uInt32 a(0); a < nEdgeCount; a++) in reSegmentPolygonEdges()
3054 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in reSegmentPolygonEdges()
3063 for(sal_uInt32 b(nSubEdges); b > 1; b--) in reSegmentPolygonEdges()
3080 for(sal_uInt32 b(nSubEdges); b > 1; b--) in reSegmentPolygonEdges()
3122 for(sal_uInt32 a(0L); a < rOld1.count(); a++) in interpolate()
3154 const sal_uInt32 nCount( rPoly.count() ); in isPolyPolygonEqualRectangle()
3162 for( sal_uInt32 i=0; i<nCount; ++i ) in isPolyPolygonEqualRectangle()
3195 const sal_uInt32 nCount(rCandidate.count()); in createSimplifiedPolygon()
3199 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nCount : nCount - 1); in createSimplifiedPolygon()
3206 for(sal_uInt32 a(0); a < nEdgeCount; a++) in createSimplifiedPolygon()
3209 const sal_uInt32 nNextIndex((a + 1) % nCount); in createSimplifiedPolygon()
3217 sal_uInt32 nExtremumCounter(4); in createSimplifiedPolygon()
3273 const sal_uInt32 nPointCount(rCandidate.count()); in simplifyCurveSegments()
3278 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in simplifyCurveSegments()
3289 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in simplifyCurveSegments()
3292 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in simplifyCurveSegments()
3331 B2DPolygon makeStartPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndexOfNewStatPoint) in makeStartPoint()
3333 const sal_uInt32 nPointCount(rCandidate.count()); 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()
3391 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1); in createEdgesOfGivenLength()
3396 for(sal_uInt32 a(0); a < nEdgeCount; a++) in createEdgesOfGivenLength()
3398 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createEdgesOfGivenLength()
3478 const sal_uInt32 nPointCount(aEqualLenghEdges.count()); 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()
3539 for(sal_uInt32 a(0); a < nPointCount; a++) in equal()
3573 const sal_uInt32 nPointCount(rCandidate.count()); in snapPointsOfHorizontalOrVerticalEdges()
3588 for(sal_uInt32 a(0); a < nPointCount; a++) in snapPointsOfHorizontalOrVerticalEdges()
3592 const sal_uInt32 nNextIndex(bLastRun ? 0 : a + 1); in snapPointsOfHorizontalOrVerticalEdges()
3637 const sal_uInt32 nPointCount(rCandidate.count()); in containsOnlyHorizontalAndVerticalEdges()
3644 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount + 1 : nPointCount); in containsOnlyHorizontalAndVerticalEdges()
3647 for(sal_uInt32 a(1); a < nEdgeCount; a++) in containsOnlyHorizontalAndVerticalEdges()
3649 const sal_uInt32 nNextIndex(a % nPointCount); in containsOnlyHorizontalAndVerticalEdges()
3663 B2DVector getTangentEnteringPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex) in getTangentEnteringPoint()
3666 const sal_uInt32 nCount(rCandidate.count()); in getTangentEnteringPoint()
3676 … sal_uInt32 nPrev(bClosed ? (nIndex + nCount - 1) % nCount : nIndex ? nIndex - 1 : nIndex); in getTangentEnteringPoint()
3707 B2DVector getTangentLeavingPoint(const B2DPolygon& rCandidate, sal_uInt32 nIndex) in getTangentLeavingPoint()
3710 const sal_uInt32 nCount(rCandidate.count()); in getTangentLeavingPoint()
3720 sal_uInt32 nCurrent(nIndex); in getTangentLeavingPoint()
3753 const sal_uInt32 nLength(rPointSequenceSource.getLength()); in UnoPointSequenceToB2DPolygon()
3788 const sal_uInt32 nPointCount(aPolygon.count()); in B2DPolygonToUnoPointSequence()
3800 for(sal_uInt32 b(0); b < nPointCount; b++) in B2DPolygonToUnoPointSequence()
3830 const sal_uInt32 nCount((sal_uInt32)rPointSequenceSource.getLength()); in UnoPolygonBezierCoordsToB2DPolygon()
3831 OSL_ENSURE(nCount == (sal_uInt32)rFlagSequenceSource.getLength(), in UnoPolygonBezierCoordsToB2DPolygon()
3852 for(sal_uInt32 b(1); b < nCount;) in UnoPolygonBezierCoordsToB2DPolygon()
3932 const sal_uInt32 nPointCount(rPolygon.count()); in B2DPolygonToUnoPolygonBezierCoords()
3944 … const sal_uInt32 nLoopCount(bClosed ? nPointCount : (nPointCount ? nPointCount - 1 : 0)); in B2DPolygonToUnoPolygonBezierCoords()
3954 const sal_uInt32 nMaxTargetCount((nLoopCount * 3) + 1); in B2DPolygonToUnoPolygonBezierCoords()
3962 for(sal_uInt32 a(0); a < nLoopCount; a++) in B2DPolygonToUnoPolygonBezierCoords()
3965 const sal_uInt32 nStartPointIndex(aCollectPoints.size()); in B2DPolygonToUnoPolygonBezierCoords()
3973 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in B2DPolygonToUnoPolygonBezierCoords()
4031 const sal_uInt32 nTargetCount(aCollectPoints.size()); in B2DPolygonToUnoPolygonBezierCoords()
4039 for(sal_uInt32 a(0); a < nTargetCount; a++) in B2DPolygonToUnoPolygonBezierCoords()
4051 const sal_uInt32 nTargetCount(nPointCount + (bClosed ? 1 : 0)); in B2DPolygonToUnoPolygonBezierCoords()
4059 for(sal_uInt32 a(0); a < nPointCount; a++) in B2DPolygonToUnoPolygonBezierCoords()