| /external/chromium_org/third_party/sqlite/src/test/ |
| D | vtabA.test | 46 execsql { CREATE VIRTUAL TABLE t1e USING echo(t1) }
52 execsql { PRAGMA table_info(t1e) }
63 INSERT INTO t1e VALUES('value a', 'value c');
68 SELECT a, b, c FROM t1e;
74 SELECT * FROM t1e;
83 INSERT INTO t1e SELECT * FROM t1e;
88 SELECT * FROM t1e;
96 get_decltype t1e b
99 get_collist t1e
107 db eval { DROP TABLE IF EXISTS t1e; }
[all …]
|
| D | notnull.test | 272 CREATE INDEX t1e ON t1(e);
|
| D | where9.test | 140 CREATE INDEX t1e ON t1(e);
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, in is_linear_inner() argument
150 SkDQuad hull = q1.subDivide(t1s, t1e); in is_linear_inner()
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in is_linear_inner()
231 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
|
| D | SkDCubicIntersection.cpp | 76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, in intersect() argument
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); in intersect()
90 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect()
|
| /external/skia/src/pathops/ |
| D | SkDQuadIntersection.cpp | 148 static bool is_linear_inner(const SkDQuad& q1, double t1s, double t1e, const SkDQuad& q2, in is_linear_inner() argument
150 SkDQuad hull = q1.subDivide(t1s, t1e); in is_linear_inner()
217 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
225 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in is_linear_inner()
231 result |= is_linear_inner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in is_linear_inner()
|
| D | SkDCubicIntersection.cpp | 76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, in intersect() argument
79 SkDCubic c1 = cubic1.subDivide(t1s, t1e); in intersect()
90 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect()
|
| /external/skia/experimental/Intersection/ |
| D | QuadraticImplicit.cpp | 156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, in isLinearInner() argument
159 sub_divide(q1, t1s, t1e, hull); in isLinearInner()
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in isLinearInner()
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
|
| D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, in intersect3() argument
83 sub_divide(cubic1, t1s, t1e, c1); in intersect3()
94 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect3()
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | QuadraticImplicit.cpp | 156 static bool isLinearInner(const Quadratic& q1, double t1s, double t1e, const Quadratic& q2, in isLinearInner() argument
159 sub_divide(q1, t1s, t1e, hull); in isLinearInner()
224 return isLinearInner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
232 result = isLinearInner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide); in isLinearInner()
238 result |= isLinearInner(q2, tsFound[split], tMax, q1, t1s, t1e, i, subDivide); in isLinearInner()
|
| D | CubicIntersection.cpp | 78 static bool intersect3(const Cubic& cubic1, double t1s, double t1e, const Cubic& cubic2, in intersect3() argument
83 sub_divide(cubic1, t1s, t1e, c1); in intersect3()
94 const double t1 = t1s + (t1e - t1s) * tEnd1; in intersect3()
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| D | example-tuple.cpp | 103 tuple<float> t1e(t1d); in test_tuple() local
104 t1d = t1e; in test_tuple()
|