diff options
| author | Gabor Greif <ggreif@gmail.com> | 2016-11-28 10:40:13 +0100 |
|---|---|---|
| committer | Gabor Greif <ggreif@gmail.com> | 2016-11-28 10:41:26 +0100 |
| commit | 52388421c5649431ce128cb08fb1329727023464 (patch) | |
| tree | 23424f858c5c4f4dd566ee11ae1ea7de92f6a420 /compiler/utils | |
| parent | 6ec2304f46c9a5423943c5bf29bd8a8c062b6560 (diff) | |
| download | haskell-52388421c5649431ce128cb08fb1329727023464.tar.gz | |
Typos in comments only [ci skip]
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 93906b237a..53173ba047 100644 --- a/compiler/utils/Digraph.hs +++ b/compiler/utils/Digraph.hs @@ -16,7 +16,7 @@ module Digraph( findCycle, - -- For backwards compatability with the simpler version of Digraph + -- For backwards compatibility with the simpler version of Digraph stronglyConnCompFromEdgedVerticesOrd, stronglyConnCompFromEdgedVerticesOrdR, stronglyConnCompFromEdgedVerticesUniq, @@ -286,7 +286,7 @@ decodeSccs Graph { gr_int_graph = graph, gr_vertex_to_node = vertex_fn } forest mentions_itself v = v `elem` (graph ! v) --- The following two versions are provided for backwards compatability: +-- The following two versions are provided for backwards compatibility: -- See Note [Deterministic SCC] -- See Note [reduceNodesIntoVertices implementations] stronglyConnCompFromEdgedVerticesOrd @@ -297,7 +297,7 @@ stronglyConnCompFromEdgedVerticesOrd = map (fmap get_node) . stronglyConnCompFromEdgedVerticesOrdR where get_node (n, _, _) = n --- The following two versions are provided for backwards compatability: +-- The following two versions are provided for backwards compatibility: -- See Note [Deterministic SCC] -- See Note [reduceNodesIntoVertices implementations] stronglyConnCompFromEdgedVerticesUniq |