| /external/r8/src/main/java/com/android/tools/r8/ir/optimize/ |
| InliningInfo.java | 68 final List<Edge> edges = new ArrayList<>(); field in class:InliningInfo
75 edges.add(new Edge(type, target.method, new Inlining(target)));
79 edges.add(new Edge(invoke.getType(), invoke.getInvokedMethod(), new NotInlining(reason)));
85 for (Edge edge : edges) {
|
| /frameworks/support/design/src/android/support/design/widget/ |
| DirectedAcyclicGraph.java | 73 ArrayList<T> edges = mGraph.get(node); local
74 if (edges == null) {
75 // If edges is null, we should try and get one from the pool and add it to the graph
76 edges = getEmptyList();
77 mGraph.put(node, edges);
80 edges.add(incomingEdge);
84 * Get any incoming edges from the given node.
86 * @return a list containing any incoming edges, or null if there are none.
94 * Get any outgoing edges for the given node (i.e. nodes which have an incoming edge
97 * @return a list containing any outgoing edges, or null if there are none
103 ArrayList<T> edges = mGraph.valueAt(i); local
116 ArrayList<T> edges = mGraph.valueAt(i); local
129 ArrayList<T> edges = mGraph.valueAt(i); local
169 final ArrayList<T> edges = mGraph.get(node); local
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| DefaultEdgeCreator.java | 43 List<Edge> edges = Lists.newArrayList(); local
46 edges.addAll(binding.acceptTargetVisitor(visitor));
48 return edges;
52 * {@link BindingTargetVisitor} that adds edges to the graph based on the visited {@link Binding}.
62 * edges
|
| /external/guice/extensions/grapher/test/com/google/inject/grapher/ |
| AbstractInjectorGrapherTest.java | 49 final Set<Edge> edges = Sets.newHashSet(); field in class:AbstractInjectorGrapherTest.FakeGrapher
53 edges.clear();
72 assertFalse(edges.contains(edge));
73 edges.add(edge);
77 assertFalse(edges.contains(edge));
78 edges.add(edge);
141 assertEquals(expectedEdges, grapher.edges);
166 assertEquals("wrong edges", expectedEdges, grapher.edges);
182 assertEquals(expectedEdges, grapher.edges);
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
|
| /external/testng/src/main/java/org/testng/internal/ |
| Tarjan.java | 62 String[] edges = new String[] { local
70 for (int i = 0; i < edges.length; i += 2) {
71 g.addPredecessor(edges[i], edges[i+1]);
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| GraphvizGrapher.java | 51 private final List<GraphvizEdge> edges = Lists.newArrayList(); field in class:GraphvizGrapher
66 edges.clear();
84 for (GraphvizEdge edge : edges) {
299 edges.add(gedge);
319 edges.add(gedge);
|
| /external/opencv/cvaux/src/ |
| cvdpstereo.cpp | 110 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
160 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
161 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
164 edges[y*imgW+j] = 0;
169 edges[y*imgW+j] |= 1;
174 edges[y*imgW+j] |= 2
[all...] |
| /external/skia/src/gpu/effects/ |
| GrConvexPolyEffect.cpp | 110 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
193 "edges",
263 SkScalar edges[3 * kMaxEdges]; local
286 edges[3 * n] = v.fY;
287 edges[3 * n + 1] = -v.fX;
289 edges[3 * n] = -v.fY;
290 edges[3 * n + 1] = v.fX;
292 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY)
355 SkScalar edges[kMaxEdges * 3]; local
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 49 /// Usage Example Graph with weighted edges and vertices:
59 /// for(const auto &e : G.edges()){
60 /// // Do something with the edges in the graph;
77 /// These objects are used to name edges and vertices in the graph.
86 /// This type is the value_type of all iterators which range over edges,
87 /// Determined by the Edges DenseMap.
100 /// The type used for storing the edges entering a vertex. Indexed by
102 /// where the incoming edges are, the EdgeIdentifiers are stored in an
113 EdgeMapT Edges;
172 /// A const iterator type for iterating through the set of edges entering
356 EdgeView<false> edges() { return EdgeView<false>(*this); } function in class:llvm::xray::Graph
358 EdgeView<true> edges() const { return EdgeView<true>(*this); } function in class:llvm::xray::Graph
[all...] |
| /external/libjpeg-turbo/simd/ |
| jdcolext-altivec.c | 40 __vector unsigned char edgel, edgeh, edges, out0, out1, out2, out3; local
223 edges = vec_perm(edgeh, edgel, unaligned_shift_index);
225 out0 = vec_perm(edges, rgb0, unaligned_shift_index);
230 out4 = vec_perm(rgb3, edges, unaligned_shift_index);
232 out3 = vec_perm(rgb2, edges, unaligned_shift_index);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| Graph.h | 106 EdgeList edges; member in class:PBQP::Graph
123 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
126 EdgeItr edgeItr = edges.insert(edges.end(), e);
157 /// This will clear the current graph, erasing any nodes and edges added,
188 /// \brief Get the number of edges in the graph.
189 /// @return Number of edges in the graph.
260 EdgeItr edgesBegin() { return edges.begin(); }
263 EdgeItr edgesEnd() { return edges.end(); }
267 /// @return Begin iterator for the set of edges connected to the given node
[all...] |
| /prebuilts/ndk/r13/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| validate_cfg.cpp | 328 << "Back-edges (" << _.getIdName(back_edge_block) << " -> "
339 << " targeted by multiple back-edges";
430 // and find all back-edges.
441 auto edges = local
443 for (auto edge : edges) {
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /external/bison/src/ |
| ielr.c | 125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_counts, always_followsp)
[all...] |
| /external/freetype/src/autofit/ |
| afhints.c | 108 AF_Edge edges; local
113 if ( !axis->edges )
115 axis->edges = axis->embedded.edges;
136 if ( axis->edges == axis->embedded.edges )
138 if ( FT_NEW_ARRAY( axis->edges, new_max ) )
140 ft_memcpy( axis->edges, axis->embedded.edges,
141 sizeof ( axis->embedded.edges ) );
292 AF_Edge edges = axis->edges; local
411 AF_Edge edges = axis->edges; local
544 AF_Edge edges = axis->edges; local
1249 AF_Edge edges = axis->edges; local
[all...] |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
80 * Edges
83 * edges.
86 * edges. An edge corresponds to a single position on the main
91 * edges, then to align segments on the edges unless it detects that
178 * interpolated linearly between their two closest edges, even if these
204 * alignment of edges and strong points, thus weak points are processed
290 FT_Fixed scale; /* used to speed up interpolation between edges */
316 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_
324 AF_EdgeRec edges[AF_EDGES_EMBEDDED]; member in struct:AF_AxisHintsRec_::__anon19458
[all...] |
