git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Update docs
13fb411Phil Freeman
libraries/prelude/README.md+121−131
compare with golang
unifiedsplit
@@ -3,19 +3,9 @@
3
3
4### Types
4### Types
5
5
6− data Array :: * -> *
7−
8− data Boolean :: *
9−
10− data Function :: * -> * -> *
11−
12− data Number :: *
13−
14 data Ref a where
6 data Ref a where
15 Ref :: a -> Ref a
7 Ref :: a -> Ref a
16
8
17− data String :: *
18−
19
9
20### Type Classes
10### Type Classes
21
11
@@ -31,9 +21,9 @@
31 (&) :: b -> b -> b
21 (&) :: b -> b -> b
32 (|) :: b -> b -> b
22 (|) :: b -> b -> b
33 (^) :: b -> b -> b
23 (^) :: b -> b -> b
34− shl :: b -> Prelude.Number -> b
24+ shl :: b -> Prim.Number -> b
35− shr :: b -> Prelude.Number -> b
25+ shr :: b -> Prim.Number -> b
36− zshr :: b -> Prelude.Number -> b
26+ zshr :: b -> Prim.Number -> b
37 complement :: b -> b
27 complement :: b -> b
38
28
39 class BoolLike b where
29 class BoolLike b where
@@ -47,8 +37,8 @@
47 (>>>) :: forall d. forall c. forall b. a b c -> a c d -> a b d
37 (>>>) :: forall d. forall c. forall b. a b c -> a c d -> a b d
48
38
49 class Eq a where
39 class Eq a where
50− (==) :: a -> a -> Prelude.Boolean
40+ (==) :: a -> a -> Prim.Boolean
51− (/=) :: a -> a -> Prelude.Boolean
41+ (/=) :: a -> a -> Prim.Boolean
52
42
53 class Functor f where
43 class Functor f where
54 (<$>) :: forall b. forall a. (a -> b) -> f a -> f b
44 (<$>) :: forall b. forall a. (a -> b) -> f a -> f b
@@ -66,118 +56,118 @@
66 negate :: a -> a
56 negate :: a -> a
67
57
68 class Ord a where
58 class Ord a where
69− (<) :: a -> a -> Prelude.Boolean
59+ (<) :: a -> a -> Prim.Boolean
70− (>) :: a -> a -> Prelude.Boolean
60+ (>) :: a -> a -> Prim.Boolean
71− (<=) :: a -> a -> Prelude.Boolean
61+ (<=) :: a -> a -> Prim.Boolean
72− (>=) :: a -> a -> Prelude.Boolean
62+ (>=) :: a -> a -> Prim.Boolean
73
63
74 class Read a where
64 class Read a where
75− read :: Prelude.String -> a
65+ read :: Prim.String -> a
76
66
77 class Show a where
67 class Show a where
78− show :: a -> Prelude.String
68+ show :: a -> Prim.String
79
69
80
70
81### Type Class Instances
71### Type Class Instances
82
72
83 (Monad (m)) => instance Applicative m
73 (Monad (m)) => instance Applicative m
84
74
85− instance Bits Prelude.Number
75+ instance Bits Prim.Number
86
76
87− instance BoolLike Prelude.Boolean
77+ instance BoolLike Prim.Boolean
88
78
89− instance Category Prelude.Function
79+ instance Category Prim.Function
90
80
91 instance Eq Ref a
81 instance Eq Ref a
92
82
93− instance Eq Prelude.String
83+ instance Eq Prim.String
94
84
95− instance Eq Prelude.Number
85+ instance Eq Prim.Number
96
86
97− instance Eq Prelude.Boolean
87+ instance Eq Prim.Boolean
98
88
99 (Eq (a)) => instance Eq [a]
89 (Eq (a)) => instance Eq [a]
100
90
101 (Applicative (f)) => instance Functor f
91 (Applicative (f)) => instance Functor f
102
92
103− instance Num Prelude.Number
93+ instance Num Prim.Number
104
94
105− instance Ord Prelude.Number
95+ instance Ord Prim.Number
106
96
107− instance Prelude.Show Prelude.Number
97+ instance Prelude.Show Prim.Number
108
98
109− instance Read Prelude.String
99+ instance Read Prim.String
110
100
111− instance Read Prelude.Boolean
101+ instance Read Prim.Boolean
112
102
113− instance Show Prelude.String
103+ instance Show Prim.String
114
104
115− instance Show Prelude.Boolean
105+ instance Show Prim.Boolean
116
106
117
107
118### Values
108### Values
119
109
120 $const :: forall b. forall a. a -> b -> a
110 $const :: forall b. forall a. a -> b -> a
121
111
122− (!!) :: forall a. [a] -> Prelude.Number -> a
112+ (!!) :: forall a. [a] -> Prim.Number -> a
123
113
124 (#) :: forall b. forall a. a -> (a -> b) -> b
114 (#) :: forall b. forall a. a -> (a -> b) -> b
125
115
126 ($) :: forall b. forall a. (a -> b) -> a -> b
116 ($) :: forall b. forall a. (a -> b) -> a -> b
127
117
128− (++) :: Prelude.String -> Prelude.String -> Prelude.String
118+ (++) :: Prim.String -> Prim.String -> Prim.String
129
119
130− boolAnd :: Prelude.Boolean -> Prelude.Boolean -> Prelude.Boolean
120+ boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
131
121
132− boolNot :: Prelude.Boolean -> Prelude.Boolean
122+ boolNot :: Prim.Boolean -> Prim.Boolean
133
123
134− boolOr :: Prelude.Boolean -> Prelude.Boolean -> Prelude.Boolean
124+ boolOr :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
135
125
136 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
126 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
137
127
138− numAdd :: Prelude.Number -> Prelude.Number -> Prelude.Number
128+ numAdd :: Prim.Number -> Prim.Number -> Prim.Number
139
129
140− numAnd :: Prelude.Number -> Prelude.Number -> Prelude.Number
130+ numAnd :: Prim.Number -> Prim.Number -> Prim.Number
141
131
142− numComplement :: Prelude.Number -> Prelude.Number
132+ numComplement :: Prim.Number -> Prim.Number
143
133
144− numDiv :: Prelude.Number -> Prelude.Number -> Prelude.Number
134+ numDiv :: Prim.Number -> Prim.Number -> Prim.Number
145
135
146− numGreater :: Prelude.Number -> Prelude.Number -> Prelude.Boolean
136+ numGreater :: Prim.Number -> Prim.Number -> Prim.Boolean
147
137
148− numGreaterEq :: Prelude.Number -> Prelude.Number -> Prelude.Boolean
138+ numGreaterEq :: Prim.Number -> Prim.Number -> Prim.Boolean
149
139
150− numLess :: Prelude.Number -> Prelude.Number -> Prelude.Boolean
140+ numLess :: Prim.Number -> Prim.Number -> Prim.Boolean
151
141
152− numLessEq :: Prelude.Number -> Prelude.Number -> Prelude.Boolean
142+ numLessEq :: Prim.Number -> Prim.Number -> Prim.Boolean
153
143
154− numMod :: Prelude.Number -> Prelude.Number -> Prelude.Number
144+ numMod :: Prim.Number -> Prim.Number -> Prim.Number
155
145
156− numMul :: Prelude.Number -> Prelude.Number -> Prelude.Number
146+ numMul :: Prim.Number -> Prim.Number -> Prim.Number
157
147
158− numNegate :: Prelude.Number -> Prelude.Number
148+ numNegate :: Prim.Number -> Prim.Number
159
149
160− numOr :: Prelude.Number -> Prelude.Number -> Prelude.Number
150+ numOr :: Prim.Number -> Prim.Number -> Prim.Number
161
151
162− numShl :: Prelude.Number -> Prelude.Number -> Prelude.Number
152+ numShl :: Prim.Number -> Prim.Number -> Prim.Number
163
153
164− numShr :: Prelude.Number -> Prelude.Number -> Prelude.Number
154+ numShr :: Prim.Number -> Prim.Number -> Prim.Number
165
155
166− numSub :: Prelude.Number -> Prelude.Number -> Prelude.Number
156+ numSub :: Prim.Number -> Prim.Number -> Prim.Number
167
157
168− numXor :: Prelude.Number -> Prelude.Number -> Prelude.Number
158+ numXor :: Prim.Number -> Prim.Number -> Prim.Number
169
159
170− numZshr :: Prelude.Number -> Prelude.Number -> Prelude.Number
160+ numZshr :: Prim.Number -> Prim.Number -> Prim.Number
171
161
172− refEq :: forall a. Ref a -> Ref a -> Prelude.Boolean
162+ refEq :: forall a. Ref a -> Ref a -> Prim.Boolean
173
163
174− refIneq :: forall a. Ref a -> Ref a -> Prelude.Boolean
164+ refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
175
165
176− showNumber :: Prelude.Number -> Prelude.String
166+ showNumber :: Prim.Number -> Prim.String
177
167
178− unsafeRefEq :: forall a. a -> a -> Prelude.Boolean
168+ unsafeRefEq :: forall a. a -> a -> Prim.Boolean
179
169
180− unsafeRefIneq :: forall a. a -> a -> Prelude.Boolean
170+ unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
181
171
182
172
183## Module Monoid
173## Module Monoid
@@ -194,7 +184,7 @@
194
184
195### Type Class Instances
185### Type Class Instances
196
186
197− instance Monoid Prelude.String
187+ instance Monoid Prim.String
198
188
199
189
200### Values
190### Values
@@ -225,11 +215,11 @@
225
215
226 mapM :: forall b. forall a. forall m. (Monad (m)) => (a -> m b) -> [a] -> m [b]
216 mapM :: forall b. forall a. forall m. (Monad (m)) => (a -> m b) -> [a] -> m [b]
227
217
228− replicateM :: forall a. forall m. (Monad (m)) => Prelude.Number -> m a -> m [a]
218+ replicateM :: forall a. forall m. (Monad (m)) => Prim.Number -> m a -> m [a]
229
219
230 sequence :: forall a. forall m. (Monad (m)) => [m a] -> m [a]
220 sequence :: forall a. forall m. (Monad (m)) => [m a] -> m [a]
231
221
232− when :: forall m. (Monad (m)) => Prelude.Boolean -> m { } -> m { }
222+ when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
233
223
234
224
235## Module Maybe
225## Module Maybe
@@ -288,9 +278,9 @@
288
278
289### Type Class Instances
279### Type Class Instances
290
280
291− instance Prelude.Alternative Prelude.Array
281+ instance Prelude.Alternative Prim.Array
292
282
293− instance Prelude.Monad Prelude.Array
283+ instance Prelude.Monad Prim.Array
294
284
295 (Prelude.Show (a)) => instance Prelude.Show [a]
285 (Prelude.Show (a)) => instance Prelude.Show [a]
296
286
@@ -299,15 +289,15 @@
299
289
300 (:) :: forall a. a -> [a] -> [a]
290 (:) :: forall a. a -> [a] -> [a]
301
291
302− all :: forall a. (a -> Prelude.Boolean) -> [a] -> Prelude.Boolean
292+ all :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Boolean
303
293
304− any :: forall a. (a -> Prelude.Boolean) -> [a] -> Prelude.Boolean
294+ any :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Boolean
305
295
306 concat :: forall a. [a] -> [a] -> [a]
296 concat :: forall a. [a] -> [a] -> [a]
307
297
308 concatMap :: forall b. forall a. [a] -> (a -> [b]) -> [b]
298 concatMap :: forall b. forall a. [a] -> (a -> [b]) -> [b]
309
299
310− filter :: forall a. (a -> Prelude.Boolean) -> [a] -> [a]
300+ filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
311
301
312 foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
302 foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
313
303
@@ -317,23 +307,23 @@
317
307
318 headSafe :: forall a. [a] -> Maybe a
308 headSafe :: forall a. [a] -> Maybe a
319
309
320− indexOf :: forall a. [a] -> a -> Prelude.Number
310+ indexOf :: forall a. [a] -> a -> Prim.Number
321
311
322− isEmpty :: forall a. [a] -> Prelude.Boolean
312+ isEmpty :: forall a. [a] -> Prim.Boolean
323
313
324− joinS :: [Prelude.String] -> Prelude.String
314+ joinS :: [Prim.String] -> Prim.String
325
315
326− joinWith :: [Prelude.String] -> Prelude.String -> Prelude.String
316+ joinWith :: [Prim.String] -> Prim.String -> Prim.String
327
317
328− lastIndexOf :: forall a. [a] -> a -> Prelude.Number
318+ lastIndexOf :: forall a. [a] -> a -> Prim.Number
329
319
330− length :: forall a. [a] -> Prelude.Number
320+ length :: forall a. [a] -> Prim.Number
331
321
332 map :: forall b. forall a. (a -> b) -> [a] -> [b]
322 map :: forall b. forall a. (a -> b) -> [a] -> [b]
333
323
334 push :: forall a. [a] -> a -> [a]
324 push :: forall a. [a] -> a -> [a]
335
325
336− range :: Prelude.Number -> Prelude.Number -> [Prelude.Number]
326+ range :: Prim.Number -> Prim.Number -> [Prim.Number]
337
327
338 reverse :: forall a. [a] -> [a]
328 reverse :: forall a. [a] -> [a]
339
329
@@ -341,11 +331,11 @@
341
331
342 singleton :: forall a. a -> [a]
332 singleton :: forall a. a -> [a]
343
333
344− slice :: forall a. Prelude.Number -> Prelude.Number -> [a] -> [a]
334+ slice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
345
335
346 sort :: forall a. [a] -> [a]
336 sort :: forall a. [a] -> [a]
347
337
348− splice :: forall a. Prelude.Number -> Prelude.Number -> [a] -> [a] -> [a]
338+ splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
349
339
350 tail :: forall a. [a] -> [a]
340 tail :: forall a. [a] -> [a]
351
341
@@ -393,31 +383,31 @@
393
383
394### Values
384### Values
395
385
396− charAt :: Prelude.Number -> Prelude.String -> Prelude.String
386+ charAt :: Prim.Number -> Prim.String -> Prim.String
397
387
398− indexOfS :: Prelude.String -> Prelude.String -> Prelude.Number
388+ indexOfS :: Prim.String -> Prim.String -> Prim.Number
399
389
400− lastIndexOfS :: Prelude.String -> Prelude.String -> Prelude.Number
390+ lastIndexOfS :: Prim.String -> Prim.String -> Prim.Number
401
391
402− lengthS :: Prelude.String -> Prelude.Number
392+ lengthS :: Prim.String -> Prim.Number
403
393
404− localeCompare :: Prelude.String -> Prelude.String -> Prelude.Number
394+ localeCompare :: Prim.String -> Prim.String -> Prim.Number
405
395
406− replace :: Prelude.String -> Prelude.String -> Prelude.String -> Prelude.String
396+ replace :: Prim.String -> Prim.String -> Prim.String -> Prim.String
407
397
408− sliceS :: Prelude.Number -> Prelude.Number -> Prelude.String -> Prelude.String
398+ sliceS :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
409
399
410− split :: Prelude.String -> Prelude.String -> [Prelude.String]
400+ split :: Prim.String -> Prim.String -> [Prim.String]
411
401
412− substr :: Prelude.Number -> Prelude.Number -> Prelude.String -> Prelude.String
402+ substr :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
413
403
414− substring :: Prelude.Number -> Prelude.Number -> Prelude.String -> Prelude.String
404+ substring :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
415
405
416− toLower :: Prelude.String -> Prelude.String
406+ toLower :: Prim.String -> Prim.String
417
407
418− toUpper :: Prelude.String -> Prelude.String
408+ toUpper :: Prim.String -> Prim.String
419
409
420− trim :: Prelude.String -> Prelude.String
410+ trim :: Prim.String -> Prim.String
421
411
422
412
423## Module Regex
413## Module Regex
@@ -435,15 +425,15 @@
435
425
436### Values
426### Values
437
427
438− match :: Regex -> Prelude.String -> [Prelude.String]
428+ match :: Regex -> Prim.String -> [Prim.String]
439
429
440− regex :: Prelude.String -> Prelude.String -> Regex
430+ regex :: Prim.String -> Prim.String -> Regex
441
431
442− replaceR :: Regex -> Prelude.String -> Prelude.String -> Prelude.String
432+ replaceR :: Regex -> Prim.String -> Prim.String -> Prim.String
443
433
444− search :: Regex -> Prelude.String -> Prelude.Number
434+ search :: Regex -> Prim.String -> Prim.Number
445
435
446− test :: Regex -> Prelude.String -> Prelude.Boolean
436+ test :: Regex -> Prim.String -> Prim.Boolean
447
437
448
438
449## Module Global
439## Module Global
@@ -459,31 +449,31 @@
459
449
460### Values
450### Values
461
451
462− decodeURI :: Prelude.String -> Prelude.String
452+ decodeURI :: Prim.String -> Prim.String
463
453
464− decodeURIComponent :: Prelude.String -> Prelude.String
454+ decodeURIComponent :: Prim.String -> Prim.String
465
455
466− encodeURI :: Prelude.String -> Prelude.String
456+ encodeURI :: Prim.String -> Prim.String
467
457
468− encodeURIComponent :: Prelude.String -> Prelude.String
458+ encodeURIComponent :: Prim.String -> Prim.String
469
459
470− infinity :: Prelude.Number
460+ infinity :: Prim.Number
471
461
472− isFinite :: Prelude.Number -> Prelude.Boolean
462+ isFinite :: Prim.Number -> Prim.Boolean
473
463
474− isNaN :: Prelude.Number -> Prelude.Boolean
464+ isNaN :: Prim.Number -> Prim.Boolean
475
465
476− nan :: Prelude.Number
466+ nan :: Prim.Number
477
467
478− parseFloat :: Prelude.String -> Prelude.Number
468+ parseFloat :: Prim.String -> Prim.Number
479
469
480− parseInt :: Prelude.String -> Prelude.Number
470+ parseInt :: Prim.String -> Prim.Number
481
471
482− toExponential :: Prelude.Number -> Prelude.String
472+ toExponential :: Prim.Number -> Prim.String
483
473
484− toFixed :: Prelude.Number -> Prelude.Number -> Prelude.String
474+ toFixed :: Prim.Number -> Prim.Number -> Prim.String
485
475
486− toPrecision :: Prelude.Number -> Prelude.Number -> Prelude.String
476+ toPrecision :: Prim.Number -> Prim.Number -> Prim.String
487
477
488
478
489## Module Math
479## Module Math
@@ -499,39 +489,39 @@
499
489
500### Values
490### Values
501
491
502− abs :: Prelude.Number -> Prelude.Number
492+ abs :: Prim.Number -> Prim.Number
503
493
504− aceil :: Prelude.Number -> Prelude.Number
494+ aceil :: Prim.Number -> Prim.Number
505
495
506− acos :: Prelude.Number -> Prelude.Number
496+ acos :: Prim.Number -> Prim.Number
507
497
508− asin :: Prelude.Number -> Prelude.Number
498+ asin :: Prim.Number -> Prim.Number
509
499
510− atan :: Prelude.Number -> Prelude.Number
500+ atan :: Prim.Number -> Prim.Number
511
501
512− atan2 :: Prelude.Number -> Prelude.Number -> Prelude.Number
502+ atan2 :: Prim.Number -> Prim.Number -> Prim.Number
513
503
514− cos :: Prelude.Number -> Prelude.Number
504+ cos :: Prim.Number -> Prim.Number
515
505
516− exp :: Prelude.Number -> Prelude.Number
506+ exp :: Prim.Number -> Prim.Number
517
507
518− floor :: Prelude.Number -> Prelude.Number
508+ floor :: Prim.Number -> Prim.Number
519
509
520− log :: Prelude.Number -> Prelude.Number
510+ log :: Prim.Number -> Prim.Number
521
511
522− max :: Prelude.Number -> Prelude.Number
512+ max :: Prim.Number -> Prim.Number
523
513
524− min :: Prelude.Number -> Prelude.Number
514+ min :: Prim.Number -> Prim.Number
525
515
526− pow :: Prelude.Number -> Prelude.Number
516+ pow :: Prim.Number -> Prim.Number
527
517
528− round :: Prelude.Number -> Prelude.Number
518+ round :: Prim.Number -> Prim.Number
529
519
530− sin :: Prelude.Number -> Prelude.Number
520+ sin :: Prim.Number -> Prim.Number
531
521
532− sqrt :: Prelude.Number -> Prelude.Number
522+ sqrt :: Prim.Number -> Prim.Number
533
523
534− tan :: Prelude.Number -> Prelude.Number
524+ tan :: Prim.Number -> Prim.Number
535
525
536
526
537## Module Eff
527## Module Eff
@@ -555,7 +545,7 @@
555
545
556 bindEff :: forall b. forall a. forall e. Eff e a -> (a -> Eff e b) -> Eff e b
546 bindEff :: forall b. forall a. forall e. Eff e a -> (a -> Eff e b) -> Eff e b
557
547
558− forE :: forall e. Prelude.Number -> Prelude.Number -> (Prelude.Number -> Eff e { }) -> Eff e { }
548+ forE :: forall e. Prim.Number -> Prim.Number -> (Prim.Number -> Eff e { }) -> Eff e { }
559
549
560 foreachE :: forall a. forall e. [a] -> (a -> Eff e { }) -> Eff e { }
550 foreachE :: forall a. forall e. [a] -> (a -> Eff e { }) -> Eff e { }
561
551
@@ -563,9 +553,9 @@
563
553
564 runPure :: forall a. Pure a -> a
554 runPure :: forall a. Pure a -> a
565
555
566− untilE :: forall e. Eff e Prelude.Boolean -> Eff e { }
556+ untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
567
557
568− whileE :: forall e. Eff e Prelude.Boolean -> Eff e { } -> Eff e { }
558+ whileE :: forall e. Eff e Prim.Boolean -> Eff e { } -> Eff e { }
569
559
570
560
571## Module Random
561## Module Random
@@ -583,7 +573,7 @@
583
573
584### Values
574### Values
585
575
586− random :: forall e. Eff random :: Random | e Prelude.Number
576+ random :: forall e. Eff random :: Random | e Prim.Number
587
577
588
578
589## Module Errors
579## Module Errors
@@ -649,7 +639,7 @@
649
639
650 print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff trace :: Trace | r { }
640 print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff trace :: Trace | r { }
651
641
652− trace :: forall r. Prelude.String -> Eff trace :: Trace | r { }
642+ trace :: forall r. Prim.String -> Eff trace :: Trace | r { }
653
643
654
644
655## Module ST
645## Module ST