git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Update generated docs
38bacfbGary Burgess
docs/source/prelude.rst+128−64
compare with golang
unifiedsplit
@@ -9,10 +9,13 @@ Types
9
9
10::
10::
11
11
12− data Ordering where
12+ data Ordering where
13− LT :: Ordering
13+ LT :: Ordering
14− GT :: Ordering
14+ GT :: Ordering
15− EQ :: Ordering
15+ EQ :: Ordering
16+
17+ data Unit where
18+ Unit :: { } -> Unit
16
19
17Type Classes
20Type Classes
18~~~~~~~~~~~~
21~~~~~~~~~~~~
@@ -40,9 +43,9 @@ Type Classes
40 (&) :: b -> b -> b
43 (&) :: b -> b -> b
41 (|) :: b -> b -> b
44 (|) :: b -> b -> b
42 (^) :: b -> b -> b
45 (^) :: b -> b -> b
43− shl :: b -> Prim.Number -> b
46+ shl :: b -> Number -> b
44− shr :: b -> Prim.Number -> b
47+ shr :: b -> Number -> b
45− zshr :: b -> Prim.Number -> b
48+ zshr :: b -> Number -> b
46 complement :: b -> b
49 complement :: b -> b
47
50
48 class BoolLike b where
51 class BoolLike b where
@@ -54,8 +57,8 @@ Type Classes
54 id :: forall t. a t t
57 id :: forall t. a t t
55
58
56 class Eq a where
59 class Eq a where
57− (==) :: a -> a -> Prim.Boolean
60+ (==) :: a -> a -> Boolean
58− (/=) :: a -> a -> Prim.Boolean
61+ (/=) :: a -> a -> Boolean
59
62
60 class Functor f where
63 class Functor f where
61 (<$>) :: forall a b. (a -> b) -> f a -> f b
64 (<$>) :: forall a b. (a -> b) -> f a -> f b
@@ -80,46 +83,72 @@ Type Classes
80 (<<<) :: forall b c d. a c d -> a b c -> a b d
83 (<<<) :: forall b c d. a c d -> a b c -> a b d
81
84
82 class Show a where
85 class Show a where
83− show :: a -> Prim.String
86+ show :: a -> String
84
87
85Type Class Instances
88Type Class Instances
86~~~~~~~~~~~~~~~~~~~~
89~~~~~~~~~~~~~~~~~~~~
87
90
88::
91::
89
92
93+ instance applicativeArr :: Applicative (Prim.Function r)
94+
95+ instance applyArr :: Apply (Prim.Function r)
96+
97+ instance bindArr :: Bind (Prim.Function r)
98+
90− instance bitsNumber :: Bits Prim.Number
99+ instance bitsNumber :: Bits Number
91
100
92− instance boolLikeBoolean :: BoolLike Prim.Boolean
101+ instance boolLikeBoolean :: BoolLike Boolean
93
102
94 instance categoryArr :: Category Prim.Function
103 instance categoryArr :: Category Prim.Function
95
104
96 instance eqArray :: (Eq a) => Eq [a]
105 instance eqArray :: (Eq a) => Eq [a]
97
106
98− instance eqBoolean :: Eq Prim.Boolean
107+ instance eqBoolean :: Eq Boolean
99
108
100− instance eqNumber :: Eq Prim.Number
109+ instance eqNumber :: Eq Number
101
110
102 instance eqOrdering :: Eq Ordering
111 instance eqOrdering :: Eq Ordering
103
112
104− instance eqString :: Eq Prim.String
113+ instance eqString :: Eq String
114+
115+ instance eqUnit :: Eq Unit
116+
117+ instance functorArr :: Functor (Prim.Function r)
118+
119+ instance monadArr :: Monad (Prim.Function r)
120+
121+ instance numNumber :: Num Number
122+
123+ instance ordArray :: (Ord a) => Ord [a]
124+
125+ instance ordBoolean :: Ord Boolean
126+
127+ instance ordNumber :: Ord Number
128+
129+ instance ordString :: Ord String
130+
131+ instance ordUnit :: Ord Unit
105
132
106− instance numNumber :: Num Prim.Number
133+ instance semigroupArr :: (Semigroup s') => Semigroup (s -> s')
107
134
108− instance ordNumber :: Ord Prim.Number
135+ instance semigroupString :: Semigroup String
109
136
110− instance semigroupString :: Semigroup Prim.String
137+ instance semigroupUnit :: Semigroup Unit
111
138
112 instance semigroupoidArr :: Semigroupoid Prim.Function
139 instance semigroupoidArr :: Semigroupoid Prim.Function
113
140
114 instance showArray :: (Show a) => Show [a]
141 instance showArray :: (Show a) => Show [a]
115
142
116− instance showBoolean :: Show Prim.Boolean
143+ instance showBoolean :: Show Boolean
117
144
118− instance showNumber :: Show Prim.Number
145+ instance showNumber :: Show Number
119
146
120 instance showOrdering :: Show Ordering
147 instance showOrdering :: Show Ordering
121
148
122− instance showString :: Show Prim.String
149+ instance showString :: Show String
150+
151+ instance showUnit :: Show Unit
123
152
124Values
153Values
125~~~~~~
154~~~~~~
@@ -134,13 +163,13 @@ Values
134
163
135 (:) :: forall a. a -> [a] -> [a]
164 (:) :: forall a. a -> [a] -> [a]
136
165
137− (<) :: forall a. (Ord a) => a -> a -> Prim.Boolean
166+ (<) :: forall a. (Ord a) => a -> a -> Boolean
138
167
139− (<=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
168+ (<=) :: forall a. (Ord a) => a -> a -> Boolean
140
169
141− (>) :: forall a. (Ord a) => a -> a -> Prim.Boolean
170+ (>) :: forall a. (Ord a) => a -> a -> Boolean
142
171
143− (>=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
172+ (>=) :: forall a. (Ord a) => a -> a -> Boolean
144
173
145 (>>>) :: forall a b c d. (Semigroupoid a) => a b c -> a c d -> a b d
174 (>>>) :: forall a b c d. (Semigroupoid a) => a b c -> a c d -> a b d
146
175
@@ -148,14 +177,6 @@ Values
148
177
149 asTypeOf :: forall a. a -> a -> a
178 asTypeOf :: forall a. a -> a -> a
150
179
151− boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
152−
153− boolNot :: Prim.Boolean -> Prim.Boolean
154−
155− boolOr :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
156−
157− concatString :: Prim.String -> Prim.String -> Prim.String
158−
159 cons :: forall a. a -> [a] -> [a]
180 cons :: forall a. a -> [a] -> [a]
160
181
161 const :: forall a b. a -> b -> a
182 const :: forall a b. a -> b -> a
@@ -166,56 +187,97 @@ Values
166
187
167 liftM1 :: forall m a b. (Monad m) => (a -> b) -> m a -> m b
188 liftM1 :: forall m a b. (Monad m) => (a -> b) -> m a -> m b
168
189
169− numAdd :: Prim.Number -> Prim.Number -> Prim.Number
190+ refEq :: forall a. a -> a -> Boolean
170−
171− numAnd :: Prim.Number -> Prim.Number -> Prim.Number
172−
173− numCompare :: Prim.Number -> Prim.Number -> Ordering
174
191
175− numComplement :: Prim.Number -> Prim.Number
192+ refIneq :: forall a. a -> a -> Boolean
176
193
177− numDiv :: Prim.Number -> Prim.Number -> Prim.Number
194+ return :: forall m a. (Monad m) => a -> m a
178
195
179− numMod :: Prim.Number -> Prim.Number -> Prim.Number
196+ unit :: Unit
180
197
181− numMul :: Prim.Number -> Prim.Number -> Prim.Number
198+ void :: forall f a. (Functor f) => f a -> f Unit
182
199
183− numNegate :: Prim.Number -> Prim.Number
200+Module Data.Function
201+--------------------
184
202
185− numOr :: Prim.Number -> Prim.Number -> Prim.Number
203+Types
204+~~~~~
186
205
187− numShl :: Prim.Number -> Prim.Number -> Prim.Number
206+::
188
207
189− numShr :: Prim.Number -> Prim.Number -> Prim.Number
208+ data Fn0 :: * -> *
190
209
191− numSub :: Prim.Number -> Prim.Number -> Prim.Number
210+ data Fn1 :: * -> * -> *
192
211
193− numXor :: Prim.Number -> Prim.Number -> Prim.Number
212+ data Fn10 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
194
213
195− numZshr :: Prim.Number -> Prim.Number -> Prim.Number
214+ data Fn2 :: * -> * -> * -> *
196
215
197− refEq :: forall a. a -> a -> Prim.Boolean
216+ data Fn3 :: * -> * -> * -> * -> *
198
217
199− refIneq :: forall a. a -> a -> Prim.Boolean
218+ data Fn4 :: * -> * -> * -> * -> * -> *
200
219
201− return :: forall m a. (Monad m) => a -> m a
220+ data Fn5 :: * -> * -> * -> * -> * -> * -> *
202
221
203− showArrayImpl :: forall a. (a -> Prim.String) -> [a] -> Prim.String
222+ data Fn6 :: * -> * -> * -> * -> * -> * -> * -> *
204
223
205− showNumberImpl :: Prim.Number -> Prim.String
224+ data Fn7 :: * -> * -> * -> * -> * -> * -> * -> * -> *
206
225
207− showStringImpl :: Prim.String -> Prim.String
226+ data Fn8 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> *
208
227
209−Module Data.Function
228+ data Fn9 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
210−--------------------
211
229
212Values
230Values
213~~~~~~
231~~~~~~
214
232
215::
233::
216
234
235+ mkFn0 :: forall a. (Unit -> a) -> Fn0 a
236+
237+ mkFn1 :: forall a b. (a -> b) -> Fn1 a b
238+
239+ mkFn10 :: forall a b c d e f g h i j k. (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k) -> Fn10 a b c d e f g h i j k
240+
241+ mkFn2 :: forall a b c. (a -> b -> c) -> Fn2 a b c
242+
243+ mkFn3 :: forall a b c d. (a -> b -> c -> d) -> Fn3 a b c d
244+
245+ mkFn4 :: forall a b c d e. (a -> b -> c -> d -> e) -> Fn4 a b c d e
246+
247+ mkFn5 :: forall a b c d e f. (a -> b -> c -> d -> e -> f) -> Fn5 a b c d e f
248+
249+ mkFn6 :: forall a b c d e f g. (a -> b -> c -> d -> e -> f -> g) -> Fn6 a b c d e f g
250+
251+ mkFn7 :: forall a b c d e f g h. (a -> b -> c -> d -> e -> f -> g -> h) -> Fn7 a b c d e f g h
252+
253+ mkFn8 :: forall a b c d e f g h i. (a -> b -> c -> d -> e -> f -> g -> h -> i) -> Fn8 a b c d e f g h i
254+
255+ mkFn9 :: forall a b c d e f g h i j. (a -> b -> c -> d -> e -> f -> g -> h -> i -> j) -> Fn9 a b c d e f g h i j
256+
217 on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
257 on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
218
258
259+ runFn0 :: forall a. Fn0 a -> a
260+
261+ runFn1 :: forall a b. Fn1 a b -> a -> b
262+
263+ runFn10 :: forall a b c d e f g h i j k. Fn10 a b c d e f g h i j k -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k
264+
265+ runFn2 :: forall a b c. Fn2 a b c -> a -> b -> c
266+
267+ runFn3 :: forall a b c d. Fn3 a b c d -> a -> b -> c -> d
268+
269+ runFn4 :: forall a b c d e. Fn4 a b c d e -> a -> b -> c -> d -> e
270+
271+ runFn5 :: forall a b c d e f. Fn5 a b c d e f -> a -> b -> c -> d -> e -> f
272+
273+ runFn6 :: forall a b c d e f g. Fn6 a b c d e f g -> a -> b -> c -> d -> e -> f -> g
274+
275+ runFn7 :: forall a b c d e f g h. Fn7 a b c d e f g h -> a -> b -> c -> d -> e -> f -> g -> h
276+
277+ runFn8 :: forall a b c d e f g h i. Fn8 a b c d e f g h i -> a -> b -> c -> d -> e -> f -> g -> h -> i
278+
279+ runFn9 :: forall a b c d e f g h i j. Fn9 a b c d e f g h i j -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j
280+
219Module Data.Eq
281Module Data.Eq
220--------------
282--------------
221
283
@@ -234,6 +296,8 @@ Type Class Instances
234
296
235 instance eqRef :: Eq (Ref a)
297 instance eqRef :: Eq (Ref a)
236
298
299+ instance functorRef :: Functor Ref
300+
237Values
301Values
238~~~~~~
302~~~~~~
239
303
@@ -249,7 +313,7 @@ Values
249
313
250::
314::
251
315
252− unsafeIndex :: forall a. [a] -> Prim.Number -> a
316+ unsafeIndex :: forall a. [a] -> Number -> a
253
317
254Module Control.Monad.Eff
318Module Control.Monad.Eff
255------------------------
319------------------------
@@ -285,7 +349,7 @@ Values
285
349
286 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
350 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
287
351
288− forE :: forall e. Prim.Number -> Prim.Number -> (Prim.Number -> Eff e Unit) -> Eff e Unit
352+ forE :: forall e. Number -> Number -> (Number -> Eff e Unit) -> Eff e Unit
289
353
290 foreachE :: forall e a. [a] -> (a -> Eff e Unit) -> Eff e Unit
354 foreachE :: forall e a. [a] -> (a -> Eff e Unit) -> Eff e Unit
291
355
@@ -293,9 +357,9 @@ Values
293
357
294 runPure :: forall a. Pure a -> a
358 runPure :: forall a. Pure a -> a
295
359
296− untilE :: forall e. Eff e Prim.Boolean -> Eff e Unit
360+ untilE :: forall e. Eff e Boolean -> Eff e Unit
297
361
298− whileE :: forall e a. Eff e Prim.Boolean -> Eff e a -> Eff e Unit
362+ whileE :: forall e a. Eff e Boolean -> Eff e a -> Eff e Unit
299
363
300Module Control.Monad.Eff.Unsafe
364Module Control.Monad.Eff.Unsafe
301-------------------------------
365-------------------------------
@@ -324,7 +388,7 @@ Values
324
388
325 print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) Unit
389 print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) Unit
326
390
327− trace :: forall r. Prim.String -> Eff (trace :: Trace | r) Unit
391+ trace :: forall r. String -> Eff (trace :: Trace | r) Unit
328
392
329Module Control.Monad.ST
393Module Control.Monad.ST
330-----------------------
394-----------------------
@@ -347,13 +411,13 @@ Values
347
411
348 modifySTRef :: forall a h r. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
412 modifySTRef :: forall a h r. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
349
413
350− newSTArray :: forall a h r. Prim.Number -> a -> Eff (st :: ST h | r) (STArray h a)
414+ newSTArray :: forall a h r. Number -> a -> Eff (st :: ST h | r) (STArray h a)
351
415
352 newSTRef :: forall a h r. a -> Eff (st :: ST h | r) (STRef h a)
416 newSTRef :: forall a h r. a -> Eff (st :: ST h | r) (STRef h a)
353
417
354 peekSTArray :: forall a h r. STArray h a -> Eff (st :: ST h | r) a
418 peekSTArray :: forall a h r. STArray h a -> Eff (st :: ST h | r) a
355
419
356− pokeSTArray :: forall a h r. STArray h a -> Prim.Number -> a -> Eff (st :: ST h | r) a
420+ pokeSTArray :: forall a h r. STArray h a -> Number -> a -> Eff (st :: ST h | r) a
357
421
358 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
422 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
359
423
prelude/README.md+126−64
@@ -4,10 +4,13 @@
4
4
5### Types
5### Types
6
6
7− data Ordering where
7+ data Ordering where
8− LT :: Ordering
8+ LT :: Ordering
9− GT :: Ordering
9+ GT :: Ordering
10− EQ :: Ordering
10+ EQ :: Ordering
11+
12+ data Unit where
13+ Unit :: { } -> Unit
11
14
12
15
13### Type Classes
16### Type Classes
@@ -31,9 +34,9 @@
31 (&) :: b -> b -> b
34 (&) :: b -> b -> b
32 (|) :: b -> b -> b
35 (|) :: b -> b -> b
33 (^) :: b -> b -> b
36 (^) :: b -> b -> b
34− shl :: b -> Prim.Number -> b
37+ shl :: b -> Number -> b
35− shr :: b -> Prim.Number -> b
38+ shr :: b -> Number -> b
36− zshr :: b -> Prim.Number -> b
39+ zshr :: b -> Number -> b
37 complement :: b -> b
40 complement :: b -> b
38
41
39 class BoolLike b where
42 class BoolLike b where
@@ -45,8 +48,8 @@
45 id :: forall t. a t t
48 id :: forall t. a t t
46
49
47 class Eq a where
50 class Eq a where
48− (==) :: a -> a -> Prim.Boolean
51+ (==) :: a -> a -> Boolean
49− (/=) :: a -> a -> Prim.Boolean
52+ (/=) :: a -> a -> Boolean
50
53
51 class Functor f where
54 class Functor f where
52 (<$>) :: forall a b. (a -> b) -> f a -> f b
55 (<$>) :: forall a b. (a -> b) -> f a -> f b
@@ -71,44 +74,70 @@
71 (<<<) :: forall b c d. a c d -> a b c -> a b d
74 (<<<) :: forall b c d. a c d -> a b c -> a b d
72
75
73 class Show a where
76 class Show a where
74− show :: a -> Prim.String
77+ show :: a -> String
75
78
76
79
77### Type Class Instances
80### Type Class Instances
78
81
79− instance bitsNumber :: Bits Prim.Number
82+ instance applicativeArr :: Applicative (Prim.Function r)
83+
84+ instance applyArr :: Apply (Prim.Function r)
85+
86+ instance bindArr :: Bind (Prim.Function r)
80
87
88+ instance bitsNumber :: Bits Number
89+
81− instance boolLikeBoolean :: BoolLike Prim.Boolean
90+ instance boolLikeBoolean :: BoolLike Boolean
82
91
83 instance categoryArr :: Category Prim.Function
92 instance categoryArr :: Category Prim.Function
84
93
85 instance eqArray :: (Eq a) => Eq [a]
94 instance eqArray :: (Eq a) => Eq [a]
86
95
87− instance eqBoolean :: Eq Prim.Boolean
96+ instance eqBoolean :: Eq Boolean
88
97
89− instance eqNumber :: Eq Prim.Number
98+ instance eqNumber :: Eq Number
90
99
91 instance eqOrdering :: Eq Ordering
100 instance eqOrdering :: Eq Ordering
92
101
93− instance eqString :: Eq Prim.String
102+ instance eqString :: Eq String
103+
104+ instance eqUnit :: Eq Unit
105+
106+ instance functorArr :: Functor (Prim.Function r)
107+
108+ instance monadArr :: Monad (Prim.Function r)
109+
110+ instance numNumber :: Num Number
111+
112+ instance ordArray :: (Ord a) => Ord [a]
113+
114+ instance ordBoolean :: Ord Boolean
115+
116+ instance ordNumber :: Ord Number
117+
118+ instance ordString :: Ord String
94
119
95− instance numNumber :: Num Prim.Number
120+ instance ordUnit :: Ord Unit
96
121
97− instance ordNumber :: Ord Prim.Number
122+ instance semigroupArr :: (Semigroup s') => Semigroup (s -> s')
98
123
99− instance semigroupString :: Semigroup Prim.String
124+ instance semigroupString :: Semigroup String
125+
126+ instance semigroupUnit :: Semigroup Unit
100
127
101 instance semigroupoidArr :: Semigroupoid Prim.Function
128 instance semigroupoidArr :: Semigroupoid Prim.Function
102
129
103 instance showArray :: (Show a) => Show [a]
130 instance showArray :: (Show a) => Show [a]
104
131
105− instance showBoolean :: Show Prim.Boolean
132+ instance showBoolean :: Show Boolean
106
133
107− instance showNumber :: Show Prim.Number
134+ instance showNumber :: Show Number
108
135
109 instance showOrdering :: Show Ordering
136 instance showOrdering :: Show Ordering
110
137
111− instance showString :: Show Prim.String
138+ instance showString :: Show String
139+
140+ instance showUnit :: Show Unit
112
141
113
142
114### Values
143### Values
@@ -121,13 +150,13 @@
121
150
122 (:) :: forall a. a -> [a] -> [a]
151 (:) :: forall a. a -> [a] -> [a]
123
152
124− (<) :: forall a. (Ord a) => a -> a -> Prim.Boolean
153+ (<) :: forall a. (Ord a) => a -> a -> Boolean
125
154
126− (<=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
155+ (<=) :: forall a. (Ord a) => a -> a -> Boolean
127
156
128− (>) :: forall a. (Ord a) => a -> a -> Prim.Boolean
157+ (>) :: forall a. (Ord a) => a -> a -> Boolean
129
158
130− (>=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
159+ (>=) :: forall a. (Ord a) => a -> a -> Boolean
131
160
132 (>>>) :: forall a b c d. (Semigroupoid a) => a b c -> a c d -> a b d
161 (>>>) :: forall a b c d. (Semigroupoid a) => a b c -> a c d -> a b d
133
162
@@ -135,14 +164,6 @@
135
164
136 asTypeOf :: forall a. a -> a -> a
165 asTypeOf :: forall a. a -> a -> a
137
166
138− boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
139−
140− boolNot :: Prim.Boolean -> Prim.Boolean
141−
142− boolOr :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
143−
144− concatString :: Prim.String -> Prim.String -> Prim.String
145−
146 cons :: forall a. a -> [a] -> [a]
167 cons :: forall a. a -> [a] -> [a]
147
168
148 const :: forall a b. a -> b -> a
169 const :: forall a b. a -> b -> a
@@ -153,53 +174,92 @@
153
174
154 liftM1 :: forall m a b. (Monad m) => (a -> b) -> m a -> m b
175 liftM1 :: forall m a b. (Monad m) => (a -> b) -> m a -> m b
155
176
156− numAdd :: Prim.Number -> Prim.Number -> Prim.Number
177+ refEq :: forall a. a -> a -> Boolean
157
178
158− numAnd :: Prim.Number -> Prim.Number -> Prim.Number
179+ refIneq :: forall a. a -> a -> Boolean
159
180
160− numCompare :: Prim.Number -> Prim.Number -> Ordering
181+ return :: forall m a. (Monad m) => a -> m a
161
182
162− numComplement :: Prim.Number -> Prim.Number
183+ unit :: Unit
163
184
164− numDiv :: Prim.Number -> Prim.Number -> Prim.Number
185+ void :: forall f a. (Functor f) => f a -> f Unit
165
186
166− numMod :: Prim.Number -> Prim.Number -> Prim.Number
167
187
168− numMul :: Prim.Number -> Prim.Number -> Prim.Number
188+## Module Data.Function
169
189
170− numNegate :: Prim.Number -> Prim.Number
190+### Types
171
191
172− numOr :: Prim.Number -> Prim.Number -> Prim.Number
192+ data Fn0 :: * -> *
173
193
174− numShl :: Prim.Number -> Prim.Number -> Prim.Number
194+ data Fn1 :: * -> * -> *
175
195
176− numShr :: Prim.Number -> Prim.Number -> Prim.Number
196+ data Fn10 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
177
197
178− numSub :: Prim.Number -> Prim.Number -> Prim.Number
198+ data Fn2 :: * -> * -> * -> *
179
199
180− numXor :: Prim.Number -> Prim.Number -> Prim.Number
200+ data Fn3 :: * -> * -> * -> * -> *
181
201
182− numZshr :: Prim.Number -> Prim.Number -> Prim.Number
202+ data Fn4 :: * -> * -> * -> * -> * -> *
183
203
184− refEq :: forall a. a -> a -> Prim.Boolean
204+ data Fn5 :: * -> * -> * -> * -> * -> * -> *
185
205
186− refIneq :: forall a. a -> a -> Prim.Boolean
206+ data Fn6 :: * -> * -> * -> * -> * -> * -> * -> *
187
207
188− return :: forall m a. (Monad m) => a -> m a
208+ data Fn7 :: * -> * -> * -> * -> * -> * -> * -> * -> *
209+
210+ data Fn8 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> *
189
211
190− showArrayImpl :: forall a. (a -> Prim.String) -> [a] -> Prim.String
212+ data Fn9 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
191
213
192− showNumberImpl :: Prim.Number -> Prim.String
193
214
194− showStringImpl :: Prim.String -> Prim.String
215+### Values
195
216
217+ mkFn0 :: forall a. (Unit -> a) -> Fn0 a
196
218
197−## Module Data.Function
219+ mkFn1 :: forall a b. (a -> b) -> Fn1 a b
198
220
199−### Values
221+ mkFn10 :: forall a b c d e f g h i j k. (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k) -> Fn10 a b c d e f g h i j k
222+
223+ mkFn2 :: forall a b c. (a -> b -> c) -> Fn2 a b c
224+
225+ mkFn3 :: forall a b c d. (a -> b -> c -> d) -> Fn3 a b c d
226+
227+ mkFn4 :: forall a b c d e. (a -> b -> c -> d -> e) -> Fn4 a b c d e
228+
229+ mkFn5 :: forall a b c d e f. (a -> b -> c -> d -> e -> f) -> Fn5 a b c d e f
230+
231+ mkFn6 :: forall a b c d e f g. (a -> b -> c -> d -> e -> f -> g) -> Fn6 a b c d e f g
232+
233+ mkFn7 :: forall a b c d e f g h. (a -> b -> c -> d -> e -> f -> g -> h) -> Fn7 a b c d e f g h
234+
235+ mkFn8 :: forall a b c d e f g h i. (a -> b -> c -> d -> e -> f -> g -> h -> i) -> Fn8 a b c d e f g h i
236+
237+ mkFn9 :: forall a b c d e f g h i j. (a -> b -> c -> d -> e -> f -> g -> h -> i -> j) -> Fn9 a b c d e f g h i j
200
238
201 on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
239 on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
202
240
241+ runFn0 :: forall a. Fn0 a -> a
242+
243+ runFn1 :: forall a b. Fn1 a b -> a -> b
244+
245+ runFn10 :: forall a b c d e f g h i j k. Fn10 a b c d e f g h i j k -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k
246+
247+ runFn2 :: forall a b c. Fn2 a b c -> a -> b -> c
248+
249+ runFn3 :: forall a b c d. Fn3 a b c d -> a -> b -> c -> d
250+
251+ runFn4 :: forall a b c d e. Fn4 a b c d e -> a -> b -> c -> d -> e
252+
253+ runFn5 :: forall a b c d e f. Fn5 a b c d e f -> a -> b -> c -> d -> e -> f
254+
255+ runFn6 :: forall a b c d e f g. Fn6 a b c d e f g -> a -> b -> c -> d -> e -> f -> g
256+
257+ runFn7 :: forall a b c d e f g h. Fn7 a b c d e f g h -> a -> b -> c -> d -> e -> f -> g -> h
258+
259+ runFn8 :: forall a b c d e f g h i. Fn8 a b c d e f g h i -> a -> b -> c -> d -> e -> f -> g -> h -> i
260+
261+ runFn9 :: forall a b c d e f g h i j. Fn9 a b c d e f g h i j -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j
262+
203
263
204## Module Data.Eq
264## Module Data.Eq
205
265
@@ -213,6 +273,8 @@
213
273
214 instance eqRef :: Eq (Ref a)
274 instance eqRef :: Eq (Ref a)
215
275
276+ instance functorRef :: Functor Ref
277+
216
278
217### Values
279### Values
218
280
@@ -223,7 +285,7 @@
223
285
224### Values
286### Values
225
287
226− unsafeIndex :: forall a. [a] -> Prim.Number -> a
288+ unsafeIndex :: forall a. [a] -> Number -> a
227
289
228
290
229## Module Control.Monad.Eff
291## Module Control.Monad.Eff
@@ -252,17 +314,17 @@
252
314
253 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
315 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
254
316
255− forE :: forall e. Prim.Number -> Prim.Number -> (Prim.Number -> Eff e { }) -> Eff e { }
317+ forE :: forall e. Number -> Number -> (Number -> Eff e Unit) -> Eff e Unit
256
318
257− foreachE :: forall e a. [a] -> (a -> Eff e { }) -> Eff e { }
319+ foreachE :: forall e a. [a] -> (a -> Eff e Unit) -> Eff e Unit
258
320
259 returnE :: forall e a. a -> Eff e a
321 returnE :: forall e a. a -> Eff e a
260
322
261 runPure :: forall a. Pure a -> a
323 runPure :: forall a. Pure a -> a
262
324
263− untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
325+ untilE :: forall e. Eff e Boolean -> Eff e Unit
264
326
265− whileE :: forall e a. Eff e Prim.Boolean -> Eff e a -> Eff e { }
327+ whileE :: forall e a. Eff e Boolean -> Eff e a -> Eff e Unit
266
328
267
329
268## Module Control.Monad.Eff.Unsafe
330## Module Control.Monad.Eff.Unsafe
@@ -281,9 +343,9 @@
281
343
282### Values
344### Values
283
345
284− print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) { }
346+ print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) Unit
285
347
286− trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
348+ trace :: forall r. String -> Eff (trace :: Trace | r) Unit
287
349
288
350
289## Module Control.Monad.ST
351## Module Control.Monad.ST
@@ -301,13 +363,13 @@
301
363
302 modifySTRef :: forall a h r. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
364 modifySTRef :: forall a h r. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
303
365
304− newSTArray :: forall a h r. Prim.Number -> a -> Eff (st :: ST h | r) (STArray h a)
366+ newSTArray :: forall a h r. Number -> a -> Eff (st :: ST h | r) (STArray h a)
305
367
306 newSTRef :: forall a h r. a -> Eff (st :: ST h | r) (STRef h a)
368 newSTRef :: forall a h r. a -> Eff (st :: ST h | r) (STRef h a)
307
369
308 peekSTArray :: forall a h r. STArray h a -> Eff (st :: ST h | r) a
370 peekSTArray :: forall a h r. STArray h a -> Eff (st :: ST h | r) a
309
371
310− pokeSTArray :: forall a h r. STArray h a -> Prim.Number -> a -> Eff (st :: ST h | r) a
372+ pokeSTArray :: forall a h r. STArray h a -> Number -> a -> Eff (st :: ST h | r) a
311
373
312 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
374 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
313
375