1/*
2 * Copyright 2012 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7#include "src/pathops/SkPathOpsCubic.h"
8#include "src/pathops/SkPathOpsLine.h"
9#include "src/pathops/SkPathOpsQuad.h"
10#include "src/pathops/SkPathOpsRect.h"
11#include "tests/PathOpsTestCommon.h"
12#include "tests/Test.h"
13
14static const QuadPts quadTests[] = {
15    {{{1, 1}, {2, 1}, {0, 2}}},
16    {{{0, 0}, {1, 1}, {3, 1}}},
17    {{{2, 0}, {1, 1}, {2, 2}}},
18    {{{4, 0}, {0, 1}, {4, 2}}},
19    {{{0, 0}, {0, 1}, {1, 1}}},
20};
21
22static const CubicPts cubicTests[] = {
23    {{{2, 0}, {3, 1}, {2, 2}, {1, 1}}},
24    {{{3, 1}, {2, 2}, {1, 1}, {2, 0}}},
25    {{{3, 0}, {2, 1}, {3, 2}, {1, 1}}},
26};
27
28static const size_t quadTests_count = SK_ARRAY_COUNT(quadTests);
29static const size_t cubicTests_count = SK_ARRAY_COUNT(cubicTests);
30
31static void setRawBounds(const SkDQuad& quad, SkDRect* rect) {
32    rect->set(quad[0]);
33    rect->add(quad[1]);
34    rect->add(quad[2]);
35}
36
37static void setRawBounds(const SkDCubic& cubic, SkDRect* rect) {
38    rect->set(cubic[0]);
39    rect->add(cubic[1]);
40    rect->add(cubic[2]);
41    rect->add(cubic[3]);
42}
43
44DEF_TEST(PathOpsDRect, reporter) {
45    size_t index;
46    SkDRect rect, rect2;
47    for (index = 0; index < quadTests_count; ++index) {
48        const QuadPts& q = quadTests[index];
49        SkDQuad quad;
50        quad.debugSet(q.fPts);
51        SkASSERT(ValidQuad(quad));
52        setRawBounds(quad, &rect);
53        rect2.setBounds(quad);
54        REPORTER_ASSERT(reporter, rect.intersects(rect2));
55        // FIXME: add a recursive box subdivision method to verify that tight bounds is correct
56        SkDPoint leftTop = {rect2.fLeft, rect2.fTop};
57        REPORTER_ASSERT(reporter, rect.contains(leftTop));
58        SkDPoint rightBottom = {rect2.fRight, rect2.fBottom};
59        REPORTER_ASSERT(reporter, rect.contains(rightBottom));
60    }
61    for (index = 0; index < cubicTests_count; ++index) {
62        const CubicPts& c = cubicTests[index];
63        SkDCubic cubic;
64        cubic.debugSet(c.fPts);
65        SkASSERT(ValidCubic(cubic));
66        setRawBounds(cubic, &rect);
67        rect2.setBounds(cubic);
68        REPORTER_ASSERT(reporter, rect.intersects(rect2));
69        // FIXME: add a recursive box subdivision method to verify that tight bounds is correct
70        SkDPoint leftTop = {rect2.fLeft, rect2.fTop};
71        REPORTER_ASSERT(reporter, rect.contains(leftTop));
72        SkDPoint rightBottom = {rect2.fRight, rect2.fBottom};
73        REPORTER_ASSERT(reporter, rect.contains(rightBottom));
74    }
75}
76