Home
last modified time | relevance | path

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

/external/skia/tests/
DPathOpsSimplifyFailTest.cpp29 static const SkPoint finitePts[] = { variable
39 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]);
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()
55 case 8: path.cubicTo(nonFinitePts[i], finitePts[f], nonFinitePts[i]); break; in failOne()
56 case 9: path.cubicTo(finitePts[f], nonFinitePts[i], nonFinitePts[i]); break; in failOne()
[all …]
/external/skqp/tests/
DPathOpsSimplifyFailTest.cpp29 static const SkPoint finitePts[] = { variable
39 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]);
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()
55 case 8: path.cubicTo(nonFinitePts[i], finitePts[f], nonFinitePts[i]); break; in failOne()
56 case 9: path.cubicTo(finitePts[f], nonFinitePts[i], nonFinitePts[i]); break; in failOne()
[all …]