git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Update Prelude doc
e05d567Phil Freeman
prelude/README.md+136−33
compare with golang
unifiedsplit
@@ -4,279 +4,321 @@
4
4
5### Types
5### Types
6
6
7+#### `Ordering`
7
8
8− data Ordering where
9+ data Ordering
9− LT :: Ordering
10+ = LT
10− GT :: Ordering
11+ | GT
11− EQ :: Ordering
12+ | EQ
12
13
14+#### `Unit`
13
15
14− newtype Unit where
16+ newtype Unit
15− Unit :: { } -> Unit
17+ = Unit { }
16
18
17
19
18### Type Classes
20### Type Classes
19
21
20![Prelude](images/Prelude.png)
22![Prelude](images/Prelude.png)
21
23
24+#### `Applicative`
22
25
23 class (Apply f) <= Applicative f where
26 class (Apply f) <= Applicative f where
24−
25 pure :: forall a. a -> f a
27 pure :: forall a. a -> f a
26
28
29+#### `Apply`
27
30
28 class (Functor f) <= Apply f where
31 class (Functor f) <= Apply f where
29−
30 (<*>) :: forall a b. f (a -> b) -> f a -> f b
32 (<*>) :: forall a b. f (a -> b) -> f a -> f b
31
33
34+#### `Bind`
32
35
33 class (Apply m) <= Bind m where
36 class (Apply m) <= Bind m where
34−
35 (>>=) :: forall a b. m a -> (a -> m b) -> m b
37 (>>=) :: forall a b. m a -> (a -> m b) -> m b
36
38
39+#### `Bits`
37
40
38 class Bits b where
41 class Bits b where
39−
40 (.&.) :: b -> b -> b
42 (.&.) :: b -> b -> b
41−
42 (.|.) :: b -> b -> b
43 (.|.) :: b -> b -> b
43−
44 (.^.) :: b -> b -> b
44 (.^.) :: b -> b -> b
45−
46 shl :: b -> Number -> b
45 shl :: b -> Number -> b
47−
48 shr :: b -> Number -> b
46 shr :: b -> Number -> b
49−
50 zshr :: b -> Number -> b
47 zshr :: b -> Number -> b
51−
52 complement :: b -> b
48 complement :: b -> b
53
49
50+#### `BoolLike`
54
51
55 class BoolLike b where
52 class BoolLike b where
56−
57 (&&) :: b -> b -> b
53 (&&) :: b -> b -> b
58−
59 (||) :: b -> b -> b
54 (||) :: b -> b -> b
60−
61 not :: b -> b
55 not :: b -> b
62
56
57+#### `Category`
63
58
64 class (Semigroupoid a) <= Category a where
59 class (Semigroupoid a) <= Category a where
65−
66 id :: forall t. a t t
60 id :: forall t. a t t
67
61
62+#### `Eq`
68
63
69 class Eq a where
64 class Eq a where
70−
71 (==) :: a -> a -> Boolean
65 (==) :: a -> a -> Boolean
72−
73 (/=) :: a -> a -> Boolean
66 (/=) :: a -> a -> Boolean
74
67
68+#### `Functor`
75
69
76 class Functor f where
70 class Functor f where
77−
78 (<$>) :: forall a b. (a -> b) -> f a -> f b
71 (<$>) :: forall a b. (a -> b) -> f a -> f b
79
72
73+#### `Monad`
80
74
81 class (Applicative m, Bind m) <= Monad m where
75 class (Applicative m, Bind m) <= Monad m where
82
76
77+#### `Num`
83
78
84 class Num a where
79 class Num a where
85−
86 (+) :: a -> a -> a
80 (+) :: a -> a -> a
87−
88 (-) :: a -> a -> a
81 (-) :: a -> a -> a
89−
90 (*) :: a -> a -> a
82 (*) :: a -> a -> a
91−
92 (/) :: a -> a -> a
83 (/) :: a -> a -> a
93−
94 (%) :: a -> a -> a
84 (%) :: a -> a -> a
95−
96 negate :: a -> a
85 negate :: a -> a
97
86
87+#### `Ord`
98
88
99 class (Eq a) <= Ord a where
89 class (Eq a) <= Ord a where
100−
101 compare :: a -> a -> Ordering
90 compare :: a -> a -> Ordering
102
91
92+#### `Semigroup`
103
93
104 class Semigroup a where
94 class Semigroup a where
105−
106 (<>) :: a -> a -> a
95 (<>) :: a -> a -> a
107
96
97+#### `Semigroupoid`
108
98
109 class Semigroupoid a where
99 class Semigroupoid a where
110−
111 (<<<) :: forall b c d. a c d -> a b c -> a b d
100 (<<<) :: forall b c d. a c d -> a b c -> a b d
112
101
102+#### `Show`
113
103
114 class Show a where
104 class Show a where
115−
116 show :: a -> String
105 show :: a -> String
117
106
118
107
119### Type Class Instances
108### Type Class Instances
120
109
110+#### `applicativeArr`
121
111
122 instance applicativeArr :: Applicative (Prim.Function r)
112 instance applicativeArr :: Applicative (Prim.Function r)
123
113
114+#### `applyArr`
124
115
125 instance applyArr :: Apply (Prim.Function r)
116 instance applyArr :: Apply (Prim.Function r)
126
117
118+#### `bindArr`
127
119
128 instance bindArr :: Bind (Prim.Function r)
120 instance bindArr :: Bind (Prim.Function r)
129
121
122+#### `bitsNumber`
130
123
131 instance bitsNumber :: Bits Number
124 instance bitsNumber :: Bits Number
132
125
126+#### `boolLikeBoolean`
133
127
134 instance boolLikeBoolean :: BoolLike Boolean
128 instance boolLikeBoolean :: BoolLike Boolean
135
129
130+#### `categoryArr`
136
131
137 instance categoryArr :: Category Prim.Function
132 instance categoryArr :: Category Prim.Function
138
133
134+#### `eqArray`
139
135
140 instance eqArray :: (Eq a) => Eq [a]
136 instance eqArray :: (Eq a) => Eq [a]
141
137
138+#### `eqBoolean`
142
139
143 instance eqBoolean :: Eq Boolean
140 instance eqBoolean :: Eq Boolean
144
141
142+#### `eqNumber`
145
143
146 instance eqNumber :: Eq Number
144 instance eqNumber :: Eq Number
147
145
146+#### `eqOrdering`
148
147
149 instance eqOrdering :: Eq Ordering
148 instance eqOrdering :: Eq Ordering
150
149
150+#### `eqString`
151
151
152 instance eqString :: Eq String
152 instance eqString :: Eq String
153
153
154+#### `eqUnit`
154
155
155 instance eqUnit :: Eq Unit
156 instance eqUnit :: Eq Unit
156
157
158+#### `functorArr`
157
159
158 instance functorArr :: Functor (Prim.Function r)
160 instance functorArr :: Functor (Prim.Function r)
159
161
162+#### `monadArr`
160
163
161 instance monadArr :: Monad (Prim.Function r)
164 instance monadArr :: Monad (Prim.Function r)
162
165
166+#### `numNumber`
163
167
164 instance numNumber :: Num Number
168 instance numNumber :: Num Number
165
169
170+#### `ordArray`
166
171
167 instance ordArray :: (Ord a) => Ord [a]
172 instance ordArray :: (Ord a) => Ord [a]
168
173
174+#### `ordBoolean`
169
175
170 instance ordBoolean :: Ord Boolean
176 instance ordBoolean :: Ord Boolean
171
177
178+#### `ordNumber`
172
179
173 instance ordNumber :: Ord Number
180 instance ordNumber :: Ord Number
174
181
182+#### `ordString`
175
183
176 instance ordString :: Ord String
184 instance ordString :: Ord String
177
185
186+#### `ordUnit`
178
187
179 instance ordUnit :: Ord Unit
188 instance ordUnit :: Ord Unit
180
189
190+#### `semigroupArr`
181
191
182 instance semigroupArr :: (Semigroup s') => Semigroup (s -> s')
192 instance semigroupArr :: (Semigroup s') => Semigroup (s -> s')
183
193
194+#### `semigroupString`
184
195
185 instance semigroupString :: Semigroup String
196 instance semigroupString :: Semigroup String
186
197
198+#### `semigroupUnit`
187
199
188 instance semigroupUnit :: Semigroup Unit
200 instance semigroupUnit :: Semigroup Unit
189
201
202+#### `semigroupoidArr`
190
203
191 instance semigroupoidArr :: Semigroupoid Prim.Function
204 instance semigroupoidArr :: Semigroupoid Prim.Function
192
205
206+#### `showArray`
193
207
194 instance showArray :: (Show a) => Show [a]
208 instance showArray :: (Show a) => Show [a]
195
209
210+#### `showBoolean`
196
211
197 instance showBoolean :: Show Boolean
212 instance showBoolean :: Show Boolean
198
213
214+#### `showNumber`
199
215
200 instance showNumber :: Show Number
216 instance showNumber :: Show Number
201
217
218+#### `showOrdering`
202
219
203 instance showOrdering :: Show Ordering
220 instance showOrdering :: Show Ordering
204
221
222+#### `showString`
205
223
206 instance showString :: Show String
224 instance showString :: Show String
207
225
226+#### `showUnit`
208
227
209 instance showUnit :: Show Unit
228 instance showUnit :: Show Unit
210
229
211
230
212### Values
231### Values
213
232
233+#### `(#)`
214
234
215 (#) :: forall a b. a -> (a -> b) -> b
235 (#) :: forall a b. a -> (a -> b) -> b
216
236
237+#### `($)`
217
238
218 ($) :: forall a b. (a -> b) -> a -> b
239 ($) :: forall a b. (a -> b) -> a -> b
219
240
241+#### `(++)`
220
242
221 (++) :: forall s. (Semigroup s) => s -> s -> s
243 (++) :: forall s. (Semigroup s) => s -> s -> s
222
244
245+#### `(:)`
223
246
224 (:) :: forall a. a -> [a] -> [a]
247 (:) :: forall a. a -> [a] -> [a]
225
248
249+#### `(<#>)`
226
250
227 (<#>) :: forall f a b. (Functor f) => f a -> (a -> b) -> f b
251 (<#>) :: forall f a b. (Functor f) => f a -> (a -> b) -> f b
228
252
253+#### `(<)`
229
254
230 (<) :: forall a. (Ord a) => a -> a -> Boolean
255 (<) :: forall a. (Ord a) => a -> a -> Boolean
231
256
257+#### `(<=)`
232
258
233 (<=) :: forall a. (Ord a) => a -> a -> Boolean
259 (<=) :: forall a. (Ord a) => a -> a -> Boolean
234
260
261+#### `(>)`
235
262
236 (>) :: forall a. (Ord a) => a -> a -> Boolean
263 (>) :: forall a. (Ord a) => a -> a -> Boolean
237
264
265+#### `(>=)`
238
266
239 (>=) :: forall a. (Ord a) => a -> a -> Boolean
267 (>=) :: forall a. (Ord a) => a -> a -> Boolean
240
268
269+#### `(>>>)`
241
270
242 (>>>) :: forall a b c d. (Semigroupoid a) => a b c -> a c d -> a b d
271 (>>>) :: forall a b c d. (Semigroupoid a) => a b c -> a c d -> a b d
243
272
273+#### `ap`
244
274
245 ap :: forall m a b. (Monad m) => m (a -> b) -> m a -> m b
275 ap :: forall m a b. (Monad m) => m (a -> b) -> m a -> m b
246
276
277+#### `asTypeOf`
247
278
248 asTypeOf :: forall a. a -> a -> a
279 asTypeOf :: forall a. a -> a -> a
249
280
281+#### `cons`
250
282
251 cons :: forall a. a -> [a] -> [a]
283 cons :: forall a. a -> [a] -> [a]
252
284
285+#### `const`
253
286
254 const :: forall a b. a -> b -> a
287 const :: forall a b. a -> b -> a
255
288
289+#### `flip`
256
290
257 flip :: forall a b c. (a -> b -> c) -> b -> a -> c
291 flip :: forall a b c. (a -> b -> c) -> b -> a -> c
258
292
293+#### `liftA1`
259
294
260 liftA1 :: forall f a b. (Applicative f) => (a -> b) -> f a -> f b
295 liftA1 :: forall f a b. (Applicative f) => (a -> b) -> f a -> f b
261
296
297+#### `liftM1`
262
298
263 liftM1 :: forall m a b. (Monad m) => (a -> b) -> m a -> m b
299 liftM1 :: forall m a b. (Monad m) => (a -> b) -> m a -> m b
264
300
301+#### `otherwise`
265
302
266 otherwise :: Boolean
303 otherwise :: Boolean
267
304
305+#### `refEq`
268
306
269 refEq :: forall a. a -> a -> Boolean
307 refEq :: forall a. a -> a -> Boolean
270
308
309+#### `refIneq`
271
310
272 refIneq :: forall a. a -> a -> Boolean
311 refIneq :: forall a. a -> a -> Boolean
273
312
313+#### `return`
274
314
275 return :: forall m a. (Monad m) => a -> m a
315 return :: forall m a. (Monad m) => a -> m a
276
316
317+#### `unit`
277
318
278 unit :: Unit
319 unit :: Unit
279
320
321+#### `void`
280
322
281 void :: forall f a. (Functor f) => f a -> f Unit
323 void :: forall f a. (Functor f) => f a -> f Unit
282
324
@@ -285,108 +327,142 @@
285
327
286### Types
328### Types
287
329
330+#### `Fn0`
288
331
289 data Fn0 :: * -> *
332 data Fn0 :: * -> *
290
333
334+#### `Fn1`
291
335
292 data Fn1 :: * -> * -> *
336 data Fn1 :: * -> * -> *
293
337
338+#### `Fn10`
294
339
295 data Fn10 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
340 data Fn10 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
296
341
342+#### `Fn2`
297
343
298 data Fn2 :: * -> * -> * -> *
344 data Fn2 :: * -> * -> * -> *
299
345
346+#### `Fn3`
300
347
301 data Fn3 :: * -> * -> * -> * -> *
348 data Fn3 :: * -> * -> * -> * -> *
302
349
350+#### `Fn4`
303
351
304 data Fn4 :: * -> * -> * -> * -> * -> *
352 data Fn4 :: * -> * -> * -> * -> * -> *
305
353
354+#### `Fn5`
306
355
307 data Fn5 :: * -> * -> * -> * -> * -> * -> *
356 data Fn5 :: * -> * -> * -> * -> * -> * -> *
308
357
358+#### `Fn6`
309
359
310 data Fn6 :: * -> * -> * -> * -> * -> * -> * -> *
360 data Fn6 :: * -> * -> * -> * -> * -> * -> * -> *
311
361
362+#### `Fn7`
312
363
313 data Fn7 :: * -> * -> * -> * -> * -> * -> * -> * -> *
364 data Fn7 :: * -> * -> * -> * -> * -> * -> * -> * -> *
314
365
366+#### `Fn8`
315
367
316 data Fn8 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> *
368 data Fn8 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> *
317
369
370+#### `Fn9`
318
371
319 data Fn9 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
372 data Fn9 :: * -> * -> * -> * -> * -> * -> * -> * -> * -> * -> *
320
373
321
374
322### Values
375### Values
323
376
377+#### `mkFn0`
324
378
325 mkFn0 :: forall a. (Unit -> a) -> Fn0 a
379 mkFn0 :: forall a. (Unit -> a) -> Fn0 a
326
380
381+#### `mkFn1`
327
382
328 mkFn1 :: forall a b. (a -> b) -> Fn1 a b
383 mkFn1 :: forall a b. (a -> b) -> Fn1 a b
329
384
385+#### `mkFn10`
330
386
331 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
387 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
332
388
389+#### `mkFn2`
333
390
334 mkFn2 :: forall a b c. (a -> b -> c) -> Fn2 a b c
391 mkFn2 :: forall a b c. (a -> b -> c) -> Fn2 a b c
335
392
393+#### `mkFn3`
336
394
337 mkFn3 :: forall a b c d. (a -> b -> c -> d) -> Fn3 a b c d
395 mkFn3 :: forall a b c d. (a -> b -> c -> d) -> Fn3 a b c d
338
396
397+#### `mkFn4`
339
398
340 mkFn4 :: forall a b c d e. (a -> b -> c -> d -> e) -> Fn4 a b c d e
399 mkFn4 :: forall a b c d e. (a -> b -> c -> d -> e) -> Fn4 a b c d e
341
400
401+#### `mkFn5`
342
402
343 mkFn5 :: forall a b c d e f. (a -> b -> c -> d -> e -> f) -> Fn5 a b c d e f
403 mkFn5 :: forall a b c d e f. (a -> b -> c -> d -> e -> f) -> Fn5 a b c d e f
344
404
405+#### `mkFn6`
345
406
346 mkFn6 :: forall a b c d e f g. (a -> b -> c -> d -> e -> f -> g) -> Fn6 a b c d e f g
407 mkFn6 :: forall a b c d e f g. (a -> b -> c -> d -> e -> f -> g) -> Fn6 a b c d e f g
347
408
409+#### `mkFn7`
348
410
349 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
411 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
350
412
413+#### `mkFn8`
351
414
352 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
415 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
353
416
417+#### `mkFn9`
354
418
355 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
419 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
356
420
421+#### `on`
357
422
358 on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
423 on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
359
424
425+#### `runFn0`
360
426
361 runFn0 :: forall a. Fn0 a -> a
427 runFn0 :: forall a. Fn0 a -> a
362
428
429+#### `runFn1`
363
430
364 runFn1 :: forall a b. Fn1 a b -> a -> b
431 runFn1 :: forall a b. Fn1 a b -> a -> b
365
432
433+#### `runFn10`
366
434
367 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
435 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
368
436
437+#### `runFn2`
369
438
370 runFn2 :: forall a b c. Fn2 a b c -> a -> b -> c
439 runFn2 :: forall a b c. Fn2 a b c -> a -> b -> c
371
440
441+#### `runFn3`
372
442
373 runFn3 :: forall a b c d. Fn3 a b c d -> a -> b -> c -> d
443 runFn3 :: forall a b c d. Fn3 a b c d -> a -> b -> c -> d
374
444
445+#### `runFn4`
375
446
376 runFn4 :: forall a b c d e. Fn4 a b c d e -> a -> b -> c -> d -> e
447 runFn4 :: forall a b c d e. Fn4 a b c d e -> a -> b -> c -> d -> e
377
448
449+#### `runFn5`
378
450
379 runFn5 :: forall a b c d e f. Fn5 a b c d e f -> a -> b -> c -> d -> e -> f
451 runFn5 :: forall a b c d e f. Fn5 a b c d e f -> a -> b -> c -> d -> e -> f
380
452
453+#### `runFn6`
381
454
382 runFn6 :: forall a b c d e f g. Fn6 a b c d e f g -> a -> b -> c -> d -> e -> f -> g
455 runFn6 :: forall a b c d e f g. Fn6 a b c d e f g -> a -> b -> c -> d -> e -> f -> g
383
456
457+#### `runFn7`
384
458
385 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
459 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
386
460
461+#### `runFn8`
387
462
388 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
463 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
389
464
465+#### `runFn9`
390
466
391 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
467 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
392
468
@@ -395,6 +471,7 @@
395
471
396### Values
472### Values
397
473
474+#### `unsafeIndex`
398
475
399 unsafeIndex :: forall a. [a] -> Number -> a
476 unsafeIndex :: forall a. [a] -> Number -> a
400
477
@@ -403,51 +480,65 @@
403
480
404### Types
481### Types
405
482
483+#### `Eff`
406
484
407 data Eff :: # ! -> * -> *
485 data Eff :: # ! -> * -> *
408
486
487+#### `Pure`
409
488
410 type Pure a = forall e. Eff e a
489 type Pure a = forall e. Eff e a
411
490
412
491
413### Type Class Instances
492### Type Class Instances
414
493
494+#### `applicativeEff`
415
495
416 instance applicativeEff :: Applicative (Eff e)
496 instance applicativeEff :: Applicative (Eff e)
417
497
498+#### `applyEff`
418
499
419 instance applyEff :: Apply (Eff e)
500 instance applyEff :: Apply (Eff e)
420
501
502+#### `bindEff`
421
503
422 instance bindEff :: Bind (Eff e)
504 instance bindEff :: Bind (Eff e)
423
505
506+#### `functorEff`
424
507
425 instance functorEff :: Functor (Eff e)
508 instance functorEff :: Functor (Eff e)
426
509
510+#### `monadEff`
427
511
428 instance monadEff :: Monad (Eff e)
512 instance monadEff :: Monad (Eff e)
429
513
430
514
431### Values
515### Values
432
516
517+#### `bindE`
433
518
434 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
519 bindE :: forall e a b. Eff e a -> (a -> Eff e b) -> Eff e b
435
520
521+#### `forE`
436
522
437 forE :: forall e. Number -> Number -> (Number -> Eff e Unit) -> Eff e Unit
523 forE :: forall e. Number -> Number -> (Number -> Eff e Unit) -> Eff e Unit
438
524
525+#### `foreachE`
439
526
440 foreachE :: forall e a. [a] -> (a -> Eff e Unit) -> Eff e Unit
527 foreachE :: forall e a. [a] -> (a -> Eff e Unit) -> Eff e Unit
441
528
529+#### `returnE`
442
530
443 returnE :: forall e a. a -> Eff e a
531 returnE :: forall e a. a -> Eff e a
444
532
533+#### `runPure`
445
534
446 runPure :: forall a. Pure a -> a
535 runPure :: forall a. Pure a -> a
447
536
537+#### `untilE`
448
538
449 untilE :: forall e. Eff e Boolean -> Eff e Unit
539 untilE :: forall e. Eff e Boolean -> Eff e Unit
450
540
541+#### `whileE`
451
542
452 whileE :: forall e a. Eff e Boolean -> Eff e a -> Eff e Unit
543 whileE :: forall e a. Eff e Boolean -> Eff e a -> Eff e Unit
453
544
@@ -456,6 +547,7 @@
456
547
457### Values
548### Values
458
549
550+#### `unsafeInterleaveEff`
459
551
460 unsafeInterleaveEff :: forall eff1 eff2 a. Eff eff1 a -> Eff eff2 a
552 unsafeInterleaveEff :: forall eff1 eff2 a. Eff eff1 a -> Eff eff2 a
461
553
@@ -464,15 +556,18 @@
464
556
465### Types
557### Types
466
558
559+#### `Trace`
467
560
468 data Trace :: !
561 data Trace :: !
469
562
470
563
471### Values
564### Values
472
565
566+#### `print`
473
567
474 print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) Unit
568 print :: forall a r. (Show a) => a -> Eff (trace :: Trace | r) Unit
475
569
570+#### `trace`
476
571
477 trace :: forall r. String -> Eff (trace :: Trace | r) Unit
572 trace :: forall r. String -> Eff (trace :: Trace | r) Unit
478
573
@@ -481,30 +576,38 @@
481
576
482### Types
577### Types
483
578
579+#### `ST`
484
580
485 data ST :: * -> !
581 data ST :: * -> !
486
582
583+#### `STRef`
487
584
488 data STRef :: * -> * -> *
585 data STRef :: * -> * -> *
489
586
490
587
491### Values
588### Values
492
589
590+#### `modifySTRef`
493
591
494 modifySTRef :: forall a h r. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
592 modifySTRef :: forall a h r. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
495
593
594+#### `newSTRef`
496
595
497 newSTRef :: forall a h r. a -> Eff (st :: ST h | r) (STRef h a)
596 newSTRef :: forall a h r. a -> Eff (st :: ST h | r) (STRef h a)
498
597
598+#### `pureST`
499
599
500 pureST :: forall a. (forall h r. Eff (st :: ST h | r) a) -> a
600 pureST :: forall a. (forall h r. Eff (st :: ST h | r) a) -> a
501
601
602+#### `readSTRef`
502
603
503 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
604 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
504
605
606+#### `runST`
505
607
506 runST :: forall a r. (forall h. Eff (st :: ST h | r) a) -> Eff r a
608 runST :: forall a r. (forall h. Eff (st :: ST h | r) a) -> Eff r a
507
609
610+#### `writeSTRef`
508
611
509 writeSTRef :: forall a h r. STRef h a -> a -> Eff (st :: ST h | r) a
612 writeSTRef :: forall a h r. STRef h a -> a -> Eff (st :: ST h | r) a
510
613