Skip to content

Commit

Permalink
Gain 1 minute (cut unnecessary repeats)
Browse files Browse the repository at this point in the history
  • Loading branch information
TorkelE committed Sep 19, 2023
1 parent e17e425 commit 5fdbf75
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions test/model_simulation/simulate_jumps.jl
Original file line number Diff line number Diff line change
Expand Up @@ -93,8 +93,8 @@ let
jumps_3 = (jump_3_1, jump_3_2, jump_3_3, jump_3_4, jump_3_5, jump_3_6)
push!(identical_networks, reaction_networks_constraint[5] => jumps_3)

for (i, networks) in enumerate(identical_networks)
for factor in [1e-2, 1e-1, 1e0, 1e1], repeat in 1:3
for networks in identical_networks
for factor in [1e-2, 1e-1, 1e0, 1e1]
(i == 3) && (factor > 1e-1) && continue # Large numbers seems to crash it.
u0 = rand(rng, 1:Int64(factor * 100), length(get_states(networks[1])))
p = factor * rand(rng, length(get_ps(networks[1])))
Expand All @@ -119,7 +119,7 @@ end

let
for (i, network) in enumerate(reaction_networks_all)
for factor in [1e-1, 1e0, 1e1]
for factor in [1e0]
u0 = rand(rng, 1:Int64(factor * 100), length(get_states(network)))
p = factor * rand(rng, length(get_ps(network)))
prob = JumpProblem(network, DiscreteProblem(network, u0, (0.0, 1.0), p),
Expand All @@ -134,7 +134,7 @@ end
# No parameter test.
let
no_param_network = @reaction_network begin (1.2, 5), X1 X2 end
for factor in [1e1, 1e2]
for factor in [1e1]
u0 = rand(rng, 1:Int64(factor * 100), length(get_states(no_param_network)))
prob = JumpProblem(no_param_network,
DiscreteProblem(no_param_network, u0, (0.0, 1000.0)), Direct())
Expand Down

0 comments on commit 5fdbf75

Please sign in to comment.