summaryrefslogtreecommitdiff
path: root/compiler/utils/Digraph.hs
diff options
context:
space:
mode:
Diffstat (limited to 'compiler/utils/Digraph.hs')
-rw-r--r--compiler/utils/Digraph.hs6
1 files changed, 3 insertions, 3 deletions
diff --git a/compiler/utils/Digraph.hs b/compiler/utils/Digraph.hs
index 53173ba047..48e39f761f 100644
--- a/compiler/utils/Digraph.hs
+++ b/compiler/utils/Digraph.hs
@@ -103,7 +103,7 @@ emptyGraph = Graph (array (1, 0) []) (error "emptyGraph") (const Nothing)
graphFromEdgedVertices
:: ReduceFn key payload
-> [Node key payload] -- The graph; its ok for the
- -- out-list to contain keys which arent
+ -- out-list to contain keys which aren't
-- a vertex key, they are ignored
-> Graph (Node key payload)
graphFromEdgedVertices _reduceFn [] = emptyGraph
@@ -122,7 +122,7 @@ graphFromEdgedVertices reduceFn edged_vertices =
graphFromEdgedVerticesOrd
:: Ord key
=> [Node key payload] -- The graph; its ok for the
- -- out-list to contain keys which arent
+ -- out-list to contain keys which aren't
-- a vertex key, they are ignored
-> Graph (Node key payload)
graphFromEdgedVerticesOrd = graphFromEdgedVertices reduceNodesIntoVerticesOrd
@@ -132,7 +132,7 @@ graphFromEdgedVerticesOrd = graphFromEdgedVertices reduceNodesIntoVerticesOrd
graphFromEdgedVerticesUniq
:: Uniquable key
=> [Node key payload] -- The graph; its ok for the
- -- out-list to contain keys which arent
+ -- out-list to contain keys which aren't
-- a vertex key, they are ignored
-> Graph (Node key payload)
graphFromEdgedVerticesUniq = graphFromEdgedVertices reduceNodesIntoVerticesUniq