HomeSort by relevance Sort by last modified time
    Searched full:subdivide (Results 1 - 25 of 97) sorted by null

1 2 3 4

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCubic.h 66 SkDCubic subDivide(double t1, double t2) const;
68 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
71 return cubic.subDivide(t1, t2);
74 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1,
80 cubic.subDivide(a, d, t1, t2, p);
SkPathOpsQuad.h 49 SkDQuad subDivide(double t1, double t2) const;
50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) {
53 return quad.subDivide(t1, t2);
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const;
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
60 return quad.subDivide(a, c, t1, t2);
SkPathOpsLine.h 23 static SkDLine SubDivide(const SkPoint a[2], double t1, double t2) {
26 return line.subDivide(t1, t2);
39 SkDLine subDivide(double t1, double t2) const;
SkDQuadIntersection.cpp 120 SkIntersections* i, bool* subDivide) {
132 if (subDivide) {
133 *subDivide = true;
149 double t2s, double t2e, SkIntersections* i, bool* subDivide) {
150 SkDQuad hull = q1.subDivide(t1s, t1e);
213 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) {
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
221 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
227 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
    [all...]
SkPathOpsCurve.h 134 SkDQuad dst = quad.subDivide(startT, endT);
141 SkDCubic dst = cubic.subDivide(startT, endT);
SkDCubicToQuads.cpp 64 sub = cubic.subDivide(start, 1);
174 SkDCubic part = subDivide(0, inflectT[0]);
178 part = subDivide(inflectT[idx], inflectT[idx + 1]);
181 part = subDivide(inflectT[last], 1);
  /external/skia/src/pathops/
SkPathOpsCubic.h 66 SkDCubic subDivide(double t1, double t2) const;
68 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
71 return cubic.subDivide(t1, t2);
74 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
76 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1,
80 cubic.subDivide(a, d, t1, t2, p);
SkPathOpsQuad.h 49 SkDQuad subDivide(double t1, double t2) const;
50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) {
53 return quad.subDivide(t1, t2);
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const;
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
60 return quad.subDivide(a, c, t1, t2);
SkPathOpsLine.h 23 static SkDLine SubDivide(const SkPoint a[2], double t1, double t2) {
26 return line.subDivide(t1, t2);
39 SkDLine subDivide(double t1, double t2) const;
SkDQuadIntersection.cpp 120 SkIntersections* i, bool* subDivide) {
132 if (subDivide) {
133 *subDivide = true;
149 double t2s, double t2e, SkIntersections* i, bool* subDivide) {
150 SkDQuad hull = q1.subDivide(t1s, t1e);
213 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) {
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
221 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
227 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
    [all...]
SkPathOpsCurve.h 134 SkDQuad dst = quad.subDivide(startT, endT);
141 SkDCubic dst = cubic.subDivide(startT, endT);
SkDCubicToQuads.cpp 64 sub = cubic.subDivide(start, 1);
174 SkDCubic part = subDivide(0, inflectT[0]);
178 part = subDivide(inflectT[idx], inflectT[idx + 1]);
181 part = subDivide(inflectT[last], 1);
  /external/chromium_org/third_party/skia/tests/
PathOpsDLineTest.cpp 46 line2 = line.subDivide(1, 0);
48 line2 = SkDLine::SubDivide(pts, 1, 0);
PathOpsQuadParameterizationTest.cpp 35 SkDQuad midThird = test.subDivide(1.0/3, 2.0/3);
  /external/skia/tests/
PathOpsDLineTest.cpp 46 line2 = line.subDivide(1, 0);
48 line2 = SkDLine::SubDivide(pts, 1, 0);
PathOpsQuadParameterizationTest.cpp 35 SkDQuad midThird = test.subDivide(1.0/3, 2.0/3);
  /external/chromium_org/third_party/skia/samplecode/
SampleCull.cpp 30 static void subdivide(SkPath* path, SkScalar bump) { function
122 subdivide(&fPath, bump);
123 subdivide(&fPath, bump);
124 subdivide(&fPath, bump);
  /external/skia/samplecode/
SampleCull.cpp 30 static void subdivide(SkPath* path, SkScalar bump) { function
122 subdivide(&fPath, bump);
123 subdivide(&fPath, bump);
124 subdivide(&fPath, bump);
  /external/chromium_org/third_party/skia/experimental/Intersection/
QuadraticImplicit.cpp 127 Intersections& i, bool* subDivide) {
139 if (subDivide) {
140 *subDivide = true;
157 double t2s, double t2e, Intersections& i, bool* subDivide) {
220 if (addIntercept(q1, q2, tMin, tMax, i, subDivide)) {
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
228 if (addIntercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
234 if (addIntercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
    [all...]
CubicBezierClip.cpp 12 // caller should subdivide, or create degenerate if the values are too small
  /external/skia/experimental/Intersection/
QuadraticImplicit.cpp 127 Intersections& i, bool* subDivide) {
139 if (subDivide) {
140 *subDivide = true;
157 double t2s, double t2e, Intersections& i, bool* subDivide) {
220 if (addIntercept(q1, q2, tMin, tMax, i, subDivide)) {
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
228 if (addIntercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
234 if (addIntercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
    [all...]
  /external/chromium_org/third_party/skia/src/utils/
SkCubicInterval.cpp 27 // subdivide the range and try again
  /external/skia/src/utils/
SkCubicInterval.cpp 27 // subdivide the range and try again
  /external/chromium_org/third_party/skia/src/core/
SkStroke.cpp 115 int subDivide);
119 int subDivide);
249 int subDivide) {
259 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) {
264 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide);
265 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide);
285 int subDivide) {
316 if (--subDivide < 0) {
323 // subdivide if we can
324 if (--subDivide < 0)
    [all...]
  /external/skia/src/core/
SkStroke.cpp 115 int subDivide);
119 int subDivide);
249 int subDivide) {
259 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) {
264 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide);
265 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide);
285 int subDivide) {
316 if (--subDivide < 0) {
323 // subdivide if we can
324 if (--subDivide < 0)
    [all...]

Completed in 1928 milliseconds

1 2 3 4