Searched refs:addEdge (Results 1 - 25 of 41) sorted by relevance

12

/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestTopologicalSort.java40 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("
[all...]
/external/testng/src/test/java/test/
H A DDynamicGraphTest.java25 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/
H A Dsanitizer_bvgraph_test.cc46 bool addEdge(uptr from, uptr to) { function in class:SimpleGraph
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(f
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java44 public void addEdge(Node n) { method in class:Graph.Node
55 public void addEdge(Object a, Object b) { method in class:Graph
59 a_node.addEdge(b_node);
/external/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h91 addEdge(nullptr, BB, EntryWeight);
95 addEdge(BB, nullptr, EntryWeight);
119 addEdge(&*BB, TargetBB, Weight).IsCritical = Critical;
124 addEdge(&*BB, nullptr, BBWeight);
185 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { function in class:llvm::CFGMST
H A DPGOInstrumentation.cpp484 PGOUseEdge &NewEdge = FuncInfo.MST.addEdge(SrcBB, InstrBB, 0);
487 PGOUseEdge &NewEdge1 = FuncInfo.MST.addEdge(InstrBB, DestBB, 0);
H A DGCOVProfiling.cpp253 void addEdge(GCOVBlock &Successor) { function in class:__anon12885::GCOVBlock
525 Block.addEdge(Func.getBlock(TI->getSuccessor(i)));
528 Block.addEdge(Func.getReturnBlock());
/external/opencv3/modules/cudaimgproc/src/
H A Dmssegmentation.cpp93 void addEdge(int from, int to, const T& val=T());
191 inline void Graph<T>::addEdge(int from, int to, const T& val) function in class:__anon15795::Graph
289 g.addEdge(pix(y, x, ncols), pix(y, x + 1, ncols), SegmLinkVal(dr[0], dsp[0]));
290 g.addEdge(pix(y, x, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[1], dsp[1]));
291 g.addEdge(pix(y, x, ncols), pix(y + 1, x + 1, ncols), SegmLinkVal(dr[2], dsp[2]));
292 g.addEdge(pix(y, x + 1, ncols), pix(y + 1, x, ncols), SegmLinkVal(dr[3], dsp[3]));
303 g.addEdge(pix(y, ncols - 1, ncols), pix(y + 1, ncols - 1, ncols), SegmLinkVal(dr[0], dsp[0]));
313 g.addEdge(pix(nrows - 1, x, ncols), pix(nrows - 1, x + 1, ncols), SegmLinkVal(dr[0], dsp[0]));
/external/opencv3/modules/stitching/include/opencv2/stitching/detail/
H A Dutil.hpp141 void addEdge(int from, int to, float weight);
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h44 bool addEdge(uptr from, uptr to) { function in class:__sanitizer::BVGraph
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h409 * 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); member in struct:ANTLR3_TOPO_struct
/external/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h131 YZEId = G.addEdge(YNId, ZNId, Delta);
/external/opencv3/modules/stitching/src/
H A Dutil.cpp95 void Graph::addEdge(int from, int to, float weight) function in class:cv::detail::Graph
H A Dmotion_estimators.cpp826 graph.addEdge(i, j, conf);
844 span_tree.addEdge(edges[i].from, edges[i].to, edges[i].weight);
845 span_tree.addEdge(edges[i].to, edges[i].from, edges[i].weight);
/external/testng/src/main/java/org/testng/internal/
H A DDynamicGraph.java52 public void addEdge(T from, T to) { method in class:DynamicGraph
/external/opencv3/modules/calib3d/src/
H A Dcirclesgrid.hpp94 void addEdge(size_t id1, size_t id2);
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DEscapeAnalysis.java172 private void addEdge(EscapeSet parentSet, EscapeSet childSet) { method in class:EscapeAnalysis
431 addEdge(parentSet, escSet);
440 addEdge(escSet, childSet);
/external/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h600 void addEdge(IrrNode &Irr, const BlockNode &Succ,
629 addEdge(Irr, I.first, OuterLoop);
1151 G.addEdge(Irr, BFI.getNode(*I), OuterLoop);
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
2277 topo->addEdge(topo, 3, 0); // Node 3 depends on node 0
2278 topo->addEdge(topo, 0, 1); // Node - depends on node 1
2306 topo->addEdge = addEdge;
2316 addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency) function
/external/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp203 G.addEdge(node1, node2, std::move(costs));
/external/testng/src/main/java/org/testng/
H A DTestRunner.java1061 result.addEdge(m, dm);
1078 result.addEdge(m, ddm);
1100 result.addEdge(dm, es.getKey());
1112 result.addEdge(dm, es.getKey());
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/
H A DTool.java570 if ( vocabName!=null ) g.addEdge(gfile, vocabName+CodeGenerator.VOCAB_FILE_EXTENSION);
572 g.addEdge(grammarName+CodeGenerator.VOCAB_FILE_EXTENSION, gfile);
/external/clang/lib/StaticAnalyzer/Core/
H A DBugReporter.cpp1020 void addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd = false,
1117 void EdgeBuilder::addEdge(PathDiagnosticLocation NewLoc, bool alwaysAdd, function in class:EdgeBuilder
1422 EB.addEdge(C->callReturn, /*AlwaysAdd=*/true, /*IsPostJump=*/true);
1438 EB.addEdge(pos);
1505 EB.addEdge(p->getLocation(), true);
1511 EB.addEdge(BL);
1532 EB.addEdge(PE->getLocation(), true);
1570 EB.addEdge(Loc, true);
/external/llvm/lib/Analysis/
H A DCFLAliasAnalysis.cpp605 void addEdge(Node From, Node To, const EdgeTypeT &Weight, function in class:__anon12127::WeightedBidirectionalGraph
851 Graph.addEdge(From, To, std::make_pair(E.Weight, Attrs),
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp395 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M));
456 G.addEdge(N1Id, N2Id, std::move(Costs));

Completed in 2382 milliseconds

12