clear the convex-hint in reset() and rewind(), to match its state in a newly
created path.
todo: convexity perhaps should be tristate: yes, no, unknown
git-svn-id: http://skia.googlecode.com/svn/trunk@768 2bbb7eff-a529-9590-31e7-b0007b416f81
diff --git a/tests/PathTest.cpp b/tests/PathTest.cpp
index 9f26d01..b4b6317 100644
--- a/tests/PathTest.cpp
+++ b/tests/PathTest.cpp
@@ -6,7 +6,7 @@
const SkRect& bounds) {
REPORTER_ASSERT(reporter, p.isConvex());
REPORTER_ASSERT(reporter, p.getBounds() == bounds);
-
+
SkPath p2(p);
REPORTER_ASSERT(reporter, p2.isConvex());
REPORTER_ASSERT(reporter, p2.getBounds() == bounds);
@@ -45,12 +45,12 @@
p.setIsConvex(false);
p.addRoundRect(bounds, SK_Scalar1, SK_Scalar1);
check_convex_bounds(reporter, p, bounds);
-
+
p.reset();
p.setIsConvex(false);
p.addOval(bounds);
check_convex_bounds(reporter, p, bounds);
-
+
p.reset();
p.setIsConvex(false);
p.addRect(bounds);
@@ -88,6 +88,18 @@
p.moveTo(SK_Scalar1, 0);
p.getLastPt(&pt);
REPORTER_ASSERT(reporter, pt.fX == SK_Scalar1);
+
+ // check that reset and rewind clear the convex hint back to false
+ p.setIsConvex(false);
+ REPORTER_ASSERT(reporter, !p.isConvex());
+ p.setIsConvex(true);
+ REPORTER_ASSERT(reporter, p.isConvex());
+ p.reset();
+ REPORTER_ASSERT(reporter, !p.isConvex());
+ p.setIsConvex(true);
+ REPORTER_ASSERT(reporter, p.isConvex());
+ p.rewind();
+ REPORTER_ASSERT(reporter, !p.isConvex());
}
#include "TestClassDef.h"