- //===- Solution.h - PBQP Solution -------------------------------*- C++ -*-===// 
- // 
- // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 
- // See https://llvm.org/LICENSE.txt for license information. 
- // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 
- // 
- //===----------------------------------------------------------------------===// 
- // 
- // PBQP Solution class. 
- // 
- //===----------------------------------------------------------------------===// 
-   
- #ifndef LLVM_CODEGEN_PBQP_SOLUTION_H 
- #define LLVM_CODEGEN_PBQP_SOLUTION_H 
-   
- #include "llvm/CodeGen/PBQP/Graph.h" 
- #include <cassert> 
- #include <map> 
-   
- namespace llvm { 
- namespace PBQP { 
-   
-   /// Represents a solution to a PBQP problem. 
-   /// 
-   /// To get the selection for each node in the problem use the getSelection method. 
-   class Solution { 
-   private: 
-     using SelectionsMap = std::map<GraphBase::NodeId, unsigned>; 
-     SelectionsMap selections; 
-   
-   public: 
-     /// Initialise an empty solution. 
-     Solution() = default; 
-   
-     /// Set the selection for a given node. 
-     /// @param nodeId Node id. 
-     /// @param selection Selection for nodeId. 
-     void setSelection(GraphBase::NodeId nodeId, unsigned selection) { 
-       selections[nodeId] = selection; 
-     } 
-   
-     /// Get a node's selection. 
-     /// @param nodeId Node id. 
-     /// @return The selection for nodeId; 
-     unsigned getSelection(GraphBase::NodeId nodeId) const { 
-       SelectionsMap::const_iterator sItr = selections.find(nodeId); 
-       assert(sItr != selections.end() && "No selection for node."); 
-       return sItr->second; 
-     } 
-   }; 
-   
- } // end namespace PBQP 
- } // end namespace llvm 
-   
- #endif // LLVM_CODEGEN_PBQP_SOLUTION_H 
-