diff options
author | Nick Lewycky <nicholas@mxc.ca> | 2013-11-09 02:01:25 +0000 |
---|---|---|
committer | Nick Lewycky <nicholas@mxc.ca> | 2013-11-09 02:01:25 +0000 |
commit | ceb0d9c085492151f8e4538119bf3de29ff935c0 (patch) | |
tree | 941ab6b15637775fb3922f4d31e5b5c7e27990a2 /include/llvm/CodeGen/PBQP/Solution.h | |
parent | d4f5a615674aaabeee4e444e708d1fa00a41495e (diff) | |
download | external_llvm-ceb0d9c085492151f8e4538119bf3de29ff935c0.zip external_llvm-ceb0d9c085492151f8e4538119bf3de29ff935c0.tar.gz external_llvm-ceb0d9c085492151f8e4538119bf3de29ff935c0.tar.bz2 |
Revert r194300 which broke the build.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@194308 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/CodeGen/PBQP/Solution.h')
-rw-r--r-- | include/llvm/CodeGen/PBQP/Solution.h | 11 |
1 files changed, 6 insertions, 5 deletions
diff --git a/include/llvm/CodeGen/PBQP/Solution.h b/include/llvm/CodeGen/PBQP/Solution.h index 98ba5a1..b9f288b 100644 --- a/include/llvm/CodeGen/PBQP/Solution.h +++ b/include/llvm/CodeGen/PBQP/Solution.h @@ -26,7 +26,8 @@ namespace PBQP { class Solution { private: - typedef std::map<Graph::NodeId, unsigned> SelectionsMap; + typedef std::map<Graph::ConstNodeItr, unsigned, + NodeItrComparator> SelectionsMap; SelectionsMap selections; unsigned r0Reductions, r1Reductions, r2Reductions, rNReductions; @@ -72,15 +73,15 @@ namespace PBQP { /// \brief Set the selection for a given node. /// @param nItr Node iterator. /// @param selection Selection for nItr. - void setSelection(Graph::NodeId nodeId, unsigned selection) { - selections[nodeId] = selection; + void setSelection(Graph::NodeItr nItr, unsigned selection) { + selections[nItr] = selection; } /// \brief Get a node's selection. /// @param nItr Node iterator. /// @return The selection for nItr; - unsigned getSelection(Graph::NodeId nodeId) const { - SelectionsMap::const_iterator sItr = selections.find(nodeId); + unsigned getSelection(Graph::ConstNodeItr nItr) const { + SelectionsMap::const_iterator sItr = selections.find(nItr); assert(sItr != selections.end() && "No selection for node."); return sItr->second; } |