Lines Matching refs:nCount
332 B2DPolygon adaptiveSubdivideByCount(const B2DPolygon& rCandidate, sal_uInt32 nCount) in adaptiveSubdivideByCount() argument
353 if(0L == nCount) in adaptiveSubdivideByCount()
355 nCount = COUNT_SUBDIVIDE_DEFAULT; in adaptiveSubdivideByCount()
370 aBezier.adaptiveSubdivideByCount(aRetval, nCount); in adaptiveSubdivideByCount()
656 sal_uInt32 nCount(sal_uInt32(-fDistance / fLength)); in getPositionAbsolute() local
657 fDistance += double(nCount + 1L) * fLength; in getPositionAbsolute()
672 sal_uInt32 nCount(sal_uInt32(fDistance / fLength)); in getPositionAbsolute() local
673 fDistance -= (double)(nCount) * fLength; in getPositionAbsolute()
1492 const sal_uInt32 nCount(pLineTarget->count()); in applyLineDashing() local
1494 if(nCount > 1) in applyLineDashing()
1499 B2DPolygon aLast(pLineTarget->getB2DPolygon(nCount - 1)); in applyLineDashing()
1507 pLineTarget->remove(nCount - 1); in applyLineDashing()
1514 const sal_uInt32 nCount(pGapTarget->count()); in applyLineDashing() local
1516 if(nCount > 1) in applyLineDashing()
1521 B2DPolygon aLast(pGapTarget->getB2DPolygon(nCount - 1)); in applyLineDashing()
1529 pGapTarget->remove(nCount - 1); in applyLineDashing()
2336 const sal_uInt32 nCount(rCandidate.count()); in addTriangleFan() local
2338 if(nCount > 2L) in addTriangleFan()
2343 for(sal_uInt32 a(2L); a < nCount; a++) in addTriangleFan()
2390 const sal_Int32 nCount( rPoly.count() ); in isRectangle() local
2391 for( sal_Int32 i=0; i<nCount; ++i ) in isRectangle()
2393 const B2DPoint& rPoint0( rPoly.getB2DPoint(i % nCount) ); in isRectangle()
2394 const B2DPoint& rPoint1( rPoly.getB2DPoint((i+1) % nCount) ); in isRectangle()
2493 const sal_uInt32 nCount(rCandidate.count()); in createB2DPolygonFromB3DPolygon() local
2496 for(sal_uInt32 a(0L); a < nCount; a++) in createB2DPolygonFromB3DPolygon()
3154 const sal_uInt32 nCount( rPoly.count() ); in isPolyPolygonEqualRectangle() local
3162 for( sal_uInt32 i=0; i<nCount; ++i ) in isPolyPolygonEqualRectangle()
3195 const sal_uInt32 nCount(rCandidate.count()); in createSimplifiedPolygon() local
3197 if(nCount && rCandidate.areControlPointsUsed()) in createSimplifiedPolygon()
3199 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nCount : nCount - 1); in createSimplifiedPolygon()
3209 const sal_uInt32 nNextIndex((a + 1) % nCount); in createSimplifiedPolygon()
3666 const sal_uInt32 nCount(rCandidate.count()); in getTangentEnteringPoint() local
3668 if(nIndex >= nCount) in getTangentEnteringPoint()
3676 … sal_uInt32 nPrev(bClosed ? (nIndex + nCount - 1) % nCount : nIndex ? nIndex - 1 : nIndex); in getTangentEnteringPoint()
3701 nPrev = bClosed ? (nPrev + nCount - 1) % nCount : nPrev ? nPrev - 1 : nIndex; in getTangentEnteringPoint()
3710 const sal_uInt32 nCount(rCandidate.count()); in getTangentLeavingPoint() local
3712 if(nIndex >= nCount) in getTangentLeavingPoint()
3738 … nCurrent = bClosed ? (nCurrent + 1) % nCount : nCurrent + 1 < nCount ? nCurrent + 1 : nIndex; in getTangentLeavingPoint()
3830 const sal_uInt32 nCount((sal_uInt32)rPointSequenceSource.getLength()); in UnoPolygonBezierCoordsToB2DPolygon() local
3831 OSL_ENSURE(nCount == (sal_uInt32)rFlagSequenceSource.getLength(), in UnoPolygonBezierCoordsToB2DPolygon()
3852 for(sal_uInt32 b(1); b < nCount;) in UnoPolygonBezierCoordsToB2DPolygon()
3863 if(b < nCount && com::sun::star::drawing::PolygonFlags_CONTROL == ePolygonFlag) in UnoPolygonBezierCoordsToB2DPolygon()
3874 if(b < nCount && com::sun::star::drawing::PolygonFlags_CONTROL == ePolygonFlag) in UnoPolygonBezierCoordsToB2DPolygon()