JavaScriptExpert
diff --git a/‎examples/passing/Collatz.purs‎
Lines changed: 12 additions & 1 deletion b/‎examples/passing/Collatz.purs‎
Lines changed: 12 additions & 1 deletion
diff --git a/‎examples/passing/Guards.purs‎
Lines changed: 31 additions & 21 deletions b/‎examples/passing/Guards.purs‎
Lines changed: 31 additions & 21 deletions
diff --git a/‎examples/passing/OperatorAssociativity.purs‎
Lines changed: 0 additions & 6 deletions b/‎examples/passing/OperatorAssociativity.purs‎
Lines changed: 0 additions & 6 deletions
diff --git a/‎examples/passing/TopLevelCase.purs‎
Lines changed: 21 additions & 11 deletions b/‎examples/passing/TopLevelCase.purs‎
Lines changed: 21 additions & 11 deletions
@@ -1,9 +1,20 @@
 module Main where
 
-import Prelude
 import Control.Monad.Eff
 import Control.Monad.ST
 
+foreign import jsMod
+  """
+  function jsMod(x) {
+    return function (y) {
+      return x % y;
+    };
+  }
+  """ :: Number -> Number -> Number
+
+infixl 7 %
+(%) = jsMod
+
 collatz :: Number -> Number
 collatz n = runPure (runST (do
   r <- newSTRef n
 
@@ -1,29 +1,39 @@
 module Main where
 
-  import Prelude
+foreign import jsMod
+  """
+  function jsMod(x) {
+    return function (y) {
+      return x % y;
+    };
+  }
+  """ :: Number -> Number -> Number
 
-  collatz = \x -> case x of
-    y | y % 2 == 0 -> y / 2
-    y -> y * 3 + 1
+infixl 7 %
+(%) = jsMod
 
-  -- Guards have access to current scope
-  collatz2 = \x y -> case x of
-    z | y > 0 -> z / 2
-    z -> z * 3 + 1
+collatz = \x -> case x of
+  y | y % 2 == 0 -> y / 2
+  y -> y * 3 + 1
 
-  min :: forall a. (Ord a) => a -> a -> a
-  min n m | n < m     = n
-          | otherwise = m
+-- Guards have access to current scope
+collatz2 = \x y -> case x of
+  z | y > 0 -> z / 2
+  z -> z * 3 + 1
 
-  max :: forall a. (Ord a) => a -> a -> a
-  max n m = case unit of
-    _ | m < n     -> n
-      | otherwise -> m
+min :: forall a. (Ord a) => a -> a -> a
+min n m | n < m     = n
+        | otherwise = m
 
-  testIndentation :: Number -> Number -> Number
-  testIndentation x y | x > 0
-    = x + y
-                      | otherwise
-    = y - x
+max :: forall a. (Ord a) => a -> a -> a
+max n m = case unit of
+  _ | m < n     -> n
+    | otherwise -> m
 
-  main = Debug.Trace.trace $ min "Done" "ZZZZ"
+testIndentation :: Number -> Number -> Number
+testIndentation x y | x > 0
+  = x + y
+                    | otherwise
+  = y - x
+
+main = Debug.Trace.trace $ min "Done" "ZZZZ"
@@ -35,12 +35,6 @@ main = do
     assert (6 / (3 * 2) == 1)   "6 / (3 * 2) == 1"
     assert ((6 / 3) * 2 == 4)   "(6 / 3) * 2 == 4"
 
-    assert (6 % (2 * 2) == 2)   "6 % (2 * 2) == 2"
-    assert ((6 % 2) * 2 == 0)   "(6 % 2) * 2 == 0"
-
-    assert (4 % (9 / 3) == 1)   "4 % (9 / 3) == 1"
-    assert ((4 % 9) / 2 == 2)   "(4 % 9) / 2 == 2"
-
     assert (not (1 < 0) == true) "not (1 < 0) == true"
     assert (not ((negate 1) < 0) == false) "not ((negate 1) < 0) == false"
 
 
@@ -1,18 +1,28 @@
 module Main where
 
-  import Prelude
+foreign import jsMod
+  """
+  function jsMod(x) {
+    return function (y) {
+      return x % y;
+    };
+  }
+  """ :: Number -> Number -> Number
 
-  gcd :: Number -> Number -> Number
-  gcd 0 x = x
-  gcd x 0 = x
-  gcd x y | x > y = gcd (x % y) y
-  gcd x y = gcd (y % x) x
+infixl 7 %
+(%) = jsMod
 
-  guardsTest (x:xs) | x > 0 = guardsTest xs
-  guardsTest xs = xs
+gcd :: Number -> Number -> Number
+gcd 0 x = x
+gcd x 0 = x
+gcd x y | x > y = gcd (x % y) y
+gcd x y = gcd (y % x) x
 
-  data A = A
+guardsTest (x:xs) | x > 0 = guardsTest xs
+guardsTest xs = xs
 
-  parseTest A 0 = 0
+data A = A
 
-  main = Debug.Trace.trace "Done"
+parseTest A 0 = 0
+
+main = Debug.Trace.trace "Done"