summaryrefslogtreecommitdiff
path: root/testsuite/tests/typecheck/should_compile/constraint_hole_fits.stderr
blob: 65e213a21b0cf230664c040b1a6e23334350777c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

constraint_hole_fits.hs:4:5: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
    • Found hole: _ :: [a] -> a
      Where: ‘a’ is a rigid type variable bound by
               the type signature for:
                 g :: forall a. Ord a => [a] -> a
               at constraint_hole_fits.hs:3:1-22
    • In an equation for ‘g’: g = _
    • Relevant bindings include
        g :: [a] -> a (bound at constraint_hole_fits.hs:4:1)
      Constraints include Ord a (from constraint_hole_fits.hs:3:1-22)
      Valid hole fits include
        g :: [a] -> a
        head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
        last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
        maximum :: forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
        minimum :: forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
      Valid refinement hole fits include
        foldl1 (_ :: a -> a -> a)
          where foldl1 :: forall (t :: * -> *) a.
                          Foldable t =>
                          (a -> a -> a) -> t a -> a
        foldr1 (_ :: a -> a -> a)
          where foldr1 :: forall (t :: * -> *) a.
                          Foldable t =>
                          (a -> a -> a) -> t a -> a
        foldl (_ :: a -> a -> a) (_ :: a)
          where foldl :: forall (t :: * -> *) b a.
                         Foldable t =>
                         (b -> a -> b) -> b -> t a -> b
        foldr (_ :: a -> a -> a) (_ :: a)
          where foldr :: forall (t :: * -> *) a b.
                         Foldable t =>
                         (a -> b -> b) -> b -> t a -> b
        const (_ :: a)
          where const :: forall a b. a -> b -> a
        ($) (_ :: [a] -> a)
          where ($) :: forall a b. (a -> b) -> a -> b
        return (_ :: a)
          where return :: forall (m :: * -> *) a. Monad m => a -> m a
        pure (_ :: a)
          where pure :: forall (f :: * -> *) a. Applicative f => a -> f a
        ($!) (_ :: [a] -> a)
          where ($!) :: forall a b. (a -> b) -> a -> b
        id (_ :: [a] -> a)
          where id :: forall a. a -> a
        head (_ :: [[a] -> a])
          where head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
        last (_ :: [[a] -> a])
          where last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
        asTypeOf (_ :: [a] -> a) (_ :: [a] -> a)
          where asTypeOf :: forall a. a -> a -> a
        (!!) (_ :: [[a] -> a]) (_ :: Int)
          where (!!) :: forall a.
                        GHC.Stack.Types.HasCallStack =>
                        [a] -> Int -> a