Searched refs:subDivide (Results 1 - 25 of 31) sorted by relevance

12

/external/chromium_org/third_party/skia/src/pathops/
H A D	SkPathOpsQuad.h	49 SkDQuad subDivide(double t1, double t2) const; 53 return quad.subDivide(t1, t2); 55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const; 60 return quad.subDivide(a, c, t1, t2);
H A D	SkPathOpsCubic.h	60 SkDCubic subDivide(double t1, double t2) const; 65 return cubic.subDivide(t1, t2); 68 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const; 74 cubic.subDivide(a, d, t1, t2, p);
H A D	SkPathOpsLine.h	26 return line.subDivide(t1, t2); 37 SkDLine subDivide(double t1, double t2) const;
H A D	SkDCubicToQuads.cpp	65 sub = cubic.subDivide(start, 1); 178 SkDCubic part = subDivide(0, inflectT[0]); 182 part = subDivide(inflectT[idx], inflectT[idx + 1]); 185 part = subDivide(inflectT[last], 1);
H A D	SkDQuadIntersection.cpp	121 SkIntersections* i, bool* subDivide) { 133 if (subDivide) { 134 *subDivide = true; 150 double t2s, double t2e, SkIntersections* i, bool* subDivide) { 151 SkDQuad hull = q1.subDivide(t1s, t1e); 211 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) { 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 219 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) { 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 225 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) { 120 add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, SkIntersections* i, bool* subDivide) argument 149 is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, double t2s, double t2e, SkIntersections* i, bool* subDivide) argument [all...]
H A D	SkPathOpsCurve.h	133 SkDQuad dst = quad.subDivide(startT, endT); 140 SkDCubic dst = cubic.subDivide(startT, endT);
H A D	SkPathOpsQuad.cpp	51 SkDQuad sub = subDivide(startT, endT); 218 SkDQuad SkDQuad::subDivide(double t1, double t2) const { function in class:SkDQuad 240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const { function in class:SkDQuad 250 SkDQuad sub = subDivide(t1, t2);
H A D	SkPathOpsCubic.cpp	297 SkDCubic sub = subDivide(startT, endT); 391 SkDCubic SkDCubic::subDivide(double t1, double t2) const { function in class:SkDCubic 430 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d, function in class:SkDCubic 448 SkDCubic sub = subDivide(t1, t2);
H A D	SkPathOpsLine.cpp	9 SkDLine SkDLine::subDivide(double t1, double t2) const { function in class:SkDLine
H A D	SkOpAngle.cpp	295 fComputed = fSegment->subDivide(fStart, fEnd, &fCurvePart); 312 fSegment->subDivide(fStart < fEnd ? 0 : last, fStart < fEnd ? last : 0, &origCurve); 363 fSegment->subDivide(fStart < fEnd ? 0 : last, fStart < fEnd ? last : 0, &origCurve);
/external/skia/src/pathops/
H A D	SkPathOpsQuad.h	49 SkDQuad subDivide(double t1, double t2) const; 53 return quad.subDivide(t1, t2); 55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const; 60 return quad.subDivide(a, c, t1, t2);
H A D	SkPathOpsCubic.h	60 SkDCubic subDivide(double t1, double t2) const; 65 return cubic.subDivide(t1, t2); 68 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const; 74 cubic.subDivide(a, d, t1, t2, p);
H A D	SkPathOpsLine.h	26 return line.subDivide(t1, t2); 37 SkDLine subDivide(double t1, double t2) const;
H A D	SkDCubicToQuads.cpp	65 sub = cubic.subDivide(start, 1); 178 SkDCubic part = subDivide(0, inflectT[0]); 182 part = subDivide(inflectT[idx], inflectT[idx + 1]); 185 part = subDivide(inflectT[last], 1);
H A D	SkDQuadIntersection.cpp	121 SkIntersections* i, bool* subDivide) { 133 if (subDivide) { 134 *subDivide = true; 150 double t2s, double t2e, SkIntersections* i, bool* subDivide) { 151 SkDQuad hull = q1.subDivide(t1s, t1e); 211 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) { 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 219 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) { 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 225 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) { 120 add_intercept(const SkDQuad& q1, const SkDQuad& q2, double tMin, double tMax, SkIntersections* i, bool* subDivide) argument 149 is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, double t2s, double t2e, SkIntersections* i, bool* subDivide) argument [all...]
H A D	SkPathOpsCurve.h	133 SkDQuad dst = quad.subDivide(startT, endT); 140 SkDCubic dst = cubic.subDivide(startT, endT);
H A D	SkPathOpsQuad.cpp	51 SkDQuad sub = subDivide(startT, endT); 218 SkDQuad SkDQuad::subDivide(double t1, double t2) const { function in class:SkDQuad 240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const { function in class:SkDQuad 250 SkDQuad sub = subDivide(t1, t2);
H A D	SkPathOpsCubic.cpp	297 SkDCubic sub = subDivide(startT, endT); 391 SkDCubic SkDCubic::subDivide(double t1, double t2) const { function in class:SkDCubic 430 void SkDCubic::subDivide(const SkDPoint& a, const SkDPoint& d, function in class:SkDCubic 448 SkDCubic sub = subDivide(t1, t2);
H A D	SkPathOpsLine.cpp	9 SkDLine SkDLine::subDivide(double t1, double t2) const { function in class:SkDLine
H A D	SkOpAngle.cpp	295 fComputed = fSegment->subDivide(fStart, fEnd, &fCurvePart); 312 fSegment->subDivide(fStart < fEnd ? 0 : last, fStart < fEnd ? last : 0, &origCurve); 363 fSegment->subDivide(fStart < fEnd ? 0 : last, fStart < fEnd ? last : 0, &origCurve);
/external/skia/tests/
H A D	PathOpsDLineTest.cpp	46 line2 = line.subDivide(1, 0);
H A D	PathOpsQuadParameterizationTest.cpp	35 SkDQuad midThird = test.subDivide(1.0/3, 2.0/3);
H A D	PathOpsTestCommon.cpp	25 SkDCubic part = cubic.subDivide(tStart, tEnd);
/external/chromium_org/third_party/skia/src/core/
H A D	SkStroke.cpp	106 int subDivide); 110 int subDivide); 240 int subDivide) { 250 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) { 255 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide); 256 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide); 276 int subDivide) { 307 if (--subDivide < 0) { 315 if (--subDivide < 0) { 324 subDivide); 237 quad_to(const SkPoint pts[3], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalBC, SkVector* unitNormalBC, int subDivide) argument 273 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument [all...]
/external/skia/src/core/
H A D	SkStroke.cpp	106 int subDivide); 110 int subDivide); 240 int subDivide) { 250 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) { 255 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide); 256 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide); 276 int subDivide) { 307 if (--subDivide < 0) { 315 if (--subDivide < 0) { 324 subDivide); 237 quad_to(const SkPoint pts[3], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalBC, SkVector* unitNormalBC, int subDivide) argument 273 cubic_to(const SkPoint pts[4], const SkVector& normalAB, const SkVector& unitNormalAB, SkVector* normalCD, SkVector* unitNormalCD, int subDivide) argument [all...]

Completed in 184 milliseconds

12

Indexes created Fri Nov 01 14:58:10 CET 2013