Home
last modified time | relevance | path

Searched refs:nPointCount (Results 1 – 25 of 79) sorted by relevance

1234

/aoo4110/main/basegfx/source/polygon/
H A Db2dpolygontools.cxx183 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 Db3dpolygontools.cxx146 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 Db2dpolypolygoncutter.cxx534 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 Db2dlinegeometry.cxx230 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 Db2dpolygoncutandtouch.cxx531 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 Db2dpolygonclipper.cxx103 const sal_uInt32 nPointCount(aCandidate.count()); in clipPolygonOnParallelAxis() local
104 … const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in clipPolygonOnParallelAxis()
429 const sal_uInt32 nPointCount(aCandidate.count()); in clipPolyPolygonOnPolyPolygon() local
430 … const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in clipPolyPolygonOnPolyPolygon()
H A Db3dpolygon.cxx107 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 Db2dsvgpolypolygon.cxx688 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 Db3dpolygonclipper.cxx199 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()
/aoo4110/main/drawinglayer/source/primitive3d/
H A Dsdrextrudeprimitive3d.cxx229 if(nPointCount > 2) in create3DDecomposition()
231 sal_uInt32 nIndexA(nPointCount); in create3DDecomposition()
232 sal_uInt32 nIndexB(nPointCount); in create3DDecomposition()
233 sal_uInt32 nIndexC(nPointCount); in create3DDecomposition()
237 const sal_uInt32 nPrevInd((d + nPointCount - 1) % nPointCount); in create3DDecomposition()
249 if(nPointCount == nIndexA) in create3DDecomposition()
253 else if(nPointCount == nIndexB) in create3DDecomposition()
257 else if(nPointCount == nIndexC) in create3DDecomposition()
260 d = nPointCount; in create3DDecomposition()
282 else if(((nIndexA + nPointCount - 2) % nPointCount) == nIndexB) in create3DDecomposition()
[all …]
H A Dsdrextrudelathetools3d.cxx128 if(nPointCount) in impAddInBetweenFill()
130 const sal_uInt32 nEdgeCount(aSubA.isClosed() ? nPointCount : nPointCount - 1L); in impAddInBetweenFill()
146 const sal_uInt32 nIndexB((b + 1L) % nPointCount); in impAddInBetweenFill()
225 if(nPointCount) in impCreateInBetweenNormals()
231 for(sal_uInt32 b(0L); b < nPointCount; b++) in impCreateInBetweenNormals()
309 for(sal_uInt32 b(0L); b < nPointCount; b++) in impMixNormals()
325 const sal_uInt32 nPointCount(rPoly.count()); in impHasCutWith() local
327 if(nPointCount) in impHasCutWith()
908 const sal_uInt32 nPointCount(rLoopA.count()); in createReducedOutlines() local
913 if(nPointCount && nPointCount == rLoopB.count()) in createReducedOutlines()
[all …]
H A Dpolygontubeprimitive3d.cxx480 const sal_uInt32 nPointCount(getB3DPolygon().count()); in impCreate3DDecomposition() local
483 if(nPointCount) in impCreate3DDecomposition()
491 const sal_uInt32 nLoopCount(bClosed ? nPointCount : nPointCount - 1); in impCreate3DDecomposition()
492 basegfx::B3DPoint aLast(getB3DPolygon().getB3DPoint(nPointCount - 1)); in impCreate3DDecomposition()
498 … const basegfx::B3DPoint aNext(getB3DPolygon().getB3DPoint((a + 1) % nPointCount)); in impCreate3DDecomposition()
/aoo4110/main/basegfx/source/raster/
H A Drasterconvert3d.cxx39 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()
/aoo4110/main/chart2/source/tools/
H A DRegressionCurveCalculator.cxx90 double min, double max, ::sal_Int32 nPointCount, in getCurveValues() argument
97 if( nPointCount < 2 ) in getCurveValues()
107 Sequence< geometry::RealPoint2D > aResult( nPointCount ); in getCurveValues()
110 double fFact = (max - min) / double(nPointCount-1); in getCurveValues()
114 fFact = (xScalingX->doScaling( max ) - fMin) / double(nPointCount-1); in getCurveValues()
117 for(sal_Int32 nP=0; nP<nPointCount; nP++) in getCurveValues()
/aoo4110/main/chart2/source/view/main/
H A DShapeFactory.cxx204 pOuterSequenceX->realloc(nPointCount); in createPolyPolygon_Cube()
205 pOuterSequenceY->realloc(nPointCount); in createPolyPolygon_Cube()
206 pOuterSequenceZ->realloc(nPointCount); in createPolyPolygon_Cube()
212 for(sal_Int32 nN = nPointCount; nN--;) in createPolyPolygon_Cube()
216 if(nPointCount == 5) in createPolyPolygon_Cube()
1341 nPointCount = 5; in createPolyPolygon_Symbol()
1344 nPointCount = 13; in createPolyPolygon_Symbol()
1347 nPointCount = 13; in createPolyPolygon_Symbol()
1350 nPointCount = 9; in createPolyPolygon_Symbol()
1353 nPointCount = 19; in createPolyPolygon_Symbol()
[all …]
/aoo4110/main/chart2/source/view/axes/
H A DVCartesianGrid.cxx266 sal_Int32 nPointCount = (*aDepthIter).size(); in createShapes() local
267 drawing::PointSequenceSequence aPoints(nPointCount); in createShapes()
302 sal_Int32 nPointCount = (*aDepthIter).size(); in createShapes() local
304 aPoints.SequenceX.realloc(nPointCount); in createShapes()
305 aPoints.SequenceY.realloc(nPointCount); in createShapes()
306 aPoints.SequenceZ.realloc(nPointCount); in createShapes()
/aoo4110/main/basegfx/source/tools/
H A Dunopolypolygon.cxx320 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()
/aoo4110/main/vcl/aqua/source/gdi/
H A Dctfonts.cxx226 const int nPointCount = rPolygon.count(); in MyCGPathApplierFunc() local
232 if( nPointCount > 0 ) { in MyCGPathApplierFunc()
244 …rPolygon.setNextControlPoint( nPointCount-1, basegfx::B2DPoint( pElement->points[0].x, -pElement->… in MyCGPathApplierFunc()
245 …rPolygon.setPrevControlPoint( nPointCount+0, basegfx::B2DPoint( pElement->points[1].x, -pElement->… in MyCGPathApplierFunc()
248 const basegfx::B2DPoint aStartPt = rPolygon.getB2DPoint( nPointCount-1 ); in MyCGPathApplierFunc()
254 rPolygon.setNextControlPoint( nPointCount-1, aCtrPt1 ); in MyCGPathApplierFunc()
255 rPolygon.setPrevControlPoint( nPointCount+0, aCtrPt2 ); in MyCGPathApplierFunc()
/aoo4110/main/chart2/source/view/charttypes/
H A DAreaChart.cxx257 sal_Int32 nPointCount = pOuterSourceX->getLength(); in lcl_removeDuplicatePoints() local
258 if( !nPointCount ) in lcl_removeDuplicatePoints()
261 pOuterTargetX->realloc(nPointCount); in lcl_removeDuplicatePoints()
262 pOuterTargetY->realloc(nPointCount); in lcl_removeDuplicatePoints()
263 pOuterTargetZ->realloc(nPointCount); in lcl_removeDuplicatePoints()
279 for( sal_Int32 nSource=1; nSource<nPointCount; nSource++ ) in lcl_removeDuplicatePoints()
294 if( nTargetPointCount<nPointCount ) in lcl_removeDuplicatePoints()
376 sal_Int32 nPointCount = aPoly.SequenceX[nPoly].getLength(); in impl_createLine() local
377 for(sal_Int32 nPoint=0;nPoint<nPointCount-1;nPoint++) in impl_createLine()
/aoo4110/main/vcl/source/gdi/
H A Dcvtsvm.cxx385 if(nPointCount) in ImplWriteExtendedPolyPolygonAction()
388 nAllPointCount += nPointCount; in ImplWriteExtendedPolyPolygonAction()
392 nAllFlagCount += nPointCount; in ImplWriteExtendedPolyPolygonAction()
417 if(nPointCount) in ImplWriteExtendedPolyPolygonAction()
419 rOStm << nPointCount; in ImplWriteExtendedPolyPolygonAction()
459 sal_uInt16 nPointCount(0); in ImplReadExtendedPolyPolygonAction() local
460 rIStm >> nPointCount; in ImplReadExtendedPolyPolygonAction()
461 Polygon aCandidate(nPointCount); in ImplReadExtendedPolyPolygonAction()
463 if(nPointCount) in ImplReadExtendedPolyPolygonAction()
465 for(sal_uInt16 b(0); b < nPointCount; b++) in ImplReadExtendedPolyPolygonAction()
[all …]
/aoo4110/main/svx/source/svdraw/
H A Dsvdopath.cxx630 const sal_uInt16 nPointCount(rOrig.GetPointCount()); in movePathDrag() local
631 sal_Bool bClosed(rOrig[0] == rOrig[nPointCount-1]); in movePathDrag()
637 if(nPointCount > 0 && !nPointIndex && bClosed) in movePathDrag()
639 rMove[nPointCount - 1] = rOrig[nPointCount - 1] + aDelta; in movePathDrag()
643 if(nPointCount > 1 && rOrig.IsControl(nPointCount - 2)) in movePathDrag()
644 rMove[nPointCount - 2] = rOrig[nPointCount - 2] + aDelta; in movePathDrag()
1951 sal_uInt32 nPointCount(0L); in TakeObjNameSingul() local
2707 const sal_uInt32 nPointCount(aCandidate.count()); in RipPoint() local
2709 if(nPointCount) in RipPoint()
2720 rNewPt0Index = (nPointCount - nPnt) % nPointCount; in RipPoint()
[all …]
/aoo4110/main/sw/source/filter/ww8/
H A Dwriterhelper.cxx723 sal_uInt32 nPointCount(0L); in PolygonFromPolyPolygon() local
728 nPointCount += (sal_uInt32)rPolyPoly[a].GetSize(); in PolygonFromPolyPolygon()
731 if(nPointCount > 0x0000ffff) in PolygonFromPolyPolygon()
734 nPointCount = 0x0000ffff; in PolygonFromPolyPolygon()
737 Polygon aRetval((sal_uInt16)nPointCount); in PolygonFromPolyPolygon()
744 for(sal_uInt16 b(0); nAppendIndex <= nPointCount && b < rCandidate.GetSize(); b++) in PolygonFromPolyPolygon()
/aoo4110/main/svx/source/sdr/contact/
H A Dviewcontactofsdrpathobj.cxx59 sal_uInt32 nPointCount(0); in createViewIndependentPrimitive2DSequence() local
63 nPointCount += aUnitPolyPolygon.getB2DPolygon(a).count(); in createViewIndependentPrimitive2DSequence()
66 if(!nPointCount) in createViewIndependentPrimitive2DSequence()
/aoo4110/main/odk/examples/DevelopersGuide/Drawing/
H A DDrawingDemo.java301 int nPointCount = 8; in Demo_PolyPolygonBezier() local
302 Point[] pPolyPoints = new Point[ nPointCount ]; in Demo_PolyPolygonBezier()
303 PolygonFlags[] pPolyFlags = new PolygonFlags[ nPointCount ]; in Demo_PolyPolygonBezier()
305 for ( n = 0; n < nPointCount; n++ ) in Demo_PolyPolygonBezier()
/aoo4110/main/filter/source/graphicfilter/idxf/
H A Ddxfentrd.cxx579 nPointCount( 0 ), in DXFBoundaryPathData()
613 nPointCount = rDGR.GetI(); in EvaluateGroup()
614 if ( nPointCount ) in EvaluateGroup()
615 pP = new DXFVector[ nPointCount ]; in EvaluateGroup()
624 if ( pP && ( nPointIndex < nPointCount ) ) in EvaluateGroup()
630 if ( pP && ( nPointIndex < nPointCount ) ) in EvaluateGroup()

Completed in 241 milliseconds

1234