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 "PathOpsTestCommon.h" 8 #include "SkPathOpsCubic.h" 9 #include "SkPathOpsLine.h" 10 #include "SkPathOpsQuad.h" 11 #include "SkPathOpsRect.h" 12 #include "Test.h" 13 14 static const SkDQuad 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 22 static const SkDCubic 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 28 static const size_t quadTests_count = SK_ARRAY_COUNT(quadTests); 29 static const size_t cubicTests_count = SK_ARRAY_COUNT(cubicTests); 30 31 static void setRawBounds(const SkDQuad& quad, SkDRect* rect) { 32 rect->set(quad[0]); 33 rect->add(quad[1]); 34 rect->add(quad[2]); 35 } 36 37 static 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 44 DEF_TEST(PathOpsDRect, reporter) { 45 size_t index; 46 SkDRect rect, rect2; 47 for (index = 0; index < quadTests_count; ++index) { 48 const SkDQuad& quad = quadTests[index]; 49 SkASSERT(ValidQuad(quad)); 50 setRawBounds(quad, &rect); 51 rect2.setBounds(quad); 52 REPORTER_ASSERT(reporter, rect.intersects(rect2)); 53 // FIXME: add a recursive box subdivision method to verify that tight bounds is correct 54 SkDPoint leftTop = {rect2.fLeft, rect2.fTop}; 55 REPORTER_ASSERT(reporter, rect.contains(leftTop)); 56 SkDPoint rightBottom = {rect2.fRight, rect2.fBottom}; 57 REPORTER_ASSERT(reporter, rect.contains(rightBottom)); 58 } 59 for (index = 0; index < cubicTests_count; ++index) { 60 const SkDCubic& cubic = cubicTests[index]; 61 SkASSERT(ValidCubic(cubic)); 62 setRawBounds(cubic, &rect); 63 rect2.setBounds(cubic); 64 REPORTER_ASSERT(reporter, rect.intersects(rect2)); 65 // FIXME: add a recursive box subdivision method to verify that tight bounds is correct 66 SkDPoint leftTop = {rect2.fLeft, rect2.fTop}; 67 REPORTER_ASSERT(reporter, rect.contains(leftTop)); 68 SkDPoint rightBottom = {rect2.fRight, rect2.fBottom}; 69 REPORTER_ASSERT(reporter, rect.contains(rightBottom)); 70 } 71 } 72
