summaryrefslogtreecommitdiff
path: root/compiler/utils
diff options
context:
space:
mode:
authorBrian Wignall <brianwignall@gmail.com>2019-11-29 14:25:14 -0500
committerMarge Bot <ben+marge-bot@smart-cactus.org>2019-12-02 03:44:16 -0500
commit717f323609857a40fdbefe7a5ba426747512414a (patch)
treedaa6c5cb93d35ac3b13e02f72484e87ca6e4aa3f /compiler/utils
parent18baed641fccc7fd91988334544d47505b577810 (diff)
downloadhaskell-717f323609857a40fdbefe7a5ba426747512414a.tar.gz
Fix more typos
Diffstat (limited to 'compiler/utils')
-rw-r--r--compiler/utils/Digraph.hs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/utils/Digraph.hs b/compiler/utils/Digraph.hs
index cb401be274..c205c45d8d 100644
--- a/compiler/utils/Digraph.hs
+++ b/compiler/utils/Digraph.hs
@@ -158,7 +158,7 @@ type ReduceFn key payload =
Note [reduceNodesIntoVertices implementations]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
reduceNodesIntoVertices is parameterized by the container type.
-This is to accomodate key types that don't have an Ord instance
+This is to accommodate key types that don't have an Ord instance
and hence preclude the use of Data.Map. An example of such type
would be Unique, there's no way to implement Ord Unique
deterministically.