| /external/skia/tests/ |
| 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();
84 SkIntersections intersections; local
85 int result = doIntersect(intersections, quad, line, flipped);
87 double quadT = intersections[0][inner];
89 double lineT = intersections[1][inner];
122 SkIntersections intersections; local
[all...] |
| PathOpsQuadLineIntersectionThreadedTest.cpp | 14 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line,
25 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped);
33 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
35 intersections.intersect(quad, line);
36 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 | 35 SkIntersections intersections; local
36 intersections.intersect(quad1, quad2);
37 if (intersections.used() > 0) {
38 for (int pt = 0; pt < intersections.used(); ++pt) {
39 double tt1 = intersections[0][pt];
41 double tt2 = intersections[1][pt];
|
| PathOpsCubicIntersectionTest.cpp | 340 SkIntersections intersections; local
341 intersections.intersect(cubic1, cubic2);
342 REPORTER_ASSERT(reporter, !coin || intersections.used() == 2);
345 for (int pt3 = 0; pt3 < intersections.used(); ++pt3) {
346 tt1 = intersections[0][pt3];
348 tt2 = intersections[1][pt3];
350 const SkDPoint& iPt = intersections.pt(pt3);
|
| PathOpsQuadIntersectionTestData.cpp | 94 { // four intersections
|
| /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
|
| HotSpotSystem.java | 96 //TOOD: take a region? how do we deal with multiple hot spot intersections?
110 //TOOD: take a region? how do we deal with multiple hot spot intersections?
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrClipData.cpp | 18 * the result of purely intersections of rects (with an initial replace)
|
| /external/skia/src/gpu/ |
| GrClipData.cpp | 18 * the result of purely intersections of rects (with an initial replace)
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| PolygonShape.cpp | 252 Vector<EdgeIntersection> intersections;
256 intersections.append(intersection);
259 if (intersections.size() < 2)
262 std::sort(intersections.begin(), intersections.end(), WebCore::compareEdgeIntersectionX);
268 while (index < intersections.size()) {
269 const EdgeIntersection& thisIntersection = intersections[index];
270 if (index + 1 < intersections.size()) {
271 const EdgeIntersection& nextIntersection = intersections[index + 1];
274 // Skip pairs of intersections whose types are VertexMaxY,VertexMaxY and VertexMinY,VertexMinY
[all...] |
| /external/chromium_org/media/base/ |
| ranges_unittest.cc | 110 // Test intersections with an empty range.
116 // Test intersections with a completely overlaping range.
123 // Test intersections with a disjoint ranges.
132 // Test intersections with partially overlapping ranges.
|
| /external/chromium_org/third_party/skia/gyp/ |
| shapeops_demo.gyp | 30 '../experimental/Intersection/Intersections.cpp',
57 '../experimental/Intersection/Intersections.h',
|
| shapeops_edge.gyp | 51 '../experimental/Intersection/Intersections.cpp',
99 '../experimental/Intersection/Intersections.h',
|
| /external/skia/gyp/ |
| shapeops_demo.gyp | 30 '../experimental/Intersection/Intersections.cpp',
57 '../experimental/Intersection/Intersections.h',
|
| shapeops_edge.gyp | 51 '../experimental/Intersection/Intersections.cpp',
99 '../experimental/Intersection/Intersections.h',
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkBBoxHierarchy.h | 35 * bounding boxes, and allows efficient retrieval of intersections with query rectangles.
|
| SkLineClipper.cpp | 120 // now compute Y intersections
225 // now compute intersections
|
| /external/skia/src/core/ |
| SkBBoxHierarchy.h | 35 * bounding boxes, and allows efficient retrieval of intersections with query rectangles.
|
| SkLineClipper.cpp | 120 // now compute Y intersections
225 // now compute intersections
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersectionHelper.h | 41 // we walk ts to describe consecutive intersections. Since a pair of ts can
|
| /external/clang/test/Analysis/ |
| NewDelete-intersections.mm | 11 // Check for intersections with unix.Malloc and unix.MallocWithAnnotations
|
| /external/eigen/test/ |
| geo_parametrizedline.cpp | 54 // intersections
|
| /external/skia/src/pathops/ |
| SkIntersectionHelper.h | 41 // we walk ts to describe consecutive intersections. Since a pair of ts can
|
