2 * Copyright 2012 Google Inc.
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
7 #include "PathOpsTestCommon.h"
8 #include "SkPathOpsCubic.h"
9 #include "SkPathOpsLine.h"
10 #include "SkPathOpsQuad.h"
11 #include "SkPathOpsRect.h"
14 static const SkDLine lineTests[] = {
23 static const SkDQuad quadTests[] = {
24 {{{1, 1}, {2, 1}, {0, 2}}},
25 {{{0, 0}, {1, 1}, {3, 1}}},
26 {{{2, 0}, {1, 1}, {2, 2}}},
27 {{{4, 0}, {0, 1}, {4, 2}}},
28 {{{0, 0}, {0, 1}, {1, 1}}},
31 static const SkDCubic cubicTests[] = {
32 {{{2, 0}, {3, 1}, {2, 2}, {1, 1}}},
33 {{{3, 1}, {2, 2}, {1, 1}, {2, 0}}},
34 {{{3, 0}, {2, 1}, {3, 2}, {1, 1}}},
37 static const size_t lineTests_count = SK_ARRAY_COUNT(lineTests);
38 static const size_t quadTests_count = SK_ARRAY_COUNT(quadTests);
39 static const size_t cubicTests_count = SK_ARRAY_COUNT(cubicTests);
41 DEF_TEST(PathOpsDRect, reporter) {
44 for (index = 0; index < lineTests_count; ++index) {
45 const SkDLine& line = lineTests[index];
46 SkASSERT(ValidLine(line));
48 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(line[0].fX, line[1].fX));
49 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(line[0].fY, line[1].fY));
50 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(line[0].fX, line[1].fX));
51 REPORTER_ASSERT(reporter, rect.fBottom == SkTMax(line[0].fY, line[1].fY));
54 REPORTER_ASSERT(reporter, rect2.fLeft == SkTMin(line[0].fX, line[1].fX));
55 REPORTER_ASSERT(reporter, rect2.fTop == SkTMin(line[0].fY, line[1].fY));
56 REPORTER_ASSERT(reporter, rect2.fRight == SkTMax(line[0].fX, line[1].fX));
57 REPORTER_ASSERT(reporter, rect2.fBottom == SkTMax(line[0].fY, line[1].fY));
58 REPORTER_ASSERT(reporter, rect.contains(line[0]));
59 REPORTER_ASSERT(reporter, rect.intersects(&rect2));
61 for (index = 0; index < quadTests_count; ++index) {
62 const SkDQuad& quad = quadTests[index];
63 SkASSERT(ValidQuad(quad));
64 rect.setRawBounds(quad);
65 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(quad[0].fX,
66 SkTMin(quad[1].fX, quad[2].fX)));
67 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(quad[0].fY,
68 SkTMin(quad[1].fY, quad[2].fY)));
69 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(quad[0].fX,
70 SkTMax(quad[1].fX, quad[2].fX)));
71 REPORTER_ASSERT(reporter, rect.fBottom == SkTMax(quad[0].fY,
72 SkTMax(quad[1].fY, quad[2].fY)));
73 rect2.setBounds(quad);
74 REPORTER_ASSERT(reporter, rect.intersects(&rect2));
75 // FIXME: add a recursive box subdivision method to verify that tight bounds is correct
76 SkDPoint leftTop = {rect2.fLeft, rect2.fTop};
77 REPORTER_ASSERT(reporter, rect.contains(leftTop));
78 SkDPoint rightBottom = {rect2.fRight, rect2.fBottom};
79 REPORTER_ASSERT(reporter, rect.contains(rightBottom));
81 for (index = 0; index < cubicTests_count; ++index) {
82 const SkDCubic& cubic = cubicTests[index];
83 SkASSERT(ValidCubic(cubic));
84 rect.setRawBounds(cubic);
85 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(cubic[0].fX,
86 SkTMin(cubic[1].fX, SkTMin(cubic[2].fX, cubic[3].fX))));
87 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(cubic[0].fY,
88 SkTMin(cubic[1].fY, SkTMin(cubic[2].fY, cubic[3].fY))));
89 REPORTER_ASSERT(reporter, rect.fRight == SkTMax(cubic[0].fX,
90 SkTMax(cubic[1].fX, SkTMax(cubic[2].fX, cubic[3].fX))));
91 REPORTER_ASSERT(reporter, rect.fBottom == SkTMax(cubic[0].fY,
92 SkTMax(cubic[1].fY, SkTMax(cubic[2].fY, cubic[3].fY))));
93 rect2.setBounds(cubic);
94 REPORTER_ASSERT(reporter, rect.intersects(&rect2));
95 // FIXME: add a recursive box subdivision method to verify that tight bounds is correct
96 SkDPoint leftTop = {rect2.fLeft, rect2.fTop};
97 REPORTER_ASSERT(reporter, rect.contains(leftTop));
98 SkDPoint rightBottom = {rect2.fRight, rect2.fBottom};
99 REPORTER_ASSERT(reporter, rect.contains(rightBottom));