HomeSort by relevance Sort by last modified time
    Searched refs:AdjEdgeItr (Results 1 - 6 of 6) sorted by null

  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h 51 typedef AdjEdgeList::iterator AdjEdgeItr;
66 AdjEdgeItr edgesBegin() { return adjEdges.begin(); }
67 AdjEdgeItr edgesEnd() { return adjEdges.end(); }
68 AdjEdgeItr addEdge(EdgeItr e) {
72 void removeEdge(AdjEdgeItr ae) {
84 AdjEdgeItr node1AEItr, node2AEItr;
93 void setNode1AEItr(AdjEdgeItr ae) { node1AEItr = ae; }
94 AdjEdgeItr getNode1AEItr() { return node1AEItr; }
95 void setNode2AEItr(AdjEdgeItr ae) { node2AEItr = ae; }
96 AdjEdgeItr getNode2AEItr() { return node2AEItr;
    [all...]
HeuristicSolver.h 210 for (Graph::AdjEdgeItr aeItr = g.adjEdgesBegin(nItr),
448 for (Graph::AdjEdgeItr aeItr = g.adjEdgesBegin(nItr),
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 68 typedef AdjEdgeList::const_iterator AdjEdgeItr;
243 typedef typename NodeEntry::AdjEdgeItr AdjEdgeItr;
332 typename NodeEntry::AdjEdgeItr begin() const {
335 typename NodeEntry::AdjEdgeItr end() const {
597 for (AdjEdgeItr AEItr = N.adjEdgesBegin(),
ReductionRules.h 85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin();
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
Graph.h 67 using AdjEdgeItr = AdjEdgeList::const_iterator;
229 using AdjEdgeItr = typename NodeEntry::AdjEdgeItr;
323 typename NodeEntry::AdjEdgeItr begin() const {
327 typename NodeEntry::AdjEdgeItr end() const {
591 for (AdjEdgeItr AEItr = N.adjEdgesBegin(),
ReductionRules.h 87 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin();

Completed in 7919 milliseconds