git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Update docs
78065b6Phil Freeman
docs/source/prelude.rst+100−52
compare with golang
unifiedsplit
@@ -7,11 +7,6 @@ Module Prelude
7Types
7Types
8~~~~~
8~~~~~
9
9
10−::
11−
12− data Ref a where
13− Ref :: a -> Ref a
14−
15Type Classes
10Type Classes
16~~~~~~~~~~~~
11~~~~~~~~~~~~
17
12
@@ -80,41 +75,39 @@ Type Class Instances
80
75
81::
76::
82
77
83− (Monad (m)) => instance Applicative m
78+ (Monad ((m))) => instance applicativeFromMonad :: Applicative (m)
84
79
85− instance Bits Prim.Number
80+ instance bitsNumber :: Bits (Prim.Number)
86
81
87− instance BoolLike Prim.Boolean
82+ instance boolLikeBoolean :: BoolLike (Prim.Boolean)
88
83
89− instance Category Prim.Function
84+ instance categoryArr :: Category (Prim.Function)
90
85
91− instance Eq Ref a
86+ (Eq ((a))) => instance eqArray :: Eq ([a])
92
87
93− instance Eq Prim.String
88+ instance eqBoolean :: Eq (Prim.Boolean)
94
89
95− instance Eq Prim.Number
90+ instance eqNumber :: Eq (Prim.Number)
96
91
97− instance Eq Prim.Boolean
92+ instance eqString :: Eq (Prim.String)
98
93
99− (Eq (a)) => instance Eq [a]
94+ (Applicative ((f))) => instance functorFromApplicative :: Functor (f)
100
95
101− (Applicative (f)) => instance Functor f
96+ instance numNumber :: Num (Prim.Number)
102
97
103− instance Num Prim.Number
98+ instance ordNumber :: Ord (Prim.Number)
104
99
105− instance Ord Prim.Number
100+ instance readBoolean :: Read (Prim.Boolean)
106
101
107− instance Prelude.Show Prim.Number
102+ instance readNumber :: Read (Prim.Number)
108
103
109− instance Read Prim.String
104+ instance readString :: Read (Prim.String)
110
105
111− instance Read Prim.Boolean
106+ instance showBoolean :: Show (Prim.Boolean)
112
107
113− instance Read Prim.Number
108+ instance showNumber :: Show (Prim.Number)
114
109
115− instance Show Prim.String
110+ instance showString :: Show (Prim.String)
116−
117− instance Show Prim.Boolean
118
111
119Values
112Values
120~~~~~~
113~~~~~~
@@ -139,8 +132,6 @@ Values
139
132
140 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
133 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
141
134
142− liftRef :: forall b. forall a. (a -> a -> b) -> Ref a -> Ref a -> b
143−
144 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
135 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
145
136
146 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
137 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
@@ -175,13 +166,9 @@ Values
175
166
176 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
167 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
177
168
178− readNumber :: Prim.String -> Prim.Number
169+ readNumberImpl :: Prim.String -> Prim.Number
179
170
180− refEq :: forall a. Ref a -> Ref a -> Prim.Boolean
181−
182− refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
183−
184− showNumber :: Prim.Number -> Prim.String
171+ showNumberImpl :: Prim.Number -> Prim.String
185
172
186 unsafeRefEq :: forall a. a -> a -> Prim.Boolean
173 unsafeRefEq :: forall a. a -> a -> Prim.Boolean
187
174
@@ -207,9 +194,9 @@ Type Class Instances
207
194
208::
195::
209
196
210− instance Monoid Prim.String
197+ instance monoidArray :: Monoid ([a])
211
198
212− instance Monoid [a]
199+ instance monoidString :: Monoid (Prim.String)
213
200
214Values
201Values
215~~~~~~
202~~~~~~
@@ -251,6 +238,8 @@ Values
251
238
252 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
239 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
253
240
241+ zipWithM :: forall c. forall b. forall a. forall m. (Monad (m)) => (a -> b -> m c) -> [a] -> [b] -> m [c]
242+
254Module Data.Maybe
243Module Data.Maybe
255-----------------
244-----------------
256
245
@@ -271,13 +260,13 @@ Type Class Instances
271
260
272::
261::
273
262
274− instance Prelude.Applicative Maybe
263+ instance applicativeMaybe :: Applicative (Maybe)
275
264
276− instance Prelude.Functor Maybe
265+ instance functorMaybe :: Functor (Maybe)
277
266
278− instance Prelude.Monad Maybe
267+ instance monadMaybe :: Monad (Maybe)
279
268
280− (Show (a)) => instance Prelude.Show Maybe a
269+ (Show ((a))) => instance showMaybe :: Show (Maybe a)
281
270
282Values
271Values
283~~~~~~
272~~~~~~
@@ -308,13 +297,13 @@ Type Class Instances
308
297
309::
298::
310
299
311− instance Prelude.Applicative Either e
300+ instance applicativeEither :: Applicative (Either e)
312
301
313− instance Prelude.Functor Either a
302+ instance functorEither :: Functor (Either a)
314
303
315− instance Prelude.Monad Either e
304+ instance monadEither :: Monad (Either e)
316
305
317− (Show (a),Show (b)) => instance Prelude.Show Either a b
306+ (Show ((a)),Show ((b))) => instance showEither :: Show (Either a b)
318
307
319Values
308Values
320~~~~~~
309~~~~~~
@@ -337,13 +326,13 @@ Type Class Instances
337
326
338::
327::
339
328
340− instance Prelude.Alternative Prim.Array
329+ instance alternativeArray :: Alternative (Prim.Array)
341
330
342− instance Prelude.Functor Prim.Array
331+ instance functorArray :: Functor (Prim.Array)
343
332
344− instance Prelude.Monad Prim.Array
333+ instance monadArray :: Monad (Prim.Array)
345
334
346− (Prelude.Show (a)) => instance Prelude.Show [a]
335+ (Show ((a))) => instance showArray :: Show ([a])
347
336
348Values
337Values
349~~~~~~
338~~~~~~
@@ -360,11 +349,15 @@ Values
360
349
361 concatMap :: forall b. forall a. [a] -> (a -> [b]) -> [b]
350 concatMap :: forall b. forall a. [a] -> (a -> [b]) -> [b]
362
351
352+ deleteAt :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
353+
354+ drop :: forall a. Prim.Number -> [a] -> [a]
355+
363 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
356 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
364
357
365 find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
358 find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
366
359
367− foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
360+ foldl :: forall b. forall a. (b -> a -> b) -> b -> [a] -> b
368
361
369 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
362 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
370
363
@@ -372,6 +365,8 @@ Values
372
365
373 indexOf :: forall a. [a] -> a -> Prim.Number
366 indexOf :: forall a. [a] -> a -> Prim.Number
374
367
368+ insertAt :: forall a. Prim.Number -> a -> [a] -> [a]
369+
375 isEmpty :: forall a. [a] -> Prim.Boolean
370 isEmpty :: forall a. [a] -> Prim.Boolean
376
371
377 joinS :: [Prim.String] -> Prim.String
372 joinS :: [Prim.String] -> Prim.String
@@ -398,12 +393,46 @@ Values
398
393
399 sort :: forall a. [a] -> [a]
394 sort :: forall a. [a] -> [a]
400
395
401− splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
402−
403 tail :: forall a. [a] -> Maybe [a]
396 tail :: forall a. [a] -> Maybe [a]
404
397
398+ take :: forall a. Prim.Number -> [a] -> [a]
399+
400+ updateAt :: forall a. Prim.Number -> a -> [a] -> [a]
401+
405 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
402 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
406
403
404+Module Data.Eq
405+--------------
406+
407+Types
408+~~~~~
409+
410+::
411+
412+ data Ref a where
413+ Ref :: a -> Ref a
414+
415+Type Classes
416+~~~~~~~~~~~~
417+
418+Type Class Instances
419+~~~~~~~~~~~~~~~~~~~~
420+
421+::
422+
423+ instance eqRef :: Eq (Ref a)
424+
425+Values
426+~~~~~~
427+
428+::
429+
430+ liftRef :: forall b. forall a. (a -> a -> b) -> Ref a -> Ref a -> b
431+
432+ refEq :: forall a. Ref a -> Ref a -> Prim.Boolean
433+
434+ refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
435+
407Module Data.Array.Unsafe
436Module Data.Array.Unsafe
408------------------------
437------------------------
409
438
@@ -444,7 +473,7 @@ Type Class Instances
444
473
445::
474::
446
475
447− (Prelude.Show (a),Prelude.Show (b)) => instance Prelude.Show Tuple a b
476+ (Show ((a)),Show ((b))) => instance showTuple :: Show (Tuple a b)
448
477
449Values
478Values
450~~~~~~
479~~~~~~
@@ -663,7 +692,7 @@ Type Class Instances
663
692
664::
693::
665
694
666− instance Prelude.Monad Eff e
695+ instance monadEff :: Monad (Eff e)
667
696
668Values
697Values
669~~~~~~
698~~~~~~
@@ -684,6 +713,25 @@ Values
684
713
685 whileE :: forall a. forall e. Eff e Prim.Boolean -> Eff e a -> Eff e { }
714 whileE :: forall a. forall e. Eff e Prim.Boolean -> Eff e a -> Eff e { }
686
715
716+Module Control.Monad.Eff.Unsafe
717+-------------------------------
718+
719+Types
720+~~~~~
721+
722+Type Classes
723+~~~~~~~~~~~~
724+
725+Type Class Instances
726+~~~~~~~~~~~~~~~~~~~~
727+
728+Values
729+~~~~~~
730+
731+::
732+
733+ unsafeInterleaveEff :: forall a. forall eff2. forall eff1. Eff eff1 a -> Eff eff2 a
734+
687Module Random
735Module Random
688-------------
736-------------
689
737
@@ -786,7 +834,7 @@ Values
786
834
787::
835::
788
836
789− print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff (trace :: Trace | r) { }
837+ print :: forall r. forall a. (Show (a)) => a -> Eff (trace :: Trace | r) { }
790
838
791 trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
839 trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
792
840
prelude/README.md+90−50
@@ -3,9 +3,6 @@
3
3
4### Types
4### Types
5
5
6− data Ref a where
7− Ref :: a -> Ref a
8−
9
6
10### Type Classes
7### Type Classes
11
8
@@ -70,41 +67,39 @@
70
67
71### Type Class Instances
68### Type Class Instances
72
69
73− (Monad (m)) => instance Applicative m
70+ (Monad ((m))) => instance applicativeFromMonad :: Applicative (m)
74−
75− instance Bits Prim.Number
76
71
77− instance BoolLike Prim.Boolean
72+ instance bitsNumber :: Bits (Prim.Number)
78
73
79− instance Category Prim.Function
74+ instance boolLikeBoolean :: BoolLike (Prim.Boolean)
80
75
81− instance Eq Ref a
76+ instance categoryArr :: Category (Prim.Function)
82
77
83− instance Eq Prim.String
78+ (Eq ((a))) => instance eqArray :: Eq ([a])
84
79
85− instance Eq Prim.Number
80+ instance eqBoolean :: Eq (Prim.Boolean)
86
81
87− instance Eq Prim.Boolean
82+ instance eqNumber :: Eq (Prim.Number)
88
83
89− (Eq (a)) => instance Eq [a]
84+ instance eqString :: Eq (Prim.String)
90
85
91− (Applicative (f)) => instance Functor f
86+ (Applicative ((f))) => instance functorFromApplicative :: Functor (f)
92
87
93− instance Num Prim.Number
88+ instance numNumber :: Num (Prim.Number)
94
89
95− instance Ord Prim.Number
90+ instance ordNumber :: Ord (Prim.Number)
96
91
97− instance Prelude.Show Prim.Number
92+ instance readBoolean :: Read (Prim.Boolean)
98
93
99− instance Read Prim.String
94+ instance readNumber :: Read (Prim.Number)
100
95
101− instance Read Prim.Boolean
96+ instance readString :: Read (Prim.String)
102
97
103− instance Read Prim.Number
98+ instance showBoolean :: Show (Prim.Boolean)
104
99
105− instance Show Prim.String
100+ instance showNumber :: Show (Prim.Number)
106
101
107− instance Show Prim.Boolean
102+ instance showString :: Show (Prim.String)
108
103
109
104
110### Values
105### Values
@@ -127,8 +122,6 @@
127
122
128 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
123 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
129
124
130− liftRef :: forall b. forall a. (a -> a -> b) -> Ref a -> Ref a -> b
131−
132 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
125 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
133
126
134 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
127 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
@@ -163,13 +156,9 @@
163
156
164 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
157 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
165
158
166− readNumber :: Prim.String -> Prim.Number
159+ readNumberImpl :: Prim.String -> Prim.Number
167−
168− refEq :: forall a. Ref a -> Ref a -> Prim.Boolean
169−
170− refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
171
160
172− showNumber :: Prim.Number -> Prim.String
161+ showNumberImpl :: Prim.Number -> Prim.String
173
162
174 unsafeRefEq :: forall a. a -> a -> Prim.Boolean
163 unsafeRefEq :: forall a. a -> a -> Prim.Boolean
175
164
@@ -190,9 +179,9 @@
190
179
191### Type Class Instances
180### Type Class Instances
192
181
193− instance Monoid Prim.String
182+ instance monoidArray :: Monoid ([a])
194
183
195− instance Monoid [a]
184+ instance monoidString :: Monoid (Prim.String)
196
185
197
186
198### Values
187### Values
@@ -229,6 +218,8 @@
229
218
230 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
219 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
231
220
221+ zipWithM :: forall c. forall b. forall a. forall m. (Monad (m)) => (a -> b -> m c) -> [a] -> [b] -> m [c]
222+
232
223
233## Module Data.Maybe
224## Module Data.Maybe
234
225
@@ -244,13 +235,13 @@
244
235
245### Type Class Instances
236### Type Class Instances
246
237
247− instance Prelude.Applicative Maybe
238+ instance applicativeMaybe :: Applicative (Maybe)
248
239
249− instance Prelude.Functor Maybe
240+ instance functorMaybe :: Functor (Maybe)
250
241
251− instance Prelude.Monad Maybe
242+ instance monadMaybe :: Monad (Maybe)
252
243
253− (Show (a)) => instance Prelude.Show Maybe a
244+ (Show ((a))) => instance showMaybe :: Show (Maybe a)
254
245
255
246
256### Values
247### Values
@@ -274,13 +265,13 @@
274
265
275### Type Class Instances
266### Type Class Instances
276
267
277− instance Prelude.Applicative Either e
268+ instance applicativeEither :: Applicative (Either e)
278
269
279− instance Prelude.Functor Either a
270+ instance functorEither :: Functor (Either a)
280
271
281− instance Prelude.Monad Either e
272+ instance monadEither :: Monad (Either e)
282
273
283− (Show (a),Show (b)) => instance Prelude.Show Either a b
274+ (Show ((a)),Show ((b))) => instance showEither :: Show (Either a b)
284
275
285
276
286### Values
277### Values
@@ -298,13 +289,13 @@
298
289
299### Type Class Instances
290### Type Class Instances
300
291
301− instance Prelude.Alternative Prim.Array
292+ instance alternativeArray :: Alternative (Prim.Array)
302
293
303− instance Prelude.Functor Prim.Array
294+ instance functorArray :: Functor (Prim.Array)
304
295
305− instance Prelude.Monad Prim.Array
296+ instance monadArray :: Monad (Prim.Array)
306
297
307− (Prelude.Show (a)) => instance Prelude.Show [a]
298+ (Show ((a))) => instance showArray :: Show ([a])
308
299
309
300
310### Values
301### Values
@@ -319,11 +310,15 @@
319
310
320 concatMap :: forall b. forall a. [a] -> (a -> [b]) -> [b]
311 concatMap :: forall b. forall a. [a] -> (a -> [b]) -> [b]
321
312
313+ deleteAt :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
314+
315+ drop :: forall a. Prim.Number -> [a] -> [a]
316+
322 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
317 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
323
318
324 find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
319 find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
325
320
326− foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
321+ foldl :: forall b. forall a. (b -> a -> b) -> b -> [a] -> b
327
322
328 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
323 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
329
324
@@ -331,6 +326,8 @@
331
326
332 indexOf :: forall a. [a] -> a -> Prim.Number
327 indexOf :: forall a. [a] -> a -> Prim.Number
333
328
329+ insertAt :: forall a. Prim.Number -> a -> [a] -> [a]
330+
334 isEmpty :: forall a. [a] -> Prim.Boolean
331 isEmpty :: forall a. [a] -> Prim.Boolean
335
332
336 joinS :: [Prim.String] -> Prim.String
333 joinS :: [Prim.String] -> Prim.String
@@ -357,13 +354,40 @@
357
354
358 sort :: forall a. [a] -> [a]
355 sort :: forall a. [a] -> [a]
359
356
360− splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
361−
362 tail :: forall a. [a] -> Maybe [a]
357 tail :: forall a. [a] -> Maybe [a]
363
358
359+ take :: forall a. Prim.Number -> [a] -> [a]
360+
361+ updateAt :: forall a. Prim.Number -> a -> [a] -> [a]
362+
364 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
363 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
365
364
366
365
366+## Module Data.Eq
367+
368+### Types
369+
370+ data Ref a where
371+ Ref :: a -> Ref a
372+
373+
374+### Type Classes
375+
376+
377+### Type Class Instances
378+
379+ instance eqRef :: Eq (Ref a)
380+
381+
382+### Values
383+
384+ liftRef :: forall b. forall a. (a -> a -> b) -> Ref a -> Ref a -> b
385+
386+ refEq :: forall a. Ref a -> Ref a -> Prim.Boolean
387+
388+ refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
389+
390+
367## Module Data.Array.Unsafe
391## Module Data.Array.Unsafe
368
392
369### Types
393### Types
@@ -395,7 +419,7 @@
395
419
396### Type Class Instances
420### Type Class Instances
397
421
398− (Prelude.Show (a),Prelude.Show (b)) => instance Prelude.Show Tuple a b
422+ (Show ((a)),Show ((b))) => instance showTuple :: Show (Tuple a b)
399
423
400
424
401### Values
425### Values
@@ -593,7 +617,7 @@
593
617
594### Type Class Instances
618### Type Class Instances
595
619
596− instance Prelude.Monad Eff e
620+ instance monadEff :: Monad (Eff e)
597
621
598
622
599### Values
623### Values
@@ -613,6 +637,22 @@
613 whileE :: forall a. forall e. Eff e Prim.Boolean -> Eff e a -> Eff e { }
637 whileE :: forall a. forall e. Eff e Prim.Boolean -> Eff e a -> Eff e { }
614
638
615
639
640+## Module Control.Monad.Eff.Unsafe
641+
642+### Types
643+
644+
645+### Type Classes
646+
647+
648+### Type Class Instances
649+
650+
651+### Values
652+
653+ unsafeInterleaveEff :: forall a. forall eff2. forall eff1. Eff eff1 a -> Eff eff2 a
654+
655+
616## Module Random
656## Module Random
617
657
618### Types
658### Types
@@ -694,7 +734,7 @@
694
734
695### Values
735### Values
696
736
697− print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff (trace :: Trace | r) { }
737+ print :: forall r. forall a. (Show (a)) => a -> Eff (trace :: Trace | r) { }
698
738
699 trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
739 trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
700
740