Lines Matching refs:cubic1
20 const Cubic& cubic1 = tests[index][0];
23 int order1 = reduceOrder(cubic1, reduce1, kReduceOrder_NoQuadraticsAllowed,
28 printf("%s [%d] cubic1 order=%d\n", __FUNCTION__, (int) index, order1);
48 xy_at_t(cubic1, tt1, tx1, ty1);
197 static void oneOff(const Cubic& cubic1, const Cubic& cubic2) {
199 cubic_to_quadratics(cubic1, calcPrecision(cubic1), quads1);
203 cubic1[0].x, cubic1[0].y, cubic1[1].x, cubic1[1].y,
204 cubic1[2].x, cubic1[2].y, cubic1[3].x, cubic1[3].y));
228 intersect2(cubic1, cubic2, intersections2);
229 intersect3(cubic1, cubic2, intersections3);
238 xy_at_t(cubic1, tt1, xy1.x, xy1.y);
273 xy_at_t(cubic1, tt1, xy1.x, xy1.y);
289 static void oneOff3(const Cubic& cubic1, const Cubic& cubic2) {
293 cubic1[0].x, cubic1[0].y, cubic1[1].x, cubic1[1].y,
294 cubic1[2].x, cubic1[2].y, cubic1[3].x, cubic1[3].y);
300 cubic_to_quadratics(cubic1, calcPrecision(cubic1), quads1);
320 intersect3(cubic1, cubic2, intersections3);
329 xy_at_t(cubic1, tt1, xy1.x, xy1.y);
361 const Cubic& cubic1 = testSet[outer];
373 oneOff(cubic1, cubic2);
376 oneOff3(cubic1, cubic2);
385 const Cubic& cubic1 = newTestSet[outer];
387 oneOff3(cubic1, cubic2);
413 : cubic1(c1)
421 sub_divide(cubic1, minT1, maxT1, sub1);
431 xy_at_t(cubic1, t1, x1, y1);
451 const Cubic& cubic1;
465 Cubic cubic1, cubic2;
467 cubic1[i].x = (double) rand() / RAND_MAX * 100;
468 cubic1[i].y = (double) rand() / RAND_MAX * 100;
482 cubic1[0].x, cubic1[0].y, cubic1[1].x, cubic1[1].y, cubic1[2].x, cubic1[2].y,
483 cubic1[3].x, cubic1[3].y,
488 rect1.setBounds(cubic1);
494 bool oldIntersects = intersect(cubic1, cubic2, i1);
501 bool newIntersects = intersect3(cubic1, cubic2, i2);
525 if (intersect(cubic1, self1)) {
532 CubicChopper c(cubic1, cubic2);
540 double calc1 = calcPrecision(cubic1);
552 oneOff3(cubic1, cubic2);
560 oneOff3(cubic1, cubic2);
570 Cubic cubic1, cubic2;
572 cubic1[i].x = (double) rand() / RAND_MAX * 100;
573 cubic1[i].y = (double) rand() / RAND_MAX * 100;
581 cubic1[0].x, cubic1[0].y, cubic1[1].x, cubic1[1].y, cubic1[2].x, cubic1[2].y,
582 cubic1[3].x, cubic1[3].y,
587 rect1.setBounds(cubic1);
595 bool newIntersects = intersect3(cubic1, cubic2, intersections2);
607 xy_at_t(cubic1, tt1, xy1.x, xy1.y);
622 const Cubic& cubic1 = newTestSet[index0];
627 xy_at_t(cubic1, t1Seed - t1Step, t1[0].x, t1[0].y);
628 xy_at_t(cubic1, t1Seed, t1[1].x, t1[1].y);
629 xy_at_t(cubic1, t1Seed + t1Step, t1[2].x, t1[2].y);
673 xy_at_t(cubic1, t10, test.x, test.y);
679 xy_at_t(cubic1, t12, test.x, test.y);
697 _Point p10 = xy_at_t(cubic1, t10);
698 _Point p1Seed = xy_at_t(cubic1, t1Seed);
699 _Point p12 = xy_at_t(cubic1, t12);
723 Cubic cubic1 = {{0, 1}, {0, 2}, {1, 0}, {1, 0}};
