@@ -108,28 +108,28 @@ find p f = case foldMap (\x -> if p x then [x] else []) f of
108108lookup :: forall a b f . (Eq a , Foldable f ) => a -> f (Tuple a b ) -> Maybe b
109109lookup a f = runFirst $ foldMap (\(Tuple a' b) -> First (if a == a' then Just b else Nothing )) f
110110
111- foreign import foldrArray
112- " function foldrArray(f) {\
113- \ return function(z) {\
114- \ return function(xs) {\
115- \ var acc = z;\
116- \ for (var i = xs.length - 1; i >= 0; --i) {\
117- \ acc = f(xs[i])(acc);\
118- \ }\
119- \ return acc;\
120- \ }\
121- \ }\
122- \} " :: forall a b . (a -> b -> b ) -> b -> [a ] -> b
123-
124- foreign import foldlArray
125- " function foldlArray(f) {\
126- \ return function(z) {\
127- \ return function(xs) {\
128- \ var acc = z;\
129- \ for (var i = 0, len = xs.length; i < len; ++i) {\
130- \ acc = f(acc)(xs[i]);\
131- \ }\
132- \ return acc;\
133- \ }\
134- \ }\
135- \} " :: forall a b . (b -> a -> b ) -> b -> [a ] -> b
111+ foreign import foldrArray " " "
112+ function foldrArray(f) {
113+ return function(z) {
114+ return function(xs) {
115+ var acc = z;
116+ for (var i = xs.length - 1; i >= 0; --i) {
117+ acc = f(xs[i])(acc);
118+ }
119+ return acc;
120+ }
121+ }
122+ } " " " :: forall a b . (a -> b -> b ) -> b -> [a ] -> b
123+
124+ foreign import foldlArray " " "
125+ function foldlArray(f) {
126+ return function(z) {
127+ return function(xs) {
128+ var acc = z;
129+ for (var i = 0, len = xs.length; i < len; ++i) {
130+ acc = f(acc)(xs[i]);
131+ }
132+ return acc;
133+ }
134+ }
135+ } " " " :: forall a b . (b -> a -> b ) -> b -> [a ] -> b
0 commit comments