We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a00468f commit 80e94c5Copy full SHA for 80e94c5
test/runtests.jl
@@ -463,7 +463,12 @@ end
463
X = [(2t)'; -(0.01t)']
464
order = [2, 1]
465
# Should warn since both rows of Y are closest to the first row of X
466
- @test_warn "`match_slices!` may not have found the best ordering; using O(n²) greedy approach." (order2_found = match_slices!(X, Y; dims=1))
+ @test_warn "`match_slices!` may not have found the best ordering; using O(n²) greedy approach." match_slices!(X, Y; dims=1)
467
+
468
+ Y = [(1.9t)'; (2t)']
469
+ X = [(2t)'; -(0.01t)']
470
+ order = [2, 1]
471
+ order2_found = match_slices!(X, Y; dims=1)
472
@test order2_found == invperm(order) # Should still find the correct inverse permutation
473
end
474
0 commit comments