/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicIntersection_Test.cpp | 20 const Cubic& cubic1 = tests[index][0]; local 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[ 289 oneOff3(const Cubic& cubic1, const Cubic& cubic2) argument 361 const Cubic& cubic1 = testSet[outer]; local 385 const Cubic& cubic1 = newTestSet[outer]; local 451 const Cubic& cubic1; member in class:CubicChopper 465 Cubic cubic1, cubic2; local 570 Cubic cubic1, cubic2; local 622 const Cubic& cubic1 = newTestSet[index0]; local [all...] |
H A D | CubicBezierClip_Test.cpp | 13 const Cubic& cubic1 = tests[index][0]; local 16 int order1 = reduceOrder(cubic1, reduce1, kReduceOrder_NoQuadraticsAllowed, 21 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, (int) index, order1);
|
H A D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { argument 21 endLine.cubicEndPoints(cubic1); 28 distance[0] = endLine.controlPtDistance(cubic1, 1); 29 distance[1] = endLine.controlPtDistance(cubic1, 2);
|
H A D | CubicConvexHull.cpp | 20 : cubic1(c1) 29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { 32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) { 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 77 xy_at_t(cubic1, lineTs.fT[0][0], pt.x, pt.y); 93 xy_at_t(cubic1, minT1, pt.x, pt.y); 155 const Cubic& cubic1; member in class:CubicIntersections
|
H A D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, argument 83 sub_divide(cubic1, t1s, t1e, c1); 96 int o1 = quadPart(cubic1, t1Start, t1, s1); 102 if (cubic1 == cubic2 && t1Start >= t2Start) { 113 sub_divide(cubic1, t1Start, t1, cSub1); 131 _Point p1 = xy_at_t(cubic1, to1); 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, c1Mi [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& );
|
/external/skia/experimental/Intersection/ |
H A D | CubicIntersection_Test.cpp | 20 const Cubic& cubic1 = tests[index][0]; local 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[ 289 oneOff3(const Cubic& cubic1, const Cubic& cubic2) argument 361 const Cubic& cubic1 = testSet[outer]; local 385 const Cubic& cubic1 = newTestSet[outer]; local 451 const Cubic& cubic1; member in class:CubicChopper 465 Cubic cubic1, cubic2; local 570 Cubic cubic1, cubic2; local 622 const Cubic& cubic1 = newTestSet[index0]; local [all...] |
H A D | CubicBezierClip_Test.cpp | 13 const Cubic& cubic1 = tests[index][0]; local 16 int order1 = reduceOrder(cubic1, reduce1, kReduceOrder_NoQuadraticsAllowed, 21 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, (int) index, order1);
|
H A D | CubicBezierClip.cpp | 13 bool bezier_clip(const Cubic& cubic1, const Cubic& cubic2, double& minT, double& maxT) { argument 21 endLine.cubicEndPoints(cubic1); 28 distance[0] = endLine.controlPtDistance(cubic1, 1); 29 distance[1] = endLine.controlPtDistance(cubic1, 2);
|
H A D | CubicConvexHull.cpp | 20 : cubic1(c1) 29 if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) { 32 if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) { 54 sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller); 77 xy_at_t(cubic1, lineTs.fT[0][0], pt.x, pt.y); 93 xy_at_t(cubic1, minT1, pt.x, pt.y); 155 const Cubic& cubic1; member in class:CubicIntersections
|
H A D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, argument 83 sub_divide(cubic1, t1s, t1e, c1); 96 int o1 = quadPart(cubic1, t1Start, t1, s1); 102 if (cubic1 == cubic2 && t1Start >= t2Start) { 113 sub_divide(cubic1, t1Start, t1, cSub1); 131 _Point p1 = xy_at_t(cubic1, to1); 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, c1Mi [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& );
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 19 const SkDCubic& cubic1 = tests[index][0]; local 22 int order1 = reduce1.reduce(cubic1, SkReduceOrder::kNo_Quadratics); 27 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, iIndex, order1); 38 tIntersections.intersect(cubic1, cubic2); 53 SkDPoint xy1 = cubic1.ptAtT(tt1); 310 static void oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, argument 312 SkASSERT(ValidCubic(cubic1)); 317 cubic1[0].fX, cubic1[0].fY, cubic1[ 367 const SkDCubic& cubic1 = testSet[outer]; local 373 const SkDCubic& cubic1 = newTestSet[outer]; local 400 SkDCubic cubic1, cubic2; local 448 const SkDCubic& cubic1 = newTestSet[index0]; local 613 const SkDCubic& cubic1 = coinSet[index]; local [all...] |
/external/skia/tests/ |
H A D | PathOpsCubicIntersectionTest.cpp | 19 const SkDCubic& cubic1 = tests[index][0]; local 22 int order1 = reduce1.reduce(cubic1, SkReduceOrder::kNo_Quadratics); 27 SkDebugf("%s [%d] cubic1 order=%d\n", __FUNCTION__, iIndex, order1); 38 tIntersections.intersect(cubic1, cubic2); 53 SkDPoint xy1 = cubic1.ptAtT(tt1); 310 static void oneOff(skiatest::Reporter* reporter, const SkDCubic& cubic1, const SkDCubic& cubic2, argument 312 SkASSERT(ValidCubic(cubic1)); 317 cubic1[0].fX, cubic1[0].fY, cubic1[ 367 const SkDCubic& cubic1 = testSet[outer]; local 373 const SkDCubic& cubic1 = newTestSet[outer]; local 400 SkDCubic cubic1, cubic2; local 448 const SkDCubic& cubic1 = newTestSet[index0]; local 613 const SkDCubic& cubic1 = coinSet[index]; 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 79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); 92 int o1 = quadPart(cubic1, t1Start, t1, &s1); 98 if (&cubic1 == &cubic2 && t1Start >= t2Start) { 124 SkDPoint p1 = cubic1.ptAtT(to1); 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, c1Mi [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 79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); 92 int o1 = quadPart(cubic1, t1Start, t1, &s1); 98 if (&cubic1 == &cubic2 && t1Start >= t2Start) { 124 SkDPoint p1 = cubic1.ptAtT(to1); 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, c1Mi [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& );
|