2013-05-07 18:51:31 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2013 Google Inc.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
|
|
* found in the LICENSE file.
|
|
|
|
*/
|
2013-07-16 16:11:16 +00:00
|
|
|
#include "PathOpsTestCommon.h"
|
2013-05-07 18:51:31 +00:00
|
|
|
#include "SkIntersections.h"
|
|
|
|
#include "SkPathOpsCubic.h"
|
|
|
|
#include "SkPathOpsQuad.h"
|
|
|
|
#include "SkReduceOrder.h"
|
|
|
|
#include "Test.h"
|
|
|
|
|
|
|
|
static struct lineCubic {
|
|
|
|
SkDCubic cubic;
|
|
|
|
SkDQuad quad;
|
|
|
|
int answerCount;
|
|
|
|
SkDPoint answers[2];
|
|
|
|
} quadCubicTests[] = {
|
2013-10-03 07:01:37 +00:00
|
|
|
{{{{49, 47}, {49, 74.614250183105469}, {26.614250183105469, 97}, {-1, 97}}},
|
2013-10-02 14:49:34 +00:00
|
|
|
{{{-8.659739592076221e-015, 96.991401672363281}, {20.065492630004883, 96.645187377929688},
|
|
|
|
{34.355339050292969, 82.355339050292969}}}, 2,
|
|
|
|
{{34.355339050292969,82.355339050292969}, {34.306797674910243,82.403823585863449}}},
|
|
|
|
|
2013-05-08 07:01:40 +00:00
|
|
|
{{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
|
2013-10-02 14:49:34 +00:00
|
|
|
{{{18,226}, {14.686291694641113,226}, {12.342399597167969,228.3424072265625}}}, 1,
|
|
|
|
{{18,226}, {0,0}}},
|
2013-05-08 07:01:40 +00:00
|
|
|
{{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
|
2013-10-02 14:49:34 +00:00
|
|
|
{{{12.342399597167969,228.3424072265625}, {10,230.68629455566406}, {10,234}}}, 1,
|
|
|
|
{{10,234}, {0,0}}},
|
2013-05-07 18:51:31 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static const size_t quadCubicTests_count = SK_ARRAY_COUNT(quadCubicTests);
|
|
|
|
|
|
|
|
static void PathOpsCubicQuadIntersectionTest(skiatest::Reporter* reporter) {
|
|
|
|
for (size_t index = 0; index < quadCubicTests_count; ++index) {
|
|
|
|
int iIndex = static_cast<int>(index);
|
|
|
|
const SkDCubic& cubic = quadCubicTests[index].cubic;
|
2013-07-16 16:11:16 +00:00
|
|
|
SkASSERT(ValidCubic(cubic));
|
2013-05-07 18:51:31 +00:00
|
|
|
const SkDQuad& quad = quadCubicTests[index].quad;
|
2013-07-16 16:11:16 +00:00
|
|
|
SkASSERT(ValidQuad(quad));
|
2013-05-07 18:51:31 +00:00
|
|
|
SkReduceOrder reduce1;
|
|
|
|
SkReduceOrder reduce2;
|
|
|
|
int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics,
|
|
|
|
SkReduceOrder::kFill_Style);
|
|
|
|
int order2 = reduce2.reduce(quad, SkReduceOrder::kFill_Style);
|
|
|
|
if (order1 != 4) {
|
|
|
|
SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
|
|
|
|
REPORTER_ASSERT(reporter, 0);
|
|
|
|
}
|
|
|
|
if (order2 != 3) {
|
|
|
|
SkDebugf("[%d] quad order=%d\n", iIndex, order2);
|
|
|
|
REPORTER_ASSERT(reporter, 0);
|
|
|
|
}
|
|
|
|
SkIntersections i;
|
|
|
|
int roots = i.intersect(cubic, quad);
|
|
|
|
SkASSERT(roots == quadCubicTests[index].answerCount);
|
|
|
|
for (int pt = 0; pt < roots; ++pt) {
|
|
|
|
double tt1 = i[0][pt];
|
2013-07-23 15:27:41 +00:00
|
|
|
SkDPoint xy1 = cubic.ptAtT(tt1);
|
2013-05-07 18:51:31 +00:00
|
|
|
double tt2 = i[1][pt];
|
2013-07-23 15:27:41 +00:00
|
|
|
SkDPoint xy2 = quad.ptAtT(tt2);
|
2013-05-07 18:51:31 +00:00
|
|
|
if (!xy1.approximatelyEqual(xy2)) {
|
|
|
|
SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
|
|
|
|
__FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
|
|
|
|
}
|
|
|
|
REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
|
|
|
|
bool found = false;
|
|
|
|
for (int idx2 = 0; idx2 < quadCubicTests[index].answerCount; ++idx2) {
|
|
|
|
found |= quadCubicTests[index].answers[idx2].approximatelyEqual(xy1);
|
|
|
|
}
|
|
|
|
REPORTER_ASSERT(reporter, found);
|
|
|
|
}
|
|
|
|
reporter->bumpTestCount();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#include "TestClassDef.h"
|
|
|
|
DEFINE_TESTCLASS_SHORT(PathOpsCubicQuadIntersectionTest)
|