tests: future proof one test

Author: james-d-mitchell

tests/test_present.py

@@ -12,16 +12,13 @@
 This module contains some tests for the Presentation class.
 """
 
-from typing import List, Union
+# pylint: disable=fixme
+
 from datetime import timedelta
+from typing import List, Union
 
 import pytest
-
-from libsemigroups_pybind11 import (
-    Presentation,
-    presentation,
-    ReportGuard,
-)
+from libsemigroups_pybind11 import Presentation, ReportGuard, presentation
 
 ###############################################################################
 # Helper functions
@@ -214,18 +211,33 @@ def check_sort_rules(W):
     presentation.add_rule(p, W([1, 2, 1]), W([0]))
     p.alphabet_from_rules()
     presentation.sort_rules(p)
-    assert p.rules == [
-        W([1, 1]),
-        W([1, 2, 1]),
-        W([1, 2, 1]),
-        W([1, 1, 2, 1]),
-        W([1, 2, 1]),
-        W([0]),
-        W([0, 1, 2, 1]),
-        W([1, 2, 1]),
-        W([1, 1, 2, 1]),
-        W([1, 1]),
-    ]
+    # TODO when we require libsemigroups v2.3.0 remove the first clause here!
+    assert p.rules in (
+        [
+            W([1, 1]),
+            W([1, 2, 1]),
+            W([1, 2, 1]),
+            W([1, 1, 2, 1]),
+            W([1, 2, 1]),
+            W([0]),
+            W([0, 1, 2, 1]),
+            W([1, 2, 1]),
+            W([1, 1, 2, 1]),
+            W([1, 1]),
+        ],
+        [
+            W([1, 2, 1]),
+            W([0]),
+            W([1, 1]),
+            W([1, 2, 1]),
+            W([1, 1, 2, 1]),
+            W([1, 1]),
+            W([0, 1, 2, 1]),
+            W([1, 2, 1]),
+            W([1, 2, 1]),
+            W([1, 1, 2, 1]),
+        ],
+    )
 
 
 def check_longest_common_subword(W):