git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Update docs
0952561Gary Burgess
docs/source/prelude.rst+116−48
compare with golang
unifiedsplit
@@ -139,6 +139,8 @@ Values
139
139
140 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
140 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
141
141
142+ liftRef :: forall b. forall a. (a -> a -> b) -> Ref a -> Ref a -> b
143+
142 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
144 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
143
145
144 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
146 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
@@ -185,8 +187,8 @@ Values
185
187
186 unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
188 unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
187
189
188−Module Monoid
190+Module Data.Monoid
189−-------------
191+------------------
190
192
191Types
193Types
192~~~~~
194~~~~~
@@ -216,8 +218,8 @@ Values
216
218
217 mconcat :: forall m. (Monoid (m)) => [m] -> m
219 mconcat :: forall m. (Monoid (m)) => [m] -> m
218
220
219−Module Monad
221+Module Control.Monad
220−------------
222+--------------------
221
223
222Types
224Types
223~~~~~
225~~~~~
@@ -249,8 +251,8 @@ Values
249
251
250 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
252 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
251
253
252−Module Maybe
254+Module Data.Maybe
253−------------
255+-----------------
254
256
255Types
257Types
256~~~~~
258~~~~~
@@ -286,8 +288,8 @@ Values
286
288
287 maybe :: forall b. forall a. b -> (a -> b) -> Maybe a -> b
289 maybe :: forall b. forall a. b -> (a -> b) -> Maybe a -> b
288
290
289−Module Either
291+Module Data.Either
290−-------------
292+------------------
291
293
292Types
294Types
293~~~~~
295~~~~~
@@ -321,8 +323,8 @@ Values
321
323
322 either :: forall c. forall b. forall a. (a -> c) -> (b -> c) -> Either a b -> c
324 either :: forall c. forall b. forall a. (a -> c) -> (b -> c) -> Either a b -> c
323
325
324−Module Arrays
326+Module Data.Array
325−-------------
327+-----------------
326
328
327Types
329Types
328~~~~~
330~~~~~
@@ -360,13 +362,13 @@ Values
360
362
361 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
363 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
362
364
365+ find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
366+
363 foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
367 foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
364
368
365 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
369 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
366
370
367− head :: forall a. [a] -> a
371+ head :: forall a. [a] -> Maybe a
368−
369− headSafe :: forall a. [a] -> Maybe a
370
372
371 indexOf :: forall a. [a] -> a -> Prim.Number
373 indexOf :: forall a. [a] -> a -> Prim.Number
372
374
@@ -398,14 +400,33 @@ Values
398
400
399 splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
401 splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
400
402
401− tail :: forall a. [a] -> [a]
403+ tail :: forall a. [a] -> Maybe [a]
402−
403− tailSafe :: forall a. [a] -> Maybe [a]
404
404
405 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
405 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
406
406
407−Module Tuples
407+Module Data.Array.Unsafe
408−-------------
408+------------------------
409+
410+Types
411+~~~~~
412+
413+Type Classes
414+~~~~~~~~~~~~
415+
416+Type Class Instances
417+~~~~~~~~~~~~~~~~~~~~
418+
419+Values
420+~~~~~~
421+
422+::
423+
424+ head :: forall a. [a] -> a
425+
426+ tail :: forall a. [a] -> [a]
427+
428+Module Data.Tuple
429+-----------------
409
430
410Types
431Types
411~~~~~
432~~~~~
@@ -438,8 +459,8 @@ Values
438
459
439 zip :: forall b. forall a. [a] -> [b] -> [Tuple a b]
460 zip :: forall b. forall a. [a] -> [b] -> [Tuple a b]
440
461
441−Module String
462+Module Data.String
442−-------------
463+------------------
443
464
444Types
465Types
445~~~~~
466~~~~~
@@ -481,8 +502,8 @@ Values
481
502
482 trim :: Prim.String -> Prim.String
503 trim :: Prim.String -> Prim.String
483
504
484−Module Regex
505+Module Data.String.Regex
485−------------
506+------------------------
486
507
487Types
508Types
488~~~~~
509~~~~~
@@ -586,16 +607,28 @@ Values
586
607
587 cos :: Prim.Number -> Prim.Number
608 cos :: Prim.Number -> Prim.Number
588
609
610+ e :: Prim.Number
611+
589 exp :: Prim.Number -> Prim.Number
612 exp :: Prim.Number -> Prim.Number
590
613
591 floor :: Prim.Number -> Prim.Number
614 floor :: Prim.Number -> Prim.Number
592
615
616+ ln10 :: Prim.Number
617+
618+ ln2 :: Prim.Number
619+
593 log :: Prim.Number -> Prim.Number
620 log :: Prim.Number -> Prim.Number
594
621
622+ log10e :: Prim.Number
623+
624+ log2e :: Prim.Number
625+
595 max :: Prim.Number -> Prim.Number
626 max :: Prim.Number -> Prim.Number
596
627
597 min :: Prim.Number -> Prim.Number
628 min :: Prim.Number -> Prim.Number
598
629
630+ pi :: Prim.Number
631+
599 pow :: Prim.Number -> Prim.Number
632 pow :: Prim.Number -> Prim.Number
600
633
601 round :: Prim.Number -> Prim.Number
634 round :: Prim.Number -> Prim.Number
@@ -604,10 +637,14 @@ Values
604
637
605 sqrt :: Prim.Number -> Prim.Number
638 sqrt :: Prim.Number -> Prim.Number
606
639
640+ sqrt1_2 :: Prim.Number
641+
642+ sqrt2 :: Prim.Number
643+
607 tan :: Prim.Number -> Prim.Number
644 tan :: Prim.Number -> Prim.Number
608
645
609−Module Eff
646+Module Control.Monad.Eff
610−----------
647+------------------------
611
648
612Types
649Types
613~~~~~
650~~~~~
@@ -645,7 +682,7 @@ Values
645
682
646 untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
683 untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
647
684
648− whileE :: forall e. Eff e Prim.Boolean -> Eff e { } -> Eff e { }
685+ whileE :: forall a. forall e. Eff e Prim.Boolean -> Eff e a -> Eff e { }
649
686
650Module Random
687Module Random
651-------------
688-------------
@@ -668,10 +705,10 @@ Values
668
705
669::
706::
670
707
671− random :: forall e. Eff random :: Random | e Prim.Number
708+ random :: forall e. Eff (random :: Random | e) Prim.Number
672
709
673−Module Errors
710+Module Control.Monad.Error
674−-------------
711+--------------------------
675
712
676Types
713Types
677~~~~~
714~~~~~
@@ -691,12 +728,12 @@ Values
691
728
692::
729::
693
730
694− catchError :: forall a. forall r. forall e. (e -> Eff r a) -> Eff err :: Error e | r a -> Eff r a
731+ catchError :: forall a. forall r. forall e. (e -> Eff r a) -> Eff (err :: Error e | r) a -> Eff r a
695
732
696− throwError :: forall r. forall e. forall a. e -> Eff err :: Error e | r a
733+ throwError :: forall r. forall e. forall a. e -> Eff (err :: Error e | r) a
697
734
698−Module IORef
735+Module Data.IORef
699−------------
736+-----------------
700
737
701Types
738Types
702~~~~~
739~~~~~
@@ -718,18 +755,18 @@ Values
718
755
719::
756::
720
757
721− modifyIORef :: forall r. forall s. IORef s -> (s -> s) -> Eff ref :: Ref | r { }
758+ modifyIORef :: forall r. forall s. IORef s -> (s -> s) -> Eff (ref :: Ref | r) { }
722
759
723− newIORef :: forall r. forall s. s -> Eff ref :: Ref | r (IORef s)
760+ newIORef :: forall r. forall s. s -> Eff (ref :: Ref | r) (IORef s)
724
761
725− readIORef :: forall r. forall s. IORef s -> Eff ref :: Ref | r s
762+ readIORef :: forall r. forall s. IORef s -> Eff (ref :: Ref | r) s
726
763
727− unsafeRunIORef :: forall a. forall eff. Eff ref :: Ref | eff a -> Eff eff a
764+ unsafeRunIORef :: forall a. forall eff. Eff (ref :: Ref | eff) a -> Eff eff a
728
765
729− writeIORef :: forall r. forall s. IORef s -> s -> Eff ref :: Ref | r { }
766+ writeIORef :: forall r. forall s. IORef s -> s -> Eff (ref :: Ref | r) { }
730
767
731−Module Trace
768+Module Debug.Trace
732−------------
769+------------------
733
770
734Types
771Types
735~~~~~
772~~~~~
@@ -749,12 +786,12 @@ Values
749
786
750::
787::
751
788
752− print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff trace :: Trace | r { }
789+ print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff (trace :: Trace | r) { }
753
790
754− trace :: forall r. Prim.String -> Eff trace :: Trace | r { }
791+ trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
755
792
756−Module ST
793+Module Control.Monad.ST
757−---------
794+-----------------------
758
795
759Types
796Types
760~~~~~
797~~~~~
@@ -763,6 +800,8 @@ Types
763
800
764 data ST :: * -> !
801 data ST :: * -> !
765
802
803+ data STArray :: * -> * -> *
804+
766 data STRef :: * -> * -> *
805 data STRef :: * -> * -> *
767
806
768Type Classes
807Type Classes
@@ -776,13 +815,42 @@ Values
776
815
777::
816::
778
817
779− modifySTRef :: forall r. forall h. forall a. STRef h a -> (a -> a) -> Eff st :: ST h | r { }
818+ modifySTRef :: forall r. forall h. forall a. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
819+
820+ newSTArray :: forall r. forall h. forall a. Prim.Number -> a -> Eff (st :: ST h | r) (STArray h a)
821+
822+ newSTRef :: forall r. forall h. forall a. a -> Eff (st :: ST h | r) (STRef h a)
823+
824+ peekSTArray :: forall r. forall h. forall a. STArray h a -> Eff (st :: ST h | r) a
825+
826+ pokeSTArray :: forall r. forall h. forall a. STArray h a -> Prim.Number -> a -> Eff (st :: ST h | r) a
827+
828+ readSTRef :: forall r. forall h. forall a. STRef h a -> Eff (st :: ST h | r) a
780
829
781− newSTRef :: forall r. forall h. forall a. a -> Eff st :: ST h | r (STRef h a)
830+ runST :: forall r. forall a. forall h. Eff (st :: ST h | r) a -> Eff r a
782
831
783− readSTRef :: forall r. forall h. forall a. STRef h a -> Eff st :: ST h | r a
832+ runSTArray :: forall r. forall a. forall h. Eff (st :: ST h | r) (STArray h a) -> Eff r [a]
784
833
785− runST :: forall r. forall a. forall h. Eff st :: ST h | r a -> Eff r a
834+ writeSTRef :: forall r. forall h. forall a. STRef h a -> a -> Eff (st :: ST h | r) a
786
835
787− writeSTRef :: forall r. forall h. forall a. STRef h a -> a -> Eff st :: ST h | r { }
836+Module Data.Enum
837+----------------
838+
839+Types
840+~~~~~
841+
842+Type Classes
843+~~~~~~~~~~~~
844+
845+::
846+
847+ class Enum a where
848+ toEnum :: Prim.Number -> Maybe a
849+ fromEnum :: a -> Prim.Number
850+
851+Type Class Instances
852+~~~~~~~~~~~~~~~~~~~~
853+
854+Values
855+~~~~~~
788
856
prelude/README.md+97−35
@@ -127,6 +127,8 @@
127
127
128 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
128 flip :: forall c. forall b. forall a. (a -> b -> c) -> b -> a -> c
129
129
130+ liftRef :: forall b. forall a. (a -> a -> b) -> Ref a -> Ref a -> b
131+
130 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
132 numAdd :: Prim.Number -> Prim.Number -> Prim.Number
131
133
132 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
134 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
@@ -174,7 +176,7 @@
174 unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
176 unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
175
177
176
178
177−## Module Monoid
179+## Module Data.Monoid
178
180
179### Types
181### Types
180
182
@@ -198,7 +200,7 @@
198 mconcat :: forall m. (Monoid (m)) => [m] -> m
200 mconcat :: forall m. (Monoid (m)) => [m] -> m
199
201
200
202
201−## Module Monad
203+## Module Control.Monad
202
204
203### Types
205### Types
204
206
@@ -228,7 +230,7 @@
228 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
230 when :: forall m. (Monad (m)) => Prim.Boolean -> m { } -> m { }
229
231
230
232
231−## Module Maybe
233+## Module Data.Maybe
232
234
233### Types
235### Types
234
236
@@ -258,7 +260,7 @@
258 maybe :: forall b. forall a. b -> (a -> b) -> Maybe a -> b
260 maybe :: forall b. forall a. b -> (a -> b) -> Maybe a -> b
259
261
260
262
261−## Module Either
263+## Module Data.Either
262
264
263### Types
265### Types
264
266
@@ -286,7 +288,7 @@
286 either :: forall c. forall b. forall a. (a -> c) -> (b -> c) -> Either a b -> c
288 either :: forall c. forall b. forall a. (a -> c) -> (b -> c) -> Either a b -> c
287
289
288
290
289−## Module Arrays
291+## Module Data.Array
290
292
291### Types
293### Types
292
294
@@ -319,13 +321,13 @@
319
321
320 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
322 filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
321
323
324+ find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
325+
322 foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
326 foldl :: forall b. forall a. (a -> b -> b) -> b -> [a] -> b
323
327
324 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
328 foldr :: forall b. forall a. (a -> b -> a) -> a -> [b] -> a
325
329
326− head :: forall a. [a] -> a
330+ head :: forall a. [a] -> Maybe a
327−
328− headSafe :: forall a. [a] -> Maybe a
329
331
330 indexOf :: forall a. [a] -> a -> Prim.Number
332 indexOf :: forall a. [a] -> a -> Prim.Number
331
333
@@ -357,14 +359,30 @@
357
359
358 splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
360 splice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] -> [a]
359
361
360− tail :: forall a. [a] -> [a]
362+ tail :: forall a. [a] -> Maybe [a]
361−
362− tailSafe :: forall a. [a] -> Maybe [a]
363
363
364 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
364 zipWith :: forall c. forall b. forall a. (a -> b -> c) -> [a] -> [b] -> [c]
365
365
366
366
367−## Module Tuples
367+## Module Data.Array.Unsafe
368+
369+### Types
370+
371+
372+### Type Classes
373+
374+
375+### Type Class Instances
376+
377+
378+### Values
379+
380+ head :: forall a. [a] -> a
381+
382+ tail :: forall a. [a] -> [a]
383+
384+
385+## Module Data.Tuple
368
386
369### Types
387### Types
370
388
@@ -391,7 +409,7 @@
391 zip :: forall b. forall a. [a] -> [b] -> [Tuple a b]
409 zip :: forall b. forall a. [a] -> [b] -> [Tuple a b]
392
410
393
411
394−## Module String
412+## Module Data.String
395
413
396### Types
414### Types
397
415
@@ -431,7 +449,7 @@
431 trim :: Prim.String -> Prim.String
449 trim :: Prim.String -> Prim.String
432
450
433
451
434−## Module Regex
452+## Module Data.String.Regex
435
453
436### Types
454### Types
437
455
@@ -524,16 +542,28 @@
524
542
525 cos :: Prim.Number -> Prim.Number
543 cos :: Prim.Number -> Prim.Number
526
544
545+ e :: Prim.Number
546+
527 exp :: Prim.Number -> Prim.Number
547 exp :: Prim.Number -> Prim.Number
528
548
529 floor :: Prim.Number -> Prim.Number
549 floor :: Prim.Number -> Prim.Number
530
550
551+ ln10 :: Prim.Number
552+
553+ ln2 :: Prim.Number
554+
531 log :: Prim.Number -> Prim.Number
555 log :: Prim.Number -> Prim.Number
532
556
557+ log10e :: Prim.Number
558+
559+ log2e :: Prim.Number
560+
533 max :: Prim.Number -> Prim.Number
561 max :: Prim.Number -> Prim.Number
534
562
535 min :: Prim.Number -> Prim.Number
563 min :: Prim.Number -> Prim.Number
536
564
565+ pi :: Prim.Number
566+
537 pow :: Prim.Number -> Prim.Number
567 pow :: Prim.Number -> Prim.Number
538
568
539 round :: Prim.Number -> Prim.Number
569 round :: Prim.Number -> Prim.Number
@@ -542,10 +572,14 @@
542
572
543 sqrt :: Prim.Number -> Prim.Number
573 sqrt :: Prim.Number -> Prim.Number
544
574
575+ sqrt1_2 :: Prim.Number
576+
577+ sqrt2 :: Prim.Number
578+
545 tan :: Prim.Number -> Prim.Number
579 tan :: Prim.Number -> Prim.Number
546
580
547
581
548−## Module Eff
582+## Module Control.Monad.Eff
549
583
550### Types
584### Types
551
585
@@ -576,7 +610,7 @@
576
610
577 untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
611 untilE :: forall e. Eff e Prim.Boolean -> Eff e { }
578
612
579− whileE :: forall e. Eff e Prim.Boolean -> Eff e { } -> Eff e { }
613+ whileE :: forall a. forall e. Eff e Prim.Boolean -> Eff e a -> Eff e { }
580
614
581
615
582## Module Random
616## Module Random
@@ -594,10 +628,10 @@
594
628
595### Values
629### Values
596
630
597− random :: forall e. Eff random :: Random | e Prim.Number
631+ random :: forall e. Eff (random :: Random | e) Prim.Number
598
632
599
633
600−## Module Errors
634+## Module Control.Monad.Error
601
635
602### Types
636### Types
603
637
@@ -612,12 +646,12 @@
612
646
613### Values
647### Values
614
648
615− catchError :: forall a. forall r. forall e. (e -> Eff r a) -> Eff err :: Error e | r a -> Eff r a
649+ catchError :: forall a. forall r. forall e. (e -> Eff r a) -> Eff (err :: Error e | r) a -> Eff r a
616
650
617− throwError :: forall r. forall e. forall a. e -> Eff err :: Error e | r a
651+ throwError :: forall r. forall e. forall a. e -> Eff (err :: Error e | r) a
618
652
619
653
620−## Module IORef
654+## Module Data.IORef
621
655
622### Types
656### Types
623
657
@@ -634,18 +668,18 @@
634
668
635### Values
669### Values
636
670
637− modifyIORef :: forall r. forall s. IORef s -> (s -> s) -> Eff ref :: Ref | r { }
671+ modifyIORef :: forall r. forall s. IORef s -> (s -> s) -> Eff (ref :: Ref | r) { }
638
672
639− newIORef :: forall r. forall s. s -> Eff ref :: Ref | r (IORef s)
673+ newIORef :: forall r. forall s. s -> Eff (ref :: Ref | r) (IORef s)
640
674
641− readIORef :: forall r. forall s. IORef s -> Eff ref :: Ref | r s
675+ readIORef :: forall r. forall s. IORef s -> Eff (ref :: Ref | r) s
642
676
643− unsafeRunIORef :: forall a. forall eff. Eff ref :: Ref | eff a -> Eff eff a
677+ unsafeRunIORef :: forall a. forall eff. Eff (ref :: Ref | eff) a -> Eff eff a
644
678
645− writeIORef :: forall r. forall s. IORef s -> s -> Eff ref :: Ref | r { }
679+ writeIORef :: forall r. forall s. IORef s -> s -> Eff (ref :: Ref | r) { }
646
680
647
681
648−## Module Trace
682+## Module Debug.Trace
649
683
650### Types
684### Types
651
685
@@ -660,17 +694,19 @@
660
694
661### Values
695### Values
662
696
663− print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff trace :: Trace | r { }
697+ print :: forall r. forall a. (Prelude.Show (a)) => a -> Eff (trace :: Trace | r) { }
664
698
665− trace :: forall r. Prim.String -> Eff trace :: Trace | r { }
699+ trace :: forall r. Prim.String -> Eff (trace :: Trace | r) { }
666
700
667
701
668−## Module ST
702+## Module Control.Monad.ST
669
703
670### Types
704### Types
671
705
672 data ST :: * -> !
706 data ST :: * -> !
673
707
708+ data STArray :: * -> * -> *
709+
674 data STRef :: * -> * -> *
710 data STRef :: * -> * -> *
675
711
676
712
@@ -682,15 +718,41 @@
682
718
683### Values
719### Values
684
720
685− modifySTRef :: forall r. forall h. forall a. STRef h a -> (a -> a) -> Eff st :: ST h | r { }
721+ modifySTRef :: forall r. forall h. forall a. STRef h a -> (a -> a) -> Eff (st :: ST h | r) a
722+
723+ newSTArray :: forall r. forall h. forall a. Prim.Number -> a -> Eff (st :: ST h | r) (STArray h a)
724+
725+ newSTRef :: forall r. forall h. forall a. a -> Eff (st :: ST h | r) (STRef h a)
726+
727+ peekSTArray :: forall r. forall h. forall a. STArray h a -> Eff (st :: ST h | r) a
728+
729+ pokeSTArray :: forall r. forall h. forall a. STArray h a -> Prim.Number -> a -> Eff (st :: ST h | r) a
730+
731+ readSTRef :: forall r. forall h. forall a. STRef h a -> Eff (st :: ST h | r) a
732+
733+ runST :: forall r. forall a. forall h. Eff (st :: ST h | r) a -> Eff r a
686
734
687− newSTRef :: forall r. forall h. forall a. a -> Eff st :: ST h | r (STRef h a)
735+ runSTArray :: forall r. forall a. forall h. Eff (st :: ST h | r) (STArray h a) -> Eff r [a]
688
736
689− readSTRef :: forall r. forall h. forall a. STRef h a -> Eff st :: ST h | r a
737+ writeSTRef :: forall r. forall h. forall a. STRef h a -> a -> Eff (st :: ST h | r) a
690
738
691− runST :: forall r. forall a. forall h. Eff st :: ST h | r a -> Eff r a
692
739
693− writeSTRef :: forall r. forall h. forall a. STRef h a -> a -> Eff st :: ST h | r { }
740+## Module Data.Enum
741+
742+### Types
743+
744+
745+### Type Classes
746+
747+ class Enum a where
748+ toEnum :: Prim.Number -> Maybe a
749+ fromEnum :: a -> Prim.Number
750+
751+
752+### Type Class Instances
753+
754+
755+### Values
694
756
695
757
696
758