| /external/skia/tests/ |
| PathOpsConicLineIntersectionTest.cpp | 32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line,
43 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped);
51 result = intersections.horizontal(conic, left, right, line[0].fY, flipped);
53 intersections.intersect(conic, line);
54 result = intersections.used();
78 SkIntersections intersections; local
79 int result = doIntersect(intersections, conic, line, flipped);
81 double conicT = intersections[0][inner];
83 double lineT = intersections[1][inner];
123 SkIntersections intersections; local
[all...] |
| PathOpsQuadLineIntersectionTest.cpp | 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
52 intersections.intersect(quad, line);
53 result = intersections.used();
88 SkIntersections intersections; local
89 int result = doIntersect(intersections, quad, line, flipped);
91 double quadT = intersections[0][inner];
93 double lineT = intersections[1][inner];
128 SkIntersections intersections; local
[all...] |
| PathOpsQuadLineIntersectionThreadedTest.cpp | 16 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
27 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
35 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
37 intersections.intersect(quad, line);
38 result = intersections.used();
52 SkIntersections intersections; local
54 int result = doIntersect(intersections, quad, line, flipped);
57 double quadT = intersections[0][index];
59 double lineT = intersections[1][index];
|
| PathOpsQuadIntersectionTest.cpp | 39 SkIntersections intersections; local
40 intersections.intersect(quad1, quad2);
41 if (intersections.used() > 0) {
42 for (int pt = 0; pt < intersections.used(); ++pt) {
43 double tt1 = intersections[0][pt];
45 double tt2 = intersections[1][pt];
344 SkIntersections intersections; local
345 intersections.intersect(quad1, quad2);
346 for (int pt = 0; pt < intersections.used(); ++pt) {
347 double tt1 = intersections[0][pt]
534 SkIntersections intersections; local
[all...] |
| PathOpsCubicLineIntersectionTest.cpp | 101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) {
111 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped);
119 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped);
121 intersections.intersect(cubic, line);
122 result = intersections.used();
|
| PathOpsConicIntersectionTest.cpp | 314 SkIntersections intersections; local
315 intersections.intersect(c1, c2);
316 if (coin && intersections.used() != 2) {
319 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
322 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) {
323 tt1 = intersections[0][pt3];
325 tt2 = intersections[1][pt3];
327 const SkDPoint& iPt = intersections.pt(pt3);
|
| PathOpsThreeWayTest.cpp | 12 // check intersections for consistency
|
| /external/skqp/tests/ |
| PathOpsConicLineIntersectionTest.cpp | 32 static int doIntersect(SkIntersections& intersections, const SkDConic& conic, const SkDLine& line,
43 result = intersections.vertical(conic, top, bottom, line[0].fX, flipped);
51 result = intersections.horizontal(conic, left, right, line[0].fY, flipped);
53 intersections.intersect(conic, line);
54 result = intersections.used();
78 SkIntersections intersections; local
79 int result = doIntersect(intersections, conic, line, flipped);
81 double conicT = intersections[0][inner];
83 double lineT = intersections[1][inner];
123 SkIntersections intersections; local
[all...] |
| PathOpsQuadLineIntersectionTest.cpp | 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
52 intersections.intersect(quad, line);
53 result = intersections.used();
88 SkIntersections intersections; local
89 int result = doIntersect(intersections, quad, line, flipped);
91 double quadT = intersections[0][inner];
93 double lineT = intersections[1][inner];
128 SkIntersections intersections; local
[all...] |
| PathOpsQuadLineIntersectionThreadedTest.cpp | 16 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
27 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
35 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
37 intersections.intersect(quad, line);
38 result = intersections.used();
52 SkIntersections intersections; local
54 int result = doIntersect(intersections, quad, line, flipped);
57 double quadT = intersections[0][index];
59 double lineT = intersections[1][index];
|
| PathOpsQuadIntersectionTest.cpp | 39 SkIntersections intersections; local
40 intersections.intersect(quad1, quad2);
41 if (intersections.used() > 0) {
42 for (int pt = 0; pt < intersections.used(); ++pt) {
43 double tt1 = intersections[0][pt];
45 double tt2 = intersections[1][pt];
344 SkIntersections intersections; local
345 intersections.intersect(quad1, quad2);
346 for (int pt = 0; pt < intersections.used(); ++pt) {
347 double tt1 = intersections[0][pt]
534 SkIntersections intersections; local
[all...] |
| PathOpsCubicLineIntersectionTest.cpp | 101 static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) {
111 result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped);
119 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped);
121 intersections.intersect(cubic, line);
122 result = intersections.used();
|
| PathOpsConicIntersectionTest.cpp | 314 SkIntersections intersections; local
315 intersections.intersect(c1, c2);
316 if (coin && intersections.used() != 2) {
319 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
322 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) {
323 tt1 = intersections[0][pt3];
325 tt2 = intersections[1][pt3];
327 const SkDPoint& iPt = intersections.pt(pt3);
|
| PathOpsThreeWayTest.cpp | 12 // check intersections for consistency
|
| /external/skia/gm/ |
| texteffects.cpp | 18 static SkPath create_underline(const SkTDArray<SkScalar>& intersections,
23 for (int index = 0; index < intersections.count(); index += 2) {
24 SkScalar start = intersections[index] - uWidth;;
25 end = intersections[index + 1] + uWidth;
40 const SkPaint& paint, SkScalar uWidth, SkTDArray<SkScalar>* intersections) {
46 intersections->setCount(count);
47 paint.getTextIntercepts(test, len, x, y, bounds, intersections->begin());
66 SkTDArray<SkScalar> intersections; local
68 &intersections);
73 SkPath underline = create_underline(intersections, start, end, uPos, uWidth, textSize)
122 SkTDArray<SkScalar> intersections; local
273 SkTDArray<SkScalar> intersections; local
[all...] |
| /external/skqp/gm/ |
| texteffects.cpp | 18 static SkPath create_underline(const SkTDArray<SkScalar>& intersections,
23 for (int index = 0; index < intersections.count(); index += 2) {
24 SkScalar start = intersections[index] - uWidth;;
25 end = intersections[index + 1] + uWidth;
40 const SkPaint& paint, SkScalar uWidth, SkTDArray<SkScalar>* intersections) {
46 intersections->setCount(count);
47 paint.getTextIntercepts(test, len, x, y, bounds, intersections->begin());
66 SkTDArray<SkScalar> intersections; local
68 &intersections);
73 SkPath underline = create_underline(intersections, start, end, uPos, uWidth, textSize)
122 SkTDArray<SkScalar> intersections; local
273 SkTDArray<SkScalar> intersections; local
[all...] |
| /external/replicaisland/src/com/replica/replicaisland/ |
| GameComponent.java | 32 COLLISION_DETECTION, // intersections are detected
33 COLLISION_RESPONSE, // intersections are resolved
|
| AABoxCollisionVolume.java | 21 * also rectangles when calculating intersections. Therefore certain types of intersections, such
68 * @param other The volume to test for intersections.
|
| DynamicCollisionComponent.java | 23 * "vulnerability" volumes (organized such that only attack vs vulnerability intersections result
|
| /external/skia/src/core/ |
| SkBBoxHierarchy.h | 17 * boxes and allows efficient retrieval of intersections with query rectangles.
|
| /external/skqp/src/core/ |
| SkBBoxHierarchy.h | 17 * boxes and allows efficient retrieval of intersections with query rectangles.
|
| /external/skia/src/pathops/ |
| SkPathOpsTSect.h | 233 SkIntersections* intersections);
[all...] |
| /external/skqp/src/pathops/ |
| SkPathOpsTSect.h | 233 SkIntersections* intersections);
[all...] |
| /external/skia/src/gpu/ccpr/ |
| GrCCCubicShader.h | 21 * edge [P3 - P0], and must not contain or be near any inflection points or loop intersections.
|
| /external/skqp/src/gpu/ccpr/ |
| GrCCCubicShader.h | 21 * edge [P3 - P0], and must not contain or be near any inflection points or loop intersections.
|
