Relax allocatin tests for v1.11

Author: albertomercurio

src/time_evolution/time_evolution.jl

@@ -213,16 +213,16 @@ struct DiscreteLindbladJumpCallback <: LindbladJumpCallbackType end
 ContinuousLindbladJumpCallback(; interp_points::Int = 10) = ContinuousLindbladJumpCallback(interp_points)
 
 function _check_tlist(tlist, T::Type)
-    tlist = convert(Vector{T}, tlist) # Convert it to support GPUs and avoid type instabilities for OrdinaryDiffEq.jl
+    tlist2 = convert(Vector{T}, tlist) # Convert it to support GPUs and avoid type instabilities for OrdinaryDiffEq.jl
 
     # Check if the list of times is not empty
-    isempty(tlist) && throw(ArgumentError("The list of times must not be empty."))
+    isempty(tlist2) && throw(ArgumentError("The list of times must not be empty."))
     # Check if the list of times is sorted
-    !issorted(tlist) && throw(ArgumentError("The list of times must be sorted."))
+    !issorted(tlist2) && throw(ArgumentError("The list of times must be sorted."))
     # Check if the list of times is unique
-    length(tlist) != length(unique(tlist)) && throw(ArgumentError("The list of times must be unique."))
+    length(tlist2) != length(unique(tlist2)) && throw(ArgumentError("The list of times must be unique."))
 
-    return tlist
+    return tlist2
 end
 
 #######################################

test/core-test/time_evolution.jl

@@ -77,7 +77,7 @@
 
             allocs_tot = @allocations sesolve(H, ψ0, tlist, saveat = [tlist[end]], progress_bar = Val(false)) # Warm-up
             allocs_tot = @allocations sesolve(H, ψ0, tlist, saveat = [tlist[end]], progress_bar = Val(false))
-            @test allocs_tot < 100
+            @test allocs_tot < 112
         end
 
         @testset "Type Inference sesolve" begin
@@ -288,21 +288,21 @@
 
             allocs_tot = @allocations mesolve(L, ψ0, tlist, e_ops = e_ops, progress_bar = Val(false)) # Warm-up
             allocs_tot = @allocations mesolve(L, ψ0, tlist, e_ops = e_ops, progress_bar = Val(false))
-            @test allocs_tot < 210
+            @test allocs_tot < 219
 
             allocs_tot = @allocations mesolve(L, ψ0, tlist, saveat = [tlist[end]], progress_bar = Val(false)) # Warm-up
             allocs_tot = @allocations mesolve(L, ψ0, tlist, saveat = [tlist[end]], progress_bar = Val(false))
-            @test allocs_tot < 120
+            @test allocs_tot < 133
 
             allocs_tot = @allocations mesolve(L_td, ψ0, tlist, e_ops = e_ops, progress_bar = Val(false), params = p) # Warm-up
             allocs_tot = @allocations mesolve(L_td, ψ0, tlist, e_ops = e_ops, progress_bar = Val(false), params = p)
-            @test allocs_tot < 210
+            @test allocs_tot < 219
 
             allocs_tot =
                 @allocations mesolve(L_td, ψ0, tlist, progress_bar = Val(false), saveat = [tlist[end]], params = p) # Warm-up
             allocs_tot =
                 @allocations mesolve(L_td, ψ0, tlist, progress_bar = Val(false), saveat = [tlist[end]], params = p)
-            @test allocs_tot < 120
+            @test allocs_tot < 133
         end
 
         @testset "Memory Allocations (mcsolve)" begin