summaryrefslogtreecommitdiff
path: root/compiler/utils/Digraph.hs
diff options
context:
space:
mode:
authorBrian Wignall <brianwignall@gmail.com>2019-12-19 09:11:42 -0500
committerMarge Bot <ben+marge-bot@smart-cactus.org>2020-01-04 15:55:06 -0500
commit3c9dc06ba2034e867c9169e60e854539875654fd (patch)
treef06e599ca380ee9ad599918b2ae4c78cd4afce2b /compiler/utils/Digraph.hs
parentb2e0323f318959c879629ef277f6433b44473c4b (diff)
downloadhaskell-3c9dc06ba2034e867c9169e60e854539875654fd.tar.gz
Fix typos, via a Levenshtein-style corrector
Diffstat (limited to 'compiler/utils/Digraph.hs')
-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 c205c45d8d..49ded1b23f 100644
--- a/compiler/utils/Digraph.hs
+++ b/compiler/utils/Digraph.hs
@@ -464,7 +464,7 @@ instance Outputable EdgeType where
newtype Time = Time Int deriving (Eq,Ord,Num,Outputable)
---Allow for specialzation
+--Allow for specialization
{-# INLINEABLE classifyEdges #-}
-- | Given a start vertex, a way to get successors from a node