diff options
author | Armin Weiss <aw@openoffice.org> | 2003-11-05 11:25:58 +0000 |
---|---|---|
committer | Armin Weiss <aw@openoffice.org> | 2003-11-05 11:25:58 +0000 |
commit | c3663a687ccc9365b2b4eb4a3950b8d94c2d6ea7 (patch) | |
tree | c47ce5e59d718d5f772121000a356ef523662b17 /basegfx/source/inc/PolygonPoint.hxx | |
parent | 571971699571e0baf9710ddf076ebf27aebb548d (diff) |
Added PolyPolygonTools, Added PolygonTool functionality, changed bool to sal_Bool
Diffstat (limited to 'basegfx/source/inc/PolygonPoint.hxx')
-rw-r--r-- | basegfx/source/inc/PolygonPoint.hxx | 50 |
1 files changed, 25 insertions, 25 deletions
diff --git a/basegfx/source/inc/PolygonPoint.hxx b/basegfx/source/inc/PolygonPoint.hxx index 37a228c1a2a6..5e38fb0dca73 100644 --- a/basegfx/source/inc/PolygonPoint.hxx +++ b/basegfx/source/inc/PolygonPoint.hxx @@ -2,9 +2,9 @@ * * $RCSfile: PolygonPoint.hxx,v $ * - * $Revision: 1.4 $ + * $Revision: 1.5 $ * - * last change: $Author: thb $ $Date: 2003-08-20 16:56:48 $ + * last change: $Author: aw $ $Date: 2003-11-05 12:25:50 $ * * The Contents of this file are made available subject to the terms of * either of the following licenses @@ -91,7 +91,7 @@ public: maPoint = rValue; } - bool operator==(const SimplePointEntry& rEntry) const + sal_Bool operator==(const SimplePointEntry& rEntry) const { return (maPoint == rEntry.maPoint); } @@ -137,14 +137,14 @@ public: maForward = rValue; } - bool isBezierNeeded() + sal_Bool isBezierNeeded() { if(maBackward != Vector::getEmptyVector() || maForward != Vector::getEmptyVector()) - return true; - return false; + return sal_True; + return sal_False; } - bool operator==(const SimpleBezierEntry& rEntry) const + sal_Bool operator==(const SimpleBezierEntry& rEntry) const { return ((maBackward == rEntry.maBackward) && (maForward == rEntry.maForward)); } @@ -181,17 +181,17 @@ template < class Point, class Vector > class PolygonPointList } public: - bool isBezier() const + sal_Bool isBezier() const { - return bool(mnBezierCount); + return sal_Bool(mnBezierCount); } - bool isClosed() const + sal_Bool isClosed() const { - return bool(mbIsClosed); + return sal_Bool(mbIsClosed); } - void setClosed(bool bNew) + void setClosed(sal_Bool bNew) { mbIsClosed = bNew; } @@ -204,7 +204,7 @@ public: PolygonPointList() : mnBezierCount(0L), mpVectors(0L), - mbIsClosed(false) + mbIsClosed(sal_False) { // complete initialization with defaults } @@ -276,27 +276,27 @@ public: } } - bool isEqual(const PolygonPointList& rPointList) const + sal_Bool isEqual(const PolygonPointList& rPointList) const { // same point count? if(maPoints.size() != rPointList.maPoints.size()) - return false; + return sal_False; // if zero points the polys are equal if(!maPoints.size()) - return true; + return sal_True; // if bezier count used it needs to be equal if(mnBezierCount != rPointList.mnBezierCount) - return false; + return sal_False; // compare point content if(maPoints != rPointList.maPoints) - return false; + return sal_False; // beziercounts are equal: if it's zero, we are done if(!mnBezierCount) - return true; + return sal_True; // beziercounts are equal and not zero; compare them DBG_ASSERT(0L != mpVectors, "Error: Bezier list needs to exist here(!)"); @@ -328,9 +328,9 @@ public: if(mpVectors) { LocalSimpleBezierEntry& rDest = (*mpVectors)[nIndex]; - bool bBezierNeededBefore(rDest.isBezierNeeded()); + sal_Bool bBezierNeededBefore(rDest.isBezierNeeded()); ((*mpVectors)[nIndex]).setBackwardVector(rValue); - bool bBezierNeededAfter(rDest.isBezierNeeded()); + sal_Bool bBezierNeededAfter(rDest.isBezierNeeded()); if(bBezierNeededBefore != bBezierNeededAfter) { @@ -342,7 +342,7 @@ public: } else { - bool bEmptyVector(rValue == Vector::getEmptyVector()); + sal_Bool bEmptyVector(rValue == Vector::getEmptyVector()); if(bEmptyVector) return; @@ -366,9 +366,9 @@ public: if(mpVectors) { LocalSimpleBezierEntry& rDest = (*mpVectors)[nIndex]; - bool bBezierNeededBefore(rDest.isBezierNeeded()); + sal_Bool bBezierNeededBefore(rDest.isBezierNeeded()); ((*mpVectors)[nIndex]).setForwardVector(rValue); - bool bBezierNeededAfter(rDest.isBezierNeeded()); + sal_Bool bBezierNeededAfter(rDest.isBezierNeeded()); if(bBezierNeededBefore != bBezierNeededAfter) { @@ -380,7 +380,7 @@ public: } else { - bool bEmptyVector(rValue == Vector::getEmptyVector()); + sal_Bool bEmptyVector(rValue == Vector::getEmptyVector()); if(bEmptyVector) return; |