|
140 | 140 | @inferred sesolveProblem(H, ψ0, tlist, progress_bar = Val(false)) |
141 | 141 | @inferred sesolveProblem(H, ψ0, [0, 10], progress_bar = Val(false)) |
142 | 142 | @inferred sesolveProblem(H, TESetup.ψ0_int, tlist, progress_bar = Val(false)) |
143 | | - @inferred sesolve(H, ψ0, tlist, e_ops = e_ops, progress_bar = Val(false)) |
| 143 | + @inferred sesolve(H, ψ0, tlist, e_ops = e_ops, progress_bar = Val(true)) # test progress bar |
144 | 144 | @inferred sesolve(H, ψ0, tlist, progress_bar = Val(false)) |
145 | 145 | @inferred sesolve(H, ψ0, tlist, e_ops = e_ops, saveat = saveat, progress_bar = Val(false)) |
146 | 146 | @inferred sesolve(H, ψ0, tlist, e_ops = (TESetup.a' * TESetup.a, TESetup.a'), progress_bar = Val(false)) # We test the type inference for Tuple of different types |
|
171 | 171 | ωq_fun(p, t) = p[2] |
172 | 172 | H = QobjEvo(a' * a, ωc_fun) + QobjEvo(σz / 2, ωq_fun) + g * (a' * σm + a * σm') |
173 | 173 |
|
174 | | - sols0 = sesolve_map(TESetup.H, ψ0_list, tlist; e_ops = e_ops) # no params, but test progress_bar |
| 174 | + sols0 = sesolve_map(TESetup.H, ψ0_list, tlist; e_ops = e_ops, progress_bar = Val(false)) # no params |
175 | 175 | sols1 = sesolve_map(H, ψ_0_e, tlist; e_ops = e_ops, params = (ωc_list, ωq_list), progress_bar = Val(false)) |
176 | 176 | sols2 = sesolve_map(H, ψ0_list, tlist; e_ops = e_ops, params = (ωc_list, ωq_list), progress_bar = Val(false)) |
177 | 177 | @test size(sols0) == (2,) |
|
195 | 195 | end |
196 | 196 |
|
197 | 197 | @testset "Type Inference sesolve_map" begin |
198 | | - @inferred sesolve_map(TESetup.H, ψ0_list, tlist; e_ops = e_ops, progress_bar = Val(false)) # no params |
| 198 | + @inferred sesolve_map(TESetup.H, ψ0_list, tlist; e_ops = e_ops, progress_bar = Val(true)) # no params, test progress bar |
199 | 199 | @inferred sesolve_map(H, ψ0_list, tlist; e_ops = e_ops, params = (ωc_list, ωq_list), progress_bar = Val(false)) |
200 | 200 | end |
201 | 201 | end |
|
289 | 289 | @inferred mesolveProblem(H, ψ0, tlist, c_ops, e_ops = e_ops, progress_bar = Val(false)) |
290 | 290 | @inferred mesolveProblem(H, ψ0, [0, 10], c_ops, e_ops = e_ops, progress_bar = Val(false)) |
291 | 291 | @inferred mesolveProblem(H, TESetup.ψ0_int, tlist, c_ops, e_ops = e_ops, progress_bar = Val(false)) |
292 | | - @inferred mesolve(H, ψ0, tlist, c_ops, e_ops = e_ops, progress_bar = Val(false)) |
| 292 | + @inferred mesolve(H, ψ0, tlist, c_ops, e_ops = e_ops, progress_bar = Val(true)) # also test progress bar |
293 | 293 | @inferred mesolve(H, ψ0, tlist, c_ops, progress_bar = Val(false)) |
294 | 294 | @inferred mesolve(H, ψ0, tlist, c_ops, e_ops = e_ops, saveat = tlist, progress_bar = Val(false)) |
295 | 295 | @inferred mesolve(H, ψ0, tlist, (a, ad_t), e_ops = (a' * a, a'), progress_bar = Val(false)) # We test the type inference for Tuple |
|
327 | 327 | ωq_fun(p, t) = p[2] |
328 | 328 | H = QobjEvo(a' * a, ωc_fun) + QobjEvo(σz / 2, ωq_fun) + g * (a' * σm + a * σm') |
329 | 329 |
|
330 | | - # Test with multiple initial states but no params (this also tests progress_bar) |
331 | | - sols0 = mesolve_map(TESetup.H, ψ0_list, tlist, c_ops; e_ops = e_ops) |
| 330 | + # Test with multiple initial states but no params |
| 331 | + sols0 = mesolve_map(TESetup.H, ψ0_list, tlist, c_ops; e_ops = e_ops, progress_bar = Val(false)) |
332 | 332 | # Test with single initial state |
333 | 333 | sols1 = mesolve_map(H, ψ_0_e, tlist, c_ops; e_ops = e_ops, params = (ωc_list, ωq_list), progress_bar = Val(false)) |
334 | 334 | # Test with multiple initial states |
|
375 | 375 | @test sols5 isa Array{<:TimeEvolutionSol} |
376 | 376 |
|
377 | 377 | @testset "Type Inference mesolve_map" begin |
378 | | - @inferred mesolve_map(TESetup.H, ψ0_list, tlist, c_ops; e_ops = e_ops, progress_bar = Val(false)) # no params |
| 378 | + @inferred mesolve_map(TESetup.H, ψ0_list, tlist, c_ops; e_ops = e_ops, progress_bar = Val(true)) # no params, but test progress bar |
379 | 379 | @inferred mesolve_map( |
380 | 380 | H, |
381 | 381 | ψ0_list, |
|
564 | 564 | rng = rng, |
565 | 565 | ) |
566 | 566 | @inferred mcsolve(H, ψ0, tlist, c_ops, ntraj = 5, e_ops = e_ops, progress_bar = Val(false), rng = rng) |
567 | | - @inferred mcsolve(H, ψ0, tlist, c_ops, ntraj = 5, progress_bar = Val(true), rng = rng) |
| 567 | + @inferred mcsolve(H, ψ0, tlist, c_ops, ntraj = 5, progress_bar = Val(true), rng = rng) # test progress bar |
568 | 568 | @inferred mcsolve(H, ψ0, [0, 10], c_ops, ntraj = 5, progress_bar = Val(false), rng = rng) |
569 | 569 | @inferred mcsolve(H, TESetup.ψ0_int, tlist, c_ops, ntraj = 5, progress_bar = Val(false), rng = rng) |
570 | 570 | @inferred mcsolve(H, ψ0, tlist, (a, a'), e_ops = (a' * a, a'), ntraj = 5, progress_bar = Val(false), rng = rng) # We test the type inference for Tuple of different types |
|
696 | 696 | rng = rng, |
697 | 697 | ) |
698 | 698 | @inferred ssesolve(H, ψ0, tlist, c_ops_tuple, ntraj = 5, e_ops = e_ops, progress_bar = Val(false), rng = rng) |
699 | | - @inferred ssesolve(H, ψ0, tlist, c_ops_tuple, ntraj = 5, progress_bar = Val(true), rng = rng) |
| 699 | + @inferred ssesolve(H, ψ0, tlist, c_ops_tuple, ntraj = 5, progress_bar = Val(true), rng = rng) # test progress bar |
700 | 700 | @inferred ssesolve(H, ψ0, [0, 10], c_ops_tuple, ntraj = 5, progress_bar = Val(false), rng = rng) |
701 | 701 | @inferred ssesolve(H, TESetup.ψ0_int, tlist, c_ops_tuple, ntraj = 5, progress_bar = Val(false), rng = rng) |
702 | 702 | @inferred ssesolve( |
|
960 | 960 | ntraj = 5, |
961 | 961 | progress_bar = Val(true), |
962 | 962 | rng = rng, |
963 | | - ) |
| 963 | + ) # test progress bar |
964 | 964 | @inferred smesolve( |
965 | 965 | H, |
966 | 966 | ψ0, |
|
0 commit comments