HomeSort by relevance Sort by last modified time
    Searched refs:intersections2 (Results 1 - 4 of 4) sorted by null

  /external/skia/tests/
PathOpsQuadIntersectionTest.cpp 396 SkIntersections intersections2; local
397 intersections2.intersect(quad1, quad2);
398 REPORTER_ASSERT(reporter, intersections2.debugCoincidentUsed() >= 2);
399 REPORTER_ASSERT(reporter, intersections2.used() >= 2);
400 for (int pt = 0; pt < intersections2.debugCoincidentUsed(); pt += 2) {
401 double tt1 = intersections2[0][pt];
402 double tt2 = intersections2[1][pt];
PathOpsCubicIntersectionTest.cpp 506 SkIntersections intersections2; local
507 int newIntersects = intersections2.intersect(c1, c2);
516 for (int pt = 0; pt < intersections2.used(); ++pt) {
517 double tt1 = intersections2[0][pt];
519 double tt2 = intersections2[1][pt];
  /external/skqp/tests/
PathOpsQuadIntersectionTest.cpp 396 SkIntersections intersections2; local
397 intersections2.intersect(quad1, quad2);
398 REPORTER_ASSERT(reporter, intersections2.debugCoincidentUsed() >= 2);
399 REPORTER_ASSERT(reporter, intersections2.used() >= 2);
400 for (int pt = 0; pt < intersections2.debugCoincidentUsed(); pt += 2) {
401 double tt1 = intersections2[0][pt];
402 double tt2 = intersections2[1][pt];
PathOpsCubicIntersectionTest.cpp 505 SkIntersections intersections2; local
506 int newIntersects = intersections2.intersect(c1, c2);
515 for (int pt = 0; pt < intersections2.used(); ++pt) {
516 double tt1 = intersections2[0][pt];
518 double tt2 = intersections2[1][pt];

Completed in 130 milliseconds