Home
last modified time | relevance | path

Searched refs:rCandidateA (Results 1 – 12 of 12) sorted by relevance

/AOO42X/main/basegfx/source/polygon/
H A Db2dpolypolygoncutter.cxx983 …B2DPolyPolygon solvePolygonOperationOr(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rC… in solvePolygonOperationOr() argument
985 if(!rCandidateA.count()) in solvePolygonOperationOr()
991 return rCandidateA; in solvePolygonOperationOr()
997 B2DPolyPolygon aRetval(rCandidateA); in solvePolygonOperationOr()
1007 …B2DPolyPolygon solvePolygonOperationXor(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& r… in solvePolygonOperationXor() argument
1009 if(!rCandidateA.count()) in solvePolygonOperationXor()
1015 return rCandidateA; in solvePolygonOperationXor()
1022 B2DPolyPolygon aRetval(rCandidateA); in solvePolygonOperationXor()
1032 …B2DPolyPolygon solvePolygonOperationAnd(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& r… in solvePolygonOperationAnd() argument
1034 if(!rCandidateA.count()) in solvePolygonOperationAnd()
[all …]
H A Db2dpolygoncutandtouch.cxx232 …void findCuts(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, temporaryPointVector& …
290 …void findCutsAndTouchesAndCommonForBezier(const B2DPolygon& rCandidateA, const B2DPolygon& rCandid… in findCutsAndTouchesAndCommonForBezier() argument
304 …OSL_ENSURE(!rCandidateA.areControlPointsUsed() && !rCandidateB.areControlPointsUsed(), "findCutsAn… in findCutsAndTouchesAndCommonForBezier()
305 …OSL_ENSURE(!rCandidateA.isClosed() && !rCandidateB.isClosed(), "findCutsAndTouchesAndCommonForBezi… in findCutsAndTouchesAndCommonForBezier()
306 const sal_uInt32 nPointCountA(rCandidateA.count()); in findCutsAndTouchesAndCommonForBezier()
313 B2DPoint aCurrA(rCandidateA.getB2DPoint(0L)); in findCutsAndTouchesAndCommonForBezier()
317 const B2DPoint aNextA(rCandidateA.getB2DPoint(a + 1L)); in findCutsAndTouchesAndCommonForBezier()
784 …void findCuts(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, temporaryPointVector& … in findCuts() argument
788 const sal_uInt32 nPointCountA(rCandidateA.count()); in findCuts()
793 … const sal_uInt32 nEdgeCountA(rCandidateA.isClosed() ? nPointCountA : nPointCountA - 1L); in findCuts()
[all …]
H A Db2dpolypolygontools.cxx558 …bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB, const double& rfS… in equal() argument
560 const sal_uInt32 nPolygonCount(rCandidateA.count()); in equal()
567 const B2DPolygon aCandidate(rCandidateA.getB2DPolygon(a)); in equal()
576 bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB) in equal() argument
580 return equal(rCandidateA, rCandidateB, fSmallValue); in equal()
H A Db3dpolypolygontools.cxx515 …bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB, const double& rfS… in equal() argument
517 const sal_uInt32 nPolygonCount(rCandidateA.count()); in equal()
524 const B3DPolygon aCandidate(rCandidateA.getB3DPolygon(a)); in equal()
533 bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB) in equal() argument
537 return equal(rCandidateA, rCandidateB, fSmallValue); in equal()
H A Db3dpolygontools.cxx1166 …bool equal(const B3DPolygon& rCandidateA, const B3DPolygon& rCandidateB, const double& rfSmallValu… in equal() argument
1168 const sal_uInt32 nPointCount(rCandidateA.count()); in equal()
1173 const bool bClosed(rCandidateA.isClosed()); in equal()
1180 const B3DPoint aPoint(rCandidateA.getB3DPoint(a)); in equal()
1189 bool equal(const B3DPolygon& rCandidateA, const B3DPolygon& rCandidateB) in equal() argument
1193 return equal(rCandidateA, rCandidateB, fSmallValue); in equal()
H A Db2dpolygontools.cxx2309 …deOfLine(const B2DPoint& rStart, const B2DPoint& rEnd, const B2DPoint& rCandidateA, const B2DPoint… in arePointsOnSameSideOfLine() argument
2312 const B2DVector aVectorToA(rEnd - rCandidateA); in arePointsOnSameSideOfLine()
3522 …bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB, const double& rfSmallValu… in equal() argument
3524 const sal_uInt32 nPointCount(rCandidateA.count()); in equal()
3529 const bool bClosed(rCandidateA.isClosed()); in equal()
3534 const bool bAreControlPointsUsed(rCandidateA.areControlPointsUsed()); in equal()
3541 const B2DPoint aPoint(rCandidateA.getB2DPoint(a)); in equal()
3548 const basegfx::B2DPoint aPrev(rCandidateA.getPrevControlPoint(a)); in equal()
3553 const basegfx::B2DPoint aNext(rCandidateA.getNextControlPoint(a)); in equal()
3563 bool equal(const B2DPolygon& rCandidateA, const B2DPolygon& rCandidateB) in equal() argument
[all …]
/AOO42X/main/basegfx/inc/basegfx/polygon/
H A Db2dpolypolygoncutter.hxx97 …BASEGFX_DLLPUBLIC B2DPolyPolygon solvePolygonOperationOr(const B2DPolyPolygon& rCandidateA, const …
100 …BASEGFX_DLLPUBLIC B2DPolyPolygon solvePolygonOperationXor(const B2DPolyPolygon& rCandidateA, const…
103 …BASEGFX_DLLPUBLIC B2DPolyPolygon solvePolygonOperationAnd(const B2DPolyPolygon& rCandidateA, const…
106 …LPUBLIC B2DPolyPolygon solvePolygonOperationDiff(const B2DPolyPolygon& rCandidateA, const B2DPolyP…
H A Db2dpolygontools.hxx417 …deOfLine(const B2DPoint& rStart, const B2DPoint& rEnd, const B2DPoint& rCandidateA, const B2DPoint…
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 Db3dpolypolygontools.hxx146 …BASEGFX_DLLPUBLIC bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB,…
147 …BASEGFX_DLLPUBLIC bool equal(const B3DPolyPolygon& rCandidateA, const B3DPolyPolygon& rCandidateB);
H A Db3dpolygontools.hxx168 …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 Db2dpolypolygontools.hxx299 …BASEGFX_DLLPUBLIC bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB,…
300 …BASEGFX_DLLPUBLIC bool equal(const B2DPolyPolygon& rCandidateA, const B2DPolyPolygon& rCandidateB);
/AOO42X/main/drawinglayer/source/primitive2d/
H A Dsvggradientprimitive2d.cxx218 const SvgGradientEntry& rCandidateA = rEntries[nIndex++]; in createRun() local
221 createAtom(rTargetColor, rTargetOpacity, rCandidateA, rCandidateB, nOffset); in createRun()