Lines Matching refs:cubicTo
71 path->cubicTo(3.747501373f, 3.88774991f, 3.635501385f, 4.0f, 3.497501373f, 4.0f); in make_path_crbug364224()
73 path->cubicTo(0.6095013618f, 4.0f, 0.4975013733f, 3.88774991f, 0.4975013733f, 3.75f); in make_path_crbug364224()
75 path->cubicTo(0.4975013733f, 0.8622499704f, 0.6095013618f, 0.75f, 0.7475013733f,0.75f); in make_path_crbug364224()
77 path->cubicTo(3.50275135f, 0.75f, 3.5070014f, 0.7527500391f, 3.513001442f, 0.753000021f); in make_path_crbug364224()
79 …path->cubicTo(3.648251295f, 0.5194999576f, 3.575501442f, 0.4999999702f, 3.497501373f, 0.4999999702… in make_path_crbug364224()
81 path->cubicTo(0.4715013802f, 0.4999999702f, 0.2475013733f, 0.7239999771f, 0.2475013733f, 1.0f); in make_path_crbug364224()
83 path->cubicTo(0.2475013733f, 4.026000023f, 0.4715013504f, 4.25f, 0.7475013733f, 4.25f); in make_path_crbug364224()
85 path->cubicTo(3.773501396f, 4.25f, 3.997501373f, 4.026000023f, 3.997501373f, 3.75f); in make_path_crbug364224()
93 …path->cubicTo(3.648251295f, 0.5194999576f, 3.575501442f, 0.4999999702f, 3.497501373f, 0.4999999702… in make_path_crbug364224_simplified()
123 path->cubicTo(p1, p2, p3); in make_path_crbugskia2820()
288 path.cubicTo(-2.35893e+08f, -4.21044e+08f, in test_bad_cubic_crbug234190()
308 path.cubicTo(pts[1], pts[2], pts[3]); in test_bad_cubic_crbug229478()
369 path.cubicTo(5.16324e+06f, -186882, 8.15247e+06f, -295092, 1.1957e+07f, -432813); in build_path_170666()
370 path.cubicTo(1.95659e+07f, -708257, 3.04359e+07f, -1.10175e+06f, 4.34798e+07f, -1.57394e+06f); in build_path_170666()
371 …path.cubicTo(6.95677e+07f, -2.51831e+06f, 1.04352e+08f, -3.77748e+06f, 1.39135e+08f, -5.03666e+06f… in build_path_170666()
372 … path.cubicTo(1.73919e+08f, -6.29583e+06f, 2.08703e+08f, -7.555e+06f, 2.34791e+08f, -8.49938e+06f); in build_path_170666()
373 …path.cubicTo(2.47835e+08f, -8.97157e+06f, 2.58705e+08f, -9.36506e+06f, 2.66314e+08f, -9.6405e+06f); in build_path_170666()
374 …path.cubicTo(2.70118e+08f, -9.77823e+06f, 2.73108e+08f, -9.88644e+06f, 2.75146e+08f, -9.96022e+06f… in build_path_170666()
375 …path.cubicTo(2.76165e+08f, -9.99711e+06f, 2.76946e+08f, -1.00254e+07f, 2.77473e+08f, -1.00444e+07f… in build_path_170666()
378 path.cubicTo(2.78271e+08f, -1.00733e+07f, 2.08703e+08f, -7.555e+06f, 135.238f, 23.3517f); in build_path_170666()
379 path.cubicTo(131.191f, 23.4981f, 125.995f, 23.7976f, 123.631f, 24.0206f); in build_path_170666()
380 path.cubicTo(121.267f, 24.2436f, 122.631f, 24.3056f, 126.677f, 24.1591f); in build_path_170666()
381 … path.cubicTo(2.08703e+08f, -7.555e+06f, 2.78271e+08f, -1.00733e+07f, 2.78271e+08f, -1.00733e+07f); in build_path_170666()
384 …path.cubicTo(2.76946e+08f, -1.00254e+07f, 2.76165e+08f, -9.99711e+06f, 2.75146e+08f, -9.96022e+06f… in build_path_170666()
385 …path.cubicTo(2.73108e+08f, -9.88644e+06f, 2.70118e+08f, -9.77823e+06f, 2.66314e+08f, -9.6405e+06f); in build_path_170666()
386 …path.cubicTo(2.58705e+08f, -9.36506e+06f, 2.47835e+08f, -8.97157e+06f, 2.34791e+08f, -8.49938e+06f… in build_path_170666()
387 … path.cubicTo(2.08703e+08f, -7.555e+06f, 1.73919e+08f, -6.29583e+06f, 1.39135e+08f, -5.03666e+06f); in build_path_170666()
388 …path.cubicTo(1.04352e+08f, -3.77749e+06f, 6.95677e+07f, -2.51831e+06f, 4.34798e+07f, -1.57394e+06f… in build_path_170666()
389 path.cubicTo(3.04359e+07f, -1.10175e+06f, 1.95659e+07f, -708258, 1.1957e+07f, -432814); in build_path_170666()
390 path.cubicTo(8.15248e+06f, -295092, 5.16324e+06f, -186883, 3.12513e+06f, -113103); in build_path_170666()
395 path.cubicTo(22.5186f, 24.5432f, 18.8134f, 24.6337f, 14.1287f, 24.8697f); in build_path_170666()
396 path.cubicTo(9.4439f, 25.1057f, 5.55359f, 25.3978f, 5.43941f, 25.5223f); in build_path_170666()
402 … path.cubicTo(2.08703e+08f, -7.555e+06f, 2.78271e+08f, -1.00733e+07f, 2.78271e+08f, -1.00733e+07f); in build_path_simple_170666()
444 path.cubicTo(0, 0, 0, 0, 0, 0); in test_addrect()
473 path->cubicTo(10.7082f, -116.596f, 262.057f, 45.6468f, 294.694f, 1.96237f); in build_big_path()
485 path->cubicTo(10.7082f, -116.596f, 262.057f, 45.6468f, 294.694f, 1.96237f); in build_big_path()
487 path->cubicTo(30.531f, 10.0005f, 1502.47f, 13.2804f, 84.3088f, 9.99601f); in build_big_path()
523 path.cubicTo(pts[1], pts[2], pts[3]); in test_tricky_cubic()
943 path.cubicTo(pts[1], pts[2], pts[3]); in stroke_cubic()
1033 quad.cubicTo(SK_Scalar1, SK_Scalar1, 10 * SK_Scalar1, in test_close()
1234 …badFirstVector.cubicTo(501.087677f, 319.610321f, 449.271606f, 258.078674f, 395.084564f, 198.711182… in test_convexity2()
1235 …badFirstVector.cubicTo(358.967072f, 159.140717f, 321.910553f, 120.650436f, 298.442322f, 101.955399… in test_convexity2()
1237 …badFirstVector.cubicTo(325.283844f, 116.945084f, 362.615204f, 155.720825f, 398.777557f, 195.340454… in test_convexity2()
1238 …badFirstVector.cubicTo(453.031860f, 254.781662f, 504.912262f, 316.389618f, 504.912292f, 316.389648… in test_convexity2()
1369 case 4: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[f]); break; in test_convexity()
1370 case 5: path.cubicTo(finitePts[f], nonFinitePts[i], finitePts[f]); break; in test_convexity()
1371 case 6: path.cubicTo(finitePts[f], finitePts[f], nonFinitePts[i]); break; in test_convexity()
1372 case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], finitePts[f]); break; in test_convexity()
1373 case 8: path.cubicTo(nonFinitePts[i], finitePts[f], nonFinitePts[i]); break; in test_convexity()
1374 case 9: path.cubicTo(finitePts[f], nonFinitePts[i], nonFinitePts[i]); break; in test_convexity()
1375 case 10: path.cubicTo(nonFinitePts[i], nonFinitePts[i], nonFinitePts[i]); break; in test_convexity()
1376 case 11: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[g]); break; in test_convexity()
1393 case 5: path.cubicTo(finitePts[f], finitePts[f], finitePts[f]); break; in test_convexity()
1394 case 6: path.cubicTo(finitePts[f], finitePts[f], finitePts[g]); break; in test_convexity()
1395 case 7: path.cubicTo(finitePts[f], finitePts[g], finitePts[f]); break; in test_convexity()
1396 case 8: path.cubicTo(finitePts[f], finitePts[g], finitePts[g]); break; in test_convexity()
1397 case 9: path.cubicTo(finitePts[g], finitePts[f], finitePts[f]); break; in test_convexity()
1398 case 10: path.cubicTo(finitePts[g], finitePts[f], finitePts[g]); break; in test_convexity()
1574 path.cubicTo(kBaseRect.fLeft + kRRRadii[0] / 2, kBaseRect.fTop, in test_conservativelyContains()
1852 path1.cubicTo(1, .5f, 1, .5f, 1, .5f); in test_isRect()
2042 path1.cubicTo(1, .5f, 1, .5f, 1, .5f); in test_isNestedFillRects()
2120 p.cubicTo(pts[4], pts[5], pts[6]); in test_flattening()
2176 p.cubicTo(pts[4], pts[5], pts[6]); in test_transform()
2349 p.cubicTo(100, 100, 200, 200, 300, 300); in test_segment_masks()
2357 p.cubicTo(100, 100, 200, 200, 300, 300); in test_segment_masks()
2512 p.cubicTo(0, 0, 0, 0, 0, 0); in test_iter()
2704 p.cubicTo(expectedPts[numPoints], expectedPts[numPoints + 1], in test_raw_iter()
3313 q.cubicTo(5, 6, 7, 8, 7, 5); in test_addPath()
3470 …p.cubicTo(pts[i + 1].fX, pts[i + 1].fY, pts[i + 2].fX, pts[i + 2].fY, pts[i + 3].fX, pts[i + 3].fY… in test_contains()
3471 …p.cubicTo(pts[i + 4].fX, pts[i + 4].fY, pts[i + 5].fX, pts[i + 5].fY, pts[i + 6].fX, pts[i + 6].fY… in test_contains()
3605 p.cubicTo(3, 4, 5, 6, 7, 8); in test_dump()
3634 q.cubicTo(5, 6, 7, 8, 7, 5); in TestPathTo()