@@ -34,10 +34,10 @@ import Unsafe.Coerce (unsafeCoerce)
34
34
-- | get (Proxy :: Proxy "x") :: forall r a. { x :: a | r } -> a
35
35
-- | ```
36
36
get
37
- :: forall proxy r r' l a
37
+ :: forall r r' l a
38
38
. IsSymbol l
39
39
=> Cons l a r' r
40
- => proxy l
40
+ => Proxy l
41
41
-> Record r
42
42
-> a
43
43
get l r = unsafeGet (reflectSymbol l) r
@@ -52,11 +52,11 @@ get l r = unsafeGet (reflectSymbol l) r
52
52
-- | :: forall r a b. a -> { x :: b | r } -> { x :: a | r }
53
53
-- | ```
54
54
set
55
- :: forall proxy r1 r2 r l a b
55
+ :: forall r1 r2 r l a b
56
56
. IsSymbol l
57
57
=> Cons l a r r1
58
58
=> Cons l b r r2
59
- => proxy l
59
+ => Proxy l
60
60
-> b
61
61
-> Record r1
62
62
-> Record r2
@@ -72,11 +72,11 @@ set l b r = unsafeSet (reflectSymbol l) b r
72
72
-- | :: forall r a b. (a -> b) -> { x :: a | r } -> { x :: b | r }
73
73
-- | ```
74
74
modify
75
- :: forall proxy r1 r2 r l a b
75
+ :: forall r1 r2 r l a b
76
76
. IsSymbol l
77
77
=> Cons l a r r1
78
78
=> Cons l b r r2
79
- => proxy l
79
+ => Proxy l
80
80
-> (a -> b )
81
81
-> Record r1
82
82
-> Record r2
@@ -92,11 +92,11 @@ modify l f r = set l (f (get l r)) r
92
92
-- | :: forall r a. Lacks "x" r => a -> { | r } -> { x :: a | r }
93
93
-- | ```
94
94
insert
95
- :: forall proxy r1 r2 l a
95
+ :: forall r1 r2 l a
96
96
. IsSymbol l
97
97
=> Lacks l r1
98
98
=> Cons l a r1 r2
99
- => proxy l
99
+ => Proxy l
100
100
-> a
101
101
-> Record r1
102
102
-> Record r2
@@ -115,11 +115,11 @@ insert l a r = unsafeSet (reflectSymbol l) a r
115
115
-- | :: forall r a. Lacks "x" r => { x :: a | r } -> { | r }
116
116
-- | ```
117
117
delete
118
- :: forall proxy r1 r2 l a
118
+ :: forall r1 r2 l a
119
119
. IsSymbol l
120
120
=> Lacks l r1
121
121
=> Cons l a r1 r2
122
- => proxy l
122
+ => Proxy l
123
123
-> Record r2
124
124
-> Record r1
125
125
delete l r = unsafeDelete (reflectSymbol l) r
@@ -136,15 +136,15 @@ delete l r = unsafeDelete (reflectSymbol l) r
136
136
-- | rename (Proxy :: Proxy "x") (Proxy :: Proxy "y")
137
137
-- | :: forall a r. Lacks "x" r => Lacks "y" r => { x :: a | r} -> { y :: a | r}
138
138
-- | ```
139
- rename :: forall proxy prev next ty input inter output
139
+ rename :: forall prev next ty input inter output
140
140
. IsSymbol prev
141
141
=> IsSymbol next
142
142
=> Cons prev ty inter input
143
143
=> Lacks prev inter
144
144
=> Cons next ty inter output
145
145
=> Lacks next inter
146
- => proxy prev
147
- -> proxy next
146
+ => Proxy prev
147
+ -> Proxy next
148
148
-> Record input
149
149
-> Record output
150
150
rename prev next record =
@@ -224,7 +224,7 @@ equal
224
224
equal a b = equalFields (Proxy :: Proxy rs ) a b
225
225
226
226
class EqualFields (rs :: RowList Type ) (row :: Row Type ) | rs -> row where
227
- equalFields :: forall rlproxy . rlproxy rs -> Record row -> Record row -> Boolean
227
+ equalFields :: Proxy rs -> Record row -> Record row -> Boolean
228
228
229
229
instance equalFieldsCons
230
230
::
0 commit comments