Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Bump ModelingToolkit v9 Catalyst v14 #131

Merged
merged 3 commits into from
Jul 20, 2024
Merged

Bump ModelingToolkit v9 Catalyst v14 #131

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
a87a75b
Bump ModelingToolkit v9 Catalyst v14
ChrisRackauckas Jul 19, 2024
e167502
update to v9 language
ChrisRackauckas Jul 20, 2024
736af11
Update lib/JumpProblemLibrary/Project.toml
ChrisRackauckas Jul 20, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions lib/JumpProblemLibrary/src/JumpProblemLibrary.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -141,7 +141,7 @@ end
rsi = rates_sym_to_idx
rates = params[[rsi[:kon], rsi[:kAon], rsi[:koff], rsi[:kAoff], rsi[:kAp], rsi[:kAdp]]]
u0 = zeros(Int, 9)
statesyms = ModelingToolkit.tosymbol.(ModelingToolkit.operation.(states(rs)))
statesyms = ModelingToolkit.tosymbol.(ModelingToolkit.operation.(unknowns(rs)))
u0[findfirst(isequal(:S1), statesyms)] = params[1]
u0[findfirst(isequal(:S2), statesyms)] = params[2]
u0[findfirst(isequal(:S3), statesyms)] = params[3]
Expand Down Expand Up @@ -202,10 +202,10 @@ function construct_genenetwork(N)
genenetwork
end
rs = construct_genenetwork(N)
u0 = zeros(Int, length(states(rs)))
statesyms = ModelingToolkit.tosymbol.(ModelingToolkit.operation.(states(rs)))
u0 = zeros(Int, length(unknowns(rs)))
statesyms = ModelingToolkit.tosymbol.(ModelingToolkit.operation.(unknowns(rs)))
for i in 1:(2 * N)
u0[findfirst(isequal(G[i]), states(rs))] = 1
u0[findfirst(isequal(G[i]), unknowns(rs))] = 1
end
tf = 2000.0
prob = DiscreteProblem(rs, u0, (0.0, tf), eval_module = @__MODULE__)
Expand Down
2 changes: 1 addition & 1 deletion lib/NonlinearProblemLibrary/Project.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ SciMLBase = "0bca4576-84f4-4d90-8ffe-ffa030f20462"
[compat]
Aqua = "0.8"
LinearAlgebra = "1.6"
SciMLBase = "1, 2"
SciMLBase = "2"
julia = "1.10"

[extras]
Expand Down
2 changes: 1 addition & 1 deletion lib/ODEProblemLibrary/Project.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ RuntimeGeneratedFunctions = "7e49a35a-f44a-4d26-94aa-eba1b4ca6b47"
[compat]
Aqua = "0.5"
DiffEqBase = "6"
Latexify = "0.15, 0.16"
Latexify = "0.16"
ModelingToolkit = "9"
RuntimeGeneratedFunctions = "0.5"
julia = "1.10"
Expand Down
2 changes: 1 addition & 1 deletion lib/SDEProblemLibrary/Project.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ SciMLBase = "0bca4576-84f4-4d90-8ffe-ffa030f20462"

[compat]
Aqua = "0.5"
Catalyst = "13"
Catalyst = "14"
DiffEqBase = "6"
RuntimeGeneratedFunctions = "0.5"
SciMLBase = "2.0.1"
Expand Down
Loading