git.iko.soy/rowtype-yoga/purescript-native
on golang help sign in
More work on the Prelude
4c74822Phil Freeman
libraries/prelude/prelude.js+13
compare with golang
unifiedsplit
@@ -52,3 +52,16 @@ function map(f) {
52 };
52 };
53}
53}
54
54
55+function filter(xs) {
56+ return function (p) {
57+ var ys = [];
58+ var j = 0;
59+ for (var i = 0; i < xs.length; i++) {
60+ var x = xs[i];
61+ if (p(x)) {
62+ ys[j++] = x;
63+ }
64+ }
65+ return ys;
66+ };
67+}
libraries/prelude/prelude.ps+94−16
@@ -25,6 +25,21 @@ maybe = \b -> \f -> \m -> case m of
25fromMaybe :: forall a. a -> Maybe a -> a
25fromMaybe :: forall a. a -> Maybe a -> a
26fromMaybe = \a -> maybe a id
26fromMaybe = \a -> maybe a id
27
27
28+bindMaybe :: forall a b. Maybe a -> (a -> Maybe b) -> Maybe b
29+bindMaybe = \m -> \f -> maybe Nothing f m
30+
31+-- Either
32+
33+data Either a b = Left a | Right b
34+
35+either :: forall a b c. (a -> c) -> (b -> c) -> Either a b -> c
36+either = \f -> \g -> \e -> case e of
37+ Left a -> f a
38+ Right b -> g b
39+
40+bindEither :: forall e a b. Either e a -> (a -> Either e b) -> Either e b
41+bindEither = either (\e -> \_ -> Left e) (\a -> \f -> f a)
42+
28-- Arrays
43-- Arrays
29
44
30head :: forall a. [a] -> a
45head :: forall a. [a] -> a
@@ -45,6 +60,20 @@ tailSafe = \xs -> case xs of
45 [_:xs] -> Just xs
60 [_:xs] -> Just xs
46 _ -> Nothing
61 _ -> Nothing
47
62
63+extern map :: forall a b. (a -> b) -> [a] -> [b]
64+
65+foldr :: forall a b. (a -> b -> a) -> a -> [b] -> a
66+foldr = \f -> \a -> \bs -> case bs of
67+ [b:bs] -> f (foldr f a bs) b
68+ [] -> a
69+
70+foldl :: forall a b. (a -> b -> b) -> b -> [a] -> b
71+foldl = \f -> \b -> \as -> do
72+ var result = b
73+ foreach a in as:
74+ result = f a result
75+ return result
76+
48extern length :: forall a. [a] -> Number
77extern length :: forall a. [a] -> Number
49
78
50extern indexOf :: forall a. [a] -> a -> Number
79extern indexOf :: forall a. [a] -> a -> Number
@@ -69,6 +98,71 @@ extern sort :: forall a. [a] -> [a]
69
98
70extern splice :: forall a. Number -> Number -> [a] -> [a] -> [a]
99extern splice :: forall a. Number -> Number -> [a] -> [a] -> [a]
71
100
101+cons :: forall a. a -> [a] -> [a]
102+cons = \a -> concat([a])
103+
104+concatMap :: forall a b. [a] -> (a -> [b]) -> [b]
105+concatMap = \as -> \f -> do
106+ var result = []
107+ foreach a in as:
108+ result = result `concat` f a
109+ return result
110+
111+extern filter :: forall a. [a] -> (a -> Boolean) -> [a]
112+
113+null :: forall a. [a] -> Boolean
114+null = \as -> case as of
115+ [] -> true
116+ _ -> false
117+
118+range :: Number -> Number -> [Number]
119+range = \lo -> \hi -> do
120+ var ns = []
121+ for n <- lo until hi:
122+ ns = push ns n
123+ return ns
124+
125+zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
126+zipWith = \f -> \as -> \bs -> case { as: as, bs: bs } of
127+ { as = [a:as1], bs = [b:bs1] } -> cons (f a b) (zipWith f as1 bs1)
128+ _ -> []
129+
130+any :: forall a. (a -> Boolean) -> [a] -> Boolean
131+any = \p -> \as -> do
132+ for i <- 0 until length as:
133+ if p as[i]:
134+ return true
135+ return false
136+
137+all :: forall a. (a -> Boolean) -> [a] -> Boolean
138+all = \p -> \as -> do
139+ for i <- 0 until length as:
140+ if !(p as[i]):
141+ return false
142+ return true
143+
144+-- Pairs
145+
146+type Tuple a b = { fst :: a ; snd :: b }
147+
148+curry :: forall a b c. (Tuple a b -> c) -> a -> b -> c
149+curry = \f -> \a -> \b -> f { fst: a, snd: b }
150+
151+uncurry :: forall a b c. (a -> b -> c) -> Tuple a b -> c
152+uncurry = \f -> \t -> f t.fst t.snd
153+
154+tuple :: forall a b. a -> b -> Tuple a b
155+tuple = curry id
156+
157+zip :: forall a b. [a] -> [b] -> [Tuple a b]
158+zip = zipWith tuple
159+
160+unzip :: forall a b. [Tuple a b] -> Tuple [a] [b]
161+unzip = \ts -> case ts of
162+ [t:ts1] -> case unzip ts1 of
163+ { fst = as, snd = bs } -> tuple (cons t.fst as) (cons t.snd bs)
164+ [] -> tuple [] []
165+
72-- Strings
166-- Strings
73
167
74extern lengthS :: String -> Number
168extern lengthS :: String -> Number
@@ -165,19 +259,3 @@ type Math =
165
259
166extern math :: Math
260extern math :: Math
167
261
168−--
169−
170−extern map :: forall a b. (a -> b) -> [a] -> [b]
171−
172−foldr :: forall a b. (a -> b -> a) -> a -> [b] -> a
173−foldr = \f -> \a -> \bs -> case bs of
174− [b:bs] -> f (foldr f a bs) b
175− [] -> a
176−
177−foldl :: forall a b. (a -> b -> b) -> b -> [a] -> b
178−foldl = \f -> \b -> \as -> do
179− var result = b
180− foreach a in as:
181− result = f a result
182− return result
183−