| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestTopologicalSort.java | 40 g.addEdge("C", "F");
41 g.addEdge("C", "G");
42 g.addEdge("C", "A");
43 g.addEdge("C", "B");
44 g.addEdge("A", "D");
45 g.addEdge("A", "E");
46 g.addEdge("B", "E");
47 g.addEdge("D", "E");
48 g.addEdge("D", "F");
49 g.addEdge("F", "H")
[all...] |
| /tools/tradefederation/core/tests/src/com/android/tradefed/util/ |
| DirectedGraphTest.java | 27 graph.addEdge(0, 1);
28 graph.addEdge(1, 2);
29 graph.addEdge(2, 3);
40 graph.addEdge(0, 1); graph.addEdge(0, 2); graph.addEdge(0, 3);
41 graph.addEdge(1, 2); graph.addEdge(1, 3); graph.addEdge(2, 3);
42 graph.addEdge(2, 4); graph.addEdge(4, 5); graph.addEdge(5, 6)
[all...] |
| /external/testng/src/test/java/test/ |
| DynamicGraphTest.java | 25 dg.addEdge("b1", "a1");
26 dg.addEdge("b1", "a2");
27 dg.addEdge("b2", "a1");
28 dg.addEdge("b2", "a2");
29 dg.addEdge("c1", "b1");
30 dg.addEdge("c1", "b2");
57 dg.addEdge("b1", "a1");
58 dg.addEdge("b1", "a2");
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_bvgraph_test.cc | 46 bool addEdge(uptr from, uptr to) {
87 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to));
132 EXPECT_EQ(g.addEdge(from, to), s_g.addEdge(from, to));
186 g.addEdge(f0, f1);
187 g.addEdge(f1, f2);
188 g.addEdge(f2, f3);
194 g.addEdge(f1, t0);
207 g.addEdge(f3, t1)
[all...] |
| /frameworks/support/coordinatorlayout/src/androidTest/java/androidx/coordinatorlayout/widget/ |
| DirectedAcyclicGraphTest.java | 68 mGraph.addEdge(node, edge);
80 mGraph.addEdge(node, edge);
89 mGraph.addEdge(node, edge);
103 mGraph.addEdge(node, edge);
121 mGraph.addEdge(node1, edge);
122 mGraph.addEdge(node2, edge);
142 mGraph.addEdge(node, edge);
180 mGraph.addEdge(node4, node2);
181 mGraph.addEdge(node2, node3);
182 mGraph.addEdge(node3, node1)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 44 public void addEdge(Node n) {
55 public void addEdge(Object a, Object b) {
59 a_node.addEdge(b_node);
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| PathNumbering.cpp | 250 addEdge(getExit(),getRoot(),0);
283 BallLarusEdge* exitEdge = addEdge(node, getExit(), 0);
301 addEdge(getRoot(), (*succ)->getTarget(), duplicateNumber++);
381 BallLarusEdge* callEdge = addEdge(currentNode, getExit(), 0);
391 addEdge(currentNode, getExit(),0);
424 addEdge(currentNode, succNode, duplicateCount);
438 addEdge(currentNode, childNode, duplicateCount);
497 BallLarusEdge* BallLarusDag::addEdge(BallLarusNode* source,
510 BallLarusEdge* childEdge = addEdge(source, target, duplicateCount);
513 childEdge->setPhonyRoot(addEdge(getRoot(), target,0))
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| CFGMST.h | 90 addEdge(nullptr, BB, EntryWeight);
94 addEdge(BB, nullptr, EntryWeight);
118 addEdge(&*BB, TargetBB, Weight).IsCritical = Critical;
123 addEdge(&*BB, nullptr, BBWeight);
184 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) {
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| Trie.h | 70 inline void addEdge(Node* N) {
178 nNode->addEdge(eNode);
232 nNode->addEdge(tNode);
236 cNode->addEdge(tNode);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| Graph.h | 68 AdjEdgeItr addEdge(EdgeItr e) {
134 ne.setNode1AEItr(n1.addEdge(edgeItr));
135 ne.setNode2AEItr(n2.addEdge(edgeItr));
176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr,
|
| /external/llvm/lib/Analysis/ |
| CFLGraph.h | 110 void addEdge(Node From, Node To, int64_t Offset = 0) {
201 Graph.addEdge(InstantiatedValue{From, 0}, InstantiatedValue{To, 0},
213 Graph.addEdge(InstantiatedValue{From, 1}, InstantiatedValue{To, 0});
347 Graph.addEdge(IRelation->From, IRelation->To);
|
| /tools/tradefederation/core/src/com/android/tradefed/util/ |
| DirectedGraph.java | 67 public void addEdge(V from, V to) {
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 44 bool addEdge(uptr from, uptr to) {
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| PathNumbering.h | 273 BallLarusEdge* addEdge(BallLarusNode* source, BallLarusNode* target,
|
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| GCOV.h | 189 void addEdge(uint32_t N) { Edges.push_back(N); }
|
| /frameworks/support/coordinatorlayout/src/main/java/androidx/coordinatorlayout/widget/ |
| DirectedAcyclicGraph.java | 75 public void addEdge(@NonNull T node, @NonNull T incomingEdge) {
|
| /external/skia/src/utils/ |
| SkShadowTessellator.cpp | 354 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal);
619 this->addEdge(fInitPoints[1], normal);
633 this->addEdge(p, normal);
637 void SkAmbientShadowTessellator::addEdge(const SkPoint& nextPoint, const SkVector& nextNormal) {
639 // then on the next addEdge() we add half of the next normal to get an average of the two
661 // This is lacking 1/4 of the next inset -- we'll add it the next time we call addEdge()
769 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal);
[all...] |
| /external/skqp/src/utils/ |
| SkShadowTessellator.cpp | 348 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal);
606 this->addEdge(fInitPoints[1], normal);
620 this->addEdge(p, normal);
624 void SkAmbientShadowTessellator::addEdge(const SkPoint& nextPoint, const SkVector& nextNormal) {
626 // then on the next addEdge() we add half of the next normal to get an average of the two
648 // This is lacking 1/4 of the next inset -- we'll add it the next time we call addEdge()
756 void addEdge(const SkVector& nextPoint, const SkVector& nextNormal);
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 131 YZEId = G.addEdge(YNId, ZNId, Delta);
|
| /external/testng/src/main/java/org/testng/internal/ |
| DynamicGraph.java | 52 public void addEdge(T from, T to) {
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 131 YZEId = G.addEdge(YNId, ZNId, Delta);
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 133 YZEId = G.addEdge(YNId, ZNId, Delta);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 133 YZEId = G.addEdge(YNId, ZNId, Delta);
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 133 YZEId = G.addEdge(YNId, ZNId, Delta);
|
