| /trunk/main/basegfx/source/polygon/ |
| H A D | b2dpolypolygoncutter.cxx | 983 …lygon solvePolygonOperationOr(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB) in solvePolygonOperationOr() argument
987 return rCandidateB; in solvePolygonOperationOr()
989 else if(!rCandidateB.count()) in solvePolygonOperationOr()
999 aRetval.append(rCandidateB); in solvePolygonOperationOr()
1011 return rCandidateB; in solvePolygonOperationXor()
1013 else if(!rCandidateB.count()) in solvePolygonOperationXor()
1024 aRetval.append(rCandidateB); in solvePolygonOperationXor()
1038 else if(!rCandidateB.count()) in solvePolygonOperationAnd()
1049 aRetval.append(rCandidateB); in solvePolygonOperationAnd()
1063 else if(!rCandidateB.count()) in solvePolygonOperationDiff()
[all …]
|
| H A D | b2dpolygoncutandtouch.cxx | 232 …void findCuts(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, temporaryPointVector& …
305 …OSL_ENSURE(!rCandidateA.isClosed() && !rCandidateB.isClosed(), "findCutsAndTouchesAndCommonForBezi… in findCutsAndTouchesAndCommonForBezier()
307 const sal_uInt32 nPointCountB(rCandidateB.count()); in findCutsAndTouchesAndCommonForBezier()
319 B2DPoint aCurrB(rCandidateB.getB2DPoint(0L)); in findCutsAndTouchesAndCommonForBezier()
323 const B2DPoint aNextB(rCandidateB.getB2DPoint(b + 1L)); in findCutsAndTouchesAndCommonForBezier()
789 const sal_uInt32 nPointCountB(rCandidateB.count()); in findCuts()
794 const sal_uInt32 nEdgeCountB(rCandidateB.isClosed() ? nPointCountB : nPointCountB - 1L); in findCuts()
798 …const bool bCurvesInvolved(rCandidateA.areControlPointsUsed() || rCandidateB.areControlPointsUsed(… in findCuts()
814 rCandidateB.getBezierSegment(b, aCubicB); in findCuts()
860 B2DPoint aCurrB(rCandidateB.getB2DPoint(0L)); in findCuts()
[all …]
|
| H A D | b2dpolypolygontools.cxx | 558 …bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB, const double& rfS… in equal() argument
562 if(nPolygonCount != rCandidateB.count()) in equal()
569 if(!equal(aCandidate, rCandidateB.getB2DPolygon(a), rfSmallValue)) in equal()
576 bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB) in equal() argument
580 return equal(rCandidateA, rCandidateB, fSmallValue); in equal()
|
| H A D | b3dpolypolygontools.cxx | 519 …bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB, const double& rfS… in equal() argument
523 if(nPolygonCount != rCandidateB.count()) in equal()
530 if(!equal(aCandidate, rCandidateB.getB3DPolygon(a), rfSmallValue)) in equal()
537 bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB) in equal() argument
541 return equal(rCandidateA, rCandidateB, fSmallValue); in equal()
|
| H A D | b3dpolygontools.cxx | 1166 …bool equal(const B3DPolygon& rCandidateA, const B3DPolygon& rCandidateB, const double& rfSmallValu… in equal() argument
1170 if(nPointCount != rCandidateB.count()) in equal()
1175 if(bClosed != rCandidateB.isClosed()) in equal()
1182 if(!aPoint.equal(rCandidateB.getB3DPoint(a), rfSmallValue)) in equal()
1189 bool equal(const B3DPolygon& rCandidateA, const B3DPolygon& rCandidateB) in equal() argument
1193 return equal(rCandidateA, rCandidateB, fSmallValue); in equal()
|
| H A D | b2dpolygontools.cxx | 2309 …rt, const B2DPoint& rEnd, const B2DPoint& rCandidateA, const B2DPoint& rCandidateB, bool bWithLine) in arePointsOnSameSideOfLine() argument
2321 const B2DVector aVectorToB(rEnd - rCandidateB); in arePointsOnSameSideOfLine()
3522 …bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, const double& rfSmallValu… in equal() argument
3526 if(nPointCount != rCandidateB.count()) in equal()
3531 if(bClosed != rCandidateB.isClosed()) in equal()
3536 if(bAreControlPointsUsed != rCandidateB.areControlPointsUsed()) in equal()
3543 if(!aPoint.equal(rCandidateB.getB2DPoint(a), rfSmallValue)) in equal()
3550 if(!aPrev.equal(rCandidateB.getPrevControlPoint(a), rfSmallValue)) in equal()
3555 if(!aNext.equal(rCandidateB.getNextControlPoint(a), rfSmallValue)) in equal()
3563 bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB) in equal() argument
[all …]
|
| /trunk/main/basegfx/inc/basegfx/polygon/ |
| H A D | b2dpolypolygoncutter.hxx | 97 …ygon solvePolygonOperationOr(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB);
100 …gon solvePolygonOperationXor(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB);
103 …gon solvePolygonOperationAnd(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB);
106 …on solvePolygonOperationDiff(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB);
|
| H A D | b2dpolygontools.hxx | 417 …rt, const B2DPoint& rEnd, const B2DPoint& rCandidateA, const B2DPoint& rCandidateB, bool bWithLine…
516 …BASEGFX_DLLPUBLIC bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, const d…
517 BASEGFX_DLLPUBLIC bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB);
|
| H A D | b3dpolypolygontools.hxx | 146 …BASEGFX_DLLPUBLIC bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB,…
147 …BASEGFX_DLLPUBLIC bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB);
|
| H A D | b3dpolygontools.hxx | 168 …BASEGFX_DLLPUBLIC bool equal(const B3DPolygon& rCandidateA, const B3DPolygon& rCandidateB, const d…
169 BASEGFX_DLLPUBLIC bool equal(const B3DPolygon& rCandidateA, const B3DPolygon& rCandidateB);
|
| H A D | b2dpolypolygontools.hxx | 299 …BASEGFX_DLLPUBLIC bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB,…
300 …BASEGFX_DLLPUBLIC bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB);
|
| /trunk/main/drawinglayer/source/primitive2d/ |
| H A D | svggradientprimitive2d.cxx | 219 const SvgGradientEntry& rCandidateB = rEntries[nIndex]; in createRun() local
221 createAtom(rTargetColor, rTargetOpacity, rCandidateA, rCandidateB, nOffset); in createRun()
222 fPos = rCandidateB.getOffset(); in createRun()
|