Fix reporting multiple errors (#99)

Fixes #96.

Author: decioferreira

src/Compiler/Canonicalize/Module.elm

@@ -85,6 +85,7 @@ canonicalizeBinop (A.At _ (Src.Infix op associativity precedence func)) =
 --
 -- 1. Detect cycles using ALL dependencies => needed for type inference
 -- 2. Detect cycles using DIRECT dependencies => nonterminating recursion
+--
 
 
 canonicalizeValues : SyntaxVersion -> Env.Env -> List (A.Located Src.Value) -> MResult i (List W.Warning) Can.Decls

src/Compiler/Reporting/Result.elm

@@ -160,18 +160,34 @@ bind callback (RResult ka) =
 
 
 traverse : (a -> RResult i w x b) -> List a -> RResult i w x (List b)
-traverse func list =
-    loop (traverseHelp func) ( list, [] )
-
-
-traverseHelp : (a -> RResult i w e b) -> ( List a, List b ) -> RResult i w e (Step ( List a, List b ) (List b))
-traverseHelp callback ( list, result ) =
-    case list of
-        [] ->
-            pure (Done (List.reverse result))
-
-        a :: rest ->
-            fmap (\b -> Loop ( rest, b :: result )) (callback a)
+traverse func =
+    List.foldl
+        (\a (RResult acc) ->
+            RResult <|
+                \i w ->
+                    let
+                        (RResult kv) =
+                            func a
+                    in
+                    case acc i w of
+                        ROk i1 w1 accList ->
+                            case kv i1 w1 of
+                                ROk i2 w2 value ->
+                                    ROk i2 w2 (value :: accList)
+
+                                RErr i2 w2 e2 ->
+                                    RErr i2 w2 e2
+
+                        RErr i1 w1 e1 ->
+                            case kv i1 w1 of
+                                ROk i2 w2 _ ->
+                                    RErr i2 w2 e1
+
+                                RErr i2 w2 e2 ->
+                                    RErr i2 w2 (OneOrMore.more e1 e2)
+        )
+        (pure [])
+        >> fmap List.reverse
 
 
 mapTraverseWithKey : (k -> comparable) -> (k -> k -> Order) -> (k -> a -> RResult i w x b) -> Dict comparable k a -> RResult i w x (Dict comparable k b)

tests/backwards-compatibility.test.js

@@ -160,7 +160,7 @@ describe("backwards compatibility", () => {
   });
 
   describe("tuples", () => {
-    test.skip("fails on 3+ tuples on elm files", () => {
+    test("fails on 3+ tuples on elm files", () => {
       const elmOutput = `${tmpDir}/guida-test-elm-tuple-n-${process.pid}.json`;
       const guidaOutput = `${tmpDir}/guida-test-guida-tuple-n-${process.pid}.json`;