PathOpsLineIntersectionTest.cpp File Reference

#include "include/core/SkTypes.h"
#include "include/private/base/SkDebug.h"
#include "src/pathops/SkIntersections.h"
#include "src/pathops/SkPathOpsLine.h"
#include "src/pathops/SkPathOpsPoint.h"
#include "tests/PathOpsTestCommon.h"
#include "tests/Test.h"
#include <algorithm>
#include <array>
#include <cstddef>

Go to the source code of this file.

Functions
static void	check_results (skiatest::Reporter *reporter, const SkDLine &line1, const SkDLine &line2, const SkIntersections &ts, bool nearAllowed)
static void	testOne (skiatest::Reporter *reporter, const SkDLine &line1, const SkDLine &line2, bool nearAllowed)
static void	testOneCoincident (skiatest::Reporter *reporter, const SkDLine &line1, const SkDLine &line2)
	DEF_TEST (PathOpsLineIntersection, reporter)
	DEF_TEST (PathOpsLineIntersectionOneOff, reporter)
	DEF_TEST (PathOpsLineIntersectionExactOneOff, reporter)
	DEF_TEST (PathOpsLineIntersectionOneCoincident, reporter)

Variables
static const SkDLine	tests [][2]
static const size_t	tests_count = std::size(tests)
static const SkDLine	noIntersect [][2]
static const size_t	noIntersect_count = std::size(noIntersect)
static const SkDLine	coincidentTests [][2]
static const size_t	coincidentTests_count = std::size(coincidentTests)

Function Documentation

check_results()

static void check_results ( skiatest::Reporter *  reporter, const SkDLine &  line1, const SkDLine &  line2, const SkIntersections &  ts, bool  nearAllowed  )

static

Definition at line 94 of file PathOpsLineIntersectionTest.cpp.

                                                                       {
    for (int i = 0; i < ts.used(); ++i) {
        SkDPoint result1 = line1.ptAtT(ts[0][i]);
        SkDPoint result2 = line2.ptAtT(ts[1][i]);
        if (nearAllowed && result1.roughlyEqual(result2)) {
            continue;
        }
        if (!result1.approximatelyEqual(result2) && !ts.nearlySame(i)) {
            REPORTER_ASSERT(reporter, ts.used() != 1);
            result2 = line2.ptAtT(ts[1][i ^ 1]);
            if (!result1.approximatelyEqual(result2)) {
                SkDebugf(".");
            }
            REPORTER_ASSERT(reporter, result1.approximatelyEqual(result2));
            REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint()));
        }
    }
}

DEF_TEST() [1/4]

DEF_TEST	(	PathOpsLineIntersection	,
		reporter
	)

Definition at line 209 of file PathOpsLineIntersectionTest.cpp.

                                            {
    size_t index;
    for (index = 0; index < coincidentTests_count; ++index) {
        const SkDLine& line1 = coincidentTests[index][0];
        const SkDLine& line2 = coincidentTests[index][1];
        testOneCoincident(reporter, line1, line2);
    }
    for (index = 0; index < tests_count; ++index) {
        const SkDLine& line1 = tests[index][0];
        const SkDLine& line2 = tests[index][1];
        testOne(reporter, line1, line2, true);
    }
    for (index = 0; index < noIntersect_count; ++index) {
        const SkDLine& line1 = noIntersect[index][0];
        const SkDLine& line2 = noIntersect[index][1];
        SkIntersections ts;
        int pts = ts.intersect(line1, line2);
        REPORTER_ASSERT(reporter, !pts);
        REPORTER_ASSERT(reporter, pts == ts.used());
        reporter->bumpTestCount();
    }
}

DEF_TEST() [2/4]

DEF_TEST	(	PathOpsLineIntersectionExactOneOff	,
		reporter
	)

Definition at line 238 of file PathOpsLineIntersectionTest.cpp.

                                                       {
    int index = 0;
    SkASSERT(index < (int) tests_count);
    testOne(reporter, tests[index][0], tests[index][1], false);
}

DEF_TEST() [3/4]

DEF_TEST	(	PathOpsLineIntersectionOneCoincident	,
		reporter
	)

Definition at line 244 of file PathOpsLineIntersectionTest.cpp.

                                                         {
    int index = 0;
    SkASSERT(index < (int) coincidentTests_count);
    const SkDLine& line1 = coincidentTests[index][0];
    const SkDLine& line2 = coincidentTests[index][1];
    testOneCoincident(reporter, line1, line2);
}

DEF_TEST() [4/4]

DEF_TEST	(	PathOpsLineIntersectionOneOff	,
		reporter
	)

Definition at line 232 of file PathOpsLineIntersectionTest.cpp.

                                                  {
    int index = 0;
    SkASSERT(index < (int) tests_count);
    testOne(reporter, tests[index][0], tests[index][1], true);
}

testOne()

static void testOne ( skiatest::Reporter *  reporter, const SkDLine &  line1, const SkDLine &  line2, bool  nearAllowed  )

static

Definition at line 114 of file PathOpsLineIntersectionTest.cpp.

                          {
    SkASSERT(ValidLine(line1));
    SkASSERT(ValidLine(line2));
    SkIntersections i;
    i.allowNear(nearAllowed);
    int pts = i.intersect(line1, line2);
    REPORTER_ASSERT(reporter, pts);
    REPORTER_ASSERT(reporter, pts == i.used());
    check_results(reporter, line1, line2, i, nearAllowed);
    if (line1[0] == line1[1] || line2[0] == line2[1]) {
        return;
    }
    if (line1[0].fY == line1[1].fY) {
        double left = std::min(line1[0].fX, line1[1].fX);
        double right = std::max(line1[0].fX, line1[1].fX);
        SkIntersections ts;
        ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
        check_results(reporter, line2, line1, ts, nearAllowed);
    }
    if (line2[0].fY == line2[1].fY) {
        double left = std::min(line2[0].fX, line2[1].fX);
        double right = std::max(line2[0].fX, line2[1].fX);
        SkIntersections ts;
        ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
        check_results(reporter, line1, line2, ts, nearAllowed);
    }
    if (line1[0].fX == line1[1].fX) {
        double top = std::min(line1[0].fY, line1[1].fY);
        double bottom = std::max(line1[0].fY, line1[1].fY);
        SkIntersections ts;
        ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top);
        check_results(reporter, line2, line1, ts, nearAllowed);
    }
    if (line2[0].fX == line2[1].fX) {
        double top = std::min(line2[0].fY, line2[1].fY);
        double bottom = std::max(line2[0].fY, line2[1].fY);
        SkIntersections ts;
        ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top);
        check_results(reporter, line1, line2, ts, nearAllowed);
    }
    reporter->bumpTestCount();
}

testOneCoincident()

static void testOneCoincident ( skiatest::Reporter *  reporter, const SkDLine &  line1, const SkDLine &  line2  )

static

Definition at line 158 of file PathOpsLineIntersectionTest.cpp.

                                                    {
    SkASSERT(ValidLine(line1));
    SkASSERT(ValidLine(line2));
    SkIntersections i;
    int pts = i.intersect(line1, line2);
    REPORTER_ASSERT(reporter, pts == 2);
    REPORTER_ASSERT(reporter, pts == i.used());
    check_results(reporter, line1, line2, i, false);
    if (line1[0] == line1[1] || line2[0] == line2[1]) {
        return;
    }
    if (line1[0].fY == line1[1].fY) {
        double left = std::min(line1[0].fX, line1[1].fX);
        double right = std::max(line1[0].fX, line1[1].fX);
        SkIntersections ts;
        ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left);
        REPORTER_ASSERT(reporter, pts == 2);
        REPORTER_ASSERT(reporter, pts == ts.used());
        check_results(reporter, line2, line1, ts, false);
    }
    if (line2[0].fY == line2[1].fY) {
        double left = std::min(line2[0].fX, line2[1].fX);
        double right = std::max(line2[0].fX, line2[1].fX);
        SkIntersections ts;
        ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left);
        REPORTER_ASSERT(reporter, pts == 2);
        REPORTER_ASSERT(reporter, pts == ts.used());
        check_results(reporter, line1, line2, ts, false);
    }
    if (line1[0].fX == line1[1].fX) {
        double top = std::min(line1[0].fY, line1[1].fY);
        double bottom = std::max(line1[0].fY, line1[1].fY);
        SkIntersections ts;
        ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top);
        REPORTER_ASSERT(reporter, pts == 2);
        REPORTER_ASSERT(reporter, pts == ts.used());
        check_results(reporter, line2, line1, ts, false);
    }
    if (line2[0].fX == line2[1].fX) {
        double top = std::min(line2[0].fY, line2[1].fY);
        double bottom = std::max(line2[0].fY, line2[1].fY);
        SkIntersections ts;
        ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top);
        REPORTER_ASSERT(reporter, pts == 2);
        REPORTER_ASSERT(reporter, pts == ts.used());
        check_results(reporter, line1, line2, ts, false);
    }
    reporter->bumpTestCount();
}

Variable Documentation

coincidentTests

const SkDLine coincidentTests[][2]

static

Initial value:

= {
   {{{ {-1.48383003e-006,-83}, {4.2268899e-014,-60} }},
    {{ {9.5359502e-007,-60}, {5.08227985e-015,-83} }}},
 
   {{{ { 10105, 2510 }, { 10123, 2509.98999f } }},
    {{{10105, 2509.98999f}, { 10123, 2510 } }}},
 
   {{ { { 0, 482.5 }, { -4.4408921e-016, 682.5 } } },
    {{{0,683}, {0,482}}}},
 
   {{{{1.77635684e-015,312}, {-1.24344979e-014,348}}},
    {{{0,348}, {0,312}}}},
 
   {{{{979.304871, 561}, {1036.69507, 291}}},
    {{{985.681519, 531}, {982.159790, 547.568542}}}},
 
   {{{{232.159805, 547.568542}, {235.681549, 531}}},
    {{{286.695129,291}, {229.304855,561}}}},
 
    {{{{186.3661956787109375f, 134.7042236328125f}, {187.8782806396484375f, 133.7258148193359375f}}},
     {{{175.8309783935546875f, 141.5211334228515625f}, {187.8782806396484375f, 133.7258148193359375f}}}},
 
    {{{{235.681549, 531.000000}, {280.318420, 321.000000}}},
     {{{286.695129, 291.000000}, {229.304855, 561.000000}}}},
}

Definition at line 66 of file PathOpsLineIntersectionTest.cpp.

coincidentTests_count

const size_t coincidentTests_count = std::size(coincidentTests)

static

Definition at line 92 of file PathOpsLineIntersectionTest.cpp.

noIntersect

const SkDLine noIntersect[][2]

static

Initial value:

= {
   {{{{(double) (2 - 1e-6f),2}, {(double) (2 - 1e-6f),4}}},
    {{{2,1}, {2,3}}}},
 
    {{{{0, 0}, {1, 0}}}, {{{3, 0}, {2, 0}}}},
    {{{{0, 0}, {0, 0}}}, {{{1, 0}, {2, 0}}}},
    {{{{0, 1}, {0, 1}}}, {{{0, 3}, {0, 2}}}},
    {{{{0, 0}, {1, 0}}}, {{{2, 0}, {3, 0}}}},
    {{{{1, 1}, {2, 2}}}, {{{4, 4}, {3, 3}}}},
}

Definition at line 53 of file PathOpsLineIntersectionTest.cpp.

noIntersect_count

const size_t noIntersect_count = std::size(noIntersect)

static

Definition at line 64 of file PathOpsLineIntersectionTest.cpp.

tests

const SkDLine tests[][2]

static

Initial value:

= {
{{{{0.00010360032320022583, 1.0172703415155411}, {0.00014114845544099808, 1.0200891587883234}}},
 {{{0.00010259449481964111, 1.017270140349865}, {0.00018215179443359375, 1.022890567779541}}}},
 
 
 
 
 
    {{{{30,20}, {30,50}}}, {{{24,30}, {36,30}}}},
    {{{{323,193}, {-317,193}}}, {{{0,994}, {0,0}}}},
    {{{{90,230}, {160,60}}}, {{{60,120}, {260,120}}}},
    {{{{90,230}, {160,60}}}, {{{181.176468,120}, {135.294128,120}}}},
    {{{{181.1764678955078125f, 120}, {186.3661956787109375f, 134.7042236328125f}}},
     {{{175.8309783935546875f, 141.5211334228515625f}, {187.8782806396484375f, 133.7258148193359375f}}}},
 
 
 
 
 
    {{{{192, 4}, {243, 4}}}, {{{246, 4}, {189, 4}}}},
    {{{{246, 4}, {189, 4}}}, {{{192, 4}, {243, 4}}}},
    {{{{5, 0}, {0, 5}}}, {{{5, 4}, {1, 4}}}},
    {{{{0, 0}, {1, 0}}}, {{{1, 0}, {0, 0}}}},
    {{{{0, 0}, {0, 0}}}, {{{0, 0}, {1, 0}}}},
    {{{{0, 1}, {0, 1}}}, {{{0, 0}, {0, 2}}}},
    {{{{0, 0}, {1, 0}}}, {{{0, 0}, {2, 0}}}},
    {{{{1, 1}, {2, 2}}}, {{{0, 0}, {3, 3}}}},
    {{{{166.86950047022856, 112.69654129527828}, {166.86948801592692, 112.69655741235339}}},
     {{{166.86960700313026, 112.6965477747386}, {166.86925794355412, 112.69656471103423}}}}
}

Definition at line 20 of file PathOpsLineIntersectionTest.cpp.

tests_count

const size_t tests_count = std::size(tests)

static

Definition at line 51 of file PathOpsLineIntersectionTest.cpp.