| /trunk/main/basegfx/source/curve/ |
| H A D | b2dcubicbezier.cxx | 696 const sal_uInt32 nPointCount(aInitialPolygon.count()); in getSmallestDistancePointToBezierSegment() local
702 for(sal_uInt32 a(1L); a < nPointCount; a++) in getSmallestDistancePointToBezierSegment()
715 double fStepValue(1.0 / (double)((nPointCount - 1L) * 2L)); // half the edge step width in getSmallestDistancePointToBezierSegment()
716 double fPosition((double)nSmallestIndex / (double)(nPointCount - 1L)); in getSmallestDistancePointToBezierSegment()
|
| /trunk/main/basegfx/source/polygon/ |
| H A D | b2dlinegeometry.cxx | 230 const sal_uInt32 nPointCount(rCandidate.count()); in subdivideToSimple() local
232 if(rCandidate.areControlPointsUsed() && nPointCount) in subdivideToSimple()
234 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in subdivideToSimple()
245 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in subdivideToSimple()
833 const sal_uInt32 nPointCount(aCandidate.count()); in createAreaGeometry() local
835 if(nPointCount) in createAreaGeometry()
840 const sal_uInt32 nEdgeCount(bIsClosed ? nPointCount : nPointCount - 1); in createAreaGeometry()
854 const sal_uInt32 nPrevIndex(nPointCount - 1); in createAreaGeometry()
864 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createAreaGeometry()
|
| H A D | b2dpolygon.cxx | 550 const sal_uInt32 nPointCount(rSource.count()); in getB2DRange() local
552 if(nPointCount) in getB2DRange()
554 for(sal_uInt32 a(0); a < nPointCount; a++) in getB2DRange()
561 const sal_uInt32 nEdgeCount(rSource.isClosed() ? nPointCount : nPointCount - 1); in getB2DRange()
570 const sal_uInt32 nNextIndex((b + 1) % nPointCount); in getB2DRange()
|
| H A D | b2dpolygonclipper.cxx | 103 const sal_uInt32 nPointCount(aCandidate.count()); in clipPolygonOnParallelAxis() local
104 … const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in clipPolygonOnParallelAxis()
431 const sal_uInt32 nPointCount(aCandidate.count()); in clipPolyPolygonOnPolyPolygon() local
432 … const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in clipPolyPolygonOnPolyPolygon()
|
| H A D | b2dpolygoncutandtouch.cxx | 531 const sal_uInt32 nPointCount(rCandidate.count()); in findCuts() local
533 if(nPointCount) in findCuts()
535 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in findCuts()
606 const B2DPoint aNextA(rCandidate.getB2DPoint(a + 1L == nPointCount ? 0L : a + 1L)); in findCuts()
612 const B2DPoint aNextB(rCandidate.getB2DPoint(b + 1L == nPointCount ? 0L : b + 1L)); in findCuts()
657 const sal_uInt32 nPointCount(rPointPolygon.count()); in findTouchesOnEdge() local
659 if(nPointCount) in findTouchesOnEdge()
667 for(sal_uInt32 a(0L); a < nPointCount; a++) in findTouchesOnEdge()
728 const sal_uInt32 nPointCount(rPointPolygon.count()); in findTouches() local
731 if(nPointCount && nEdgePointCount) in findTouches()
|
| H A D | b2dpolygontools.cxx | 183 if(nPointCount) in adaptiveSubdivideByDistance()
266 if(nPointCount) in adaptiveSubdivideByAngle()
339 if(nPointCount) in adaptiveSubdivideByCount()
410 if(nPointCount) in isInside()
480 if(nPointCount) in getRangeWithControlPoints()
590 if(nPointCount) in getLength()
1637 if(nPointCount) in isInEpsilonRange()
2717 if(nPointCount) in rotateAroundPoint()
2745 if(nPointCount) in expandToCurveInPoint()
2799 if(nPointCount) in setContinuityInPoint()
[all …]
|
| H A D | b2dpolypolygoncutter.cxx | 534 const sal_uInt32 nPointCount(aGeometry.count()); in solver() local
539 if(nPointCount > 3 || (nPointCount > 1 && mbIsCurve)) in solver()
542 maSNV.reserve(nPointCount); in solver()
543 maPNV.reserve(nPointCount); in solver()
544 maVNV.reserve(mbIsCurve ? nPointCount : 0); in solver()
572 sal_uInt32 nPointCount(0); in solver() local
588 nPointCount += nCandCount; in solver()
592 if(nPointCount) in solver()
595 maSNV.reserve(nPointCount); in solver()
596 maPNV.reserve(nPointCount); in solver()
[all …]
|
| H A D | b2dsvgpolypolygon.cxx | 688 const sal_uInt32 nPointCount(rPoly.count()); in exportToSvgPoints() local
691 for(sal_uInt32 a(0); a < nPointCount; a++) in exportToSvgPoints()
721 const sal_uInt32 nPointCount(aPolygon.count()); in exportToSvgD() local
723 if(nPointCount) in exportToSvgD()
726 … const sal_uInt32 nEdgeCount(aPolygon.isClosed() ? nPointCount : nPointCount - 1); in exportToSvgD()
752 const sal_uInt32 nNextIndex((nIndex + 1) % nPointCount); in exportToSvgD()
|
| H A D | b2dtrapezoid.cxx | 1161 const sal_uInt32 nPointCount(aSource.count()); in createLineTrapezoidFromB2DPolygon() local
1163 if(!nPointCount) in createLineTrapezoidFromB2DPolygon()
1168 const sal_uInt32 nEdgeCount(aSource.isClosed() ? nPointCount : nPointCount - 1); in createLineTrapezoidFromB2DPolygon()
1175 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in createLineTrapezoidFromB2DPolygon()
|
| H A D | b3dpolygon.cxx | 107 const sal_uInt32 nPointCount(maVector.size()); in getNormal() local
109 if(nPointCount > 2) in getNormal()
119 for(a = 1; a < nPointCount; a++) in getNormal()
133 for(a = (nISmallest + 1) % nPointCount; a != nISmallest; a = (a + 1) % nPointCount) in getNormal()
145 …for(a = (nISmallest + nPointCount - 1) % nPointCount; a != nISmallest; a = (a + nPointCount - 1) %… in getNormal()
|
| H A D | b3dpolygonclipper.cxx | 199 const sal_uInt32 nPointCount(rCandidate.count()); in clipPolygonOnOrthogonalPlane() local
200 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in clipPolygonOnOrthogonalPlane()
214 const sal_uInt32 nNextIndex((a + 1L == nPointCount) ? 0L : a + 1L); in clipPolygonOnOrthogonalPlane()
260 const sal_uInt32 nNextIndex((a + 1L == nPointCount) ? 0L : a + 1L); in clipPolygonOnOrthogonalPlane()
|
| H A D | b3dpolygontools.cxx | 146 if(nPointCount > 2) in getSignedArea()
230 if(nIndex < nPointCount) in getEdgeLength()
250 if(nPointCount > 1L) in getLength()
252 const sal_uInt32 nLoopCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in getLength()
272 if(nPointCount > 1L) in getPositionAbsolute()
315 nIndex = nPointCount - 1L; in getPositionAbsolute()
830 if(nPointCount) in isInEpsilonRange()
881 if(nPointCount) in isInside()
1099 if(nPointCount > 1L) in isPointOnPolygon()
1101 const sal_uInt32 nLoopCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isPointOnPolygon()
[all …]
|
| H A D | b3dpolypolygontools.cxx | 616 const sal_uInt32 nPointCount(aPoly.count()); in B3DPolyPolygonToUnoPolyPolygonShape3D() local
618 if(nPointCount) in B3DPolyPolygonToUnoPolyPolygonShape3D()
621 const sal_uInt32 nTargetCount(bIsClosed ? nPointCount + 1 : nPointCount); in B3DPolyPolygonToUnoPolyPolygonShape3D()
630 for(sal_uInt32 b(0); b < nPointCount; b++) in B3DPolyPolygonToUnoPolyPolygonShape3D()
|
| /trunk/main/basegfx/source/raster/ |
| H A D | rasterconvert3d.cxx | 39 const sal_uInt32 nPointCount(rFill.count()); in addArea() local
41 for(sal_uInt32 a(0); a < nPointCount; a++) in addArea()
43 addEdge(rFill, a, (a + 1) % nPointCount, pViewToEye); in addArea()
334 const sal_uInt32 nPointCount(rLine.count()); in rasterconvertB3DPolygon() local
336 if(nPointCount) in rasterconvertB3DPolygon()
338 const sal_uInt32 nEdgeCount(rLine.isClosed() ? nPointCount : nPointCount - 1); in rasterconvertB3DPolygon()
342 rasterconvertB3DEdge(rLine, a, (a + 1) % nPointCount, nStartLine, nStopLine, nLineWidth); in rasterconvertB3DPolygon()
|
| /trunk/main/basegfx/source/tools/ |
| H A D | canvastools.cxx | 69 const sal_uInt32 nPointCount(rPoly.count()); in bezierSequenceFromB2DPolygon() local
70 uno::Sequence< geometry::RealBezierSegment2D > outputSequence(nPointCount); in bezierSequenceFromB2DPolygon()
74 for(sal_uInt32 a(0); a < nPointCount; a++) in bezierSequenceFromB2DPolygon()
78 … const basegfx::B2DPoint aControlB(rPoly.getPrevControlPoint((a + 1) % nPointCount)); in bezierSequenceFromB2DPolygon()
|
| H A D | unopolypolygon.cxx | 320 const sal_uInt32 nPointCount(rPoly.count()); in getBezierSegment() local
322 if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(nPointCount) ) in getBezierSegment()
327 const B2DPoint& rCtrl1( rPoly.getPrevControlPoint((nPointIndex + 1) % nPointCount) ); in getBezierSegment()
347 const sal_uInt32 nPointCount(aPoly.count()); in setBezierSegment() local
349 if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(nPointCount) ) in setBezierSegment()
357 aPoly.setPrevControlPoint((nPointIndex + 1) % nPointCount, in setBezierSegment()
|
| /trunk/main/canvas/source/cairo/ |
| H A D | cairo_canvashelper.cxx | 955 const sal_uInt32 nPointCount( aPolygon.count() ); in doPolyPolygonImplementation() local
958 const sal_uInt32 nExtendedPointCount( nPointCount + in doPolyPolygonImplementation()
961 if( nPointCount > 1) { in doPolyPolygonImplementation()
967 aP = aPolygon.getB2DPoint( j % nPointCount ); in doPolyPolygonImplementation()
990 aA = aPolygon.getNextControlPoint( (j-1) % nPointCount ); in doPolyPolygonImplementation()
991 aB = aPolygon.getPrevControlPoint( j % nPointCount ); in doPolyPolygonImplementation()
1059 const sal_uInt32 nPointCount(aCandidate.count()); in doPolyPolygonPath() local
1061 if(nPointCount) in doPolyPolygonPath()
1063 … const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount + 1: nPointCount); in doPolyPolygonPath()
1070 const sal_uInt32 nNextIndex((b + 1) % nPointCount); in doPolyPolygonPath()
|
| /trunk/main/chart2/source/inc/ |
| H A D | ExponentialRegressionCurveCalculator.hxx | 55 ::sal_Int32 nPointCount,
|
| H A D | LinearRegressionCurveCalculator.hxx | 55 ::sal_Int32 nPointCount,
|
| H A D | LogarithmicRegressionCurveCalculator.hxx | 55 ::sal_Int32 nPointCount,
|
| H A D | MeanValueRegressionCurveCalculator.hxx | 55 ::sal_Int32 nPointCount,
|
| H A D | PotentialRegressionCurveCalculator.hxx | 57 ::sal_Int32 nPointCount,
|
| H A D | RegressionCurveCalculator.hxx | 70 ::sal_Int32 nPointCount,
|
| /trunk/main/chart2/source/tools/ |
| H A D | BaseGFXHelper.cxx | 47 sal_Int32 nPointCount = rPolyPoly.SequenceX[nPoly].getLength(); in getBoundVolume() local
48 for( sal_Int32 nPoint = 0; nPoint < nPointCount; nPoint++) in getBoundVolume()
|
| H A D | ExponentialRegressionCurveCalculator.cxx | 118 double min, double max, ::sal_Int32 nPointCount, in getCurveValues() argument
139 …return RegressionCurveCalculator::getCurveValues( min, max, nPointCount, xScalingX, xScalingY, bMa… in getCurveValues()
|