summaryrefslogtreecommitdiff
path: root/testsuite/tests/module/T13622.hs
diff options
context:
space:
mode:
authorMatthew Pickering <matthewtpickering@gmail.com>2017-05-04 14:15:43 -0400
committerBen Gamari <ben@smart-cactus.org>2017-05-04 18:20:45 -0400
commit1829d265662ca8d052df3e5df1aa1137b19e39ce (patch)
treebfccc2863d63608bc5307634cdafb7304f742bba /testsuite/tests/module/T13622.hs
parent74f31539ce48a218922368ca62e1c3c6023f27a8 (diff)
downloadhaskell-1829d265662ca8d052df3e5df1aa1137b19e39ce.tar.gz
Implement sequential name lookup properly
Previously we would run all the monadic actions and then combine their results. This caused problems if later actions raised errors but earlier lookups suceeded. We only want to run later lookups if the earlier ones fail. Fixes #13622 Reviewers: RyanGlScott, austin, bgamari, simonpj Reviewed By: simonpj Subscribers: simonpj, rwbarton, thomie GHC Trac Issues: #13622 Differential Revision: https://phabricator.haskell.org/D3515
Diffstat (limited to 'testsuite/tests/module/T13622.hs')
-rw-r--r--testsuite/tests/module/T13622.hs5
1 files changed, 5 insertions, 0 deletions
diff --git a/testsuite/tests/module/T13622.hs b/testsuite/tests/module/T13622.hs
new file mode 100644
index 0000000000..037283ee57
--- /dev/null
+++ b/testsuite/tests/module/T13622.hs
@@ -0,0 +1,5 @@
+module Bug (Bits(Bits)) where
+
+import qualified Data.Bits as Bits
+
+newtype Bits = Bits Int