1f94f12 · rowtype-yoga/purescript-native

examples/failing/Foldable.purs+7−5

compare with golang

unifiedsplit

@@ -4,9 +4,11 @@ class Foldable f where

4 fold :: forall a b. (a -> b -> b) -> b -> f a -> b

5 size :: forall a. f a -> Number

6

7−instance foldableArray :: Foldable [] where

7+data L a = C a (L a) | N

8− fold _ z [] = z

9− fold f z (x:xs) = x `f` (fold f z xs)

10− size = fold (const ((+) 1)) 0

11

8

9+instance foldableL :: Foldable L where

10+ fold _ z N = z

11+ fold f z (C x xs) = x `f` (fold f z xs)

12+ size = fold (const ((+) 1.0)) 0.0

13+

12−x = size [1,2,3]

14+x = size (C 1 (C 2 (C 3 N)))

examples/failing/OverlappingBinders.purs+3−1

@@ -1,4 +1,6 @@

1module OverlappingBinders where

2

3+data S a = S a (S a)

4+

3f x = case x of

5f x = case x of

4− (y:y@(z:zs)) -> y

6+ (S y (S y@(S z zs))) -> y

examples/failing/TypeSynonyms.purs+1−1

@@ -1,5 +1,5 @@

1module Main where

2

3−type T1 = [T2]

3+type T1 = Array T2

4

5type T2 = T1

examples/passing/ArrayType.purs+1−1

@@ -3,7 +3,7 @@ module Main where

3class Pointed p where

4 point :: forall a. a -> p a

5

6−instance pointedArray :: Pointed [] where

6+instance pointedArray :: Pointed Array where

7 point a = [a]

8

9main = Debug.Trace.trace "Done"

examples/passing/Arrays.pursdeleted−24

@@ -1,24 +0,0 @@

1−module Main where

2−

3−import Prelude.Unsafe (unsafeIndex)

4−

5−test1 arr = arr `unsafeIndex` 0.0 + arr `unsafeIndex` 1.0 + 1.0

6−

7−test2 = \arr -> case arr of

8− [x, y] -> x + y

9− [x] -> x

10− [] -> 0.0

11− (x : y : _) -> x + y

12−

13−data Tree = One Number | Some [Tree]

14−

15−test3 = \tree sum -> case tree of

16− One n -> n

17− Some (n1 : n2 : rest) -> test3 n1 sum * 10.0 + test3 n2 sum * 5.0 + sum rest

18−

19−test4 = \arr -> case arr of

20− [] -> 0.0

21− [_] -> 0.0

22− x : y : xs -> x * y + test4 xs

23−

24−main = Debug.Trace.trace "Done"

examples/passing/BindersInFunctions.purs+4−4

@@ -2,7 +2,7 @@ module Main where

2

3import Prelude

4

5−tail = \(_:xs) -> xs

5+snd = \[_, y] -> y

6

7foreign import error

8 """

@@ -12,7 +12,7 @@ foreign import error

12 """ :: forall a. String -> a

13

14main =

15− let ts = tail [1.0, 2.0, 3.0] in

15+ let ts = snd [1.0, 2.0] in

16− if ts == [2.0, 3.0]

16+ if ts == 2.0

17 then Debug.Trace.trace "Done"

18− else error "Incorrect result from 'tails'."

18+ else error "Incorrect result from 'snd'."

examples/passing/CheckSynonymBug.purs+2−2

@@ -2,14 +2,14 @@ module Main where

2

3 import Prelude

4

5− type Foo a = [a]

5+ type Foo a = Array a

6

7 foreign import length

8 """

9 function length(a) {

10 return a.length;

11 }

12− """ :: forall a. [a] -> Number

12+ """ :: forall a. Array a -> Number

13

14 foo _ = length ([] :: Foo Number)

15

examples/passing/DeepArrayBinder.purs+5−3

@@ -2,8 +2,10 @@ module Main where

2

3import Control.Monad.Eff

4

5+data List a = Cons a (List a) | Nil

6+

5−match2 :: [Number] -> Number

7+match2 :: List Number -> Number

6−match2 (x : y : xs) = x * y + match2 xs

8+match2 (Cons x (Cons y xs)) = x * y + match2 xs

7match2 _ = 0.0

9match2 _ = 0.0

8

10

9foreign import explode

11foreign import explode

@@ -13,6 +15,6 @@ foreign import explode

13 }

15 }

14 """ :: forall eff a. Eff eff a

16 """ :: forall eff a. Eff eff a

15

17

16−main = case match2 [1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0] of

18+main = case match2 (Cons 1.0 (Cons 2.0 (Cons 3.0 (Cons 4.0 (Cons 5.0 (Cons 6.0 (Cons 7.0 (Cons 8.0 (Cons 9.0 Nil))))))))) of

17 100.0 -> Debug.Trace.trace "Done"

19 100.0 -> Debug.Trace.trace "Done"

18 _ -> explode

20 _ -> explode

examples/passing/Do.purs+2−2

@@ -25,8 +25,8 @@ test1 = \_ -> do

25 Just "abc"

26

27test2 = \_ -> do

28− (x : _) <- Just [1.0, 2.0, 3.0]

28+ x <- Just 1.0

29− (y : _) <- Just [4.0, 5.0, 6.0]

29+ y <- Just 2.0

30 Just (x + y)

31

32test3 = \_ -> do

examples/passing/EmptyDataDecls.purs+2−2

@@ -5,7 +5,7 @@ import Prelude

5data Z

6data S n

7

8−data ArrayBox n a = ArrayBox [a]

8+data ArrayBox n a = ArrayBox (Array a)

9

10nil :: forall a. ArrayBox Z a

11nil = ArrayBox []

@@ -17,7 +17,7 @@ foreign import concat

17 return l1.concat(l2);

18 };

19 }

20− """ :: forall a. [a] -> [a] -> [a]

20+ """ :: forall a. Array a -> Array a -> Array a

21

22cons' :: forall a n. a -> ArrayBox n a -> ArrayBox (S n) a

23cons' x (ArrayBox xs) = ArrayBox $ concat [x] xs

examples/passing/EmptyTypeClass.purs+2−2

@@ -4,8 +4,8 @@ import Prelude

4

5class Partial

6

7−head :: forall a. (Partial) => [a] -> a

7+head :: forall a. (Partial) => Array a -> a

8−head (x:xs) = x

8+head [x] = x

9

10instance allowPartials :: Partial

11

examples/passing/ExtendedInfixOperators.purs+4−12

@@ -1,20 +1,12 @@

1module Main where

2

3−zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]

4−zipWith _ [] _ = []

5−zipWith _ _ [] = []

6−zipWith f (x:xs) (y:ys) = f x y : zipWith f xs ys

7−

8−test1 = [1.0, 2.0, 3.0] `zipWith (+)` [4.0, 5.0, 6.0]

9−

10comparing :: forall a b. (Ord b) => (a -> b) -> a -> a -> Ordering

3comparing :: forall a b. (Ord b) => (a -> b) -> a -> a -> Ordering

11comparing f = compare `Data.Function.on` f

4comparing f = compare `Data.Function.on` f

12

5

13−sum [] = 0.0

6+null [] = true

14−sum (x:xs) = x + sum xs

7+null _ = false

15

8

16−test2 = [1.0, 2.0, 3.0] `comparing sum` [4.0, 5.0, 6.0]

9+test = [1.0, 2.0, 3.0] `comparing null` [4.0, 5.0, 6.0]

17

10

18main = do

11main = do

19− Debug.Trace.print test1

12+ Debug.Trace.print test

20− Debug.Trace.print test2

examples/passing/ExternRaw.purs+2−2

@@ -5,7 +5,7 @@ foreign import first

5 function first(xs) {

6 return xs[0];

7 }

8− """ :: forall a. [a] -> a

8+ """ :: forall a. Array a -> a

9

10foreign import loop

11 """

@@ -21,6 +21,6 @@ foreign import concat

21 return xs.concat(ys);

22 };

23 }

24− """ :: forall a. [a] -> [a] -> [a]

24+ """ :: forall a. Array a -> Array a -> Array a

25

26main = Debug.Trace.trace "Done"

examples/passing/ForeignInstance.purs+1−1

@@ -3,7 +3,7 @@ module Main where

3class Foo a where

4 foo :: a -> String

5

6−foreign import instance fooArray :: (Foo a) => Foo [a]

6+foreign import instance fooArray :: (Foo a) => Foo (Array a)

7

8foreign import instance fooNumber :: Foo Number

9

examples/passing/KindedType.purs+3−3

@@ -4,7 +4,7 @@ type Star2Star f = f :: * -> *

4

5type Star t = t :: *

6

7−test1 :: Star2Star [] String

7+test1 :: Star2Star Array String

8test1 = ["test"]

9

10f :: Star (String -> String)

@@ -14,12 +14,12 @@ test2 = f "test"

14

15data Proxy (f :: * -> *) = Proxy

16

17−test3 :: Proxy []

17+test3 :: Proxy Array

18test3 = Proxy

19

20type Test (f :: * -> *) = f String

21

22−test4 :: Test []

22+test4 :: Test Array

23test4 = ["test"]

24

25class Clazz (a :: *) where

examples/passing/Let.purs−11

@@ -26,16 +26,6 @@ test5 = let

26 g x = f (x - 1.0) + 1.0

27 in f 10.0

28

29−test6 = runPure (runST (do

30− r <- newSTRef 0.0

31− (let

32− go [] = readSTRef r

33− go (n : ns) = do

34− modifySTRef r ((+) n)

35− go ns

36− in go [1.0, 2.0, 3.0, 4.0, 5.0])

37− ))

38−

39test7 = let

29test7 = let

40 f :: forall a. a -> a

30 f :: forall a. a -> a

41 f x = x

31 f x = x

@@ -59,6 +49,5 @@ main = do

59 Debug.Trace.print test3

49 Debug.Trace.print test3

60 Debug.Trace.print test4

50 Debug.Trace.print test4

61 Debug.Trace.print test5

51 Debug.Trace.print test5

62− Debug.Trace.print test6

63 Debug.Trace.print test7

52 Debug.Trace.print test7

64 Debug.Trace.print (test8 100.0)

53 Debug.Trace.print (test8 100.0)

examples/passing/MultipleConstructorArgs.pursdeleted−21

@@ -1,21 +0,0 @@

1−module Main where

2−

3−import Prelude

4−import Control.Monad.Eff

5−

6−data P a b = P a b

7−

8−runP :: forall a b r. (a -> b -> r) -> P a b -> r

9−runP f (P a b) = f a b

10−

11−idP = runP P

12−

13−testCase = \p -> case p of

14− P (x:xs) (y:ys) -> x + y

15− P _ _ -> 0.0

16−

17−test1 = testCase (P [0.0, 0.0, 0.0] [0.0, 0.0, 0.0])

18−

19−main = do

20− Debug.Trace.trace (runP (\s n -> s ++ show n) (P "Test" 0.0))

21− Debug.Trace.print test1

examples/passing/Operators.purs+1−1

@@ -46,7 +46,7 @@ module Main where

46

47 test10 = "Hello" `Main.bar` "World"

48

49− (...) :: forall a. [a] -> [a] -> [a]

49+ (...) :: forall a. Array a -> Array a -> Array a

50 (...) = \as -> \bs -> as

51

52 test11 = [1.0, 2.0, 0.0] ... [4.0, 5.0, 6.0]

examples/passing/Patterns.purs+1−7

@@ -11,17 +11,11 @@ module Main where

11 { foo = "Foo" } -> o.bar

12 _ -> 0

13

14− g = \o -> case o of

15− { arr = [x : xs], take = "car" } -> x

16− { arr = [_, x : xs], take = "cadr" } -> x

17− _ -> 0

18−

19−

20 h = \o -> case o of

14 h = \o -> case o of

21 a@[_,_,_] -> a

15 a@[_,_,_] -> a

22 _ -> []

16 _ -> []

23

17

24− isDesc :: [Number] -> Boolean

18+ isDesc :: Array Number -> Boolean

25 isDesc [x, y] | x > y = true

19 isDesc [x, y] | x > y = true

26 isDesc _ = false

20 isDesc _ = false

27

21

examples/passing/Sequence.purs+6−4

@@ -2,11 +2,13 @@ module Main where

2

3import Control.Monad.Eff

4

5+data List a = Cons a (List a) | Nil

6+

5class Sequence t where

7class Sequence t where

6 sequence :: forall m a. (Monad m) => t (m a) -> m (t a)

8 sequence :: forall m a. (Monad m) => t (m a) -> m (t a)

7

9

8−instance sequenceArray :: Sequence [] where

10+instance sequenceList :: Sequence List where

9− sequence [] = pure []

11+ sequence Nil = pure Nil

10− sequence (x:xs) = (:) <$> x <*> sequence xs

12+ sequence (Cons x xs) = Cons <$> x <*> sequence xs

11

13

12−main = sequence $ [Debug.Trace.trace "Done"]

14+main = sequence $ Cons (Debug.Trace.trace "Done") Nil

examples/passing/SequenceDesugared.purs+21−19

@@ -2,33 +2,35 @@ module Main where

2

3import Control.Monad.Eff

4

5+data List a = Cons a (List a) | Nil

6+

5data Sequence t = Sequence (forall m a. (Monad m) => t (m a) -> m (t a))

7data Sequence t = Sequence (forall m a. (Monad m) => t (m a) -> m (t a))

6

8

7sequence :: forall t. Sequence t -> (forall m a. (Monad m) => t (m a) -> m (t a))

9sequence :: forall t. Sequence t -> (forall m a. (Monad m) => t (m a) -> m (t a))

8sequence (Sequence s) = s

10sequence (Sequence s) = s

9

11

10−sequenceArraySeq :: forall m a. (Monad m) => Array (m a) -> m (Array a)

12+sequenceListSeq :: forall m a. (Monad m) => List (m a) -> m (List a)

11−sequenceArraySeq [] = pure []

13+sequenceListSeq Nil = pure Nil

12−sequenceArraySeq (x:xs) = (:) <$> x <*> sequenceArraySeq xs

14+sequenceListSeq (Cons x xs) = Cons <$> x <*> sequenceListSeq xs

13

15

14−sequenceArray :: Sequence []

16+sequenceList :: Sequence List

15−sequenceArray = Sequence (sequenceArraySeq)

17+sequenceList = Sequence (sequenceListSeq)

16

18

17−sequenceArray' :: Sequence []

19+sequenceList' :: Sequence List

18−sequenceArray' = Sequence ((\val -> case val of

20+sequenceList' = Sequence ((\val -> case val of

19− [] -> pure []

21+ Nil -> pure Nil

20− (x:xs) -> (:) <$> x <*> sequence sequenceArray' xs))

22+ Cons x xs -> Cons <$> x <*> sequence sequenceList' xs))

21

23

22−sequenceArray'' :: Sequence []

24+sequenceList'' :: Sequence List

23−sequenceArray'' = Sequence (sequenceArraySeq :: forall m a. (Monad m) => Array (m a) -> m (Array a))

25+sequenceList'' = Sequence (sequenceListSeq :: forall m a. (Monad m) => List (m a) -> m (List a))

24

26

25−sequenceArray''' :: Sequence []

27+sequenceList''' :: Sequence List

26−sequenceArray''' = Sequence ((\val -> case val of

28+sequenceList''' = Sequence ((\val -> case val of

27− [] -> pure []

29+ Nil -> pure Nil

28− (x:xs) -> (:) <$> x <*> sequence sequenceArray''' xs) :: forall m a. (Monad m) => Array (m a) -> m (Array a))

30+ Cons x xs -> Cons <$> x <*> sequence sequenceList''' xs) :: forall m a. (Monad m) => List (m a) -> m (List a))

29

31

30main = do

32main = do

31− sequence sequenceArray $ [Debug.Trace.trace "Done"]

33+ sequence sequenceList $ Cons (Debug.Trace.trace "Done") Nil

32− sequence sequenceArray' $ [Debug.Trace.trace "Done"]

34+ sequence sequenceList' $ Cons (Debug.Trace.trace "Done") Nil

33− sequence sequenceArray'' $ [Debug.Trace.trace "Done"]

35+ sequence sequenceList'' $ Cons (Debug.Trace.trace "Done") Nil

34− sequence sequenceArray''' $ [Debug.Trace.trace "Done"]

36+ sequence sequenceList''' $ Cons (Debug.Trace.trace "Done") Nil

examples/passing/Superclasses2.purs+4−4

@@ -5,19 +5,19 @@ import Prelude.Unsafe (unsafeIndex)

5class Su a where

6 su :: a -> a

7

8−class (Su [a]) <= Cl a where

8+class (Su (Array a)) <= Cl a where

9 cl :: a -> a -> a

10

11instance suNumber :: Su Number where

12 su n = n + 1.0

13

14−instance suArray :: (Su a) => Su [a] where

14+instance suArray :: (Su a) => Su (Array a) where

15− su (x : _) = [su x]

15+ su [x] = [su x]

16

17instance clNumber :: Cl Number where

18 cl n m = n + m

19

20−test :: forall a. (Cl a) => a -> [a]

20+test :: forall a. (Cl a) => a -> Array a

21test x = su [cl x x]

22

23main = Debug.Trace.print $ test 10.0 `unsafeIndex` 0.0

examples/passing/TailCall.purs+6−4

@@ -2,9 +2,11 @@ module Main where

2

3import Prelude

4

5+data L a = C a (L a) | N

6+

5−test :: Number -> [Number] -> Number

7+test :: Number -> L Number -> Number

6−test n [] = n

8+test n N = n

7−test n (x:xs) = test (n + x) xs

9+test n (C x xs) = test (n + x) xs

8

10

9loop :: forall a. Number -> a

11loop :: forall a. Number -> a

10loop x = loop (x + 1.0)

12loop x = loop (x + 1.0)

@@ -12,4 +14,4 @@ loop x = loop (x + 1.0)

12notATailCall = \x ->

14notATailCall = \x ->

13 (\notATailCall -> notATailCall x) (\x -> x)

15 (\notATailCall -> notATailCall x) (\x -> x)

14

16

15−main = Debug.Trace.print (test 0.0 [1.0, 2.0, 3.0])

17+main = Debug.Trace.print (test 0.0 (1.0 `C` (2.0 `C` (3.0 `C` N))))

examples/passing/TopLevelCase.purs+1−1

@@ -18,7 +18,7 @@ gcd x 0.0 = x

18gcd x y | x > y = gcd (x % y) y

19gcd x y = gcd (y % x) x

20

21−guardsTest (x:xs) | x > 0.0 = guardsTest xs

21+guardsTest [x] | x > 0.0 = []

22guardsTest xs = xs

23

24data A = A

examples/passing/TypeSynonymInData.purs+1−1

@@ -1,6 +1,6 @@

1module Main where

2

3−type A a = [a]

3+type A a = Array a

4

5data Foo a = Foo (A a) | Bar

6

examples/passing/TypedWhere.purs+8−6

@@ -2,12 +2,14 @@ module Main where

2

3data E a b = L a | R b

4

5+data L a = C a (L a) | N

6+

5−lefts :: forall a b. [E a b] -> [a]

7+lefts :: forall a b. L (E a b) -> L a

6−lefts = go []

8+lefts = go N

7 where

9 where

8− go :: forall a b. [a] -> [E a b] -> [a]

10+ go :: forall a b. L a -> L (E a b) -> L a

9− go ls [] = ls

11+ go ls N = ls

10− go ls (L a : rest) = go (a : ls) rest

12+ go ls (C (L a) rest) = go (C a ls) rest

11− go ls (_ : rest) = go ls rest

13+ go ls (C _ rest) = go ls rest

12

14

13main = Debug.Trace.trace "Done"

15main = Debug.Trace.trace "Done"

src/Language/PureScript/AST/Binders.hs−5

@@ -63,10 +63,6 @@ data Binder

63 --

64 | ArrayBinder [Binder]

65 -- |

66− -- A binder which matches an array and binds its head and tail

67− --

68− | ConsBinder Binder Binder

69− -- |

70 -- A binder which binds its input to an identifier

66 -- A binder which binds its input to an identifier

71 --

67 --

72 | NamedBinder Ident Binder

68 | NamedBinder Ident Binder

@@ -85,7 +81,6 @@ binderNames = go []

85 go ns (ConstructorBinder _ bs) = foldl go ns bs

81 go ns (ConstructorBinder _ bs) = foldl go ns bs

86 go ns (ObjectBinder bs) = foldl go ns (map snd bs)

82 go ns (ObjectBinder bs) = foldl go ns (map snd bs)

87 go ns (ArrayBinder bs) = foldl go ns bs

83 go ns (ArrayBinder bs) = foldl go ns bs

88− go ns (ConsBinder b1 b2) = go (go ns b1) b2

89 go ns (NamedBinder name b) = go (name : ns) b

84 go ns (NamedBinder name b) = go (name : ns) b

90 go ns (PositionedBinder _ _ b) = go ns b

85 go ns (PositionedBinder _ _ b) = go ns b

91 go ns _ = ns

86 go ns _ = ns

src/Language/PureScript/AST/Traversals.hs−6

@@ -68,7 +68,6 @@ everywhereOnValues f g h = (f', g', h')

68 h' (ConstructorBinder ctor bs) = h (ConstructorBinder ctor (map h' bs))

69 h' (ObjectBinder bs) = h (ObjectBinder (map (fmap h') bs))

70 h' (ArrayBinder bs) = h (ArrayBinder (map h' bs))

71− h' (ConsBinder b1 b2) = h (ConsBinder (h' b1) (h' b2))

72 h' (NamedBinder name b) = h (NamedBinder name (h' b))

71 h' (NamedBinder name b) = h (NamedBinder name (h' b))

73 h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))

72 h' (PositionedBinder pos com b) = h (PositionedBinder pos com (h' b))

74 h' other = h other

73 h' other = h other

@@ -125,7 +124,6 @@ everywhereOnValuesTopDownM f g h = (f' <=< f, g' <=< g, h' <=< h)

125 h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h' <=< h) bs

124 h' (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h' <=< h) bs

126 h' (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h' <=< h)) bs

125 h' (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h' <=< h)) bs

127 h' (ArrayBinder bs) = ArrayBinder <$> mapM (h' <=< h) bs

126 h' (ArrayBinder bs) = ArrayBinder <$> mapM (h' <=< h) bs

128− h' (ConsBinder b1 b2) = ConsBinder <$> (h b1 >>= h') <*> (h b2 >>= h')

129 h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')

127 h' (NamedBinder name b) = NamedBinder name <$> (h b >>= h')

130 h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')

128 h' (PositionedBinder pos com b) = PositionedBinder pos com <$> (h b >>= h')

131 h' other = h other

129 h' other = h other

@@ -178,7 +176,6 @@ everywhereOnValuesM f g h = (f', g', h')

178 h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> mapM h' bs) >>= h

176 h' (ConstructorBinder ctor bs) = (ConstructorBinder ctor <$> mapM h' bs) >>= h

179 h' (ObjectBinder bs) = (ObjectBinder <$> mapM (sndM h') bs) >>= h

177 h' (ObjectBinder bs) = (ObjectBinder <$> mapM (sndM h') bs) >>= h

180 h' (ArrayBinder bs) = (ArrayBinder <$> mapM h' bs) >>= h

178 h' (ArrayBinder bs) = (ArrayBinder <$> mapM h' bs) >>= h

181− h' (ConsBinder b1 b2) = (ConsBinder <$> h' b1 <*> h' b2) >>= h

182 h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h

179 h' (NamedBinder name b) = (NamedBinder name <$> h' b) >>= h

183 h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h

180 h' (PositionedBinder pos com b) = (PositionedBinder pos com <$> h' b) >>= h

184 h' other = h other

181 h' other = h other

@@ -234,7 +231,6 @@ everythingOnValues (<>) f g h i j = (f', g', h', i', j')

234 h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)

231 h' b@(ConstructorBinder _ bs) = foldl (<>) (h b) (map h' bs)

235 h' b@(ObjectBinder bs) = foldl (<>) (h b) (map (h' . snd) bs)

232 h' b@(ObjectBinder bs) = foldl (<>) (h b) (map (h' . snd) bs)

236 h' b@(ArrayBinder bs) = foldl (<>) (h b) (map h' bs)

233 h' b@(ArrayBinder bs) = foldl (<>) (h b) (map h' bs)

237− h' b@(ConsBinder b1 b2) = h b <> h' b1 <> h' b2

238 h' b@(NamedBinder _ b1) = h b <> h' b1

234 h' b@(NamedBinder _ b1) = h b <> h' b1

239 h' b@(PositionedBinder _ _ b1) = h b <> h' b1

235 h' b@(PositionedBinder _ _ b1) = h b <> h' b1

240 h' b = h b

236 h' b = h b

@@ -303,7 +299,6 @@ everythingWithContextOnValues s0 r0 (<>) f g h i j = (f'' s0, g'' s0, h'' s0, i'

303 h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)

299 h' s (ConstructorBinder _ bs) = foldl (<>) r0 (map (h'' s) bs)

304 h' s (ObjectBinder bs) = foldl (<>) r0 (map (h'' s . snd) bs)

300 h' s (ObjectBinder bs) = foldl (<>) r0 (map (h'' s . snd) bs)

305 h' s (ArrayBinder bs) = foldl (<>) r0 (map (h'' s) bs)

301 h' s (ArrayBinder bs) = foldl (<>) r0 (map (h'' s) bs)

306− h' s (ConsBinder b1 b2) = h'' s b1 <> h'' s b2

307 h' s (NamedBinder _ b1) = h'' s b1

302 h' s (NamedBinder _ b1) = h'' s b1

308 h' s (PositionedBinder _ _ b1) = h'' s b1

303 h' s (PositionedBinder _ _ b1) = h'' s b1

309 h' _ _ = r0

304 h' _ _ = r0

@@ -373,7 +368,6 @@ everywhereWithContextOnValuesM s0 f g h i j = (f'' s0, g'' s0, h'' s0, i'' s0, j

373 h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h'' s) bs

368 h' s (ConstructorBinder ctor bs) = ConstructorBinder ctor <$> mapM (h'' s) bs

374 h' s (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h'' s)) bs

369 h' s (ObjectBinder bs) = ObjectBinder <$> mapM (sndM (h'' s)) bs

375 h' s (ArrayBinder bs) = ArrayBinder <$> mapM (h'' s) bs

370 h' s (ArrayBinder bs) = ArrayBinder <$> mapM (h'' s) bs

376− h' s (ConsBinder b1 b2) = ConsBinder <$> h'' s b1 <*> h'' s b2

377 h' s (NamedBinder name b) = NamedBinder name <$> h'' s b

371 h' s (NamedBinder name b) = NamedBinder name <$> h'' s b

378 h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b

372 h' s (PositionedBinder pos com b) = PositionedBinder pos com <$> h'' s b

379 h' _ other = return other

373 h' _ other = return other

src/Language/PureScript/CodeGen/JS.hs+1−22

@@ -30,7 +30,7 @@ import qualified Data.Traversable as T (traverse)

30

31import Control.Applicative

32import Control.Arrow ((&&&))

33−import Control.Monad (foldM, replicateM, forM)

33+import Control.Monad (replicateM, forM)

34import Control.Monad.Reader (MonadReader, asks)

35import Control.Monad.Supply.Class

36

@@ -315,23 +315,6 @@ moduleToJs (Module coms mn imps exps foreigns decls) = do

315 done'' <- go remain done'

316 js <- binderToJs argVar done'' binder

317 return (JSVariableIntroduction argVar (Just (JSAccessor (identToJs field) (JSVar varName))) : js)

318− binderToJs varName done binder@(ConstructorBinder _ _ ctor _) | isCons ctor = do

319− let (headBinders, tailBinder) = uncons [] binder

320− numberOfHeadBinders = fromIntegral $ length headBinders

321− js1 <- foldM (\done' (headBinder, index) -> do

322− headVar <- freshName

323− jss <- binderToJs headVar done' headBinder

324− return (JSVariableIntroduction headVar (Just (JSIndexer (JSNumericLiteral (Left index)) (JSVar varName))) : jss)) done (zip headBinders [0..])

325− tailVar <- freshName

326− js2 <- binderToJs tailVar js1 tailBinder

327− return [JSIfElse (JSBinary GreaterThanOrEqualTo (JSAccessor "length" (JSVar varName)) (JSNumericLiteral (Left numberOfHeadBinders))) (JSBlock

328− ( JSVariableIntroduction tailVar (Just (JSApp (JSAccessor "slice" (JSVar varName)) [JSNumericLiteral (Left numberOfHeadBinders)])) :

329− js2

330− )) Nothing]

331− where

332− uncons :: [Binder Ann] -> Binder Ann -> ([Binder Ann], Binder Ann)

333− uncons acc (ConstructorBinder _ _ ctor' [h, t]) | isCons ctor' = uncons (h : acc) t

334− uncons acc tailBinder = (reverse acc, tailBinder)

335 binderToJs _ _ b@(ConstructorBinder{}) =

318 binderToJs _ _ b@(ConstructorBinder{}) =

336 error $ "Invalid ConstructorBinder in binderToJs: " ++ show b

319 error $ "Invalid ConstructorBinder in binderToJs: " ++ show b

337 binderToJs varName done (NamedBinder _ ident binder) = do

320 binderToJs varName done (NamedBinder _ ident binder) = do

@@ -369,7 +352,3 @@ moduleToJs (Module coms mn imps exps foreigns decls) = do

369 done'' <- go done' (index + 1) bs'

352 done'' <- go done' (index + 1) bs'

370 js <- binderToJs elVar done'' binder

353 js <- binderToJs elVar done'' binder

371 return (JSVariableIntroduction elVar (Just (JSIndexer (JSNumericLiteral (Left index)) (JSVar varName))) : js)

354 return (JSVariableIntroduction elVar (Just (JSIndexer (JSNumericLiteral (Left index)) (JSVar varName))) : js)

372−

373− isCons :: Qualified ProperName -> Bool

374− isCons (Qualified (Just mn') ctor) = mn' == ModuleName [ProperName C.prim] && ctor == ProperName "Array"

375− isCons name = error $ "Unexpected argument in isCons: " ++ show name

src/Language/PureScript/CoreFn/Desugar.hs−3

@@ -162,9 +162,6 @@ moduleToCoreFn env (A.Module coms mn decls (Just exps)) =

162 LiteralBinder (ss, com, Nothing, Nothing) (ObjectLiteral $ map (second (binderToCoreFn ss [])) bs)

163 binderToCoreFn ss com (A.ArrayBinder bs) =

164 LiteralBinder (ss, com, Nothing, Nothing) (ArrayLiteral $ map (binderToCoreFn ss []) bs)

165− binderToCoreFn ss com (A.ConsBinder b1 b2) =

166− let arrCtor = Qualified (Just $ ModuleName [ProperName "Prim"]) (ProperName "Array")

167− in ConstructorBinder (ss, com, Nothing, Nothing) arrCtor arrCtor $ map (binderToCoreFn ss []) [b1, b2]

168 binderToCoreFn ss com (A.NamedBinder name b) =

165 binderToCoreFn ss com (A.NamedBinder name b) =

169 NamedBinder (ss, com, Nothing, Nothing) name (binderToCoreFn ss [] b)

166 NamedBinder (ss, com, Nothing, Nothing) name (binderToCoreFn ss [] b)

170 binderToCoreFn _ com (A.PositionedBinder ss com1 b) =

167 binderToCoreFn _ com (A.PositionedBinder ss com1 b) =

src/Language/PureScript/Parser/Declarations.hs+3−2

@@ -493,9 +493,10 @@ parseIdentifierAndBinder = do

493-- Parse a binder

494--

495parseBinder :: TokenParser Binder

496−parseBinder = withSourceSpan PositionedBinder (P.buildExpressionParser operators parseBinderAtom P.<?> "expression")

496+parseBinder = withSourceSpan PositionedBinder (P.buildExpressionParser operators parseBinderAtom)

497 where

498+ -- TODO: remove this deprecation warning in 0.8

498− operators = [ [ P.Infix (P.try $ C.indented *> colon *> return ConsBinder) P.AssocRight ] ]

499+ operators = [ [ P.Infix (P.try $ C.indented *> colon *> return (error "Cons binders are no longer supported. Consider using purescript-lists or purescript-sequences instead.")) P.AssocRight ] ]

499 parseBinderAtom :: TokenParser Binder

500 parseBinderAtom :: TokenParser Binder

500 parseBinderAtom = P.choice (map P.try

501 parseBinderAtom = P.choice (map P.try

501 [ parseNullBinder

502 [ parseNullBinder

src/Language/PureScript/Parser/Types.hs+7−2

@@ -32,11 +32,16 @@ import Language.PureScript.Environment

32import qualified Text.Parsec as P

33import qualified Text.Parsec.Expr as P

34

35+-- TODO: remove these deprecation warnings in 0.8

35parseArray :: TokenParser Type

36parseArray :: TokenParser Type

37+parseArray = do

36−parseArray = squares $ return tyArray

38+ _ <- squares $ return tyArray

39+ return $ error "Array notation is no longer supported. Use Array instead of []."

37

40

38parseArrayOf :: TokenParser Type

41parseArrayOf :: TokenParser Type

42+parseArrayOf = do

39−parseArrayOf = squares $ TypeApp tyArray <$> parseType

43+ _ <- squares $ TypeApp tyArray <$> parseType

44+ return $ error "Array notation is no longer supported. Use Array _ instead of [_]."

40

45

41parseFunction :: TokenParser Type

46parseFunction :: TokenParser Type

42parseFunction = parens $ rarrow >> return tyFunction

47parseFunction = parens $ rarrow >> return tyFunction

src/Language/PureScript/Pretty/Types.hs−2

@@ -37,7 +37,6 @@ typeLiterals = mkPattern match

37 match TypeWildcard = Just "_"

38 match (TypeVar var) = Just var

39 match (PrettyPrintObject row) = Just $ "{ " ++ prettyPrintRow row ++ " }"

40− match (PrettyPrintArray ty) = Just $ "[" ++ prettyPrintType ty ++ "]"

41 match (TypeConstructor ctor) = Just $ show ctor

40 match (TypeConstructor ctor) = Just $ show ctor

42 match (TUnknown u) = Just $ 'u' : show u

41 match (TUnknown u) = Just $ 'u' : show u

43 match (Skolem name s _) = Just $ name ++ show s

42 match (Skolem name s _) = Just $ name ++ show s

@@ -84,7 +83,6 @@ insertPlaceholders :: Type -> Type

84insertPlaceholders = everywhereOnTypesTopDown convertForAlls . everywhereOnTypes convert

83insertPlaceholders = everywhereOnTypesTopDown convertForAlls . everywhereOnTypes convert

85 where

84 where

86 convert (TypeApp (TypeApp f arg) ret) | f == tyFunction = PrettyPrintFunction arg ret

85 convert (TypeApp (TypeApp f arg) ret) | f == tyFunction = PrettyPrintFunction arg ret

87− convert (TypeApp a el) | a == tyArray = PrettyPrintArray el

88 convert (TypeApp o r) | o == tyObject = PrettyPrintObject r

86 convert (TypeApp o r) | o == tyObject = PrettyPrintObject r

89 convert other = other

87 convert other = other

90 convertForAlls (ForAll ident ty _) = go [ident] ty

88 convertForAlls (ForAll ident ty _) = go [ident] ty

src/Language/PureScript/Pretty/Values.hs+1−11

@@ -216,7 +216,6 @@ prettyPrintBinderAtom = mkPattern' match

216 ]

217 match (NamedBinder ident binder) = ((show ident ++ "@") ++) <$> prettyPrintBinder' binder

218 match (PositionedBinder _ _ binder) = prettyPrintBinder' binder

219− match _ = mzero

220

219

221-- |

220-- |

222-- Generate a pretty-printed string representing a Binder

221-- Generate a pretty-printed string representing a Binder

@@ -228,16 +227,7 @@ prettyPrintBinder' :: Binder -> StateT PrinterState Maybe String

228prettyPrintBinder' = runKleisli $ runPattern matchBinder

227prettyPrintBinder' = runKleisli $ runPattern matchBinder

229 where

228 where

230 matchBinder :: Pattern PrinterState Binder String

229 matchBinder :: Pattern PrinterState Binder String

231− matchBinder = buildPrettyPrinter operators (prettyPrintBinderAtom <+> fmap parens matchBinder)

230+ matchBinder = prettyPrintBinderAtom <+> fmap parens matchBinder

232− operators :: OperatorTable PrinterState Binder String

233− operators =

234− OperatorTable [ [ AssocR matchConsBinder (\b1 b2 -> b1 ++ " : " ++ b2) ] ]

235−

236−matchConsBinder :: Pattern PrinterState Binder (Binder, Binder)

237−matchConsBinder = mkPattern match'

238− where

239− match' (ConsBinder b1 b2) = Just (b1, b2)

240− match' _ = Nothing

241

231

242prettyPrintObjectPropertyBinder :: (String, Binder) -> StateT PrinterState Maybe String

232prettyPrintObjectPropertyBinder :: (String, Binder) -> StateT PrinterState Maybe String

243prettyPrintObjectPropertyBinder (key, binder) = concat <$> sequence

233prettyPrintObjectPropertyBinder (key, binder) = concat <$> sequence

src/Language/PureScript/TypeChecker/Types.hs−6

@@ -391,12 +391,6 @@ inferBinder val (ArrayBinder binders) = do

391 m1 <- M.unions <$> mapM (inferBinder el) binders

392 val =?= TypeApp tyArray el

393 return m1

394−inferBinder val (ConsBinder headBinder tailBinder) = do

395− el <- fresh

396− m1 <- inferBinder el headBinder

397− m2 <- inferBinder val tailBinder

398− val =?= TypeApp tyArray el

399− return $ m1 `M.union` m2

400inferBinder val (NamedBinder name binder) = do

394inferBinder val (NamedBinder name binder) = do

401 m <- inferBinder val binder

395 m <- inferBinder val binder

402 return $ M.insert name val m

396 return $ M.insert name val m

src/Language/PureScript/Types.hs−9

@@ -94,10 +94,6 @@ data Type

94 -- |

95 -- A placeholder used in pretty printing

96 --

97− | PrettyPrintArray Type

98− -- |

99− -- A placeholder used in pretty printing

100− --

101 | PrettyPrintObject Type

97 | PrettyPrintObject Type

102 -- |

98 -- |

103 -- A placeholder used in pretty printing

99 -- A placeholder used in pretty printing

@@ -248,7 +244,6 @@ everywhereOnTypes f = go

248 go (RCons name ty rest) = f (RCons name (go ty) (go rest))

244 go (RCons name ty rest) = f (RCons name (go ty) (go rest))

249 go (KindedType ty k) = f (KindedType (go ty) k)

245 go (KindedType ty k) = f (KindedType (go ty) k)

250 go (PrettyPrintFunction t1 t2) = f (PrettyPrintFunction (go t1) (go t2))

246 go (PrettyPrintFunction t1 t2) = f (PrettyPrintFunction (go t1) (go t2))

251− go (PrettyPrintArray t) = f (PrettyPrintArray (go t))

252 go (PrettyPrintObject t) = f (PrettyPrintObject (go t))

247 go (PrettyPrintObject t) = f (PrettyPrintObject (go t))

253 go (PrettyPrintForAll args t) = f (PrettyPrintForAll args (go t))

248 go (PrettyPrintForAll args t) = f (PrettyPrintForAll args (go t))

254 go other = f other

249 go other = f other

@@ -263,7 +258,6 @@ everywhereOnTypesTopDown f = go . f

263 go (RCons name ty rest) = RCons name (go (f ty)) (go (f rest))

258 go (RCons name ty rest) = RCons name (go (f ty)) (go (f rest))

264 go (KindedType ty k) = KindedType (go (f ty)) k

259 go (KindedType ty k) = KindedType (go (f ty)) k

265 go (PrettyPrintFunction t1 t2) = PrettyPrintFunction (go (f t1)) (go (f t2))

260 go (PrettyPrintFunction t1 t2) = PrettyPrintFunction (go (f t1)) (go (f t2))

266− go (PrettyPrintArray t) = PrettyPrintArray (go (f t))

267 go (PrettyPrintObject t) = PrettyPrintObject (go (f t))

261 go (PrettyPrintObject t) = PrettyPrintObject (go (f t))

268 go (PrettyPrintForAll args t) = PrettyPrintForAll args (go (f t))

262 go (PrettyPrintForAll args t) = PrettyPrintForAll args (go (f t))

269 go other = f other

263 go other = f other

@@ -278,7 +272,6 @@ everywhereOnTypesM f = go

278 go (RCons name ty rest) = (RCons name <$> go ty <*> go rest) >>= f

272 go (RCons name ty rest) = (RCons name <$> go ty <*> go rest) >>= f

279 go (KindedType ty k) = (KindedType <$> go ty <*> pure k) >>= f

273 go (KindedType ty k) = (KindedType <$> go ty <*> pure k) >>= f

280 go (PrettyPrintFunction t1 t2) = (PrettyPrintFunction <$> go t1 <*> go t2) >>= f

274 go (PrettyPrintFunction t1 t2) = (PrettyPrintFunction <$> go t1 <*> go t2) >>= f

281− go (PrettyPrintArray t) = (PrettyPrintArray <$> go t) >>= f

282 go (PrettyPrintObject t) = (PrettyPrintObject <$> go t) >>= f

275 go (PrettyPrintObject t) = (PrettyPrintObject <$> go t) >>= f

283 go (PrettyPrintForAll args t) = (PrettyPrintForAll args <$> go t) >>= f

276 go (PrettyPrintForAll args t) = (PrettyPrintForAll args <$> go t) >>= f

284 go other = f other

277 go other = f other

@@ -293,7 +286,6 @@ everywhereOnTypesTopDownM f = go <=< f

293 go (RCons name ty rest) = RCons name <$> (f ty >>= go) <*> (f rest >>= go)

286 go (RCons name ty rest) = RCons name <$> (f ty >>= go) <*> (f rest >>= go)

294 go (KindedType ty k) = KindedType <$> (f ty >>= go) <*> pure k

287 go (KindedType ty k) = KindedType <$> (f ty >>= go) <*> pure k

295 go (PrettyPrintFunction t1 t2) = PrettyPrintFunction <$> (f t1 >>= go) <*> (f t2 >>= go)

288 go (PrettyPrintFunction t1 t2) = PrettyPrintFunction <$> (f t1 >>= go) <*> (f t2 >>= go)

296− go (PrettyPrintArray t) = PrettyPrintArray <$> (f t >>= go)

297 go (PrettyPrintObject t) = PrettyPrintObject <$> (f t >>= go)

289 go (PrettyPrintObject t) = PrettyPrintObject <$> (f t >>= go)

298 go (PrettyPrintForAll args t) = PrettyPrintForAll args <$> (f t >>= go)

290 go (PrettyPrintForAll args t) = PrettyPrintForAll args <$> (f t >>= go)

299 go other = f other

291 go other = f other

@@ -308,7 +300,6 @@ everythingOnTypes (<>) f = go

308 go t@(RCons _ ty rest) = f t <> go ty <> go rest

300 go t@(RCons _ ty rest) = f t <> go ty <> go rest

309 go t@(KindedType ty _) = f t <> go ty

301 go t@(KindedType ty _) = f t <> go ty

310 go t@(PrettyPrintFunction t1 t2) = f t <> go t1 <> go t2

302 go t@(PrettyPrintFunction t1 t2) = f t <> go t1 <> go t2

311− go t@(PrettyPrintArray t1) = f t <> go t1

312 go t@(PrettyPrintObject t1) = f t <> go t1

303 go t@(PrettyPrintObject t1) = f t <> go t1

313 go t@(PrettyPrintForAll _ t1) = f t <> go t1

304 go t@(PrettyPrintForAll _ t1) = f t <> go t1

314 go other = f other

305 go other = f other

tests/prelude.purs+37−14

@@ -68,11 +68,11 @@ module Prelude

68 return [e].concat(l);

69 };

70 }

71− """ :: forall a. a -> [a] -> [a]

71+ """ :: forall a. a -> Array a -> Array a

72

73 infixr 6 :

74

75− (:) :: forall a. a -> [a] -> [a]

75+ (:) :: forall a. a -> Array a -> Array a

76 (:) = cons

77

78 infixr 9 >>>

@@ -303,7 +303,7 @@ module Prelude

303 (==) _ _ = true

304 (/=) _ _ = false

305

306− instance eqArray :: (Eq a) => Eq [a] where

306+ instance eqArray :: (Eq a) => Eq (Array a) where

307 (==) = eqArrayImpl (==)

308 (/=) xs ys = not (xs == ys)

309

@@ -345,7 +345,7 @@ module Prelude

345 };

346 };

347 }

348− """ :: forall a. (a -> a -> Boolean) -> [a] -> [a] -> Boolean

348+ """ :: forall a. (a -> a -> Boolean) -> Array a -> Array a -> Boolean

349

350 data Ordering = LT | GT | EQ

351

@@ -367,13 +367,36 @@ module Prelude

367 instance ordUnit :: Ord Unit where

368 compare _ _ = EQ

369

370− instance ordArray :: (Ord a) => Ord [a] where

370+ instance ordArray :: (Ord a) => Ord (Array a) where

371− compare [] [] = EQ

371+ compare xs ys = compare 0.0 $ ordArrayImpl (\x y -> case compare x y of

372− compare [] _ = LT

372+ EQ -> 0.0

373− compare _ [] = GT

373+ LT -> -1.0

374− compare (x:xs) (y:ys) = case compare x y of

374+ GT -> 1.0) xs ys

375− EQ -> compare xs ys

375+

376− other -> other

376+ foreign import ordArrayImpl """

377+ function ordArrayImpl(f) {

378+ return function (ys) {

379+ return function (ys) {

380+ var i = 0;

381+ while (i < xs.length && i < ys.length) {

382+ var x = xs[i];

383+ var y = ys[i];

384+ var o = f(x)(y);

385+ if (o !== 0) {

386+ return o;

387+ }

388+ }

389+ if (xs.length == ys.length) {

390+ return 0;

391+ } else if (xs.length > ys.length) {

392+ return 1;

393+ } else {

394+ return -1;

395+ }

396+ };

397+ };

398+ }

399+ """ :: forall a. (a -> a -> Number) -> Array a -> Array a -> Number

377

400

378 instance ordOrdering :: Ord Ordering where

401 instance ordOrdering :: Ord Ordering where

379 compare LT LT = EQ

402 compare LT LT = EQ

@@ -532,7 +555,7 @@ module Prelude

532 instance showUnit :: Show Unit where

555 instance showUnit :: Show Unit where

533 show _ = "unit"

556 show _ = "unit"

534

557

535− instance showArray :: (Show a) => Show [a] where

558+ instance showArray :: (Show a) => Show (Array a) where

536 show = showArrayImpl show

559 show = showArrayImpl show

537

560

538 instance showOrdering :: Show Ordering where

561 instance showOrdering :: Show Ordering where

@@ -565,7 +588,7 @@ module Prelude

565 return '[' + ss.join(',') + ']';

588 return '[' + ss.join(',') + ']';

566 };

589 };

567 }

590 }

568− """ :: forall a. (a -> String) -> [a] -> String

591+ """ :: forall a. (a -> String) -> Array a -> String

569

592

570module Data.Function where

593module Data.Function where

571

594

@@ -889,7 +912,7 @@ module Prelude.Unsafe where

889 return xs[n];

912 return xs[n];

890 };

913 };

891 }

914 }

892− """ :: forall a. [a] -> Number -> a

915+ """ :: forall a. Array a -> Number -> a

893

916

894module Control.Monad.Eff

917module Control.Monad.Eff

895 ( Eff()

918 ( Eff()