Lines Matching refs:sal_uInt32
43 const sal_uInt32 nCount(aRetval.count()); in correctOrientations()
45 for(sal_uInt32 a(0L); a < nCount; a++) in correctOrientations()
49 sal_uInt32 nDepth(0L); in correctOrientations()
51 for(sal_uInt32 b(0L); b < nCount; b++) in correctOrientations()
80 const sal_uInt32 nCount(rCandidate.count()); in correctOutmostPolygon()
84 for(sal_uInt32 a(0L); a < nCount; a++) in correctOutmostPolygon()
87 sal_uInt32 nDepth(0L); in correctOutmostPolygon()
89 for(sal_uInt32 b(0L); b < nCount; b++) in correctOutmostPolygon()
126 const sal_uInt32 nPolygonCount(rCandidate.count()); in adaptiveSubdivideByDistance()
129 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByDistance()
155 const sal_uInt32 nPolygonCount(rCandidate.count()); in adaptiveSubdivideByAngle()
158 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByAngle()
180 B2DPolyPolygon adaptiveSubdivideByCount(const B2DPolyPolygon& rCandidate, sal_uInt32 nCount) in adaptiveSubdivideByCount()
184 const sal_uInt32 nPolygonCount(rCandidate.count()); in adaptiveSubdivideByCount()
187 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in adaptiveSubdivideByCount()
211 const sal_uInt32 nPolygonCount(rCandidate.count()); in isInside()
221 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in isInside()
239 const sal_uInt32 nPolygonCount(rCandidate.count()); in getRangeWithControlPoints()
241 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRangeWithControlPoints()
253 const sal_uInt32 nPolygonCount(rCandidate.count()); in getRange()
255 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getRange()
267 const sal_uInt32 nPolygonCount(rCandidate.count()); in getSignedArea()
269 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getSignedArea()
296 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in applyLineDashing()
322 const sal_uInt32 nPolygonCount(rCandidate.count()); in isInEpsilonRange()
324 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in isInEpsilonRange()
339 const sal_uInt32 nPolygonCount(rCandidate.count()); in createB3DPolyPolygonFromB2DPolyPolygon()
342 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in createB3DPolyPolygonFromB2DPolyPolygon()
354 const sal_uInt32 nPolygonCount(rCandidate.count()); in createB2DPolyPolygonFromB3DPolyPolygon()
357 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in createB2DPolyPolygonFromB3DPolyPolygon()
367 …t B2DPolyPolygon& rCandidate, const B2DPoint& rTestPoint, sal_uInt32& rPolygonIndex, sal_uInt32& r… in getSmallestDistancePointToPolyPolygon()
371 const sal_uInt32 nPolygonCount(rCandidate.count()); in getSmallestDistancePointToPolyPolygon()
373 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in getSmallestDistancePointToPolyPolygon()
376 sal_uInt32 nNewEdgeIndex; in getSmallestDistancePointToPolyPolygon()
401 const sal_uInt32 nPolygonCount(rCandidate.count()); in distort()
404 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in distort()
416 const sal_uInt32 nPolygonCount(rCandidate.count()); in rotateAroundPoint()
419 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in rotateAroundPoint()
431 const sal_uInt32 nPolygonCount(rCandidate.count()); in expandToCurve()
434 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in expandToCurve()
448 const sal_uInt32 nPolygonCount(rCandidate.count()); in setContinuity()
451 for(sal_uInt32 a(0L); a < nPolygonCount; a++) in setContinuity()
472 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in growInNormalDirection()
489 B2DPolyPolygon reSegmentPolyPolygon(const B2DPolyPolygon& rCandidate, sal_uInt32 nSegments) in reSegmentPolyPolygon()
493 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in reSegmentPolyPolygon()
506 for(sal_uInt32 a(0L); a < rOld1.count(); a++) in interpolate()
530 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in simplifyCurveSegments()
543 …B2DPolyPolygon reSegmentPolyPolygonEdges(const B2DPolyPolygon& rCandidate, sal_uInt32 nSubEdges, b… in reSegmentPolyPolygonEdges()
547 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in reSegmentPolyPolygonEdges()
560 const sal_uInt32 nPolygonCount(rCandidateA.count()); in equal()
565 for(sal_uInt32 a(0); a < nPolygonCount; a++) in equal()
587 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in snapPointsOfHorizontalOrVerticalEdges()
602 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in containsOnlyHorizontalAndVerticalEdges()
637 const sal_uInt32 nCount(rPolyPolygon.count()); in B2DPolyPolygonToUnoPointSequenceSequence()
644 for(sal_uInt32 a(0); a < nCount; a++) in B2DPolyPolygonToUnoPointSequenceSequence()
666 …const sal_uInt32 nSequenceCount((sal_uInt32)rPolyPolygonBezierCoordsSource.Coordinates.getLength()… in UnoPolyPolygonBezierCoordsToB2DPolyPolygon()
670 … OSL_ENSURE(nSequenceCount == (sal_uInt32)rPolyPolygonBezierCoordsSource.Flags.getLength(), in UnoPolyPolygonBezierCoordsToB2DPolyPolygon()
675 for(sal_uInt32 a(0); a < nSequenceCount; a++) in UnoPolyPolygonBezierCoordsToB2DPolyPolygon()
695 const sal_uInt32 nCount(rPolyPolygon.count()); in B2DPolyPolygonToUnoPolyPolygonBezierCoords()
707 for(sal_uInt32 a(0); a < nCount; a++) in B2DPolyPolygonToUnoPolyPolygonBezierCoords()