Searched defs:n1Itr (Results 1 - 2 of 2) sorted by relevance
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/ |
H A D | Briggs.h | 51 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { argument 52 if (s->getSolverDegree(n1Itr) > s->getSolverDegree(n2Itr)) 64 bool operator()(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr) const { argument 65 const PBQP::Vector &cv1 = g->getNodeCosts(n1Itr); 68 PBQPNum cost1 = cv1[0] / s->getSolverDegree(n1Itr); 186 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), local 188 NodeData &n1 = getHeuristicNodeData(n1Itr), 216 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr), local 218 NodeData &n1 = getHeuristicNodeData(n1Itr), 232 addEdgeContributions(eItr, n1Itr); [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 173 /// @param n1Itr First node. 176 EdgeItr addEdge(Graph::NodeItr n1Itr, Graph::NodeItr n2Itr, argument 178 assert(getNodeCosts(n1Itr).getLength() == costs.getRows() && 181 return addConstructedEdge(EdgeEntry(n1Itr, n2Itr, costs)); 306 /// @param n1Itr First node iterator. 308 /// @return An iterator for edge (n1Itr, n2Itr) if such an edge exists, 310 EdgeItr findEdge(NodeItr n1Itr, NodeItr n2Itr) { argument 311 for (AdjEdgeItr aeItr = adjEdgesBegin(n1Itr), aeEnd = adjEdgesEnd(n1Itr);
|
Completed in 66 milliseconds