skia2/experimental/Intersection/EdgeWalkerQuadralaterals_Test.cpp
caryclark@google.com 198e054b33 shape ops work in progress
git-svn-id: http://skia.googlecode.com/svn/trunk@3566 2bbb7eff-a529-9590-31e7-b0007b416f81
2012-03-30 18:47:02 +00:00

121 lines
2.6 KiB
C++

#include "EdgeWalker_Test.h"
#include "Intersection_Tests.h"
#include "SkBitmap.h"
static SkBitmap bitmap;
static void testSimplifyQuad1() {
SkPath path, out;
path.moveTo(0, 0);
path.lineTo(1, 0);
path.lineTo(3, 2);
path.lineTo(3, 3);
path.close();
path.moveTo(1, 0);
path.lineTo(1, 3);
path.lineTo(1, 3);
path.lineTo(1, 3);
path.close();
testSimplify(path, true, out, bitmap);
}
static void testSimplifyQuad2() {
SkPath path, out;
path.moveTo(0, 0);
path.lineTo(0, 0);
path.lineTo(0, 0);
path.lineTo(0, 2);
path.close();
path.moveTo(0, 1);
path.lineTo(0, 1);
path.lineTo(1, 1);
path.lineTo(0, 2);
path.close();
testSimplify(path, true, out, bitmap);
}
static void testSimplifyQuad3() {
SkPath path, out;
path.moveTo(0, 0);
path.lineTo(0, 0);
path.lineTo(1, 0);
path.lineTo(1, 2);
path.close();
path.moveTo(0, 1);
path.lineTo(1, 1);
path.lineTo(2, 1);
path.lineTo(0, 2);
path.close();
testSimplify(path, true, out, bitmap);
}
static void testSimplifyQuad4() {
SkPath path, out;
path.moveTo(0, 0);
path.lineTo(0, 0);
path.lineTo(1, 0);
path.lineTo(2, 2);
path.close();
path.moveTo(0, 0);
path.lineTo(2, 1);
path.lineTo(3, 1);
path.lineTo(3, 3);
path.close();
testSimplify(path, true, out, bitmap);
}
static void testSimplifyQuad5() {
SkPath path, out;
path.moveTo(0, 0);
path.lineTo(0, 0);
path.lineTo(1, 0);
path.lineTo(3, 2);
path.close();
path.moveTo(0, 1);
path.lineTo(1, 1);
path.lineTo(2, 1);
path.lineTo(0, 2);
path.close();
testSimplify(path, true, out, bitmap);
}
static void testSimplifyQuad6() {
SkPath path, out;
path.moveTo(0, 0);
path.lineTo(1, 0);
path.lineTo(1, 1);
path.lineTo(3, 3);
path.close();
path.moveTo(1, 1);
path.lineTo(1, 1);
path.lineTo(1, 1);
path.lineTo(2, 2);
path.close();
testSimplify(path, true, out, bitmap);
}
static void (*simplifyTests[])() = {
testSimplifyQuad6,
testSimplifyQuad5,
testSimplifyQuad4,
testSimplifyQuad3,
testSimplifyQuad2,
testSimplifyQuad1,
};
static size_t simplifyTestsCount = sizeof(simplifyTests) / sizeof(simplifyTests[0]);
static void (*firstTest)() = 0;
void SimplifyQuadralateralPaths_Test() {
size_t index = 0;
if (firstTest) {
while (index < simplifyTestsCount && simplifyTests[index] != firstTest) {
++index;
}
}
for ( ; index < simplifyTestsCount; ++index) {
(*simplifyTests[index])();
}
}