Lines Matching refs:count
64 if(rCandidate.count()) in openWithGeometryChange()
70 rCandidate.setPrevControlPoint(rCandidate.count() - 1, rCandidate.getPrevControlPoint(0)); in openWithGeometryChange()
83 …while(rCandidate.count() > 1 && rCandidate.getB2DPoint(0) == rCandidate.getB2DPoint(rCandidate.cou… in closeWithGeometryChange()
85 … if(rCandidate.areControlPointsUsed() && rCandidate.isPrevControlPointUsed(rCandidate.count() - 1)) in closeWithGeometryChange()
87 rCandidate.setPrevControlPoint(0, rCandidate.getPrevControlPoint(rCandidate.count() - 1)); in closeWithGeometryChange()
90 rCandidate.remove(rCandidate.count() - 1); in closeWithGeometryChange()
102 …if(rCandidate.count() > 1 && rCandidate.getB2DPoint(0) == rCandidate.getB2DPoint(rCandidate.count(… in checkClosed()
112 …OSL_ENSURE(nIndex < rCandidate.count(), "getIndexOfPredecessor: Access to polygon out of range (!)… in getIndexOfPredecessor()
118 else if(rCandidate.count()) in getIndexOfPredecessor()
120 return rCandidate.count() - 1L; in getIndexOfPredecessor()
130 …OSL_ENSURE(nIndex < rCandidate.count(), "getIndexOfPredecessor: Access to polygon out of range (!)… in getIndexOfSuccessor()
132 if(nIndex + 1L < rCandidate.count()) in getIndexOfSuccessor()
136 else if(nIndex + 1L == rCandidate.count()) in getIndexOfSuccessor()
150 if(rCandidate.count() > 2L || rCandidate.areControlPointsUsed()) in getOrientation()
180 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByDistance()
263 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByAngle()
336 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByCount()
408 const sal_uInt32 nPointCount(aCandidate.count()); in isInside()
460 const sal_uInt32 nPointCount(aPolygon.count()); in isInside()
477 const sal_uInt32 nPointCount(rCandidate.count()); in getRangeWithControlPoints()
509 const sal_uInt32 nPointCount(aCandidate.count()); in getSignedArea()
538 if(rCandidate.count() > 2 || rCandidate.areControlPointsUsed()) in getArea()
554 const sal_uInt32 nPointCount(rCandidate.count()); in getEdgeLength()
588 const sal_uInt32 nPointCount(rCandidate.count()); in getLength()
631 const sal_uInt32 nPointCount(rCandidate.count()); in getPositionAbsolute()
781 const sal_uInt32 nPointCount(rCandidate.count()); in getSnippetAbsolute()
834 … aRetval.setNextControlPoint(aRetval.count() - 1, rCandidate.getNextControlPoint(a)); in getSnippetAbsolute()
848 … aRetval.setNextControlPoint(aRetval.count() - 1, rCandidate.getNextControlPoint(a)); in getSnippetAbsolute()
874 … aRetval.setNextControlPoint(aRetval.count() - 1, aRight.getControlPointA()); in getSnippetAbsolute()
906 … aRetval.setPrevControlPoint(aRetval.count() - 1, rCandidate.getPrevControlPoint(nNextIndex)); in getSnippetAbsolute()
932 … aRetval.setPrevControlPoint(aRetval.count() - 1, aLeft.getControlPointB()); in getSnippetAbsolute()
957 … aRetval.setPrevControlPoint(aRetval.count() - 1, rCandidate.getPrevControlPoint(nNextIndex)); in getSnippetAbsolute()
958 … aRetval.setNextControlPoint(aRetval.count() - 1, rCandidate.getNextControlPoint(nNextIndex)); in getSnippetAbsolute()
995 const sal_uInt32 nPointCount(rCandidate.count()); in findCut()
1025 const sal_uInt32 nPointCount1(rCandidate1.count()); in findCut()
1026 const sal_uInt32 nPointCount2(rCandidate2.count()); in findCut()
1300 const sal_uInt32 nPointCount(rCandidate.count()); in applyLineDashing()
1365 if(!aSnippet.count()) in applyLineDashing()
1401 if(!aSnippet.count()) in applyLineDashing()
1428 if(!aSnippet.count()) in applyLineDashing()
1459 if(!aSnippet.count()) in applyLineDashing()
1477 if(aSnippet.count()) in applyLineDashing()
1492 const sal_uInt32 nCount(pLineTarget->count()); in applyLineDashing()
1501 if(aFirst.getB2DPoint(0).equal(aLast.getB2DPoint(aLast.count() - 1))) in applyLineDashing()
1514 const sal_uInt32 nCount(pGapTarget->count()); in applyLineDashing()
1523 if(aFirst.getB2DPoint(0).equal(aLast.getB2DPoint(aLast.count() - 1))) in applyLineDashing()
1635 const sal_uInt32 nPointCount(aCandidate.count()); in isInEpsilonRange()
1836 if(!aRetval.count()) in createUnitPolygon()
1894 if(!aUnitHalfCircle.count()) in createHalfUnitCircle()
1925 if(!aUnitCircleStartQuadrantOne.count()) in createPolygonFromUnitCircle()
1937 if(!aUnitCircleStartQuadrantTwo.count()) in createPolygonFromUnitCircle()
1949 if(!aUnitCircleStartQuadrantThree.count()) in createPolygonFromUnitCircle()
1961 if(!aUnitCircleStartQuadrantZero.count()) in createPolygonFromUnitCircle()
2096 const sal_uInt32 nPointCount(rCandidate.count()); in hasNeutralPoints()
2131 const sal_uInt32 nPointCount(rCandidate.count()); in removeNeutralPoints()
2159 while(aRetval.count() && ORIENTATION_NEUTRAL == getOrientationForIndex(aRetval, 0L)) in removeNeutralPoints()
2178 const sal_uInt32 nPointCount(rCandidate.count()); in isConvex()
2218 OSL_ENSURE(nIndex < rCandidate.count(), "getOrientationForIndex: index out of range (!)"); in getOrientationForIndex()
2266 const sal_uInt32 nPointCount(aCandidate.count()); in isPointOnPolygon()
2336 const sal_uInt32 nCount(rCandidate.count()); in addTriangleFan()
2370 rPoly.count() < 4 || in isRectangle()
2390 const sal_Int32 nCount( rPoly.count() ); in isRectangle()
2477 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in createB3DPolygonFromB2DPolygon()
2493 const sal_uInt32 nCount(rCandidate.count()); in createB2DPolygonFromB3DPolygon()
2582 const sal_uInt32 nPointCount(rCandidate.count()); in getSmallestDistancePointToPolygon()
2679 const sal_uInt32 nPointCount(rCandidate.count()); in distort()
2714 const sal_uInt32 nPointCount(rCandidate.count()); in rotateAroundPoint()
2731 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in expandToCurve()
2741 …OSL_ENSURE(nIndex < rCandidate.count(), "expandToCurveInPoint: Access to polygon out of range (!)"… in expandToCurveInPoint()
2743 const sal_uInt32 nPointCount(rCandidate.count()); in expandToCurveInPoint()
2785 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in setContinuity()
2795 …OSL_ENSURE(nIndex < rCandidate.count(), "setContinuityInPoint: Access to polygon out of range (!)"… in setContinuityInPoint()
2797 const sal_uInt32 nPointCount(rCandidate.count()); in setContinuityInPoint()
2958 const sal_uInt32 nPointCount(rCandidate.count()); in growInNormalDirection()
2998 const sal_uInt32 nPointCount(rCandidate.count()); in reSegmentPolygon()
3031 const sal_uInt32 nPointCount(rCandidate.count()); in reSegmentPolygonEdges()
3106 OSL_ENSURE(rOld1.count() == rOld2.count(), "B2DPolygon interpolate: Different geometry (!)"); in interpolate()
3122 for(sal_uInt32 a(0L); a < rOld1.count(); a++) in interpolate()
3141 if( rPolyPoly.count() != 1 ) in isPolyPolygonEqualRectangle()
3154 const sal_uInt32 nCount( rPoly.count() ); in isPolyPolygonEqualRectangle()
3195 const sal_uInt32 nCount(rCandidate.count()); in createSimplifiedPolygon()
3273 const sal_uInt32 nPointCount(rCandidate.count()); in simplifyCurveSegments()
3333 const sal_uInt32 nPointCount(rCandidate.count()); in makeStartPoint()
3386 const sal_uInt32 nPointCount(aCandidate.count()); in createEdgesOfGivenLength()
3478 const sal_uInt32 nPointCount(aEqualLenghEdges.count()); in createWaveline()
3524 const sal_uInt32 nPointCount(rCandidateA.count()); in equal()
3526 if(nPointCount != rCandidateB.count()) in equal()
3573 const sal_uInt32 nPointCount(rCandidate.count()); in snapPointsOfHorizontalOrVerticalEdges()
3637 const sal_uInt32 nPointCount(rCandidate.count()); in containsOnlyHorizontalAndVerticalEdges()
3666 const sal_uInt32 nCount(rCandidate.count()); in getTangentEnteringPoint()
3710 const sal_uInt32 nCount(rCandidate.count()); in getTangentLeavingPoint()
3788 const sal_uInt32 nPointCount(aPolygon.count()); in B2DPolygonToUnoPointSequence()
3900 && aControlA.equal(aRetval.getB2DPoint(aRetval.count() - 1))) in UnoPolygonBezierCoordsToB2DPolygon()
3932 const sal_uInt32 nPointCount(rPolygon.count()); in B2DPolygonToUnoPolygonBezierCoords()