More robust

Author: christiangnrd

test/testsuite/random.jl

@@ -6,8 +6,10 @@
     end
     cpu_rng = Random.default_rng()
 
+    SEEDING_BROKEN = (rng != cpu_rng) && !(@isdefined(JLArray) && AT == JLArray)
+
     @testset "rand" begin  # uniform
-        @testset "$d $T" for T in eltypes, d in (10, (10, 10), (128, 128))
+        @testset "$d $T" for T in eltypes, d in (10, (10, 10), (512, 512))
             A = AT{T}(undef, d)
             B = copy(A)
             rand!(rng, A)
@@ -22,7 +24,7 @@
             rand!(rng, A)
             Random.seed!(rng, 1)
             rand!(rng, B)
-            @test Array(A) == Array(B) broken=(rng != cpu_rng) && (prod(d) > length(rng.state))
+            @test Array(A) == Array(B) broken=SEEDING_BROKEN && (prod(d) > length(rng.state))
 
             if rng != cpu_rng
                 rand!(cpu_rng, A)
@@ -47,7 +49,7 @@
     @testset "randn" begin  # normally-distributed
         # XXX: randn calls sqrt, and Base's sqrt(::Complex) performs
         #      checked type conversions that throw boxed numbers.
-        @testset "$d $T" for T in filter(isrealfloattype, eltypes), d in (2, (2, 2), (128, 128))
+        @testset "$d $T" for T in filter(isrealfloattype, eltypes), d in (2, (2, 2), (512, 512))
             A = AT{T}(undef, d)
             B = copy(A)
             randn!(rng, A)
@@ -62,7 +64,7 @@
             randn!(rng, A)
             Random.seed!(rng, 1)
             randn!(rng, B)
-            @test Array(A) == Array(B) broken=(rng != cpu_rng) && (prod(d) > (2 * length(rng.state)))
+            @test Array(A) == Array(B) broken=SEEDING_BROKEN && (prod(d) > (2 * length(rng.state)))
 
             if rng != cpu_rng
                 randn!(cpu_rng, A)