diff options
| author | Simon Peyton Jones <simonpj@microsoft.com> | 2015-01-05 16:57:01 +0000 |
|---|---|---|
| committer | Simon Peyton Jones <simonpj@microsoft.com> | 2015-01-06 14:24:59 +0000 |
| commit | 39337a6d97c853a88fa61d6b12a04eb8c2e5984f (patch) | |
| tree | 0dd7051080041ee928429832122b9dd14add302c /compiler/utils/GraphColor.hs | |
| parent | 32973bf3c2f6fe00e01b44a63ac1904080466938 (diff) | |
| download | haskell-39337a6d97c853a88fa61d6b12a04eb8c2e5984f.tar.gz | |
Remove redundant constraints in the compiler itself, found by -fwarn-redundant-constraints
Diffstat (limited to 'compiler/utils/GraphColor.hs')
| -rw-r--r-- | compiler/utils/GraphColor.hs | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/compiler/utils/GraphColor.hs b/compiler/utils/GraphColor.hs index 7ba8efbd03..41b367692a 100644 --- a/compiler/utils/GraphColor.hs +++ b/compiler/utils/GraphColor.hs @@ -34,7 +34,7 @@ import Data.List -- colorGraph :: ( Uniquable k, Uniquable cls, Uniquable color - , Eq color, Eq cls, Ord k + , Eq cls, Ord k , Outputable k, Outputable cls, Outputable color) => Bool -- ^ whether to do iterative coalescing -> Int -- ^ how many times we've tried to color this graph so far. @@ -250,7 +250,7 @@ colorScan_spill iterative triv spill graph assignColors :: ( Uniquable k, Uniquable cls, Uniquable color - , Eq color, Outputable cls) + , Outputable cls) => UniqFM (UniqSet color) -- ^ map of (node class -> set of colors available for this class). -> Graph k cls color -- ^ the graph -> [k] -- ^ nodes to assign a color to. @@ -288,7 +288,7 @@ assignColors colors graph ks -- selectColor :: ( Uniquable k, Uniquable cls, Uniquable color - , Eq color, Outputable cls) + , Outputable cls) => UniqFM (UniqSet color) -- ^ map of (node class -> set of colors available for this class). -> Graph k cls color -- ^ the graph -> k -- ^ key of the node to select a color for. |