Searched refs:t1e (Results 1 - 5 of 5) sorted by relevance
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 149 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, argument 151 SkDQuad hull = q1.subDivide(t1s, t1e); 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 229 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
|
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); 90 const double t1 = t1s + (t1e - t1s) * tEnd1;
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 149 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, argument 151 SkDQuad hull = q1.subDivide(t1s, t1e); 215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); 223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); 229 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide);
|
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); 90 const double t1 = t1s + (t1e - t1s) * tEnd1;
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | example-tuple.cpp | 103 tuple<float> t1e(t1d); 104 t1d = t1e;
|
Completed in 591 milliseconds