You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

37 lines
1.3 KiB

/*
* Copyright 2013 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "tests/PathOpsExtendedTest.h"
DEF_TEST(PathOpsInverse, reporter) {
const SkPathDirection dirs[] = {SkPathDirection::kCW, SkPathDirection::kCCW};
const SkPathFillType fts[] = {
SkPathFillType::kWinding, SkPathFillType::kEvenOdd,
SkPathFillType::kInverseWinding, SkPathFillType::kInverseEvenOdd
};
SkPath one, two;
int testCount = 0;
for (int op = kDifference_SkPathOp; op <= kReverseDifference_SkPathOp; ++op) {
for (auto oneFill : fts) {
for (auto oneDir : dirs) {
one.reset();
one.setFillType(oneFill);
one.addRect(0, 0, 6, 6, oneDir);
for (auto twoFill : fts) {
for (auto twoDir : dirs) {
two.reset();
two.setFillType(twoFill);
two.addRect(3, 3, 9, 9, twoDir);
SkString testName;
testName.printf("inverseTest%d", ++testCount);
testPathOp(reporter, one, two, (SkPathOp) op, testName.c_str());
}
}
}
}
}
}