diff options
| author | Krzysztof Gogolewski <krz.gogolewski@gmail.com> | 2018-08-05 22:13:34 +0200 |
|---|---|---|
| committer | Krzysztof Gogolewski <krz.gogolewski@gmail.com> | 2018-08-05 22:13:34 +0200 |
| commit | 0095cde3474cf487296b6e52bf75130b10827607 (patch) | |
| tree | f9f915396a27a8987b5275efcb1df796081b6af2 /compiler/utils | |
| parent | 73683f143d352343b00b1ab4f3abeb38b81794be (diff) | |
| download | haskell-0095cde3474cf487296b6e52bf75130b10827607.tar.gz | |
Fix typos
Diffstat (limited to 'compiler/utils')
| -rw-r--r-- | compiler/utils/GraphColor.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/utils/GraphColor.hs b/compiler/utils/GraphColor.hs index 7affb92391..34cbb29b02 100644 --- a/compiler/utils/GraphColor.hs +++ b/compiler/utils/GraphColor.hs @@ -116,7 +116,7 @@ colorGraph iterative spinCount colors triv spill graph0 -- | Scan through the conflict graph separating out trivially colorable and -- potentially uncolorable (problem) nodes. -- --- Checking whether a node is trivially colorable or not is a resonably expensive operation, +-- Checking whether a node is trivially colorable or not is a reasonably expensive operation, -- so after a triv node is found and removed from the graph it's no good to return to the 'start' -- of the graph and recheck a bunch of nodes that will probably still be non-trivially colorable. -- |