Searched refs:t1Seed (Results 1 - 12 of 12) sorted by relevance

/external/chromium_org/third_party/skia/tests/
H A DPathOpsQuadIntersectionTest.cpp414 double t1Seed = 0.5; local
421 t1[0] = quad1.ptAtT(t1Seed - t1Step);
422 t1[1] = quad1.ptAtT(t1Seed);
423 t1[2] = quad1.ptAtT(t1Seed + t1Step);
443 t1Seed -= t1Step;
445 t1Seed += t1Step;
461 double t10 = t1Seed - t1Step * 2;
462 double t12 = t1Seed + t1Step * 2;
490 t10, t1Seed, t12, t20, t2Seed, t22);
492 SkDPoint p1Seed = quad1.ptAtT(t1Seed);
[all...]
H A DPathOpsCubicIntersectionTest.cpp446 static void intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, argument
453 t1[0] = cubic1.ptAtT(t1Seed - t1Step);
454 t1[1] = cubic1.ptAtT(t1Seed);
455 t1[2] = cubic1.ptAtT(t1Seed + t1Step);
475 t1Seed -= t1Step;
477 t1Seed += t1Step;
493 double t10 = t1Seed - t1Step * 2;
494 double t12 = t1Seed + t1Step * 2;
522 t10, t1Seed, t12, t20, t2Seed, t22);
524 SkDPoint p1Seed = cubic1.ptAtT(t1Seed);
[all...]
/external/skia/tests/
H A DPathOpsQuadIntersectionTest.cpp411 double t1Seed = 0.5; local
418 t1[0] = quad1.ptAtT(t1Seed - t1Step);
419 t1[1] = quad1.ptAtT(t1Seed);
420 t1[2] = quad1.ptAtT(t1Seed + t1Step);
440 t1Seed -= t1Step;
442 t1Seed += t1Step;
458 double t10 = t1Seed - t1Step * 2;
459 double t12 = t1Seed + t1Step * 2;
487 t10, t1Seed, t12, t20, t2Seed, t22);
489 SkDPoint p1Seed = quad1.ptAtT(t1Seed);
[all...]
H A DPathOpsCubicIntersectionTest.cpp446 static void intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, argument
453 t1[0] = cubic1.ptAtT(t1Seed - t1Step);
454 t1[1] = cubic1.ptAtT(t1Seed);
455 t1[2] = cubic1.ptAtT(t1Seed + t1Step);
475 t1Seed -= t1Step;
477 t1Seed += t1Step;
493 double t10 = t1Seed - t1Step * 2;
494 double t12 = t1Seed + t1Step * 2;
522 t10, t1Seed, t12, t20, t2Seed, t22);
524 SkDPoint p1Seed = cubic1.ptAtT(t1Seed);
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DQuadraticIntersection_Test.cpp344 double t1Seed = 0.5; local
351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y);
352 xy_at_t(quad1, t1Seed, t1[1].x, t1[1].y);
353 xy_at_t(quad1, t1Seed + t1Step, t1[2].x, t1[2].y);
373 t1Seed -= t1Step;
375 t1Seed += t1Step;
391 double t10 = t1Seed - t1Step * 2;
392 double t12 = t1Seed + t1Step * 2;
420 t10, t1Seed, t12, t20, t2Seed, t22);
422 _Point p1Seed = xy_at_t(quad1, t1Seed);
[all...]
H A DCubicIntersection_Test.cpp620 static void intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, argument
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);
649 t1Seed -= t1Step;
651 t1Seed += t1Step;
667 double t10 = t1Seed - t1Step * 2;
668 double t12 = t1Seed + t1Step * 2;
696 t10, t1Seed, t12, t20, t2Seed, t22);
698 _Point p1Seed = xy_at_t(cubic1, t1Seed);
[all...]
H A DQuadraticImplicit.cpp336 static bool binarySearch(const Quadratic& quad1, const Quadratic& quad2, double& t1Seed,
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed);
348 t1Seed, t2Seed, t1[1].x, t1[1].y, t1[2].x, t1[2].y);
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep);
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep);
382 t1Seed -= tStep;
387 t1Seed += tStep;
408 t1Seed, t2Seed, t1[1].x, t1[1].y, t1[2].x, t1[2].y);
/external/skia/experimental/Intersection/
H A DQuadraticIntersection_Test.cpp344 double t1Seed = 0.5; local
351 xy_at_t(quad1, t1Seed - t1Step, t1[0].x, t1[0].y);
352 xy_at_t(quad1, t1Seed, t1[1].x, t1[1].y);
353 xy_at_t(quad1, t1Seed + t1Step, t1[2].x, t1[2].y);
373 t1Seed -= t1Step;
375 t1Seed += t1Step;
391 double t10 = t1Seed - t1Step * 2;
392 double t12 = t1Seed + t1Step * 2;
420 t10, t1Seed, t12, t20, t2Seed, t22);
422 _Point p1Seed = xy_at_t(quad1, t1Seed);
[all...]
H A DCubicIntersection_Test.cpp620 static void intersectionFinder(int index0, int index1, double t1Seed, double t2Seed, argument
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);
649 t1Seed -= t1Step;
651 t1Seed += t1Step;
667 double t10 = t1Seed - t1Step * 2;
668 double t12 = t1Seed + t1Step * 2;
696 t10, t1Seed, t12, t20, t2Seed, t22);
698 _Point p1Seed = xy_at_t(cubic1, t1Seed);
[all...]
H A DQuadraticImplicit.cpp336 static bool binarySearch(const Quadratic& quad1, const Quadratic& quad2, double& t1Seed,
342 if (calcMask & (1 << 1)) t1[1] = xy_at_t(quad1, t1Seed);
348 t1Seed, t2Seed, t1[1].x, t1[1].y, t1[2].x, t1[2].y);
352 if (calcMask & (1 << 0)) t1[0] = xy_at_t(quad1, t1Seed - tStep);
353 if (calcMask & (1 << 2)) t1[2] = xy_at_t(quad1, t1Seed + tStep);
382 t1Seed -= tStep;
387 t1Seed += tStep;
408 t1Seed, t2Seed, t1[1].x, t1[1].y, t1[2].x, t1[2].y);
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, argument
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
306 t1Seed, t2Seed, t1[1].fX, t1[1].fY, t2[1].fX, t2[1].fY);
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep));
340 *t1Seed -= tStep;
345 *t1Seed += tStep;
366 t1Seed, t2Seed, t1[1].fX, t1[1].fY, t1[2].fX, t1[2].fY);
/external/skia/src/pathops/
H A DSkDQuadIntersection.cpp294 static bool binary_search(const SkDQuad& quad1, const SkDQuad& quad2, double* t1Seed, argument
300 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed);
306 t1Seed, t2Seed, t1[1].fX, t1[1].fY, t2[1].fX, t2[1].fY);
310 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(SkTMax(0., *t1Seed - tStep));
311 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(SkTMin(1., *t1Seed + tStep));
340 *t1Seed -= tStep;
345 *t1Seed += tStep;
366 t1Seed, t2Seed, t1[1].fX, t1[1].fY, t1[2].fX, t1[2].fY);

Completed in 216 milliseconds