9e49fb63d3
add copyrights everywhere start working on quadratic line segments (for quad intersection) git-svn-id: http://skia.googlecode.com/svn/trunk@5286 2bbb7eff-a529-9590-31e7-b0007b416f81
127 lines
2.7 KiB
C++
127 lines
2.7 KiB
C++
/*
|
|
* Copyright 2012 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
#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])();
|
|
}
|
|
}
|