Home
last modified time | relevance | path

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

1234

/trunk/main/basegfx/source/polygon/
H A Db2dpolygontools.cxx180 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByDistance() local
183 if(nPointCount) in adaptiveSubdivideByDistance()
186 … const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByDistance()
191 aRetval.reserve(nPointCount*4); in adaptiveSubdivideByDistance()
199 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByDistance()
263 const sal_uInt32 nPointCount(rCandidate.count()); in adaptiveSubdivideByAngle() local
266 if(nPointCount) in adaptiveSubdivideByAngle()
269 … const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in adaptiveSubdivideByAngle()
274 aRetval.reserve(nPointCount*4); in adaptiveSubdivideByAngle()
296 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in adaptiveSubdivideByAngle()
[all …]
H A Db3dpolygontools.cxx92 const sal_uInt32 nPointCount(rCandidate.count()); in getRange() local
94 for(sal_uInt32 a(0L); a < nPointCount; a++) in getRange()
144 const sal_uInt32 nPointCount(rCandidate.count()); in getSignedArea() local
146 if(nPointCount > 2) in getSignedArea()
163 B3DPoint aPreviousPoint(rCandidate.getB3DPoint(nPointCount - 1L)); in getSignedArea()
165 for(sal_uInt32 a(0L); a < nPointCount; a++) in getSignedArea()
228 const sal_uInt32 nPointCount(rCandidate.count()); in getEdgeLength() local
230 if(nIndex < nPointCount) in getEdgeLength()
232 if(rCandidate.isClosed() || ((nIndex + 1L) != nPointCount)) in getEdgeLength()
248 const sal_uInt32 nPointCount(rCandidate.count()); in getLength() local
[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.cxx226 const sal_uInt32 nPointCount(rCandidate.count()); in subdivideToSimple() local
228 if(rCandidate.areControlPointsUsed() && nPointCount) in subdivideToSimple()
230 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1); in subdivideToSimple()
241 const sal_uInt32 nNextIndex((a + 1) % nPointCount); in subdivideToSimple()
829 const sal_uInt32 nPointCount(aCandidate.count()); in createAreaGeometry() local
831 if(nPointCount) in createAreaGeometry()
836 const sal_uInt32 nEdgeCount(bIsClosed ? nPointCount : nPointCount - 1); in createAreaGeometry()
850 const sal_uInt32 nPrevIndex(nPointCount - 1); in createAreaGeometry()
860 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 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 Db2dpolygonclipper.cxx103 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 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()
/trunk/main/drawinglayer/source/primitive3d/
H A Dsdrextrudeprimitive3d.cxx227 const sal_uInt32 nPointCount(aCandidate.count()); in create3DDecomposition() local
229 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()
235 for(sal_uInt32 d(0); d < nPointCount; d++) in create3DDecomposition()
237 const sal_uInt32 nPrevInd((d + nPointCount - 1) % nPointCount); in create3DDecomposition()
238 const sal_uInt32 nNextInd((d + 1) % nPointCount); in create3DDecomposition()
249 if(nPointCount == nIndexA) in create3DDecomposition()
253 else if(nPointCount == nIndexB) in create3DDecomposition()
[all …]
H A Dsdrextrudelathetools3d.cxx123 const sal_uInt32 nPointCount(::std::min(aSubA.count(), aSubB.count())); in impAddInBetweenFill() local
125 if(nPointCount) in impAddInBetweenFill()
127 const sal_uInt32 nEdgeCount(aSubA.isClosed() ? nPointCount : nPointCount - 1L); in impAddInBetweenFill()
143 const sal_uInt32 nIndexB((b + 1L) % nPointCount); in impAddInBetweenFill()
220 const sal_uInt32 nPointCount(::std::min(aSubA.count(), aSubB.count())); in impCreateInBetweenNormals() local
222 if(nPointCount) in impCreateInBetweenNormals()
224 basegfx::B3DPoint aPrevA(aSubA.getB3DPoint(nPointCount - 1L)); in impCreateInBetweenNormals()
228 for(sal_uInt32 b(0L); b < nPointCount; b++) in impCreateInBetweenNormals()
230 const sal_uInt32 nIndNext((b + 1L) % nPointCount); in impCreateInBetweenNormals()
257 const bool bLastAndNotClosed(!bClosed && b + 1L == nPointCount); in impCreateInBetweenNormals()
[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()
/trunk/main/basegfx/source/raster/
H A Drasterconvert3d.cxx36 const sal_uInt32 nPointCount(rFill.count()); in addArea() local
38 for(sal_uInt32 a(0); a < nPointCount; a++) in addArea()
40 addEdge(rFill, a, (a + 1) % nPointCount, pViewToEye); in addArea()
331 const sal_uInt32 nPointCount(rLine.count()); in rasterconvertB3DPolygon() local
333 if(nPointCount) in rasterconvertB3DPolygon()
335 const sal_uInt32 nEdgeCount(rLine.isClosed() ? nPointCount : nPointCount - 1); in rasterconvertB3DPolygon()
339 … rasterconvertB3DEdge(rLine, a, (a + 1) % nPointCount, nStartLine, nStopLine, nLineWidth); in rasterconvertB3DPolygon()
/trunk/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()
/trunk/main/chart2/source/view/main/
H A DShapeFactory.cxx191 const sal_Int32 nPointCount = bRoundEdges ? 13 : 5; in createPolyPolygon_Cube() local
204 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()
854 …sal_Int32 nPointCount = 1 + 3*nSegmentCount; //first point of next segment equals last point o… in getCircularArcBezierCoords() local
859 drawing::PointSequence aPoints(nPointCount); in getCircularArcBezierCoords()
860 drawing::FlagSequence aFlags(nPointCount); in getCircularArcBezierCoords()
1332 sal_Int32 nPointCount = 4; //all arrow symbols only need 4 points in createPolyPolygon_Symbol() local
[all …]
/trunk/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()
/trunk/main/svx/source/svdraw/
H A Dsvdtrans.cxx402 sal_uInt16 nPointCount=rPoly.GetPointCount(); in CrookRotatePoly() local
404 while (i<nPointCount) { in CrookRotatePoly()
408 if (i+1<nPointCount && rPoly.IsControl(i)) { // Kontrollpunkt links in CrookRotatePoly()
414 if (i<nPointCount && rPoly.IsControl(i)) { // Kontrollpunkt rechts in CrookRotatePoly()
425 sal_uInt16 nPointCount=rPoly.GetPointCount(); in CrookSlantPoly() local
427 while (i<nPointCount) { in CrookSlantPoly()
431 if (i+1<nPointCount && rPoly.IsControl(i)) { // Kontrollpunkt links in CrookSlantPoly()
437 if (i<nPointCount && rPoly.IsControl(i)) { // Kontrollpunkt rechts in CrookSlantPoly()
448 sal_uInt16 nPointCount=rPoly.GetPointCount(); in CrookStretchPoly() local
450 while (i<nPointCount) { in CrookStretchPoly()
[all …]
H A Dsvdorect.cxx142 const sal_uInt16 nPointCount(aXPoly.GetPointCount()); in ImpCalcXPoly() local
143 XPolygon aNewPoly(nPointCount+1); in ImpCalcXPoly()
144 sal_uInt16 nShift=nPointCount-2; in ImpCalcXPoly()
145 if (nRad1!=0) nShift=nPointCount-5; in ImpCalcXPoly()
147 for (sal_uInt16 i=1; i<nPointCount; i++) { in ImpCalcXPoly()
151 if (j>=nPointCount) j=1; in ImpCalcXPoly()
154 aNewPoly[nPointCount]=aNewPoly[0]; in ImpCalcXPoly()
H A Dsvdopath.cxx628 const sal_uInt16 nPointCount(rOrig.GetPointCount()); in movePathDrag() local
629 sal_Bool bClosed(rOrig[0] == rOrig[nPointCount-1]); in movePathDrag()
635 if(nPointCount > 0 && !nPointIndex && bClosed) in movePathDrag()
637 rMove[nPointCount - 1] = rOrig[nPointCount - 1] + aDelta; in movePathDrag()
641 if(nPointCount > 1 && rOrig.IsControl(nPointCount - 2)) in movePathDrag()
642 rMove[nPointCount - 2] = rOrig[nPointCount - 2] + aDelta; in movePathDrag()
653 if(nPointIndex + 1 < nPointCount && rOrig.IsControl(nPointIndex + 1)) in movePathDrag()
1949 sal_uInt32 nPointCount(0L); in TakeObjNameSingul() local
1954 nPointCount += GetPathPoly().getB2DPolygon(a).count(); in TakeObjNameSingul()
1972 rName.Insert(UniString::CreateFromInt32(nPointCount), nPos); in TakeObjNameSingul()
[all …]
/trunk/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()
/trunk/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()
/trunk/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()
/trunk/main/vcl/source/gdi/
H A Dcvtsvm.cxx383 const sal_uInt16 nPointCount(rCandidate.GetSize()); in ImplWriteExtendedPolyPolygonAction() local
385 if(nPointCount) in ImplWriteExtendedPolyPolygonAction()
388 nAllPointCount += nPointCount; in ImplWriteExtendedPolyPolygonAction()
392 nAllFlagCount += nPointCount; in ImplWriteExtendedPolyPolygonAction()
415 const sal_uInt16 nPointCount(rCandidate.GetSize()); in ImplWriteExtendedPolyPolygonAction() local
417 if(nPointCount) in ImplWriteExtendedPolyPolygonAction()
419 rOStm << nPointCount; in ImplWriteExtendedPolyPolygonAction()
421 for(sal_uInt16 b(0); b < nPointCount; b++) in ImplWriteExtendedPolyPolygonAction()
430 for(sal_uInt16 c(0); c < nPointCount; c++) in ImplWriteExtendedPolyPolygonAction()
459 sal_uInt16 nPointCount(0); in ImplReadExtendedPolyPolygonAction() local
[all …]
/trunk/main/sw/source/filter/ww8/
H A Dwriterhelper.cxx722 sal_uInt32 nPointCount(0L); in PolygonFromPolyPolygon() local
727 nPointCount += (sal_uInt32)rPolyPoly[a].GetSize(); in PolygonFromPolyPolygon()
730 if(nPointCount > 0x0000ffff) in PolygonFromPolyPolygon()
733 nPointCount = 0x0000ffff; in PolygonFromPolyPolygon()
736 Polygon aRetval((sal_uInt16)nPointCount); in PolygonFromPolyPolygon()
743 … for(sal_uInt16 b(0); nAppendIndex <= nPointCount && b < rCandidate.GetSize(); b++) in PolygonFromPolyPolygon()
/trunk/main/filter/source/graphicfilter/idxf/
H A Ddxfentrd.cxx590 nPointCount( 0 ), in DXFBoundaryPathData()
624 nPointCount = rDGR.GetI(); in EvaluateGroup()
625 if ( rDGR.GetStatus() && nPointCount >= 0 ) in EvaluateGroup()
629 pP = new DXFVector[ nPointCount ]; in EvaluateGroup()
646 if ( pP && ( nPointIndex < nPointCount ) ) in EvaluateGroup()
652 if ( pP && ( nPointIndex < nPointCount ) ) in EvaluateGroup()

1234