Lines Matching refs:a
126 for(sal_uInt32 a(0L); a < nCount; a++) in mergeTemporaryPointsAndPolygon() local
129 rCandidate.getBezierSegment(a, aEdge); in mergeTemporaryPointsAndPolygon()
137 while(nNewInd < nTempPointCount && rTempPoints[nNewInd].getIndex() == a) in mergeTemporaryPointsAndPolygon()
159 while(nNewInd < nTempPointCount && rTempPoints[nNewInd].getIndex() == a) in mergeTemporaryPointsAndPolygon()
206 for(sal_uInt32 a(0L); a < nTempPointCount; a++) in adaptAndTransferCutsWithBezierSegment() local
208 const temporaryPoint& rTempPoint = rPointVector[a]; in adaptAndTransferCutsWithBezierSegment()
315 for(sal_uInt32 a(0L); a < nEdgeCountA; a++) in findCutsAndTouchesAndCommonForBezier() local
317 const B2DPoint aNextA(rCandidateA.getB2DPoint(a + 1L)); in findCutsAndTouchesAndCommonForBezier()
368 if(a) in findCutsAndTouchesAndCommonForBezier()
370 rTempPointsA.push_back(temporaryPoint(aCurrA, a, 0.0)); in findCutsAndTouchesAndCommonForBezier()
376 rTempPointsA.push_back(temporaryPoint(aCutPoint, a, fCutA)); in findCutsAndTouchesAndCommonForBezier()
444 for(sal_uInt32 a(0L); a < aTempPointVectorEdge.size(); a++) in findEdgeCutsBezierAndEdge() local
446 const temporaryPoint& rTempPoint = aTempPointVectorEdge[a]; in findEdgeCutsBezierAndEdge()
546 for(sal_uInt32 a(0L); a < nEdgeCount - 1L; a++) in findCuts() local
548 rCandidate.getBezierSegment(a, aCubicA); in findCuts()
556 findEdgeCutsOneBezier(aCubicA, a, rTempPoints); in findCuts()
559 for(sal_uInt32 b(a + 1L); b < nEdgeCount; b++) in findCuts()
569 if( b > a+1) in findCuts()
578 findEdgeCutsTwoBeziers(aCubicA, aCubicB, a, b, rTempPoints, rTempPoints); in findCuts()
583 …findEdgeCutsBezierAndEdge(aCubicA, aCubicB.getStartPoint(), aCubicB.getEndPoint(), a, b, rTempPoin… in findCuts()
588 …findEdgeCutsBezierAndEdge(aCubicB, aCubicA.getStartPoint(), aCubicA.getEndPoint(), b, a, rTempPoin… in findCuts()
594 a, b, rTempPoints, rTempPoints); in findCuts()
604 for(sal_uInt32 a(0L); a < nEdgeCount - 1L; a++) in findCuts() local
606 const B2DPoint aNextA(rCandidate.getB2DPoint(a + 1L == nPointCount ? 0L : a + 1L)); in findCuts()
608 B2DPoint aCurrB(rCandidate.getB2DPoint(a + 1L)); in findCuts()
610 for(sal_uInt32 b(a + 1L); b < nEdgeCount; b++) in findCuts()
617 if( b > a+1) in findCuts()
623 findEdgeCutsTwoEdges(aCurrA, aNextA, aCurrB, aNextB, a, b, rTempPoints, rTempPoints); in findCuts()
667 for(sal_uInt32 a(0L); a < nPointCount; a++) in findTouchesOnEdge() local
669 const B2DPoint aTestPoint(rPointPolygon.getB2DPoint(a)); in findTouchesOnEdge()
736 for(sal_uInt32 a(0L); a < nEdgeCount; a++) in findTouches() local
738 const sal_uInt32 nNextIndex((a + 1) % nEdgePointCount); in findTouches()
747 const B2DPoint aNextControlPoint(rEdgePolygon.getNextControlPoint(a)); in findTouches()
755 findTouchesOnCurve(aCubicA, rPointPolygon, a, rTempPoints); in findTouches()
761 findTouchesOnEdge(aCurr, aNext, rPointPolygon, a, rTempPoints); in findTouches()
805 for(sal_uInt32 a(0L); a < nEdgeCountA; a++) in findCuts() local
807 rCandidateA.getBezierSegment(a, aCubicA); in findCuts()
821 if( b > a+1) in findCuts()
830 findEdgeCutsTwoBeziers(aCubicA, aCubicB, a, b, rTempPointsA, rTempPointsB); in findCuts()
835 …findEdgeCutsBezierAndEdge(aCubicA, aCubicB.getStartPoint(), aCubicB.getEndPoint(), a, b, rTempPoin… in findCuts()
840 …findEdgeCutsBezierAndEdge(aCubicB, aCubicA.getStartPoint(), aCubicA.getEndPoint(), b, a, rTempPoin… in findCuts()
846 a, b, rTempPointsA, rTempPointsB); in findCuts()
856 for(sal_uInt32 a(0L); a < nEdgeCountA; a++) in findCuts() local
858 const B2DPoint aNextA(rCandidateA.getB2DPoint(a + 1L == nPointCountA ? 0L : a + 1L)); in findCuts()
869 if( b > a+1) in findCuts()
876 findEdgeCutsTwoEdges(aCurrA, aNextA, aCurrB, aNextB, a, b, rTempPointsA, rTempPointsB); in findCuts()
948 sal_uInt32 a, b; in addPointsAtCutsAndTouches() local
950 for(a = 0L; a < nCount; a++) in addPointsAtCutsAndTouches()
955 pTempData[a].setPolygon(addPointsAtCutsAndTouches(rCandidate.getB2DPolygon(a))); in addPointsAtCutsAndTouches()
960 pTempData[a].setPolygon(rCandidate.getB2DPolygon(a)); in addPointsAtCutsAndTouches()
965 for(a = 0L; a < nCount; a++) in addPointsAtCutsAndTouches()
969 if(a != b) in addPointsAtCutsAndTouches()
972 if(pTempData[a].getRange().overlaps(pTempData[b].getRange())) in addPointsAtCutsAndTouches()
974 …findTouches(pTempData[a].getPolygon(), pTempData[b].getPolygon(), pTempData[a].getTemporaryPointVe… in addPointsAtCutsAndTouches()
978 if(a < b) in addPointsAtCutsAndTouches()
981 if(pTempData[a].getRange().overlaps(pTempData[b].getRange())) in addPointsAtCutsAndTouches()
983 …findCuts(pTempData[a].getPolygon(), pTempData[b].getPolygon(), pTempData[a].getTemporaryPointVecto… in addPointsAtCutsAndTouches()
990 for(a = 0L; a < nCount; a++) in addPointsAtCutsAndTouches()
992 …aRetval.append(mergeTemporaryPointsAndPolygon(pTempData[a].getPolygon(), pTempData[a].getTemporary… in addPointsAtCutsAndTouches()
1015 for(sal_uInt32 a(0L); a < rMask.count(); a++) in addPointsAtCutsAndTouches() local
1017 const B2DPolygon aPartMask(rMask.getB2DPolygon(a)); in addPointsAtCutsAndTouches()
1037 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in addPointsAtCutsAndTouches() local
1039 aRetval.append(addPointsAtCutsAndTouches(rMask, rCandidate.getB2DPolygon(a))); in addPointsAtCutsAndTouches()
1063 for(sal_uInt32 a(0); a < nEdgeCount; a++) in addPointsAtCuts() local
1065 rCandidate.getBezierSegment(a, aCubic); in addPointsAtCuts()
1075 … findEdgeCutsBezierAndEdge(aCubic, rStart, rEnd, a, 0, aTempPoints, aUnusedTempPoints); in addPointsAtCuts()
1082 …findEdgeCutsTwoEdges(aCubic.getStartPoint(), aCubic.getEndPoint(), rStart, rEnd, a, 0, aTempPoints… in addPointsAtCuts()
1098 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in addPointsAtCuts() local
1100 aRetval.append(addPointsAtCuts(rCandidate.getB2DPolygon(a), rStart, rEnd)); in addPointsAtCuts()
1134 for(sal_uInt32 a(0); a < nEdgeCountA; a++) in addPointsAtCuts() local
1136 rCandidate.getBezierSegment(a, aCubicA); in addPointsAtCuts()
1162 … findEdgeCutsTwoBeziers(aCubicA, aCubicB, a, b, aTempPointsA, aUnusedTempPointsB); in addPointsAtCuts()
1166 …eCutsBezierAndEdge(aCubicA, aCubicB.getStartPoint(), aCubicB.getEndPoint(), a, b, aTempPointsA, aU… in addPointsAtCuts()
1170 …tsBezierAndEdge(aCubicB, aCubicA.getStartPoint(), aCubicA.getEndPoint(), b, a, aUnusedTempPointsB,… in addPointsAtCuts()
1174 …t(), aCubicA.getEndPoint(), aCubicB.getStartPoint(), aCubicB.getEndPoint(), a, b, aTempPointsA, aU… in addPointsAtCuts()
1193 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in addPointsAtCuts() local
1195 aRetval.append(addPointsAtCuts(rCandidate.getB2DPolygon(a), rMask)); in addPointsAtCuts()
1242 sal_uInt32 a, b; in addPointsAtCuts() local
1244 for(a = 0; a < nCount; a++) in addPointsAtCuts()
1249 pTempData[a].setPolygon(addPointsAtCuts(rCandidate.getB2DPolygon(a))); in addPointsAtCuts()
1254 pTempData[a].setPolygon(rCandidate.getB2DPolygon(a)); in addPointsAtCuts()
1259 for(a = 0; a < nCount; a++) in addPointsAtCuts()
1263 if(a < b) in addPointsAtCuts()
1266 if(pTempData[a].getRange().overlaps(pTempData[b].getRange())) in addPointsAtCuts()
1268 …findCuts(pTempData[a].getPolygon(), pTempData[b].getPolygon(), pTempData[a].getTemporaryPointVecto… in addPointsAtCuts()
1275 for(a = 0L; a < nCount; a++) in addPointsAtCuts()
1277 …aRetval.append(mergeTemporaryPointsAndPolygon(pTempData[a].getPolygon(), pTempData[a].getTemporary… in addPointsAtCuts()