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

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 58 SolverEdgeItr addSolverEdge(Graph::EdgeItr eItr) {
60 return solverEdges.insert(solverEdges.end(), eItr);
135 /// @param eItr Edge iterator.
137 HeuristicEdgeData& getHeuristicEdgeData(Graph::EdgeItr eItr) {
138 return getSolverEdgeData(eItr).getHeuristicData();
160 /// @param eItr Edge iterator for edge to be removed.
164 void removeSolverEdge(Graph::EdgeItr eItr) {
165 EdgeData &eData = getSolverEdgeData(eItr);
166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)),
167 &n2Data = getSolverNodeData(g.getEdgeNode2(eItr));
    [all...]
Graph.h 119 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; }
120 const EdgeEntry& getEdge(ConstEdgeItr eItr) const { return *eItr; }
222 /// @param eItr Edge iterator.
224 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); }
227 /// @param eItr Edge iterator.
229 const Matrix& getEdgeCosts(ConstEdgeItr eItr) const {
230 return getEdge(eItr).getCosts()
    [all...]
HeuristicBase.h 202 /// @param eItr Edge iterator.
203 void preUpdateEdgeCosts(Graph::EdgeItr eItr) {
208 /// @param eItr Edge iterator.
209 void postUpdateEdgeCostts(Graph::EdgeItr eItr) {
214 /// @param eItr Edge iterator for the added edge.
215 void handleAddEdge(Graph::EdgeItr eItr) {
220 /// @param eItr Edge iterator for edge being disconnected.
226 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) {
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 182 /// @param eItr Edge iterator.
183 void preUpdateEdgeCosts(Graph::EdgeItr eItr) {
185 Graph::NodeItr n1Itr = g.getEdgeNode1(eItr),
186 n2Itr = g.getEdgeNode2(eItr);
191 subtractEdgeContributions(eItr, getGraph().getEdgeNode1(eItr));
193 subtractEdgeContributions(eItr, getGraph().getEdgeNode2(eItr));
195 EdgeData &ed = getHeuristicEdgeData(eItr);
200 /// @param eItr Edge iterator
    [all...]

Completed in 26 milliseconds