Lines Matching refs:nEdgeCount
186 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByDistance() local
196 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByDistance()
269 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByAngle() local
293 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByAngle()
342 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByCount() local
358 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in adaptiveSubdivideByCount()
592 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getLength() local
599 for(sal_uInt32 a(0); a < nEdgeCount; a++) in getLength()
614 for(sal_uInt32 a(0); a < nEdgeCount; a++) in getLength()
640 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in getPositionAbsolute() local
679 nIndex = nEdgeCount; in getPositionAbsolute()
696 if(nIndex < nEdgeCount && fTools::moreOrEqual(fDistance, fEdgeLength)) in getPositionAbsolute()
817 … const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in getSnippetAbsolute() local
822 for(sal_uInt32 a(0L); !(bStartDone && bEndDone) && a < nEdgeCount; a++) in getSnippetAbsolute()
1323 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in applyLineDashing() local
1333 for(sal_uInt32 a(0); a < nEdgeCount; a++) in applyLineDashing()
1639 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isInEpsilonRange() local
1642 if(nEdgeCount) in isInEpsilonRange()
1645 for(sal_uInt32 a(0); a < nEdgeCount; a++) in isInEpsilonRange()
2587 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getSmallestDistancePointToPolygon() local
2591 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in getSmallestDistancePointToPolygon()
2644 if(rEdgeIndex != nEdgeCount - 1L) in getSmallestDistancePointToPolygon()
3044 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in reSegmentPolygonEdges() local
3051 for(sal_uInt32 a(0); a < nEdgeCount; a++) in reSegmentPolygonEdges()
3199 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nCount : nCount - 1); in createSimplifiedPolygon() local
3206 for(sal_uInt32 a(0); a < nEdgeCount; a++) in createSimplifiedPolygon()
3278 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in simplifyCurveSegments() local
3284 aRetval.reserve( nEdgeCount+1); in simplifyCurveSegments()
3289 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in simplifyCurveSegments()
3391 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1); in createEdgesOfGivenLength() local
3396 for(sal_uInt32 a(0); a < nEdgeCount; a++) in createEdgesOfGivenLength()
3644 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount + 1 : nPointCount); in containsOnlyHorizontalAndVerticalEdges() local
3647 for(sal_uInt32 a(1); a < nEdgeCount; a++) in containsOnlyHorizontalAndVerticalEdges()