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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
|
type_in_type_hole_fits.hs:79:11: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
• Found hole:
_a :: [Integer] -> Sorted (O ('NLogN 2 0)) (O N) 'True Integer
Or perhaps ‘_a’ is mis-spelled, or not in scope
• In the expression: _a [3, 1, 2]
In an equation for ‘mySortA’: mySortA = _a [3, 1, 2]
• Relevant bindings include
mySortA :: Sorted (O (N ^. 2)) (O N) 'True Integer
(bound at type_in_type_hole_fits.hs:79:1)
Valid hole fits include
Sorted :: forall (cpu :: AsympPoly) (mem :: AsympPoly)
(stable :: Bool) a.
[a] -> Sorted cpu mem stable a
with Sorted @(O ('NLogN 2 0)) @(O N) @'True @Integer
(defined at type_in_type_hole_fits.hs:54:18)
mergeSort :: forall a (n :: AsympPoly) (m :: AsympPoly)
(s :: Bool).
(Ord a, n >=. O (N *. LogN), m >=. O N, IsStable s) =>
[a] -> Sorted n m s a
with mergeSort @Integer @(O ('NLogN 2 0)) @(O N) @'True
(defined at type_in_type_hole_fits.hs:61:1)
insertionSort :: forall a (n :: AsympPoly) (m :: AsympPoly)
(s :: Bool).
(Ord a, n >=. O (N ^. 2), m >=. O One, IsStable s) =>
[a] -> Sorted n m s a
with insertionSort @Integer @(O ('NLogN 2 0)) @(O N) @'True
(defined at type_in_type_hole_fits.hs:65:1)
type_in_type_hole_fits.hs:82:11: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
• Found hole:
_b :: [Integer] -> Sorted (O ('NLogN 1 1)) (O N) 'False Integer
Or perhaps ‘_b’ is mis-spelled, or not in scope
• In the expression: _b [3, 1, 2]
In an equation for ‘mySortB’: mySortB = _b [3, 1, 2]
• Relevant bindings include
mySortB :: Sorted (O (N *. LogN)) (O N) 'False Integer
(bound at type_in_type_hole_fits.hs:82:1)
Valid hole fits include
quickSort :: forall a (n :: AsympPoly) (m :: AsympPoly).
(Ord a, n >=. O (N *. LogN), m >=. O N) =>
[a] -> Sorted n m 'False a
with quickSort @Integer @(O ('NLogN 1 1)) @(O N)
(defined at type_in_type_hole_fits.hs:71:1)
heapSort :: forall a (n :: AsympPoly) (m :: AsympPoly).
(Ord a, n >=. O (N *. LogN), m >=. O One) =>
[a] -> Sorted n m 'False a
with heapSort @Integer @(O ('NLogN 1 1)) @(O N)
(defined at type_in_type_hole_fits.hs:74:1)
Sorted :: forall (cpu :: AsympPoly) (mem :: AsympPoly)
(stable :: Bool) a.
[a] -> Sorted cpu mem stable a
with Sorted @(O ('NLogN 1 1)) @(O N) @'False @Integer
(defined at type_in_type_hole_fits.hs:54:18)
mergeSort :: forall a (n :: AsympPoly) (m :: AsympPoly)
(s :: Bool).
(Ord a, n >=. O (N *. LogN), m >=. O N, IsStable s) =>
[a] -> Sorted n m s a
with mergeSort @Integer @(O ('NLogN 1 1)) @(O N) @'False
(defined at type_in_type_hole_fits.hs:61:1)
type_in_type_hole_fits.hs:85:11: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
• Found hole:
_c :: [Integer] -> Sorted (O ('NLogN 1 1)) (O One) 'False Integer
Or perhaps ‘_c’ is mis-spelled, or not in scope
• In the expression: _c [3, 1, 2]
In an equation for ‘mySortC’: mySortC = _c [3, 1, 2]
• Relevant bindings include
mySortC :: Sorted (O (N *. LogN)) (O One) 'False Integer
(bound at type_in_type_hole_fits.hs:85:1)
Valid hole fits include
heapSort :: forall a (n :: AsympPoly) (m :: AsympPoly).
(Ord a, n >=. O (N *. LogN), m >=. O One) =>
[a] -> Sorted n m 'False a
with heapSort @Integer @(O ('NLogN 1 1)) @(O One)
(defined at type_in_type_hole_fits.hs:74:1)
Sorted :: forall (cpu :: AsympPoly) (mem :: AsympPoly)
(stable :: Bool) a.
[a] -> Sorted cpu mem stable a
with Sorted @(O ('NLogN 1 1)) @(O One) @'False @Integer
(defined at type_in_type_hole_fits.hs:54:18)
|
