Lines Matching refs:rCandidate
102 …B2DPolygon mergeTemporaryPointsAndPolygon(const B2DPolygon& rCandidate, temporaryPointVector& rTem… in mergeTemporaryPointsAndPolygon() argument
112 const sal_uInt32 nCount(rCandidate.count()); in mergeTemporaryPointsAndPolygon()
124 aRetval.append(rCandidate.getB2DPoint(0)); in mergeTemporaryPointsAndPolygon()
129 rCandidate.getBezierSegment(a, aEdge); in mergeTemporaryPointsAndPolygon()
177 if(rCandidate.isClosed()) in mergeTemporaryPointsAndPolygon()
187 return rCandidate; in mergeTemporaryPointsAndPolygon()
230 void findCuts(const B2DPolygon& rCandidate, temporaryPointVector& rTempPoints);
527 void findCuts(const B2DPolygon& rCandidate, temporaryPointVector& rTempPoints) in findCuts() argument
531 const sal_uInt32 nPointCount(rCandidate.count()); in findCuts()
535 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nPointCount : nPointCount - 1L); in findCuts()
539 const bool bCurvesInvolved(rCandidate.areControlPointsUsed()); in findCuts()
548 rCandidate.getBezierSegment(a, aCubicA); in findCuts()
561 rCandidate.getBezierSegment(b, aCubicB); in findCuts()
602 B2DPoint aCurrA(rCandidate.getB2DPoint(0L)); in findCuts()
606 const B2DPoint aNextA(rCandidate.getB2DPoint(a + 1L == nPointCount ? 0L : a + 1L)); in findCuts()
608 B2DPoint aCurrB(rCandidate.getB2DPoint(a + 1L)); in findCuts()
612 const B2DPoint aNextB(rCandidate.getB2DPoint(b + 1L == nPointCount ? 0L : b + 1L)); in findCuts()
904 B2DPolygon addPointsAtCutsAndTouches(const B2DPolygon& rCandidate) in addPointsAtCutsAndTouches() argument
906 if(rCandidate.count()) in addPointsAtCutsAndTouches()
910 findTouches(rCandidate, rCandidate, aTempPoints); in addPointsAtCutsAndTouches()
911 findCuts(rCandidate, aTempPoints); in addPointsAtCutsAndTouches()
913 return mergeTemporaryPointsAndPolygon(rCandidate, aTempPoints); in addPointsAtCutsAndTouches()
917 return rCandidate; in addPointsAtCutsAndTouches()
923 …B2DPolyPolygon addPointsAtCutsAndTouches(const B2DPolyPolygon& rCandidate, bool bSelfIntersections) in addPointsAtCutsAndTouches() argument
925 const sal_uInt32 nCount(rCandidate.count()); in addPointsAtCutsAndTouches()
936 aRetval.append(addPointsAtCutsAndTouches(rCandidate.getB2DPolygon(0L))); in addPointsAtCutsAndTouches()
941 aRetval = rCandidate; in addPointsAtCutsAndTouches()
955 pTempData[a].setPolygon(addPointsAtCutsAndTouches(rCandidate.getB2DPolygon(a))); in addPointsAtCutsAndTouches()
960 pTempData[a].setPolygon(rCandidate.getB2DPolygon(a)); in addPointsAtCutsAndTouches()
1002 return rCandidate; in addPointsAtCutsAndTouches()
1008 B2DPolygon addPointsAtCutsAndTouches(const B2DPolyPolygon& rMask, const B2DPolygon& rCandidate) in addPointsAtCutsAndTouches() argument
1010 if(rCandidate.count()) in addPointsAtCutsAndTouches()
1019 findTouches(rCandidate, aPartMask, aTempPoints); in addPointsAtCutsAndTouches()
1020 findCuts(rCandidate, aPartMask, aTempPoints, aTempPointsUnused); in addPointsAtCutsAndTouches()
1023 return mergeTemporaryPointsAndPolygon(rCandidate, aTempPoints); in addPointsAtCutsAndTouches()
1027 return rCandidate; in addPointsAtCutsAndTouches()
1033 …olyPolygon addPointsAtCutsAndTouches(const B2DPolyPolygon& rMask, const B2DPolyPolygon& rCandidate) in addPointsAtCutsAndTouches() argument
1037 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in addPointsAtCutsAndTouches()
1039 aRetval.append(addPointsAtCutsAndTouches(rMask, rCandidate.getB2DPolygon(a))); in addPointsAtCutsAndTouches()
1047 …B2DPolygon addPointsAtCuts(const B2DPolygon& rCandidate, const B2DPoint& rStart, const B2DPoint& r… in addPointsAtCuts() argument
1049 const sal_uInt32 nCount(rCandidate.count()); in addPointsAtCuts()
1053 const B2DRange aPolygonRange(rCandidate.getB2DRange()); in addPointsAtCuts()
1058 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nCount : nCount - 1); in addPointsAtCuts()
1065 rCandidate.getBezierSegment(a, aCubic); in addPointsAtCuts()
1087 return mergeTemporaryPointsAndPolygon(rCandidate, aTempPoints); in addPointsAtCuts()
1091 return rCandidate; in addPointsAtCuts()
1094 …B2DPolyPolygon addPointsAtCuts(const B2DPolyPolygon& rCandidate, const B2DPoint& rStart, const B2D… in addPointsAtCuts() argument
1098 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in addPointsAtCuts()
1100 aRetval.append(addPointsAtCuts(rCandidate.getB2DPolygon(a), rStart, rEnd)); in addPointsAtCuts()
1108 B2DPolygon addPointsAtCuts(const B2DPolygon& rCandidate, const B2DPolyPolygon& rPolyMask) in addPointsAtCuts() argument
1110 const sal_uInt32 nCountA(rCandidate.count()); in addPointsAtCuts()
1115 const B2DRange aRangeA(rCandidate.getB2DRange()); in addPointsAtCuts()
1120 const sal_uInt32 nEdgeCountA(rCandidate.isClosed() ? nCountA : nCountA - 1); in addPointsAtCuts()
1136 rCandidate.getBezierSegment(a, aCubicA); in addPointsAtCuts()
1182 return mergeTemporaryPointsAndPolygon(rCandidate, aTempPointsA); in addPointsAtCuts()
1186 return rCandidate; in addPointsAtCuts()
1189 … B2DPolyPolygon addPointsAtCuts(const B2DPolyPolygon& rCandidate, const B2DPolyPolygon& rMask) in addPointsAtCuts() argument
1193 for(sal_uInt32 a(0); a < rCandidate.count(); a++) in addPointsAtCuts()
1195 aRetval.append(addPointsAtCuts(rCandidate.getB2DPolygon(a), rMask)); in addPointsAtCuts()
1201 B2DPolygon addPointsAtCuts(const B2DPolygon& rCandidate) in addPointsAtCuts() argument
1203 if(rCandidate.count()) in addPointsAtCuts()
1207 findCuts(rCandidate, aTempPoints); in addPointsAtCuts()
1209 return mergeTemporaryPointsAndPolygon(rCandidate, aTempPoints); in addPointsAtCuts()
1213 return rCandidate; in addPointsAtCuts()
1217 B2DPolyPolygon addPointsAtCuts(const B2DPolyPolygon& rCandidate, bool bSelfIntersections) in addPointsAtCuts() argument
1219 const sal_uInt32 nCount(rCandidate.count()); in addPointsAtCuts()
1230 aRetval.append(addPointsAtCuts(rCandidate.getB2DPolygon(0))); in addPointsAtCuts()
1235 aRetval = rCandidate; in addPointsAtCuts()
1249 pTempData[a].setPolygon(addPointsAtCuts(rCandidate.getB2DPolygon(a))); in addPointsAtCuts()
1254 pTempData[a].setPolygon(rCandidate.getB2DPolygon(a)); in addPointsAtCuts()
1287 return rCandidate; in addPointsAtCuts()