diff options
| author | Gabor Greif <ggreif@gmail.com> | 2017-01-05 11:41:44 +0100 |
|---|---|---|
| committer | Gabor Greif <ggreif@gmail.com> | 2017-01-09 16:26:25 +0100 |
| commit | a8a714ea6787f5717ca3ddf0f81ebba8d7ccca4d (patch) | |
| tree | b65d0e13c92aba0d9a5b34b6df3d9165c5cbee65 /compiler/utils | |
| parent | 7d2e5da61714025142f0085d5ae150a61e637a5e (diff) | |
| download | haskell-a8a714ea6787f5717ca3ddf0f81ebba8d7ccca4d.tar.gz | |
Typos in comments (and in a test)
Diffstat (limited to 'compiler/utils')
| -rw-r--r-- | compiler/utils/Digraph.hs | 6 |
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 |