Reorder binary case patterns to avoid false matches

Author: honno

array_api_tests/test_special_cases.py

@@ -579,12 +579,6 @@ def __call__(self, groups: Tuple[str, ...]) -> BinaryCase:
 r_result_sign = re.compile("([a-z]+) mathematical sign")
 
 binary_pattern_to_case_factory: Dict[Pattern, BinaryCaseFactory] = {
-    re.compile(
-        "If ``x1_i`` is (.+) and ``x2_i`` is (.+), the result is (.+)"
-    ): BinaryCaseFactory(
-        AndCondFactory(ValueCondFactory("i1", 0), ValueCondFactory("i2", 1)),
-        ResultCheckFactory(2),
-    ),
     re.compile(
         "If ``x1_i`` is (.+), ``x1_i`` (.+), "
         "and ``x2_i`` is (.+), the result is (.+)"
@@ -607,6 +601,13 @@ def __call__(self, groups: Tuple[str, ...]) -> BinaryCase:
         ),
         ResultCheckFactory(3),
     ),
+    # This case must come after the above to avoid false matches
+    re.compile(
+        "If ``x1_i`` is (.+) and ``x2_i`` is (.+), the result is (.+)"
+    ): BinaryCaseFactory(
+        AndCondFactory(ValueCondFactory("i1", 0), ValueCondFactory("i2", 1)),
+        ResultCheckFactory(2),
+    ),
     re.compile(
         r"If ``abs\(x1_i\)`` is (.+) and ``x2_i`` is (.+), the result is (.+)"
     ): BinaryCaseFactory(