add add lxor (^) unified operator

Author: MiryangJung

compiler/ml/unified_ops.ml

@@ -161,6 +161,19 @@ let entries =
           string = None;
         };
     };
+    {
+      path = builtin "^";
+      name = "%xor";
+      form = Binary;
+      specialization =
+        {
+          int = Pxorint;
+          bool = None;
+          float = None;
+          bigint = Some Pxorbigint;
+          string = None;
+        };
+    };
   |]
 
 let index_by_path =

runtime/Pervasives.res

@@ -51,6 +51,7 @@ external \"*": ('a, 'a) => 'a = "%mul"
 external \"/": ('a, 'a) => 'a = "%div"
 external \"%": ('a, 'a) => 'a = "%mod"
 external mod: ('a, 'a) => 'a = "%mod"
+external \"^": ('a, 'a) => 'a = "%xor"
 
 /* Comparisons */
 /* Note: Later comparisons will be converted to unified operations too */

runtime/Pervasives_mini.res

@@ -30,6 +30,7 @@ external \"*": (int, int) => int = "%mulint"
 external \"/": (int, int) => int = "%divint"
 external \"%": (int, int) => int = "%modint"
 external mod: (int, int) => int = "%modint"
+external \"^": (int, int) => int = "%xorint"
 
 /* Comparisons */
 /* Note: Later comparisons will be converted to unified operations too */

tests/syntax_tests/data/parsing/grammar/expressions/binary.res

@@ -28,6 +28,7 @@ let x = z |> @attr while condition { () }
 let x = a + -1 + -2
 let x = a + @attr -1 + @attr -2
 let x = a % a == 0
+let x = a ^ a == 0
 
 // should be interpreted as binary expression not prefix op
 let x = a -b

tests/syntax_tests/data/printer/expr/binary.res

@@ -54,6 +54,7 @@ let () = (x: int) |> (print_int: int => unit)
 x + y / z
 x / y + z
 x % y * z
+x ^ y + z
 100 * x / total
 2 / 3 * 10 / 2 + 2
 let rotateX = ((range / rect.height) * refY - range / 2) * getXMultiplication(rect.width)

tests/tests/src/belt_int_test.res

@@ -41,5 +41,6 @@ describe(__MODULE__, () => {
     eq(__LOC__, 2 * 3, 6)
     eq(__LOC__, 2 / 3, 0)
     eq(__LOC__, 2 % 2, 0)
+    eq(__LOC__, 2 ^ 3, 1)
   })
 })

tests/tests/src/unified_ops_test.res

@@ -20,3 +20,5 @@ let case2 = (a, b) => a + "test" + b
 
 let even = n => n % 2 == 0
 let odd = n => n % 2 == 1
+
+let lxor = (a, b: int) => a ^ b