diff options
| author | Brian Wignall <brianwignall@gmail.com> | 2019-11-08 16:21:03 -0500 |
|---|---|---|
| committer | Brian Wignall <brianwignall@gmail.com> | 2019-11-23 19:04:52 -0500 |
| commit | 7b4c7b75be351e9b6a40093cbccab728dd89064f (patch) | |
| tree | 01126ac3823a1f1b197ac1865d7bc628eb4676a5 /compiler/nativeGen/BlockLayout.hs | |
| parent | c14b723f7fa24b4db0b561f9ab0d6e0f4261fd2f (diff) | |
| download | haskell-7b4c7b75be351e9b6a40093cbccab728dd89064f.tar.gz | |
Fix typos
Diffstat (limited to 'compiler/nativeGen/BlockLayout.hs')
| -rw-r--r-- | compiler/nativeGen/BlockLayout.hs | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/compiler/nativeGen/BlockLayout.hs b/compiler/nativeGen/BlockLayout.hs index 56e3177dd8..d8b844c32b 100644 --- a/compiler/nativeGen/BlockLayout.hs +++ b/compiler/nativeGen/BlockLayout.hs @@ -359,7 +359,7 @@ takeL n (BlockChain blks) = -- While we could take into account the space between the two blocks which -- share an edge this blows up compile times quite a bit. It requires -- us to find all edges between two chains, check the distance for all edges, --- rank them based on the distance and and only then we can select two chains +-- rank them based on the distance and only then we can select two chains -- to combine. Which would add a lot of complexity for little gain. -- -- So instead we just rank by the strength of the edge and use the first pair we @@ -891,4 +891,3 @@ lookupDeleteUFM :: Uniquable key => UniqFM elt -> key lookupDeleteUFM m k = do -- Maybe monad v <- lookupUFM m k return (v, delFromUFM m k) - |