Searched refs:nItr (Results 1 – 5 of 5) sorted by relevance
66 void addToOptimalReductionList(Graph::NodeItr nItr) { in addToOptimalReductionList() argument67 optimalList.insert(optimalList.end(), nItr); in addToOptimalReductionList()108 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce() argument109 if (g.getNodeDegree(nItr) < 3) in shouldOptimallyReduce()121 void addToOptimalReduceList(Graph::NodeItr nItr) { in addToOptimalReduceList() argument122 optimalList.push_back(nItr); in addToOptimalReduceList()133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd(); in setup() local134 nItr != nEnd; ++nItr) { in setup()135 if (impl().shouldOptimallyReduce(nItr)) { in setup()136 addToOptimalReduceList(nItr); in setup()[all …]
111 NodeEntry& getNode(NodeItr nItr) { return *nItr; } in getNode() argument112 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; } in getNode() argument195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } in getNodeCosts() argument200 const Vector& getNodeCosts(ConstNodeItr nItr) const { in getNodeCosts() argument201 return getNode(nItr).getCosts(); in getNodeCosts()209 void setNodeData(NodeItr nItr, void *data) { getNode(nItr).setData(data); } in setNodeData() argument214 void* getNodeData(NodeItr nItr) { return getNode(nItr).getData(); } in getNodeData() argument243 unsigned getNodeDegree(NodeItr nItr) const { in getNodeDegree() argument244 return getNode(nItr).getDegree(); in getNodeDegree()268 AdjEdgeItr adjEdgesBegin(NodeItr nItr) { in adjEdgesBegin() argument[all …]
130 HeuristicNodeData& getHeuristicNodeData(Graph::NodeItr nItr) { in getHeuristicNodeData() argument131 return getSolverNodeData(nItr).getHeuristicData(); in getHeuristicNodeData()146 SolverEdgeItr solverEdgesBegin(Graph::NodeItr nItr) { in solverEdgesBegin() argument147 return getSolverNodeData(nItr).solverEdgesBegin(); in solverEdgesBegin()155 SolverEdgeItr solverEdgesEnd(Graph::NodeItr nItr) { in solverEdgesEnd() argument156 return getSolverNodeData(nItr).solverEdgesEnd(); in solverEdgesEnd()192 void pushToStack(Graph::NodeItr nItr) { in pushToStack() argument193 getSolverNodeData(nItr).clearSolverEdges(); in pushToStack()194 stack.push_back(nItr); in pushToStack()200 unsigned getSolverDegree(Graph::NodeItr nItr) { in getSolverDegree() argument[all …]
77 void setSelection(Graph::NodeItr nItr, unsigned selection) { in setSelection() argument78 selections[nItr] = selection; in setSelection()84 unsigned getSelection(Graph::ConstNodeItr nItr) const { in getSelection() argument85 SelectionsMap::const_iterator sItr = selections.find(nItr); in getSelection()
127 bool shouldOptimallyReduce(Graph::NodeItr nItr) { in shouldOptimallyReduce() argument128 if (getSolver().getSolverDegree(nItr) < 3) { in shouldOptimallyReduce()137 void addToHeuristicReduceList(Graph::NodeItr nItr) { in addToHeuristicReduceList() argument138 NodeData &nd = getHeuristicNodeData(nItr); in addToHeuristicReduceList()139 initializeNode(nItr); in addToHeuristicReduceList()142 nd.rnaItr = rnAllocableList.insert(rnAllocableList.end(), nItr); in addToHeuristicReduceList()144 nd.rnuItr = rnUnallocableList.insert(rnUnallocableList.end(), nItr); in addToHeuristicReduceList()163 Graph::NodeItr nItr = *rnaItr; in heuristicReduce() local165 handleRemoveNode(nItr); in heuristicReduce()166 getSolver().pushToStack(nItr); in heuristicReduce()[all …]