| /frameworks/support/coordinatorlayout/src/main/java/androidx/coordinatorlayout/widget/ |
| DirectedAcyclicGraph.java | 81 ArrayList<T> edges = mGraph.get(node); local
82 if (edges == null) {
83 // If edges is null, we should try and get one from the pool and add it to the graph
84 edges = getEmptyList();
85 mGraph.put(node, edges);
88 edges.add(incomingEdge);
92 * Get any incoming edges from the given node.
94 * @return a list containing any incoming edges, or null if there are none.
102 * Get any outgoing edges for the given node (i.e. nodes which have an incoming edge
105 * @return a list containing any outgoing edges, or null if there are none
111 ArrayList<T> edges = mGraph.valueAt(i); local
131 ArrayList<T> edges = mGraph.valueAt(i); local
144 ArrayList<T> edges = mGraph.valueAt(i); local
184 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/tensorflow/tensorflow/core/graph/ |
| mkl_layout_pass_test.cc | 86 std::vector<string> edges; local
92 for (const Edge* e : g->edges()) {
94 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->",
100 std::sort(edges.begin(), edges.end());
102 str_util::Join(edges, ";"));
294 // _MklConv2D has two outgoing edges: BiasAdd and some other dummy node (Zeta).
[all...] |
| mkl_tfconversion_pass_test.cc | 74 std::vector<string> edges; local
80 for (const Edge* e : g->edges()) {
82 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->",
88 std::sort(edges.begin(), edges.end());
90 str_util::Join(edges, ";"));
|
| optimizer_cse_test.cc | 70 std::vector<string> edges; local
76 for (const Edge* e : g->edges()) {
78 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->",
84 std::sort(edges.begin(), edges.end());
86 str_util::Join(edges, ";"));
|
| mkl_tfconversion_pass.cc | 82 // Function scans the graph for candidate edges where we
208 // Get the input nodes and edges
209 std::vector<const Edge*> edges; local
210 TF_CHECK_OK(n->input_edges(&edges));
211 if (edges.size() != 4) {
219 CHECK_EQ(BaseType(edges[0]->src()->output_type(edges[0]->src_output())),
220 BaseType(edges[1]->src()->output_type(edges[1]->src_output())));
221 CHECK_EQ(BaseType(edges[0]->src()->output_type(edges[0]->src_output()))
[all...] |
| /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/skia/src/gpu/effects/ |
| GrConvexPolyEffect.cpp | 47 "edges",
118 SkScalar edges[3 * kMaxEdges]; local
141 edges[3 * n] = v.fY;
142 edges[3 * n + 1] = -v.fX;
144 edges[3 * n] = -v.fY;
145 edges[3 * n + 1] = v.fX;
147 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY);
159 return Make(type, n, edges);
220 SkScalar edges[kMaxEdges * 3]; local
[all...] |
| /external/skqp/src/gpu/effects/ |
| GrConvexPolyEffect.cpp | 47 "edges",
118 SkScalar edges[3 * kMaxEdges]; local
141 edges[3 * n] = v.fY;
142 edges[3 * n + 1] = -v.fX;
144 edges[3 * n] = -v.fY;
145 edges[3 * n + 1] = v.fX;
147 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY);
159 return Make(type, n, edges);
220 SkScalar edges[kMaxEdges * 3]; local
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/ |
| local_single_store_elim_pass.cpp | 160 auto edges = spvtools::CFA<ir::BasicBlock>::CalculateDominators( local
163 for (auto edge : edges)
|
| /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/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| graphcycles_test.cc | 40 typedef std::vector<Edge> Edges;
43 static bool IsReachable(Edges *edges, int from, int to,
47 for (int i = 0; i != edges->size(); i++) {
48 Edge *edge = &(*edges)[i];
53 IsReachable(edges, edge->to, to, seen)) {
68 static void PrintEdges(Edges *edges) {
69 LOG(INFO) << "EDGES (" << edges->size() << ")"
200 Edges edges; \/\/ from, to local
[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/darwin-x86/clang-4393122/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-4479392/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-4579689/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-4630689/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-4639204/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-4691093/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...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/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-4479392/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...] |
