Home
last modified time | relevance | path

Searched refs:nonFinitePts (Results 1 – 4 of 4) sorted by relevance

/external/skia/tests/
DPathOpsSimplifyFailTest.cpp13 static const SkPoint nonFinitePts[] = { variable
27 const size_t nonFinitePtsCount = sizeof(nonFinitePts) / sizeof(nonFinitePts[0]);
47 case 0: path.lineTo(nonFinitePts[i]); break; in failOne()
48 case 1: path.quadTo(nonFinitePts[i], nonFinitePts[i]); break; in failOne()
49 case 2: path.quadTo(nonFinitePts[i], finitePts[f]); break; in failOne()
50 case 3: path.quadTo(finitePts[f], nonFinitePts[i]); break; in failOne()
51 case 4: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[f]); break; in failOne()
52 case 5: path.cubicTo(finitePts[f], nonFinitePts[i], finitePts[f]); break; in failOne()
53 case 6: path.cubicTo(finitePts[f], finitePts[f], nonFinitePts[i]); break; in failOne()
54 case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], finitePts[f]); break; in failOne()
[all …]
DPathTest.cpp1614 static const SkPoint nonFinitePts[] = { in test_convexity() local
1628 const size_t nonFinitePtsCount = sizeof(nonFinitePts) / sizeof(nonFinitePts[0]); in test_convexity()
1645 case 0: path.lineTo(nonFinitePts[i]); break; in test_convexity()
1646 case 1: path.quadTo(nonFinitePts[i], nonFinitePts[i]); break; in test_convexity()
1647 case 2: path.quadTo(nonFinitePts[i], axisAlignedPts[f]); break; in test_convexity()
1648 case 3: path.quadTo(axisAlignedPts[f], nonFinitePts[i]); break; in test_convexity()
1649 case 4: path.cubicTo(nonFinitePts[i], axisAlignedPts[f], axisAlignedPts[f]); break; in test_convexity()
1650 case 5: path.cubicTo(axisAlignedPts[f], nonFinitePts[i], axisAlignedPts[f]); break; in test_convexity()
1651 case 6: path.cubicTo(axisAlignedPts[f], axisAlignedPts[f], nonFinitePts[i]); break; in test_convexity()
1652 case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], axisAlignedPts[f]); break; in test_convexity()
[all …]
/external/skqp/tests/
DPathOpsSimplifyFailTest.cpp13 static const SkPoint nonFinitePts[] = { variable
27 const size_t nonFinitePtsCount = sizeof(nonFinitePts) / sizeof(nonFinitePts[0]);
47 case 0: path.lineTo(nonFinitePts[i]); break; in failOne()
48 case 1: path.quadTo(nonFinitePts[i], nonFinitePts[i]); break; in failOne()
49 case 2: path.quadTo(nonFinitePts[i], finitePts[f]); break; in failOne()
50 case 3: path.quadTo(finitePts[f], nonFinitePts[i]); break; in failOne()
51 case 4: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[f]); break; in failOne()
52 case 5: path.cubicTo(finitePts[f], nonFinitePts[i], finitePts[f]); break; in failOne()
53 case 6: path.cubicTo(finitePts[f], finitePts[f], nonFinitePts[i]); break; in failOne()
54 case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], finitePts[f]); break; in failOne()
[all …]
DPathTest.cpp1631 static const SkPoint nonFinitePts[] = { in test_convexity() local
1645 const size_t nonFinitePtsCount = sizeof(nonFinitePts) / sizeof(nonFinitePts[0]); in test_convexity()
1662 case 0: path.lineTo(nonFinitePts[i]); break; in test_convexity()
1663 case 1: path.quadTo(nonFinitePts[i], nonFinitePts[i]); break; in test_convexity()
1664 case 2: path.quadTo(nonFinitePts[i], axisAlignedPts[f]); break; in test_convexity()
1665 case 3: path.quadTo(axisAlignedPts[f], nonFinitePts[i]); break; in test_convexity()
1666 case 4: path.cubicTo(nonFinitePts[i], axisAlignedPts[f], axisAlignedPts[f]); break; in test_convexity()
1667 case 5: path.cubicTo(axisAlignedPts[f], nonFinitePts[i], axisAlignedPts[f]); break; in test_convexity()
1668 case 6: path.cubicTo(axisAlignedPts[f], axisAlignedPts[f], nonFinitePts[i]); break; in test_convexity()
1669 case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], axisAlignedPts[f]); break; in test_convexity()
[all …]