Searched refs:roots2Copy (Results 1 - 4 of 4) sorted by relevance
| /external/chromium_org/third_party/skia/src/pathops/ |
| H A D | SkDQuadIntersection.cpp | 479 double roots2Copy[4]; local
480 int r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
483 pts2[index] = q2.ptAtT(roots2Copy[index]);
488 insert(roots1Copy[0], roots2Copy[0], pts1[0]);
491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
492 insert(roots1Copy[0], roots2Copy[0], pts1[0]);
550 insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]],
|
| /external/skia/src/pathops/ |
| H A D | SkDQuadIntersection.cpp | 479 double roots2Copy[4]; local
480 int r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
483 pts2[index] = q2.ptAtT(roots2Copy[index]);
488 insert(roots1Copy[0], roots2Copy[0], pts1[0]);
491 if (binary_search(q1, q2, roots1Copy, roots2Copy, pts1)) {
492 insert(roots1Copy[0], roots2Copy[0], pts1[0]);
550 insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]],
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| H A D | QuadraticImplicit.cpp | 467 double roots2Copy[4];
468 int r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
471 xy_at_t(q2, roots2Copy[index], pts2[index].x, pts2[index].y);
476 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]);
491 r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
506 r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
507 if (binarySearch(q1, q2, roots1Copy[0], roots2Copy[0], pts1[0])) {
508 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]);
566 i.insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]],
|
| /external/skia/experimental/Intersection/ |
| H A D | QuadraticImplicit.cpp | 467 double roots2Copy[4];
468 int r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
471 xy_at_t(q2, roots2Copy[index], pts2[index].x, pts2[index].y);
476 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]);
491 r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
506 r2Count = addValidRoots(roots2, rootCount2, roots2Copy);
507 if (binarySearch(q1, q2, roots1Copy[0], roots2Copy[0], pts1[0])) {
508 i.insert(roots1Copy[0], roots2Copy[0], pts1[0]);
566 i.insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]],
|
Completed in 58 milliseconds