Searched refs:nItr (Results 1 – 5 of 5) sorted by relevance
67 optimalList.insert(optimalList.end(), nItr); in addToOptimalReductionList()109 if (g.getNodeDegree(nItr) < 3) in shouldOptimallyReduce()122 optimalList.push_back(nItr); in addToOptimalReduceList()134 nItr != nEnd; ++nItr) { in setup()136 addToOptimalReduceList(nItr); in setup()138 impl().addToHeuristicReduceList(nItr); in setup()153 Graph::NodeItr nItr = optimalList.front(); in optimalReduce() local156 switch (s.getSolverDegree(nItr)) { in optimalReduce()157 case 0: s.applyR0(nItr); break; in optimalReduce()158 case 1: s.applyR1(nItr); break; in optimalReduce()[all …]
112 NodeEntry& getNode(NodeItr nItr) { return *nItr; } in getNode() argument113 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; } in getNode() argument196 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } in getNodeCosts() argument210 void setNodeData(NodeItr nItr, void *data) { getNode(nItr).setData(data); } in setNodeData() argument215 void* getNodeData(NodeItr nItr) { return getNode(nItr).getData(); } in getNodeData() argument300 if (e.getNode1() == nItr) { in getEdgeOtherNode()324 void removeNode(NodeItr nItr) { in removeNode() argument325 NodeEntry &n = getNode(nItr); in removeNode()331 nodes.erase(nItr); in removeNode()417 nItr != nEnd; ++nItr) { in copyFrom()[all …]
192 void pushToStack(Graph::NodeItr nItr) { in pushToStack() argument194 stack.push_back(nItr); in pushToStack()208 s.setSelection(nItr, selection); in setSolution()223 void applyR0(Graph::NodeItr nItr) { in applyR0() argument228 pushToStack(nItr); in applyR0()418 nItr != nEnd; ++nItr) { in setup()442 nItr != nEnd; ++nItr) { in disconnectTrivialNodes()454 if (g.getEdgeNode1(eItr) == nItr) { in disconnectTrivialNodes()561 Vector v(g.getNodeCosts(nItr)); in computeSolution()571 if (nItr == g.getEdgeNode1(eItr)) { in computeSolution()[all …]
72 void setSelection(Graph::NodeItr nItr, unsigned selection) { in setSelection() argument73 selections[nItr] = selection; in setSelection()79 unsigned getSelection(Graph::NodeItr nItr) const { in getSelection() argument80 SelectionsMap::const_iterator sItr = selections.find(nItr); in getSelection()
136 initializeNode(nItr); in addToHeuristicReduceList()160 Graph::NodeItr nItr = *rnaItr; in heuristicReduce() local162 handleRemoveNode(nItr); in heuristicReduce()163 getSolver().pushToStack(nItr); in heuristicReduce()169 Graph::NodeItr nItr = *rnuItr; in heuristicReduce() local171 handleRemoveNode(nItr); in heuristicReduce()172 getSolver().pushToStack(nItr); in heuristicReduce()272 updateAllocability(nItr); in handleRemoveEdge()275 if (shouldOptimallyReduce(nItr)) { in handleRemoveEdge()277 addToOptimalReduceList(nItr); in handleRemoveEdge()[all …]