/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicIntersection_Test.cpp | 21 const Cubic& cubic2 = tests[index][1]; local 25 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, 32 printf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2); 51 xy_at_t(cubic2, tt2, tx2, ty2); 197 static void oneOff(const Cubic& cubic1, const Cubic& cubic2) { 206 cubic2[0].x, cubic2[0].y, cubic2[1].x, cubic2[1].y, 207 cubic2[ 289 oneOff3(const Cubic& cubic1, const Cubic& cubic2) argument 362 const Cubic& cubic2 = testSet[inner]; local 386 const Cubic& cubic2 = newTestSet[inner]; local 452 const Cubic& cubic2; member in class:CubicChopper 465 Cubic cubic1, cubic2; local 570 Cubic cubic1, cubic2; local 623 const Cubic& cubic2 = newTestSet[index1]; local [all...] |
H A D | CubicBezierClip_Test.cpp | 14 const Cubic& cubic2 = tests[index][1]; local 18 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, 24 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2);
|
H A D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, argument 84 sub_divide(cubic2, t2s, t2e, c2); 102 if (cubic1 == cubic2 && t1Start >= t2Start) { 107 int o2 = quadPart(cubic2, t2Start, t2, s2); 114 sub_divide(cubic2, t2Start, t2, cSub2); 132 _Point p2 = xy_at_t(cubic2, to2); 144 } else if (cubic1 != cubic2 || !approximately_equal(to1, to2)) { 180 intersect3(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 220 intersect3(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 244 intersect3(cubic1, c1Min, c1Max, cubic2, c2Mi [all...] |
H A D | CurveIntersection.h | 16 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT); 20 bool implicit_matches(const Cubic& cubic1, const Cubic& cubic2); 52 bool intersect(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); 54 //bool intersect2(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); 56 bool intersect3(const Cubic& cubic1, const Cubic& cubic2, Intersections& );
|
H A D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { argument 54 endLine.cubicDistanceY(cubic2, distance2y);
|
H A D | CubicConvexHull.cpp | 21 , cubic2(c2) 29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { 32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) { 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 156 const Cubic& cubic2; member in class:CubicIntersections
|
/external/skia/experimental/Intersection/ |
H A D | CubicIntersection_Test.cpp | 21 const Cubic& cubic2 = tests[index][1]; local 25 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, 32 printf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2); 51 xy_at_t(cubic2, tt2, tx2, ty2); 197 static void oneOff(const Cubic& cubic1, const Cubic& cubic2) { 206 cubic2[0].x, cubic2[0].y, cubic2[1].x, cubic2[1].y, 207 cubic2[ 289 oneOff3(const Cubic& cubic1, const Cubic& cubic2) argument 362 const Cubic& cubic2 = testSet[inner]; local 386 const Cubic& cubic2 = newTestSet[inner]; local 452 const Cubic& cubic2; member in class:CubicChopper 465 Cubic cubic1, cubic2; local 570 Cubic cubic1, cubic2; local 623 const Cubic& cubic2 = newTestSet[index1]; local [all...] |
H A D | CubicBezierClip_Test.cpp | 14 const Cubic& cubic2 = tests[index][1]; local 18 int order2 = reduceOrder(cubic2, reduce2, kReduceOrder_NoQuadraticsAllowed, 24 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, (int) index, order2);
|
H A D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, argument 84 sub_divide(cubic2, t2s, t2e, c2); 102 if (cubic1 == cubic2 && t1Start >= t2Start) { 107 int o2 = quadPart(cubic2, t2Start, t2, s2); 114 sub_divide(cubic2, t2Start, t2, cSub2); 132 _Point p2 = xy_at_t(cubic2, to2); 144 } else if (cubic1 != cubic2 || !approximately_equal(to1, to2)) { 180 intersect3(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 220 intersect3(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 244 intersect3(cubic1, c1Min, c1Max, cubic2, c2Mi [all...] |
H A D | CurveIntersection.h | 16 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT); 20 bool implicit_matches(const Cubic& cubic1, const Cubic& cubic2); 52 bool intersect(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); 54 //bool intersect2(const Cubic& cubic1, const Cubic& cubic2, Intersections& ); 56 bool intersect3(const Cubic& cubic1, const Cubic& cubic2, Intersections& );
|
H A D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { argument 54 endLine.cubicDistanceY(cubic2, distance2y);
|
H A D | CubicConvexHull.cpp | 21 , cubic2(c2) 29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { 32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) { 55 sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger); 156 const Cubic& cubic2; member in class:CubicIntersections
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 20 const SkDCubic& cubic2 = tests[index][1]; local 23 int order2 = reduce2.reduce(cubic2, SkReduceOrder::kNo_Quadratics); 33 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2); 38 tIntersections.intersect(cubic1, cubic2); 55 SkDPoint xy2 = cubic2.ptAtT(tt2); 310 static void oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, argument 313 SkASSERT(ValidCubic(cubic2)); 320 cubic2[0].fX, cubic2[0].fY, cubic2[ 368 const SkDCubic& cubic2 = testSet[inner]; local 374 const SkDCubic& cubic2 = newTestSet[inner]; local 400 SkDCubic cubic1, cubic2; local 449 const SkDCubic& cubic2 = newTestSet[index1]; local 614 const SkDCubic& cubic2 = coinSet[index + 1]; local [all...] |
/external/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 20 const SkDCubic& cubic2 = tests[index][1]; local 23 int order2 = reduce2.reduce(cubic2, SkReduceOrder::kNo_Quadratics); 33 SkDebugf("%s [%d] cubic2 order=%d\n", __FUNCTION__, iIndex, order2); 38 tIntersections.intersect(cubic1, cubic2); 55 SkDPoint xy2 = cubic2.ptAtT(tt2); 310 static void oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, argument 313 SkASSERT(ValidCubic(cubic2)); 320 cubic2[0].fX, cubic2[0].fY, cubic2[ 368 const SkDCubic& cubic2 = testSet[inner]; local 374 const SkDCubic& cubic2 = newTestSet[inner]; local 400 SkDCubic cubic1, cubic2; local 449 const SkDCubic& cubic2 = newTestSet[index1]; local 614 const SkDCubic& cubic2 = coinSet[index + 1]; local [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, argument 80 SkDCubic c2 = cubic2.subDivide(t2s, t2e); 98 if (&cubic1 == &cubic2 && t1Start >= t2Start) { 103 int o2 = quadPart(cubic2, t2Start, t2, &s2); 125 SkDPoint p2 = cubic2.ptAtT(to2); 129 if (&cubic1 != &cubic2 || !approximately_equal(to1, to2)) { 168 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 210 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 236 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 242 // intersect(cubic1, c1Min, c1Max, cubic2, c2Mi [all...] |
H A D | SkIntersections.h | 271 bool cubicExactEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2); 272 void cubicNearEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2, const SkDRect& );
|
/external/skia/src/pathops/ |
H A D | SkDCubicIntersection.cpp | 76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, argument 80 SkDCubic c2 = cubic2.subDivide(t2s, t2e); 98 if (&cubic1 == &cubic2 && t1Start >= t2Start) { 103 int o2 = quadPart(cubic2, t2Start, t2, &s2); 125 SkDPoint p2 = cubic2.ptAtT(to2); 129 if (&cubic1 != &cubic2 || !approximately_equal(to1, to2)) { 168 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 210 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 236 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i); 242 // intersect(cubic1, c1Min, c1Max, cubic2, c2Mi [all...] |
H A D | SkIntersections.h | 271 bool cubicExactEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2); 272 void cubicNearEnd(const SkDCubic& cubic1, bool start, const SkDCubic& cubic2, const SkDRect& );
|