| /art/test/084-class-init/ |
| info.txt | 1 Test class initialization edge cases and race conditions.
|
| /art/test/537-checker-arraycopy/ |
| info.txt | 1 Test for edge cases of System.arraycopy.
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/ |
| com.badlogic.gdx.physics.box2d.EdgeShape.cpp | 21 b2EdgeShape* edge = (b2EdgeShape*)addr; local
22 edge->Set(b2Vec2(v1x, v1y), b2Vec2(v2x, v2y));
33 b2EdgeShape* edge = (b2EdgeShape*)addr; local
34 vertex[0] = edge->m_vertex1.x;
35 vertex[1] = edge->m_vertex1.y;
47 b2EdgeShape* edge = (b2EdgeShape*)addr; local
48 vertex[0] = edge->m_vertex2.x;
49 vertex[1] = edge->m_vertex2.y;
61 b2EdgeShape* edge = (b2EdgeShape*)addr; local
62 vertex[0] = edge->m_vertex0.x
74 b2EdgeShape* edge = (b2EdgeShape*)addr; local
87 b2EdgeShape* edge = (b2EdgeShape*)addr; local
100 b2EdgeShape* edge = (b2EdgeShape*)addr; local
112 b2EdgeShape* edge = (b2EdgeShape*)addr; local
123 b2EdgeShape* edge = (b2EdgeShape*)addr; local
134 b2EdgeShape* edge = (b2EdgeShape*)addr; local
145 b2EdgeShape* edge = (b2EdgeShape*)addr; local
[all...] |
| /external/mesa3d/src/glsl/builtins/ir/ |
| step.ir | 4 (declare (in) float edge)
6 ((return (expression float b2f (expression bool >= (var_ref x) (var_ref edge))))))
10 (declare (in) float edge)
13 (assign (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
14 (assign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
19 (declare (in) float edge)
22 (assign (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
23 (assign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
24 (assign (z) (var_ref t) (expression float b2f (expression bool >= (swiz z (var_ref x))(var_ref edge))))
29 (declare (in) float edge)
[all...] |
| /external/opencv3/samples/cpp/ |
| edge.cpp | 12 Mat image, gray, edge, cedge; variable
17 blur(gray, edge, Size(3,3));
19 // Run the edge detector on grayscale
20 Canny(edge, edge, edgeThresh, edgeThresh*3, 3);
23 image.copyTo(cedge, edge);
24 imshow("Edge map", cedge);
29 printf("\nThis sample demonstrates Canny edge detection\n"
31 " /.edge [image_name -- Default is ../data/fruits.jpg]\n\n");
57 namedWindow("Edge map", 1)
[all...] |
| /external/opencv3/samples/python2/ |
| edge.py | 4 This sample demonstrates Canny edge detection.
7 edge.py [<video source>]
9 Trackbars control edge thresholds.
33 cv2.namedWindow('edge')
34 cv2.createTrackbar('thrs1', 'edge', 2000, 5000, nothing)
35 cv2.createTrackbar('thrs2', 'edge', 4000, 5000, nothing)
41 thrs1 = cv2.getTrackbarPos('thrs1', 'edge')
42 thrs2 = cv2.getTrackbarPos('thrs2', 'edge')
43 edge = cv2.Canny(gray, thrs1, thrs2, apertureSize=5)
46 vis[edge != 0] = (0, 255, 0
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfghooks.h | 38 /* Redirect edge E to the given basic block B and update underlying program
39 representation. Returns edge representing redirected branch (that may not
41 if edge is not easily redirectable for whatever reason. */
42 edge (*redirect_edge_and_branch) (edge e, basic_block b);
45 newly created forwarder basic block is returned. The edge must
47 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
49 /* Returns true if it is possible to remove the edge by redirecting it
50 to the destination of the other edge going from its source. */
69 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 27 * edge calculation for debugging purposes.
75 var edge = new Object;
77 edge.startX = firstPoint.anchor[0];
78 edge.startY = firstPoint.anchor[1];
80 edge.endX = lastPoint.anchor[0];
81 edge.endY = lastPoint.anchor[1];
83 var normalX = -(edge.endY - edge.startY);
84 var normalY = edge.endX - edge.startX
[all...] |
| /art/test/547-regression-trycatch-critical-edge/ |
| info.txt | 1 Test a specific SSA building regression a back edge would not be split due to
|
| /frameworks/support/design/jvm-tests/src/android/support/design/widget/ |
| DirectedAcyclicGraphTest.java | 66 final TestNode edge = new TestNode("edge"); local
69 mGraph.addNode(edge);
70 mGraph.addEdge(node, edge);
76 final TestNode edge = new TestNode("edge"); local
78 // Add the node, but not the edge node
82 mGraph.addEdge(node, edge);
88 final TestNode edge = new TestNode("edge"); local
102 final TestNode edge = new TestNode("edge"); local
118 final TestNode edge = new TestNode("edge"); local
137 final TestNode edge = new TestNode("edge"); local
153 final TestNode edge = new TestNode("edge"); local
[all...] |
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 37 * Stages (4) and (5) use an active edge list, which a list of all edges for which the
46 * not exact and may violate the mesh topology or active edge list ordering. We
50 * A) Intersections may cause a shortened edge to no longer be ordered with respect to its
53 * B) Intersections may cause an edge to violate the left-to-right ordering of the
54 * active edge list. This is handled by splitting the neighbour edge on the
56 * C) Shortening an edge may cause an active edge to become inactive or an inactive edge
57 * to become active. This is handled by removing or inserting the edge in the activ
1017 Edge* edge = new_edge(v->fPrev, v, alloc, c); local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/ |
| EdgeShape.java | 21 /** A line segment (edge) shape. These can be connected in chains or loops to other edge shapes. The connectivity information is
41 /** Set this as an isolated edge. */
46 /** Set this as an isolated edge. */
52 b2EdgeShape* edge = (b2EdgeShape*)addr;
53 edge->Set(b2Vec2(v1x, v1y), b2Vec2(v2x, v2y));
65 b2EdgeShape* edge = (b2EdgeShape*)addr;
66 vertex[0] = edge->m_vertex1.x;
67 vertex[1] = edge->m_vertex1.y;
77 b2EdgeShape* edge = (b2EdgeShape*)addr
[all...] |
| /external/opencv/cv/src/ |
| cvsubdivision2d.cpp | 72 * Quad Edge algebra *
78 CvQuadEdge2D *edge = 0; local
88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges );
91 memset( edge->pt, 0, sizeof( edge->pt ));
92 edgehandle = (CvSubdiv2DEdge) edge;
94 edge->next[0] = edgehandle;
95 edge->next[1] = edgehandle + 3;
96 edge->next[2] = edgehandle + 2;
97 edge->next[3] = edgehandle + 1
254 CvSubdiv2DEdge edge = 0; local
734 CvSubdiv2DEdge edge; local
[all...] |
| /external/opencv3/modules/java/src/ |
| imgproc+Subdiv2D.java | 125 // C++: int getEdge(int edge, int nextEdgeType)
128 //javadoc: Subdiv2D::getEdge(edge, nextEdgeType)
129 public int getEdge(int edge, int nextEdgeType)
132 int retVal = getEdge_0(nativeObj, edge, nextEdgeType);
139 // C++: int nextEdge(int edge)
142 //javadoc: Subdiv2D::nextEdge(edge)
143 public int nextEdge(int edge)
146 int retVal = nextEdge_0(nativeObj, edge);
153 // C++: int rotateEdge(int edge, int rotate)
156 //javadoc: Subdiv2D::rotateEdge(edge, rotate
[all...] |
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| loop.ll | 12 ; CHECK: edge entry -> do.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
18 ; CHECK: edge do.body -> do.body1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
26 ; CHECK: edge do.body1 -> do.body1 probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
27 ; CHECK: edge do.body1 -> do.end probability is 0x04000000 / 0x80000000 = 3.12%
34 ; CHECK: edge do.end -> do.body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
35 ; CHECK: edge do.end -> do.end5 probability is 0x04000000 / 0x80000000 = 3.12
[all...] |
| basic.ll | 7 ; CHECK: edge entry -> body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
18 ; CHECK: edge body -> exit probability is 0x04000000 / 0x80000000 = 3.12%
19 ; CHECK: edge body -> body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
30 ; CHECK: edge entry -> then probability is 0x78787878 / 0x80000000 = 94.12% [HOT edge]
31 ; CHECK: edge entry -> else probability is 0x07878788 / 0x80000000 = 5.88%
35 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| subdivision2d.cpp | 46 int Subdiv2D::nextEdge(int edge) const
48 CV_DbgAssert((size_t)(edge >> 2) < qedges.size());
49 return qedges[edge >> 2].next[edge & 3];
52 int Subdiv2D::rotateEdge(int edge, int rotate) const
54 return (edge & ~3) + ((edge + rotate) & 3);
57 int Subdiv2D::symEdge(int edge) const
59 return edge ^ 2;
62 int Subdiv2D::getEdge(int edge, int nextEdgeType) cons
189 int edge = newEdge(); local
235 int edge = freeQEdge*4; local
288 int edge = recentEdge; local
650 int vertex = 0, edge = 0; local
737 int edge = i; local
772 int edge = rotateEdge(vtx[k].firstEdge, 1), t = edge; local
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| Edge.java | 22 * Edge in a guice dependency graph.
27 public abstract class Edge {
31 protected Edge(NodeId fromId, NodeId toId) {
45 if (!(obj instanceof Edge)) {
48 Edge other = (Edge) obj;
57 * Returns a copy of the edge with new node IDs.
61 * @return copy of the edge with the new node IDs
63 public abstract Edge copy(NodeId fromId, NodeId toId);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 28 /** the edge of the dragged node that is matched */
31 /** the "other" edge that the dragged edge is matched with */
32 public final Segment edge; field in class:Match
50 * @param edge the "other" edge that the dragged edge is matched with
51 * @param with the edge of the dragged node that is matched
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
59 this.edge = edge
[all...] |
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 25 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) {
26 if (last->fCurveCount || last->fDX || edge->fX != last->fX) {
29 if (edge->fWinding == last->fWinding) {
30 if (edge->fLastY + 1 == last->fFirstY) {
31 last->fFirstY = edge->fFirstY;
34 if (edge->fFirstY == last->fLastY + 1) {
35 last->fLastY = edge->fLastY;
40 if (edge->fFirstY == last->fFirstY) {
41 if (edge->fLastY == last->fLastY) {
44 if (edge->fLastY < last->fLastY)
71 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
91 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
100 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
161 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /build/core/ |
| host_fuzz_test.mk | 6 LOCAL_CFLAGS += -fsanitize-coverage=edge,indirect-calls,8bit-counters,trace-cmp
|
| /external/opencv3/doc/py_tutorials/py_imgproc/py_canny/ |
| py_canny.markdown | 1 Canny Edge Detection {#tutorial_py_canny}
9 - Concept of Canny edge detection
15 Canny Edge Detection is a popular edge detection algorithm. It was developed by John F. Canny in
20 Since edge detection is susceptible to noise in the image, first step is to remove the noise in the
27 images, we can find edge gradient and direction for each pixel as follows:
30 Edge\_Gradient \; (G) = \sqrt{G_x^2 + G_y^2} \\
40 pixels which may not constitute the edge. For this, at every pixel, pixel is checked if it is a
45 Point A is on the edge ( in vertical direction). Gradient direction is normal to the edge. Point
[all...] |
| /packages/apps/Test/connectivity/sl4n/rapidjson/doc/diagram/ |
| utilityclass.dot | 13 edge [fontname="Inconsolata, Consolas", fontsize=10, penwidth=0.5]
21 edge [arrowtail=onormal, dir=back]
35 edge [arrowtail=onormal, dir=back]
53 edge [arrowtail=onormal, dir=back]
58 edge [arrowtail=odiamond, arrowhead=vee, dir=both]
67 edge [arrowhead=vee, style=dashed]
|
| /external/v8/src/compiler/ |
| node-properties.cc | 85 bool NodeProperties::IsValueEdge(Edge edge) {
86 Node* const node = edge.from();
87 return IsInputRange(edge, FirstValueIndex(node),
93 bool NodeProperties::IsContextEdge(Edge edge) {
94 Node* const node = edge.from();
95 return IsInputRange(edge, FirstContextIndex(node),
101 bool NodeProperties::IsFrameStateEdge(Edge edge) {
[all...] |
