Home
last modified time | relevance | path

Searched refs:lineConicTests (Results 1 – 2 of 2) sorted by relevance

/external/skqp/tests/
DPathOpsConicLineIntersectionTest.cpp23 } lineConicTests[] = { variable
32 static size_t lineConicTests_count = SK_ARRAY_COUNT(lineConicTests);
105 const ConicPts& c = lineConicTests[index].conic; in DEF_TEST()
109 const SkDLine& line = lineConicTests[index].line; in DEF_TEST()
130 REPORTER_ASSERT(reporter, result == lineConicTests[index].result); in DEF_TEST()
146 if (!t1.approximatelyEqual(lineConicTests[index].expected[0]) in DEF_TEST()
147 && (lineConicTests[index].result == 1 in DEF_TEST()
148 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) { in DEF_TEST()
/external/skia/tests/
DPathOpsConicLineIntersectionTest.cpp23 } lineConicTests[] = { variable
32 static size_t lineConicTests_count = SK_ARRAY_COUNT(lineConicTests);
105 const ConicPts& c = lineConicTests[index].conic; in DEF_TEST()
109 const SkDLine& line = lineConicTests[index].line; in DEF_TEST()
130 REPORTER_ASSERT(reporter, result == lineConicTests[index].result); in DEF_TEST()
146 if (!t1.approximatelyEqual(lineConicTests[index].expected[0]) in DEF_TEST()
147 && (lineConicTests[index].result == 1 in DEF_TEST()
148 || !t1.approximatelyEqual(lineConicTests[index].expected[1]))) { in DEF_TEST()