| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/Shapes/ |
| b2ChainShape.cpp | 106 // edge count = vertex count - 1
110 void b2ChainShape::GetChildEdge(b2EdgeShape* edge, int32 index) const
113 edge->m_type = b2Shape::e_edge;
114 edge->m_radius = m_radius;
116 edge->m_vertex1 = m_vertices[index + 0];
117 edge->m_vertex2 = m_vertices[index + 1];
121 edge->m_vertex0 = m_vertices[index - 1];
122 edge->m_hasVertex0 = true;
126 edge->m_vertex0 = m_prevVertex;
127 edge->m_hasVertex0 = m_hasPrevVertex
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| GuidelineHandler.java | 95 /** Whether the left edge is being moved/resized */
98 /** Whether the right edge is being moved/resized */
101 /** Whether the top edge is being moved/resized */
104 /** Whether the bottom edge is being moved/resized */
178 * The current match on the left edge, or null if no match or if the left edge is not
184 * The current match on the top edge, or null if no match or if the top edge is not
190 * The current match on the right edge, or null if no match or if the right edge i
[all...] |
| MoveHandler.java | 49 * different segment types -- the left edge, the right edge, the baseline, the center
210 Segment edge = new Segment(b.y, b.x, b.x2(), null, null, TOP, NO_MARGIN); local
211 List<Match> horizontalMatches = findClosest(edge, mHorizontalEdges);
212 edge = new Segment(b.y2(), b.x, b.x2(), null, null, BOTTOM, NO_MARGIN);
213 addClosest(edge, mHorizontalEdges, horizontalMatches);
215 edge = new Segment(b.x, b.y, b.y2(), null, null, LEFT, NO_MARGIN);
216 List<Match> verticalMatches = findClosest(edge, mVerticalEdges);
217 edge = new Segment(b.x2(), b.y, b.y2(), null, null, RIGHT, NO_MARGIN);
218 addClosest(edge, mVerticalEdges, verticalMatches)
[all...] |
| /external/opencv/cvaux/src/ |
| enmin.cpp | 81 // struct Edge is used for storing edges of graph
82 // weight - weight of the edge ( maximum flow via the edge )
83 // flow - current flow via the edge
86 struct Edge
198 getSizeForGraph( Edge ),
231 /* adding edge oriented from alpha vertex to current vertex */
233 ( ( Edge* )newEdgePtr ) -> weight = dFunc( leftLine,
238 ( ( Edge* )newEdgePtr ) -> flow = 0;
245 ( ( Edge* )newEdgePtr ) -> weight +
[all...] |
| cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local
61 if( edge && CV_IS_SET_ELEM( edge ))
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j;
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge )
109 CvSubdiv2DEdge t = edge;
120 while( t != edge && count < subdiv->quad_edges * 4 );
128 t = edge;
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 ));
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ) local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| ACyclicDFACodeGenerator.java | 99 Transition edge = (Transition) s.transition(i); local
100 //System.out.println("edge "+s.stateNumber+"-"+edge.label.toString()+"->"+edge.target.stateNumber);
101 if ( edge.label.getAtom()==Label.EOT ) {
102 // don't generate a real edge for EOT; track alt EOT predicts
104 EOTTarget = (DFAState)edge.target;
108 edge.target.stateNumber+" predicates alt "+
116 List labels = edge.label.getSet().toList();
127 parentGenerator.genLabelExpr(templates,edge,k))
[all...] |
| /external/v8/src/compiler/ |
| graph-reducer.cc | 176 for (Edge edge : node->use_edges()) {
177 Node* const user = edge.from();
178 Verifier::VerifyEdgeInputReplacement(edge, replacement);
179 edge.UpdateTo(replacement);
187 for (Edge edge : node->use_edges()) {
188 Node* const user = edge.from();
190 edge.UpdateTo(replacement);
214 for (Edge edge : node->use_edges())
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfg-flags.def | 100 /* Masks for edge.flags.
103 NAME is the name of the edge flag. A flag EDGE_#NAME will be
114 this means that the edge cannot be split. */
117 /* Edge out of a basic block that ends with a CALL_INSN with abnormal
123 /* Exception edge. Exception handling edges represent possible control
128 /* Never merge blocks via this edge. This is used for exception handling,
133 /* Not a real edge. This is used to connect parts of the CFG that do
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
139 are hints that this edge may be part of a loop in the CFG. */
142 /* Edge in a part of the CFG that is an irreducible loop. *
[all...] |
| /external/guice/extensions/grapher/test/com/google/inject/grapher/ |
| AbstractInjectorGrapherTest.java | 49 final Set<Edge> edges = Sets.newHashSet();
71 @Override protected void newDependencyEdge(DependencyEdge edge) {
72 assertFalse(edges.contains(edge));
73 edges.add(edge);
76 @Override protected void newBindingEdge(BindingEdge edge) {
77 assertFalse(edges.contains(edge));
78 edges.add(edge);
134 Set<Edge> expectedEdges = ImmutableSet.<Edge>of(
159 Set<Edge> expectedEdges = ImmutableSet.<Edge>of
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/linearmath/com/badlogic/gdx/physics/bullet/linearmath/ |
| btConvexHullComputer.java | 60 static public class Edge extends BulletBase {
63 protected Edge(final String className, long cPtr, boolean cMemoryOwn) {
68 /** Construct a new Edge, normally you should not need this constructor it's intended for low-level usage. */
69 public Edge(long cPtr, boolean cMemoryOwn) {
70 this("Edge", cPtr, cMemoryOwn);
81 public static long getCPtr(Edge obj) {
111 public btConvexHullComputer.Edge getNextEdgeOfVertex() {
113 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false);
116 public btConvexHullComputer.Edge getNextEdgeOfFace() {
118 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false)
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| GraphvizGrapher.java | 84 for (GraphvizEdge edge : edges) {
85 renderEdge(edge);
166 protected void renderEdge(GraphvizEdge edge) {
167 Map<String, String> attrs = getEdgeAttributes(edge);
169 String tailId = getEdgeEndPoint(nodes.get(edge.getTailNodeId()).getIdentifier(),
170 edge.getTailPortId(), edge.getTailCompassPoint());
172 String headId = getEdgeEndPoint(nodes.get(edge.getHeadNodeId()).getIdentifier(),
173 edge.getHeadPortId(), edge.getHeadCompassPoint())
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/shapes/ |
| ChainShape.java | 66 * Get a child edge.
68 public void getChildEdge(EdgeShape edge, int index) {
70 edge.m_radius = m_radius;
74 edge.m_vertex1.x = v0.x;
75 edge.m_vertex1.y = v0.y;
76 edge.m_vertex2.x = v1.x;
77 edge.m_vertex2.y = v1.y;
81 edge.m_vertex0.x = v.x;
82 edge.m_vertex0.y = v.y;
83 edge.m_hasVertex0 = true
104 final EdgeShape edge = pool0; local
[all...] |
| /art/test/800-smali/smali/ |
| b_29778499_2.smali | 5 # This is testing an edge case (not implementing any interface) for b/18116999.
|
| /dalvik/dx/tests/088-ssa-combine-blocks/ |
| info.txt | 1 This is a test case for the identical-block combining algorithm, which runs after the SSA optimizer to recombine identical blocks (usually exception handlers) created during edge-splitting.
|
| /external/bison/doc/figs/ |
| example-reduce.dot | 4 edge [fontname=courier]
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| BindingEdge.java | 22 * Edge that connects an interface to the type or instance that is bound to implement it.
27 public class BindingEdge extends Edge {
29 * Classification for what kind of binding this edge represents.
67 @Override public Edge copy(NodeId fromId, NodeId toId) {
|
| /external/opencv3/samples/cpp/ |
| npr_demo.cpp | 8 * 1) Edge Preserve Smoothing
48 cout << " Edge Preserve Filter" << endl;
54 cout << "1) Edge Preserve Smoothing" << endl;
76 imshow("Edge Preserve Smoothing",img);
|
| /external/opencv3/samples/cpp/tutorial_code/photo/non_photorealistic_rendering/ |
| npr_demo.cpp | 8 * 1) Edge Preserve Smoothing
47 cout << " Edge Preserve Filter" << endl;
53 cout << "1) Edge Preserve Smoothing" << endl;
75 imshow("Edge Preserve Smoothing",img);
|
| /frameworks/base/docs/html/training/ |
| building-graphics.jd | 9 that can give your app an edge on the competition.
|
| /hardware/bsp/intel/peripheral/libupm/src/grove/ |
| javaupm_grove.i | 10 %apply int {mraa::Edge}
|
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| loop1.cpp | 1 // Verify that loop optimization takes into account the exception edge
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| loop1.cpp | 1 // Verify that loop optimization takes into account the exception edge
|
| /packages/apps/DevCamera/res/values/ |
| strings.xml | 9 <string name="edge_unknown">Edge --</string>
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/doc/diagram/ |
| normalparsing.dot | 10 edge [fontname="Inconsolata, Consolas", fontsize=10, arrowhead=normal]
43 edge [arrowhead=vee]
46 edge [arrowhead="none"]
50 edge [arrowhead=vee, arrowtail=dot, arrowsize=0.5, dir=both, tailclip=false]
|
| /external/chromium-trace/catapult/tracing/tracing/ui/tracks/ |
| chart_point.html | 18 * y coordinate (which for example corresponds to the bottom edge of the
29 // If the base y-coordinate is undefined, the bottom edge of the associated
30 // bar in a bar chart will start at the outer bottom edge (which is most
|
