FFTIndexerTest: Update test to sort input vectors + remove old, unused file duplicating this test

2026-06-03 12:08:45 +02:00
parent c1f884279d
commit ce23a6ccf2
2 changed files with 19 additions and 57 deletions
@@ -218,10 +218,26 @@ TEST_CASE("FFTIndexer","[Indexing]") {
    auto end = std::chrono::high_resolution_clock::now();

    REQUIRE(result.lattice.size() == 1);
+
    auto uc_out = result.lattice[0].GetUnitCell();
-    CHECK(uc_out.a == Catch::Approx(uc.b));
-    CHECK(uc_out.b == Catch::Approx(uc.a));
-    CHECK(uc_out.c == Catch::Approx(uc.c));
+
+    // Collect and sort both sets of lengths to compare order-independently
+    std::array<float, 3> out_lengths = {
+        static_cast<float>(uc_out.a),
+        static_cast<float>(uc_out.b),
+        static_cast<float>(uc_out.c)
+    };
+    std::array<float, 3> ref_lengths = {
+        static_cast<float>(uc.a),
+        static_cast<float>(uc.b),
+        static_cast<float>(uc.c)
+    };
+    std::sort(out_lengths.begin(), out_lengths.end());
+    std::sort(ref_lengths.begin(), ref_lengths.end());
+
+    CHECK(out_lengths[0] == Catch::Approx(ref_lengths[0]));
+    CHECK(out_lengths[1] == Catch::Approx(ref_lengths[1]));
+    CHECK(out_lengths[2] == Catch::Approx(ref_lengths[2]));

    CHECK(uc_out.alpha == Catch::Approx(uc.alpha));
    CHECK(uc_out.beta == Catch::Approx(uc.beta));