| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| FASerializer.java | 97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i); local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin'
128 // to it, but don't "draw" an edge.
129 if ( edge instanceof RuleClosureTransition ) {
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState);
150 // depth first walk each transition, printing its edge first
152 Transition edge = (Transition) s.transition(i); local
155 if ( edge.isAction() ) {
158 else if ( edge.isEpsilon() )
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| graph.rst | 18 destination node of the edge, the optional third element is the
19 edge data. The source and destination nodes are added to the graph
87 the edge lists should not be modified, doing so
123 Edge related methods
126 .. method:: Graph.add_edge(head_id, tail_id [, edge data [, create_nodes]])
128 Adds a directed edge from *head_id* to *tail_id*. Arbitrary data can
133 .. method:: Graph.hide_edge(edge)
135 Hides an edge from the graph. The edge may be unhidden at some later
138 .. method:: Graph.restore_edge(edge)
[all...] |
| graphalgo.rst | 12 than or equal to the *end* node. The edge data is assumed to be the edge length.
16 Dijkstra's algorithm is only guaranteed to work correctly when all edge lengths are positive.
19 edges, and will raise an exception if it discovers that a negative edge has caused it to make a mistake.
|
| /dalvik/dx/tests/072-dex-switch-edge-cases/ |
| info.txt | 2 a bunch of switch op edge cases get converted reasonably.
|
| /dalvik/dx/tests/086-ssa-edge-split/ |
| info.txt | 1 This is a test case for the edge-splitting algorthim used in the conversion to SSA form.
|
| /external/bison/doc/figs/ |
| example-shift.dot | 4 edge [fontname=courier]
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| AbstractInjectorGrapher.java | 127 /** Adds a new dependency edge to the graph. */
128 protected abstract void newDependencyEdge(DependencyEdge edge) throws IOException;
130 /** Adds a new binding edge to the graph. */
131 protected abstract void newBindingEdge(BindingEdge edge) throws IOException;
155 private void createEdges(Iterable<Edge> edges, Map<NodeId, NodeId> aliases) throws IOException {
156 for (Edge edge : edges) {
157 edge = edge.copy(resolveAlias(aliases, edge.getFromId())
[all...] |
| /external/llvm/lib/Fuzzer/test/trace-bb/ |
| CMakeLists.txt | 4 "${LIBFUZZER_FLAGS_BASE} -fsanitize-coverage=edge,trace-bb")
|
| /external/llvm/test/Transforms/SCCP/ |
| switch.ll | 3 ; Make sure we always consider the default edge executable for a switch
|
| /hardware/bsp/intel/peripheral/libupm/src/ttp223/ |
| javaupm_ttp223.i | 10 %apply int {mraa::Edge}
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| ImageFilterEdge.java | 24 private static final String SERIALIZATION_NAME = "EDGE";
26 mName = "Edge";
31 representation.setName("Edge");
34 representation.setTextId(R.string.edge);
|
| /system/update_engine/payload_generator/ |
| graph_utils.h | 33 // Returns the number of blocks represented by all extents in the edge.
34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
37 // already exists, the block/s is/are added to the existing edge.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge. */
53 /* The index number corresponding to this edge in the edge vector
69 /* Masks for edge.flags. */
77 /* Bit mask for all edge flags. */
80 /* The following four flags all indicate something special about an edge.
81 Test the edge flags on EDGE_COMPLEX to detect all forms of "strange
[all...] |
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| SingleRow.java | 79 int edge; local
81 edge = mReversedFlow ? Integer.MIN_VALUE : Integer.MAX_VALUE;
85 edge = mProvider.getEdge(index + 1) + mMargin + size;
87 edge = mProvider.getEdge(index + 1) - mMargin - size;
91 mProvider.addItem(mTmpItem[0], index, size, 0, edge);
112 int edge; local
114 edge = mReversedFlow ? Integer.MAX_VALUE : Integer.MIN_VALUE;
118 edge = mProvider.getEdge(index - 1) - mProvider.getSize(index - 1) - mMargin;
120 edge = mProvider.getEdge(index - 1) + mProvider.getSize(index - 1) + mMargin;
124 mProvider.addItem(mTmpItem[0], index, size, 0, edge);
[all...] |
| StaggeredGridDefault.java | 25 * Returns the max edge value of item (visible or cached) in a row. This
33 int edge = mProvider.getEdge(mFirstVisibleIndex); local
35 return edge;
39 edge += loc.offset;
41 return edge;
45 int edge = mProvider.getEdge(mLastVisibleIndex); local
48 return edge + loc.size;
51 edge -= loc.offset;
54 return edge + loc.size;
62 * Returns the min edge value of item (visible or cached) in a row. Thi
70 int edge = mProvider.getEdge(mLastVisibleIndex); local
83 int edge = mProvider.getEdge(mFirstVisibleIndex); local
105 int edge = mProvider.getEdge(indexLimit); local
157 int edge = mProvider.getEdge(indexLimit); local
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/ |
| afcjk.c | 949 /* an edge in our table that corresponds to its position. */
951 /* If no edge is found, we create and insert a new edge in the */
952 /* sorted table. Otherwise, we simply add the segment to the edge's */
954 /* edge's properties. */
956 /* Note that the edges table is sorted along the segment/edge */
975 /* look for an edge corresponding to the segment */
978 AF_Edge edge = axis->edges + ee; local
982 if ( edge->dir != seg->dir )
985 dist = seg->pos - edge->fpos
1027 AF_Edge edge; local
1082 AF_Edge edge; local
1215 AF_Edge edge = axis->edges; local
1736 AF_Edge edge; local
2114 AF_Edge edge; local
[all...] |
| /art/test/547-regression-trycatch-critical-edge/smali/ |
| TestCase.smali | 18 # The following test case would crash liveness analysis because the back edge of
21 # edge between TryBoundary and outer loop header (b/25493695).
39 if-eqz v3, :outer_loop # back edge of outer loop
44 goto :inner_loop # back edge of inner loop
52 goto :inner_loop # back edge of inner loop
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/contacts/ |
| ContactEdge.java | 29 * A contact edge is used to connect bodies and contacts together in a contact graph where each body
30 * is a node and each contact is an edge. A contact edge belongs to a doubly linked list maintained
48 * the previous contact edge in the body's contact list
53 * the next contact edge in the body's contact list
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/dynamics/joints/ |
| JointEdge.java | 29 * A joint edge is used to connect bodies and joints together
31 * is an edge. A joint edge belongs to a doubly linked list
49 * the previous joint edge in the body's joint list
54 * the next joint edge in the body's joint list
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/testdata/ |
| completion12-expected-completion75.txt | 10 android:paddingLeft : Sets the padding, in pixels, of the left edge; see padding. [dimension]
11 android:paddingTop : Sets the padding, in pixels, of the top edge; see padding. [dimension]
12 android:paddingRight : Sets the padding, in pixels, of the right edge; see padding. [dimension]
13 android:paddingBottom : Sets the padding, in pixels, of the bottom edge; see padding. [dimension]
14 android:paddingStart : Sets the padding, in pixels, of the start edge; see padding. [dimension]
15 android:paddingEnd : Sets the padding, in pixels, of the end edge; see padding. [dimension]
71 android:layout_toLeftOf : Positions the right edge of this view to the left of the given anchor view ID. [reference]
72 android:layout_toRightOf : Positions the left edge of this view to the right of the given anchor view ID. [reference]
73 android:layout_above : Positions the bottom edge of this view above the given anchor view ID. [reference]
74 android:layout_below : Positions the top edge of this view below the given anchor view ID. [reference
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 39 /// @brief Returns a value representing an invalid (non-existent) edge.
85 // 1) Update the adj index of the edge currently at back().
86 // 2) Move last Edge down to Idx.
122 "Edge already connected to NIds[NIdx].");
131 assert(NId == NIds[1] && "Edge does not connect NId.");
145 assert(NId == NIds[1] && "Edge not connected to NId");
152 "Edge not connected to NIds[NIdx].");
162 assert(NId == NIds[1] && "Edge does not connect NId");
221 "Attempt to add duplicate edge.");
234 // Add the edge to the adjacency sets of its nodes
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/ |
| omxVCM4P10_DeblockChroma_I.c | 51 * vertical edge, internal vertical edge, external
52 * horizontal edge, internal horizontal edge }
54 * vertical edge, internal vertical edge, external horizontal edge,
55 * internal horizontal edge }
57 * above edge of each 4x2 or 2x4 block, arranged in vertical block order
|
| omxVCM4P10_DeblockLuma_I.c | 53 * vertical edge, internal vertical edge, external horizontal
54 * edge, internal horizontal edge }
56 * vertical edge, internal vertical edge, external horizontal edge,
57 * internal horizontal edge }
59 * the left or above edge of each 4x4 block, arranged in vertical block order
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p10/src/ |
| omxVCM4P10_DeblockChroma_I.c | 51 * vertical edge, internal vertical edge, external
52 * horizontal edge, internal horizontal edge }
54 * vertical edge, internal vertical edge, external horizontal edge,
55 * internal horizontal edge }
57 * above edge of each 4x2 or 2x4 block, arranged in vertical block order
|
| omxVCM4P10_DeblockLuma_I.c | 53 * vertical edge, internal vertical edge, external horizontal
54 * edge, internal horizontal edge }
56 * vertical edge, internal vertical edge, external horizontal edge,
57 * internal horizontal edge }
59 * the left or above edge of each 4x4 block, arranged in vertical block order
|
