git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
Update Prelude docs
a1d7ff1Phil Freeman
docs/source/prelude.rst+29−580
compare with golang
unifiedsplit
@@ -7,6 +7,13 @@ Module Prelude
7Types
7Types
8~~~~~
8~~~~~
9
9
10+::
11+
12+ data Ordering where
13+ LT :: Ordering
14+ GT :: Ordering
15+ EQ :: Ordering
16+
10Type Classes
17Type Classes
11~~~~~~~~~~~~
18~~~~~~~~~~~~
12
19
@@ -37,7 +44,6 @@ Type Classes
37 class Category a where
44 class Category a where
38 id :: forall t. a t t
45 id :: forall t. a t t
39 (<<<) :: forall b c d. a c d -> a b c -> a b d
46 (<<<) :: forall b c d. a c d -> a b c -> a b d
40− (>>>) :: forall b c d. a b c -> a c d -> a b d
41
47
42 class Eq a where
48 class Eq a where
43 (==) :: a -> a -> Prim.Boolean
49 (==) :: a -> a -> Prim.Boolean
@@ -59,13 +65,7 @@ Type Classes
59 negate :: a -> a
65 negate :: a -> a
60
66
61 class Ord a where
67 class Ord a where
62− (<) :: a -> a -> Prim.Boolean
68+ compare :: a -> a -> Ordering
63− (>) :: a -> a -> Prim.Boolean
64− (<=) :: a -> a -> Prim.Boolean
65− (>=) :: a -> a -> Prim.Boolean
66−
67− class Read a where
68− read :: Prim.String -> a
69
69
70 class Show a where
70 class Show a where
71 show :: a -> Prim.String
71 show :: a -> Prim.String
@@ -97,16 +97,12 @@ Type Class Instances
97
97
98 instance ordNumber :: Ord Prim.Number
98 instance ordNumber :: Ord Prim.Number
99
99
100− instance readBoolean :: Read Prim.Boolean
101−
102− instance readNumber :: Read Prim.Number
103−
104− instance readString :: Read Prim.String
105−
106 instance showBoolean :: Show Prim.Boolean
100 instance showBoolean :: Show Prim.Boolean
107
101
108 instance showNumber :: Show Prim.Number
102 instance showNumber :: Show Prim.Number
109
103
104+ instance showOrdering :: Show Ordering
105+
110 instance showString :: Show Prim.String
106 instance showString :: Show Prim.String
111
107
112Values
108Values
@@ -122,6 +118,16 @@ Values
122
118
123 (++) :: Prim.String -> Prim.String -> Prim.String
119 (++) :: Prim.String -> Prim.String -> Prim.String
124
120
121+ (<) :: forall a. (Ord a) => a -> a -> Prim.Boolean
122+
123+ (<=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
124+
125+ (>) :: forall a. (Ord a) => a -> a -> Prim.Boolean
126+
127+ (>=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
128+
129+ (>>>) :: forall a b c d. (Category a) => a b c -> a c d -> a b d
130+
125 boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
131 boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
126
132
127 boolNot :: Prim.Boolean -> Prim.Boolean
133 boolNot :: Prim.Boolean -> Prim.Boolean
@@ -136,18 +142,12 @@ Values
136
142
137 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
143 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
138
144
145+ numCompare :: Prim.Number -> Prim.Number -> Ordering
146+
139 numComplement :: Prim.Number -> Prim.Number
147 numComplement :: Prim.Number -> Prim.Number
140
148
141 numDiv :: Prim.Number -> Prim.Number -> Prim.Number
149 numDiv :: Prim.Number -> Prim.Number -> Prim.Number
142
150
143− numGreater :: Prim.Number -> Prim.Number -> Prim.Boolean
144−
145− numGreaterEq :: Prim.Number -> Prim.Number -> Prim.Boolean
146−
147− numLess :: Prim.Number -> Prim.Number -> Prim.Boolean
148−
149− numLessEq :: Prim.Number -> Prim.Number -> Prim.Boolean
150−
151 numMod :: Prim.Number -> Prim.Number -> Prim.Number
151 numMod :: Prim.Number -> Prim.Number -> Prim.Number
152
152
153 numMul :: Prim.Number -> Prim.Number -> Prim.Number
153 numMul :: Prim.Number -> Prim.Number -> Prim.Number
@@ -166,241 +166,10 @@ Values
166
166
167 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
167 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
168
168
169− readNumberImpl :: Prim.String -> Prim.Number
169+ on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
170
170
171 showNumberImpl :: Prim.Number -> Prim.String
171 showNumberImpl :: Prim.Number -> Prim.String
172
172
173− unsafeRefEq :: forall a. a -> a -> Prim.Boolean
174−
175− unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
176−
177−Module Data.Monoid
178−------------------
179−
180−Types
181−~~~~~
182−
183−Type Classes
184−~~~~~~~~~~~~
185−
186−::
187−
188− class Monoid m where
189− mempty :: m
190− (<>) :: m -> m -> m
191−
192−Type Class Instances
193−~~~~~~~~~~~~~~~~~~~~
194−
195−::
196−
197− instance monoidArray :: Monoid [a]
198−
199− instance monoidString :: Monoid Prim.String
200−
201−Values
202−~~~~~~
203−
204−::
205−
206− mconcat :: forall m. (Monoid m) => [m] -> m
207−
208−Module Control.Monad
209−--------------------
210−
211−Types
212−~~~~~
213−
214−Type Classes
215−~~~~~~~~~~~~
216−
217−Type Class Instances
218−~~~~~~~~~~~~~~~~~~~~
219−
220−Values
221−~~~~~~
222−
223−::
224−
225− (<=<) :: forall m a b c. (Monad m) => (b -> m c) -> (a -> m b) -> a -> m c
226−
227− (>=>) :: forall m a b c. (Monad m) => (a -> m b) -> (b -> m c) -> a -> m c
228−
229− foldM :: forall m a b. (Monad m) => (a -> b -> m a) -> a -> [b] -> m a
230−
231− join :: forall m a. (Monad m) => m (m a) -> m a
232−
233− mapM :: forall m a b. (Monad m) => (a -> m b) -> [a] -> m [b]
234−
235− replicateM :: forall m a. (Monad m) => Prim.Number -> m a -> m [a]
236−
237− sequence :: forall m a. (Monad m) => [m a] -> m [a]
238−
239− when :: forall m. (Monad m) => Prim.Boolean -> m { } -> m { }
240−
241− zipWithM :: forall m a b c. (Monad m) => (a -> b -> m c) -> [a] -> [b] -> m [c]
242−
243−Module Data.Maybe
244−-----------------
245−
246−Types
247−~~~~~
248−
249−::
250−
251− data Maybe a where
252− Nothing :: Maybe a
253− Just :: a -> Maybe a
254−
255−Type Classes
256−~~~~~~~~~~~~
257−
258−Type Class Instances
259−~~~~~~~~~~~~~~~~~~~~
260−
261−::
262−
263− instance applicativeMaybe :: Applicative Maybe
264−
265− instance functorMaybe :: Functor Maybe
266−
267− instance monadMaybe :: Monad Maybe
268−
269− instance showMaybe :: (Show a) => Show (Maybe a)
270−
271−Values
272−~~~~~~
273−
274−::
275−
276− fromMaybe :: forall a. a -> Maybe a -> a
277−
278− maybe :: forall a b. b -> (a -> b) -> Maybe a -> b
279−
280−Module Data.Either
281−------------------
282−
283−Types
284−~~~~~
285−
286−::
287−
288− data Either a b where
289− Left :: a -> Either a b
290− Right :: b -> Either a b
291−
292−Type Classes
293−~~~~~~~~~~~~
294−
295−Type Class Instances
296−~~~~~~~~~~~~~~~~~~~~
297−
298−::
299−
300− instance applicativeEither :: Applicative (Either e)
301−
302− instance functorEither :: Functor (Either a)
303−
304− instance monadEither :: Monad (Either e)
305−
306− instance showEither :: (Show a, Show b) => Show (Either a b)
307−
308−Values
309−~~~~~~
310−
311−::
312−
313− either :: forall a b c. (a -> c) -> (b -> c) -> Either a b -> c
314−
315−Module Data.Array
316−-----------------
317−
318−Types
319−~~~~~
320−
321−Type Classes
322−~~~~~~~~~~~~
323−
324−Type Class Instances
325−~~~~~~~~~~~~~~~~~~~~
326−
327−::
328−
329− instance alternativeArray :: Alternative Prim.Array
330−
331− instance functorArray :: Functor Prim.Array
332−
333− instance monadArray :: Monad Prim.Array
334−
335− instance showArray :: (Show a) => Show [a]
336−
337−Values
338−~~~~~~
339−
340−::
341−
342− (:) :: forall a. a -> [a] -> [a]
343−
344− all :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Boolean
345−
346− any :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Boolean
347−
348− concat :: forall a. [a] -> [a] -> [a]
349−
350− concatMap :: forall a b. [a] -> (a -> [b]) -> [b]
351−
352− deleteAt :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
353−
354− drop :: forall a. Prim.Number -> [a] -> [a]
355−
356− filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
357−
358− find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
359−
360− foldl :: forall a b. (b -> a -> b) -> b -> [a] -> b
361−
362− foldr :: forall a b. (a -> b -> a) -> a -> [b] -> a
363−
364− head :: forall a. [a] -> Maybe a
365−
366− indexOf :: forall a. [a] -> a -> Prim.Number
367−
368− insertAt :: forall a. Prim.Number -> a -> [a] -> [a]
369−
370− isEmpty :: forall a. [a] -> Prim.Boolean
371−
372− joinS :: [Prim.String] -> Prim.String
373−
374− joinWith :: [Prim.String] -> Prim.String -> Prim.String
375−
376− lastIndexOf :: forall a. [a] -> a -> Prim.Number
377−
378− length :: forall a. [a] -> Prim.Number
379−
380− map :: forall a b. (a -> b) -> [a] -> [b]
381−
382− push :: forall a. [a] -> a -> [a]
383−
384− range :: Prim.Number -> Prim.Number -> [Prim.Number]
385−
386− reverse :: forall a. [a] -> [a]
387−
388− shift :: forall a. [a] -> [a]
389−
390− singleton :: forall a. a -> [a]
391−
392− slice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
393−
394− sort :: forall a. [a] -> [a]
395−
396− tail :: forall a. [a] -> Maybe [a]
397−
398− take :: forall a. Prim.Number -> [a] -> [a]
399−
400− updateAt :: forall a. Prim.Number -> a -> [a] -> [a]
401−
402− zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
403−
404Module Data.Eq
173Module Data.Eq
405--------------
174--------------
406
175
@@ -433,180 +202,8 @@ Values
433
202
434 refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
203 refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
435
204
436−Module Data.Array.Unsafe
205+Module Data.Eq.Unsafe
437−------------------------
206+---------------------
438−
439−Types
440−~~~~~
441−
442−Type Classes
443−~~~~~~~~~~~~
444−
445−Type Class Instances
446−~~~~~~~~~~~~~~~~~~~~
447−
448−Values
449−~~~~~~
450−
451−::
452−
453− head :: forall a. [a] -> a
454−
455− tail :: forall a. [a] -> [a]
456−
457−Module Data.Tuple
458−-----------------
459−
460−Types
461−~~~~~
462−
463−::
464−
465− data Tuple a b where
466− Tuple :: a -> b -> Tuple a b
467−
468−Type Classes
469−~~~~~~~~~~~~
470−
471−Type Class Instances
472−~~~~~~~~~~~~~~~~~~~~
473−
474−::
475−
476− instance showTuple :: (Show a, Show b) => Show (Tuple a b)
477−
478−Values
479−~~~~~~
480−
481−::
482−
483− curry :: forall a b c. (Tuple a b -> c) -> a -> b -> c
484−
485− uncurry :: forall a b c. (a -> b -> c) -> Tuple a b -> c
486−
487− unzip :: forall a b. [Tuple a b] -> Tuple [a] [b]
488−
489− zip :: forall a b. [a] -> [b] -> [Tuple a b]
490−
491−Module Data.String
492−------------------
493−
494−Types
495−~~~~~
496−
497−Type Classes
498−~~~~~~~~~~~~
499−
500−Type Class Instances
501−~~~~~~~~~~~~~~~~~~~~
502−
503−Values
504−~~~~~~
505−
506−::
507−
508− charAt :: Prim.Number -> Prim.String -> Prim.String
509−
510− indexOfS :: Prim.String -> Prim.String -> Prim.Number
511−
512− lastIndexOfS :: Prim.String -> Prim.String -> Prim.Number
513−
514− lengthS :: Prim.String -> Prim.Number
515−
516− localeCompare :: Prim.String -> Prim.String -> Prim.Number
517−
518− replace :: Prim.String -> Prim.String -> Prim.String -> Prim.String
519−
520− sliceS :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
521−
522− split :: Prim.String -> Prim.String -> [Prim.String]
523−
524− substr :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
525−
526− substring :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
527−
528− toLower :: Prim.String -> Prim.String
529−
530− toUpper :: Prim.String -> Prim.String
531−
532− trim :: Prim.String -> Prim.String
533−
534−Module Data.String.Regex
535−------------------------
536−
537−Types
538−~~~~~
539−
540−::
541−
542− data Regex :: *
543−
544−Type Classes
545−~~~~~~~~~~~~
546−
547−Type Class Instances
548−~~~~~~~~~~~~~~~~~~~~
549−
550−Values
551−~~~~~~
552−
553−::
554−
555− match :: Regex -> Prim.String -> [Prim.String]
556−
557− regex :: Prim.String -> Prim.String -> Regex
558−
559− replaceR :: Regex -> Prim.String -> Prim.String -> Prim.String
560−
561− search :: Regex -> Prim.String -> Prim.Number
562−
563− test :: Regex -> Prim.String -> Prim.Boolean
564−
565−Module Global
566−-------------
567−
568−Types
569−~~~~~
570−
571−Type Classes
572−~~~~~~~~~~~~
573−
574−Type Class Instances
575−~~~~~~~~~~~~~~~~~~~~
576−
577−Values
578−~~~~~~
579−
580−::
581−
582− decodeURI :: Prim.String -> Prim.String
583−
584− decodeURIComponent :: Prim.String -> Prim.String
585−
586− encodeURI :: Prim.String -> Prim.String
587−
588− encodeURIComponent :: Prim.String -> Prim.String
589−
590− infinity :: Prim.Number
591−
592− isFinite :: Prim.Number -> Prim.Boolean
593−
594− isNaN :: Prim.Number -> Prim.Boolean
595−
596− nan :: Prim.Number
597−
598− parseFloat :: Prim.String -> Prim.Number
599−
600− parseInt :: Prim.String -> Prim.Number
601−
602− toExponential :: Prim.Number -> Prim.String
603−
604− toFixed :: Prim.Number -> Prim.Number -> Prim.String
605−
606− toPrecision :: Prim.Number -> Prim.Number -> Prim.String
607−
608−Module Math
609−-----------
610
207
611Types
208Types
612~~~~~
209~~~~~
@@ -622,55 +219,9 @@ Values
622
219
623::
220::
624
221
625− abs :: Prim.Number -> Prim.Number
222+ refEq :: forall a. a -> a -> Prim.Boolean
626−
627− aceil :: Prim.Number -> Prim.Number
628−
629− acos :: Prim.Number -> Prim.Number
630−
631− asin :: Prim.Number -> Prim.Number
632
223
633− atan :: Prim.Number -> Prim.Number
224+ refIneq :: forall a. a -> a -> Prim.Boolean
634−
635− atan2 :: Prim.Number -> Prim.Number -> Prim.Number
636−
637− cos :: Prim.Number -> Prim.Number
638−
639− e :: Prim.Number
640−
641− exp :: Prim.Number -> Prim.Number
642−
643− floor :: Prim.Number -> Prim.Number
644−
645− ln10 :: Prim.Number
646−
647− ln2 :: Prim.Number
648−
649− log :: Prim.Number -> Prim.Number
650−
651− log10e :: Prim.Number
652−
653− log2e :: Prim.Number
654−
655− max :: Prim.Number -> Prim.Number -> Prim.Number
656−
657− min :: Prim.Number -> Prim.Number -> Prim.Number
658−
659− pi :: Prim.Number
660−
661− pow :: Prim.Number -> Prim.Number -> Prim.Number
662−
663− round :: Prim.Number -> Prim.Number
664−
665− sin :: Prim.Number -> Prim.Number
666−
667− sqrt :: Prim.Number -> Prim.Number
668−
669− sqrt1_2 :: Prim.Number
670−
671− sqrt2 :: Prim.Number
672−
673− tan :: Prim.Number -> Prim.Number
674
225
675Module Control.Monad.Eff
226Module Control.Monad.Eff
676------------------------
227------------------------
@@ -732,87 +283,6 @@ Values
732
283
733 unsafeInterleaveEff :: forall eff1 eff2 a. Eff eff1 a -> Eff eff2 a
284 unsafeInterleaveEff :: forall eff1 eff2 a. Eff eff1 a -> Eff eff2 a
734
285
735−Module Random
736−-------------
737−
738−Types
739−~~~~~
740−
741−::
742−
743− data Random :: !
744−
745−Type Classes
746−~~~~~~~~~~~~
747−
748−Type Class Instances
749−~~~~~~~~~~~~~~~~~~~~
750−
751−Values
752−~~~~~~
753−
754−::
755−
756− random :: forall e. Eff (random :: Random | e) Prim.Number
757−
758−Module Control.Monad.Error
759−--------------------------
760−
761−Types
762−~~~~~
763−
764−::
765−
766− data Error :: * -> !
767−
768−Type Classes
769−~~~~~~~~~~~~
770−
771−Type Class Instances
772−~~~~~~~~~~~~~~~~~~~~
773−
774−Values
775−~~~~~~
776−
777−::
778−
779− catchError :: forall e r a. (e -> Eff r a) -> Eff (err :: Error e | r) a -> Eff r a
780−
781− throwError :: forall a e r. e -> Eff (err :: Error e | r) a
782−
783−Module Data.IORef
784−-----------------
785−
786−Types
787−~~~~~
788−
789−::
790−
791− data IORef :: * -> *
792−
793− data Ref :: !
794−
795−Type Classes
796−~~~~~~~~~~~~
797−
798−Type Class Instances
799−~~~~~~~~~~~~~~~~~~~~
800−
801−Values
802−~~~~~~
803−
804−::
805−
806− modifyIORef :: forall s r. IORef s -> (s -> s) -> Eff (ref :: Ref | r) { }
807−
808− newIORef :: forall s r. s -> Eff (ref :: Ref | r) (IORef s)
809−
810− readIORef :: forall s r. IORef s -> Eff (ref :: Ref | r) s
811−
812− unsafeRunIORef :: forall eff a. Eff (ref :: Ref | eff) a -> Eff eff a
813−
814− writeIORef :: forall s r. IORef s -> s -> Eff (ref :: Ref | r) { }
815−
816Module Debug.Trace
286Module Debug.Trace
817------------------
287------------------
818
288
@@ -875,30 +345,9 @@ Values
875
345
876 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
346 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
877
347
878− runST :: forall a r. forall h. Eff (st :: ST h | r) a -> Eff r a
348+ runST :: forall a r. (forall h. Eff (st :: ST h | r) a) -> Eff r a
879
349
880− runSTArray :: forall a r. forall h. Eff (st :: ST h | r) (STArray h a) -> Eff r [a]
350+ runSTArray :: forall a r. (forall h. Eff (st :: ST h | r) (STArray h a)) -> Eff r [a]
881
351
882 writeSTRef :: forall a h r. STRef h a -> a -> Eff (st :: ST h | r) a
352 writeSTRef :: forall a h r. STRef h a -> a -> Eff (st :: ST h | r) a
883
353
884−Module Data.Enum
885−----------------
886−
887−Types
888−~~~~~
889−
890−Type Classes
891−~~~~~~~~~~~~
892−
893−::
894−
895− class Enum a where
896− toEnum :: Prim.Number -> Maybe a
897− fromEnum :: a -> Prim.Number
898−
899−Type Class Instances
900−~~~~~~~~~~~~~~~~~~~~
901−
902−Values
903−~~~~~~
904−
prelude/README.md+26−511
@@ -3,6 +3,11 @@
3
3
4### Types
4### Types
5
5
6+ data Ordering where
7+ LT :: Ordering
8+ GT :: Ordering
9+ EQ :: Ordering
10+
6
11
7### Type Classes
12### Type Classes
8
13
@@ -31,7 +36,6 @@
31 class Category a where
36 class Category a where
32 id :: forall t. a t t
37 id :: forall t. a t t
33 (<<<) :: forall b c d. a c d -> a b c -> a b d
38 (<<<) :: forall b c d. a c d -> a b c -> a b d
34− (>>>) :: forall b c d. a b c -> a c d -> a b d
35
39
36 class Eq a where
40 class Eq a where
37 (==) :: a -> a -> Prim.Boolean
41 (==) :: a -> a -> Prim.Boolean
@@ -53,13 +57,7 @@
53 negate :: a -> a
57 negate :: a -> a
54
58
55 class Ord a where
59 class Ord a where
56− (<) :: a -> a -> Prim.Boolean
60+ compare :: a -> a -> Ordering
57− (>) :: a -> a -> Prim.Boolean
58− (<=) :: a -> a -> Prim.Boolean
59− (>=) :: a -> a -> Prim.Boolean
60−
61− class Read a where
62− read :: Prim.String -> a
63
61
64 class Show a where
62 class Show a where
65 show :: a -> Prim.String
63 show :: a -> Prim.String
@@ -89,16 +87,12 @@
89
87
90 instance ordNumber :: Ord Prim.Number
88 instance ordNumber :: Ord Prim.Number
91
89
92− instance readBoolean :: Read Prim.Boolean
93−
94− instance readNumber :: Read Prim.Number
95−
96− instance readString :: Read Prim.String
97−
98 instance showBoolean :: Show Prim.Boolean
90 instance showBoolean :: Show Prim.Boolean
99
91
100 instance showNumber :: Show Prim.Number
92 instance showNumber :: Show Prim.Number
101
93
94+ instance showOrdering :: Show Ordering
95+
102 instance showString :: Show Prim.String
96 instance showString :: Show Prim.String
103
97
104
98
@@ -112,6 +106,16 @@
112
106
113 (++) :: Prim.String -> Prim.String -> Prim.String
107 (++) :: Prim.String -> Prim.String -> Prim.String
114
108
109+ (<) :: forall a. (Ord a) => a -> a -> Prim.Boolean
110+
111+ (<=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
112+
113+ (>) :: forall a. (Ord a) => a -> a -> Prim.Boolean
114+
115+ (>=) :: forall a. (Ord a) => a -> a -> Prim.Boolean
116+
117+ (>>>) :: forall a b c d. (Category a) => a b c -> a c d -> a b d
118+
115 boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
119 boolAnd :: Prim.Boolean -> Prim.Boolean -> Prim.Boolean
116
120
117 boolNot :: Prim.Boolean -> Prim.Boolean
121 boolNot :: Prim.Boolean -> Prim.Boolean
@@ -126,18 +130,12 @@
126
130
127 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
131 numAnd :: Prim.Number -> Prim.Number -> Prim.Number
128
132
133+ numCompare :: Prim.Number -> Prim.Number -> Ordering
134+
129 numComplement :: Prim.Number -> Prim.Number
135 numComplement :: Prim.Number -> Prim.Number
130
136
131 numDiv :: Prim.Number -> Prim.Number -> Prim.Number
137 numDiv :: Prim.Number -> Prim.Number -> Prim.Number
132
138
133− numGreater :: Prim.Number -> Prim.Number -> Prim.Boolean
134−
135− numGreaterEq :: Prim.Number -> Prim.Number -> Prim.Boolean
136−
137− numLess :: Prim.Number -> Prim.Number -> Prim.Boolean
138−
139− numLessEq :: Prim.Number -> Prim.Number -> Prim.Boolean
140−
141 numMod :: Prim.Number -> Prim.Number -> Prim.Number
139 numMod :: Prim.Number -> Prim.Number -> Prim.Number
142
140
143 numMul :: Prim.Number -> Prim.Number -> Prim.Number
141 numMul :: Prim.Number -> Prim.Number -> Prim.Number
@@ -156,212 +154,10 @@
156
154
157 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
155 numZshr :: Prim.Number -> Prim.Number -> Prim.Number
158
156
159− readNumberImpl :: Prim.String -> Prim.Number
157+ on :: forall a b c. (b -> b -> c) -> (a -> b) -> a -> a -> c
160
158
161 showNumberImpl :: Prim.Number -> Prim.String
159 showNumberImpl :: Prim.Number -> Prim.String
162
160
163− unsafeRefEq :: forall a. a -> a -> Prim.Boolean
164−
165− unsafeRefIneq :: forall a. a -> a -> Prim.Boolean
166−
167−
168−## Module Data.Monoid
169−
170−### Types
171−
172−
173−### Type Classes
174−
175− class Monoid m where
176− mempty :: m
177− (<>) :: m -> m -> m
178−
179−
180−### Type Class Instances
181−
182− instance monoidArray :: Monoid [a]
183−
184− instance monoidString :: Monoid Prim.String
185−
186−
187−### Values
188−
189− mconcat :: forall m. (Monoid m) => [m] -> m
190−
191−
192−## Module Control.Monad
193−
194−### Types
195−
196−
197−### Type Classes
198−
199−
200−### Type Class Instances
201−
202−
203−### Values
204−
205− (<=<) :: forall m a b c. (Monad m) => (b -> m c) -> (a -> m b) -> a -> m c
206−
207− (>=>) :: forall m a b c. (Monad m) => (a -> m b) -> (b -> m c) -> a -> m c
208−
209− foldM :: forall m a b. (Monad m) => (a -> b -> m a) -> a -> [b] -> m a
210−
211− join :: forall m a. (Monad m) => m (m a) -> m a
212−
213− mapM :: forall m a b. (Monad m) => (a -> m b) -> [a] -> m [b]
214−
215− replicateM :: forall m a. (Monad m) => Prim.Number -> m a -> m [a]
216−
217− sequence :: forall m a. (Monad m) => [m a] -> m [a]
218−
219− when :: forall m. (Monad m) => Prim.Boolean -> m { } -> m { }
220−
221− zipWithM :: forall m a b c. (Monad m) => (a -> b -> m c) -> [a] -> [b] -> m [c]
222−
223−
224−## Module Data.Maybe
225−
226−### Types
227−
228− data Maybe a where
229− Nothing :: Maybe a
230− Just :: a -> Maybe a
231−
232−
233−### Type Classes
234−
235−
236−### Type Class Instances
237−
238− instance applicativeMaybe :: Applicative Maybe
239−
240− instance functorMaybe :: Functor Maybe
241−
242− instance monadMaybe :: Monad Maybe
243−
244− instance showMaybe :: (Show a) => Show (Maybe a)
245−
246−
247−### Values
248−
249− fromMaybe :: forall a. a -> Maybe a -> a
250−
251− maybe :: forall a b. b -> (a -> b) -> Maybe a -> b
252−
253−
254−## Module Data.Either
255−
256−### Types
257−
258− data Either a b where
259− Left :: a -> Either a b
260− Right :: b -> Either a b
261−
262−
263−### Type Classes
264−
265−
266−### Type Class Instances
267−
268− instance applicativeEither :: Applicative (Either e)
269−
270− instance functorEither :: Functor (Either a)
271−
272− instance monadEither :: Monad (Either e)
273−
274− instance showEither :: (Show a, Show b) => Show (Either a b)
275−
276−
277−### Values
278−
279− either :: forall a b c. (a -> c) -> (b -> c) -> Either a b -> c
280−
281−
282−## Module Data.Array
283−
284−### Types
285−
286−
287−### Type Classes
288−
289−
290−### Type Class Instances
291−
292− instance alternativeArray :: Alternative Prim.Array
293−
294− instance functorArray :: Functor Prim.Array
295−
296− instance monadArray :: Monad Prim.Array
297−
298− instance showArray :: (Show a) => Show [a]
299−
300−
301−### Values
302−
303− (:) :: forall a. a -> [a] -> [a]
304−
305− all :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Boolean
306−
307− any :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Boolean
308−
309− concat :: forall a. [a] -> [a] -> [a]
310−
311− concatMap :: forall a b. [a] -> (a -> [b]) -> [b]
312−
313− deleteAt :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
314−
315− drop :: forall a. Prim.Number -> [a] -> [a]
316−
317− filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a]
318−
319− find :: forall a. (a -> Prim.Boolean) -> [a] -> Maybe a
320−
321− foldl :: forall a b. (b -> a -> b) -> b -> [a] -> b
322−
323− foldr :: forall a b. (a -> b -> a) -> a -> [b] -> a
324−
325− head :: forall a. [a] -> Maybe a
326−
327− indexOf :: forall a. [a] -> a -> Prim.Number
328−
329− insertAt :: forall a. Prim.Number -> a -> [a] -> [a]
330−
331− isEmpty :: forall a. [a] -> Prim.Boolean
332−
333− joinS :: [Prim.String] -> Prim.String
334−
335− joinWith :: [Prim.String] -> Prim.String -> Prim.String
336−
337− lastIndexOf :: forall a. [a] -> a -> Prim.Number
338−
339− length :: forall a. [a] -> Prim.Number
340−
341− map :: forall a b. (a -> b) -> [a] -> [b]
342−
343− push :: forall a. [a] -> a -> [a]
344−
345− range :: Prim.Number -> Prim.Number -> [Prim.Number]
346−
347− reverse :: forall a. [a] -> [a]
348−
349− shift :: forall a. [a] -> [a]
350−
351− singleton :: forall a. a -> [a]
352−
353− slice :: forall a. Prim.Number -> Prim.Number -> [a] -> [a]
354−
355− sort :: forall a. [a] -> [a]
356−
357− tail :: forall a. [a] -> Maybe [a]
358−
359− take :: forall a. Prim.Number -> [a] -> [a]
360−
361− updateAt :: forall a. Prim.Number -> a -> [a] -> [a]
362−
363− zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
364−
365
161
366## Module Data.Eq
162## Module Data.Eq
367
163
@@ -388,219 +184,22 @@
388 refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
184 refIneq :: forall a. Ref a -> Ref a -> Prim.Boolean
389
185
390
186
391−## Module Data.Array.Unsafe
187+## Module Data.Eq.Unsafe
392−
393−### Types
394−
395−
396−### Type Classes
397−
398−
399−### Type Class Instances
400−
401−
402−### Values
403−
404− head :: forall a. [a] -> a
405−
406− tail :: forall a. [a] -> [a]
407−
408−
409−## Module Data.Tuple
410
188
411### Types
189### Types
412
190
413− data Tuple a b where
414− Tuple :: a -> b -> Tuple a b
415−
416
191
417### Type Classes
192### Type Classes
418
193
419
194
420### Type Class Instances
195### Type Class Instances
421
196
422− instance showTuple :: (Show a, Show b) => Show (Tuple a b)
423−
424
197
425### Values
198### Values
426
199
427− curry :: forall a b c. (Tuple a b -> c) -> a -> b -> c
200+ refEq :: forall a. a -> a -> Prim.Boolean
428−
429− uncurry :: forall a b c. (a -> b -> c) -> Tuple a b -> c
430−
431− unzip :: forall a b. [Tuple a b] -> Tuple [a] [b]
432−
433− zip :: forall a b. [a] -> [b] -> [Tuple a b]
434
201
435−
202+ refIneq :: forall a. a -> a -> Prim.Boolean
436−## Module Data.String
437−
438−### Types
439−
440−
441−### Type Classes
442−
443−
444−### Type Class Instances
445−
446−
447−### Values
448−
449− charAt :: Prim.Number -> Prim.String -> Prim.String
450−
451− indexOfS :: Prim.String -> Prim.String -> Prim.Number
452−
453− lastIndexOfS :: Prim.String -> Prim.String -> Prim.Number
454−
455− lengthS :: Prim.String -> Prim.Number
456−
457− localeCompare :: Prim.String -> Prim.String -> Prim.Number
458−
459− replace :: Prim.String -> Prim.String -> Prim.String -> Prim.String
460−
461− sliceS :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
462−
463− split :: Prim.String -> Prim.String -> [Prim.String]
464−
465− substr :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
466−
467− substring :: Prim.Number -> Prim.Number -> Prim.String -> Prim.String
468−
469− toLower :: Prim.String -> Prim.String
470−
471− toUpper :: Prim.String -> Prim.String
472−
473− trim :: Prim.String -> Prim.String
474−
475−
476−## Module Data.String.Regex
477−
478−### Types
479−
480− data Regex :: *
481−
482−
483−### Type Classes
484−
485−
486−### Type Class Instances
487−
488−
489−### Values
490−
491− match :: Regex -> Prim.String -> [Prim.String]
492−
493− regex :: Prim.String -> Prim.String -> Regex
494−
495− replaceR :: Regex -> Prim.String -> Prim.String -> Prim.String
496−
497− search :: Regex -> Prim.String -> Prim.Number
498−
499− test :: Regex -> Prim.String -> Prim.Boolean
500−
501−
502−## Module Global
503−
504−### Types
505−
506−
507−### Type Classes
508−
509−
510−### Type Class Instances
511−
512−
513−### Values
514−
515− decodeURI :: Prim.String -> Prim.String
516−
517− decodeURIComponent :: Prim.String -> Prim.String
518−
519− encodeURI :: Prim.String -> Prim.String
520−
521− encodeURIComponent :: Prim.String -> Prim.String
522−
523− infinity :: Prim.Number
524−
525− isFinite :: Prim.Number -> Prim.Boolean
526−
527− isNaN :: Prim.Number -> Prim.Boolean
528−
529− nan :: Prim.Number
530−
531− parseFloat :: Prim.String -> Prim.Number
532−
533− parseInt :: Prim.String -> Prim.Number
534−
535− toExponential :: Prim.Number -> Prim.String
536−
537− toFixed :: Prim.Number -> Prim.Number -> Prim.String
538−
539− toPrecision :: Prim.Number -> Prim.Number -> Prim.String
540−
541−
542−## Module Math
543−
544−### Types
545−
546−
547−### Type Classes
548−
549−
550−### Type Class Instances
551−
552−
553−### Values
554−
555− abs :: Prim.Number -> Prim.Number
556−
557− aceil :: Prim.Number -> Prim.Number
558−
559− acos :: Prim.Number -> Prim.Number
560−
561− asin :: Prim.Number -> Prim.Number
562−
563− atan :: Prim.Number -> Prim.Number
564−
565− atan2 :: Prim.Number -> Prim.Number -> Prim.Number
566−
567− cos :: Prim.Number -> Prim.Number
568−
569− e :: Prim.Number
570−
571− exp :: Prim.Number -> Prim.Number
572−
573− floor :: Prim.Number -> Prim.Number
574−
575− ln10 :: Prim.Number
576−
577− ln2 :: Prim.Number
578−
579− log :: Prim.Number -> Prim.Number
580−
581− log10e :: Prim.Number
582−
583− log2e :: Prim.Number
584−
585− max :: Prim.Number -> Prim.Number -> Prim.Number
586−
587− min :: Prim.Number -> Prim.Number -> Prim.Number
588−
589− pi :: Prim.Number
590−
591− pow :: Prim.Number -> Prim.Number -> Prim.Number
592−
593− round :: Prim.Number -> Prim.Number
594−
595− sin :: Prim.Number -> Prim.Number
596−
597− sqrt :: Prim.Number -> Prim.Number
598−
599− sqrt1_2 :: Prim.Number
600−
601− sqrt2 :: Prim.Number
602−
603− tan :: Prim.Number -> Prim.Number
604
203
605
204
606## Module Control.Monad.Eff
205## Module Control.Monad.Eff
@@ -653,72 +252,6 @@
653 unsafeInterleaveEff :: forall eff1 eff2 a. Eff eff1 a -> Eff eff2 a
252 unsafeInterleaveEff :: forall eff1 eff2 a. Eff eff1 a -> Eff eff2 a
654
253
655
254
656−## Module Random
657−
658−### Types
659−
660− data Random :: !
661−
662−
663−### Type Classes
664−
665−
666−### Type Class Instances
667−
668−
669−### Values
670−
671− random :: forall e. Eff (random :: Random | e) Prim.Number
672−
673−
674−## Module Control.Monad.Error
675−
676−### Types
677−
678− data Error :: * -> !
679−
680−
681−### Type Classes
682−
683−
684−### Type Class Instances
685−
686−
687−### Values
688−
689− catchError :: forall e r a. (e -> Eff r a) -> Eff (err :: Error e | r) a -> Eff r a
690−
691− throwError :: forall a e r. e -> Eff (err :: Error e | r) a
692−
693−
694−## Module Data.IORef
695−
696−### Types
697−
698− data IORef :: * -> *
699−
700− data Ref :: !
701−
702−
703−### Type Classes
704−
705−
706−### Type Class Instances
707−
708−
709−### Values
710−
711− modifyIORef :: forall s r. IORef s -> (s -> s) -> Eff (ref :: Ref | r) { }
712−
713− newIORef :: forall s r. s -> Eff (ref :: Ref | r) (IORef s)
714−
715− readIORef :: forall s r. IORef s -> Eff (ref :: Ref | r) s
716−
717− unsafeRunIORef :: forall eff a. Eff (ref :: Ref | eff) a -> Eff eff a
718−
719− writeIORef :: forall s r. IORef s -> s -> Eff (ref :: Ref | r) { }
720−
721−
722## Module Debug.Trace
255## Module Debug.Trace
723
256
724### Types
257### Types
@@ -770,29 +303,11 @@
770
303
771 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
304 readSTRef :: forall a h r. STRef h a -> Eff (st :: ST h | r) a
772
305
773− runST :: forall a r. forall h. Eff (st :: ST h | r) a -> Eff r a
306+ runST :: forall a r. (forall h. Eff (st :: ST h | r) a) -> Eff r a
774
307
775− runSTArray :: forall a r. forall h. Eff (st :: ST h | r) (STArray h a) -> Eff r [a]
308+ runSTArray :: forall a r. (forall h. Eff (st :: ST h | r) (STArray h a)) -> Eff r [a]
776
309
777 writeSTRef :: forall a h r. STRef h a -> a -> Eff (st :: ST h | r) a
310 writeSTRef :: forall a h r. STRef h a -> a -> Eff (st :: ST h | r) a
778
311
779
312
780−## Module Data.Enum
781−
782−### Types
783−
784−
785−### Type Classes
786−
787− class Enum a where
788− toEnum :: Prim.Number -> Maybe a
789− fromEnum :: a -> Prim.Number
790−
791−
792−### Type Class Instances
793−
794−
795−### Values
796−
797−
798
313