diff options
| author | Oleg Grenrus <oleg.grenrus@iki.fi> | 2021-05-26 05:03:52 +0300 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2021-12-12 12:52:18 -0500 |
| commit | 31bf380f3925d72a3369978d28d02aaae31f75ef (patch) | |
| tree | 38afd6818f3f4661c7ec2f560bd249b3408e021a /testsuite/tests/typecheck/should_compile/holes3.stderr | |
| parent | 93783e6a8765e1410d0a14fd5249a995c6759308 (diff) | |
| download | haskell-31bf380f3925d72a3369978d28d02aaae31f75ef.tar.gz | |
Use HasCallStack and error in GHC.List and .NonEmpty
In addition to providing stack traces, the scary HasCallStack will
hopefully make people think whether they want to use these functions,
i.e. act as a documentation hint that something weird might happen.
A single metric increased, which doesn't visibly
use any method with `HasCallStack`.
-------------------------
Metric Decrease:
T9630
Metric Decrease:
T19695
T9630
-------------------------
Diffstat (limited to 'testsuite/tests/typecheck/should_compile/holes3.stderr')
| -rw-r--r-- | testsuite/tests/typecheck/should_compile/holes3.stderr | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/testsuite/tests/typecheck/should_compile/holes3.stderr b/testsuite/tests/typecheck/should_compile/holes3.stderr index 448f89009e..4dec2c57a5 100644 --- a/testsuite/tests/typecheck/should_compile/holes3.stderr +++ b/testsuite/tests/typecheck/should_compile/holes3.stderr @@ -98,15 +98,15 @@ holes3.hs:11:15: error: id :: forall a. a -> a until :: forall a. (a -> Bool) -> (a -> a) -> a -> a ioError :: forall a. IOError -> IO a - (!!) :: forall a. [a] -> Int -> a + (!!) :: forall a. GHC.Stack.Types.HasCallStack => [a] -> Int -> a break :: forall a. (a -> Bool) -> [a] -> ([a], [a]) - cycle :: forall a. [a] -> [a] + cycle :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a] drop :: forall a. Int -> [a] -> [a] dropWhile :: forall a. (a -> Bool) -> [a] -> [a] - head :: forall a. [a] -> a - init :: forall a. [a] -> [a] + head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a + init :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a] iterate :: forall a. (a -> a) -> a -> [a] - last :: forall a. [a] -> a + last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a repeat :: forall a. a -> [a] replicate :: forall a. Int -> a -> [a] reverse :: forall a. [a] -> [a] @@ -114,7 +114,7 @@ holes3.hs:11:15: error: scanr1 :: forall a. (a -> a -> a) -> [a] -> [a] span :: forall a. (a -> Bool) -> [a] -> ([a], [a]) splitAt :: forall a. Int -> [a] -> ([a], [a]) - tail :: forall a. [a] -> [a] + tail :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a] take :: forall a. Int -> [a] -> [a] takeWhile :: forall a. (a -> Bool) -> [a] -> [a] subtract :: forall a. Num a => a -> a -> a |