@@ -202,7 +202,7 @@ tspan = (0.0, 250.0)
202
202
dprob = DiscreteProblem(js, u₀map, tspan, parammap)
203
203
```
204
204
"""
205
- function DiffEqBase. DiscreteProblem (sys:: JumpSystem , u0map, tspan:: Tuple ,
205
+ function DiffEqBase. DiscreteProblem (sys:: JumpSystem , u0map, tspan:: Union{ Tuple,Nothing} ,
206
206
parammap= DiffEqBase. NullParameters (); kwargs... )
207
207
u0 = varmap_to_vars (u0map, states (sys); defaults= default_u0 (sys))
208
208
p = varmap_to_vars (parammap, parameters (sys); defaults= default_p (sys))
@@ -230,7 +230,7 @@ tspan = (0.0, 250.0)
230
230
dprob = DiscreteProblem(js, u₀map, tspan, parammap)
231
231
```
232
232
"""
233
- function DiscreteProblemExpr (sys:: JumpSystem , u0map, tspan:: Tuple ,
233
+ function DiscreteProblemExpr (sys:: JumpSystem , u0map, tspan:: Union{ Tuple,Nothing} ,
234
234
parammap= DiffEqBase. NullParameters (); kwargs... )
235
235
u0 = varmap_to_vars (u0map, states (sys); defaults= default_u0 (sys))
236
236
p = varmap_to_vars (parammap, parameters (sys); defaults= default_p (sys))
@@ -241,7 +241,7 @@ function DiscreteProblemExpr(sys::JumpSystem, u0map, tspan::Tuple,
241
241
p = $ p
242
242
tspan = $ tspan
243
243
df = DiscreteFunction {true,true} (f, syms= $ (Symbol .(states (sys))))
244
- DiscreteProblem (df, u0, tspan, p; kwargs ... )
244
+ DiscreteProblem (df, u0, tspan, p)
245
245
end
246
246
end
247
247
@@ -262,7 +262,7 @@ function DiffEqJump.JumpProblem(js::JumpSystem, prob, aggregator; kwargs...)
262
262
263
263
statetoid = Dict (value (state) => i for (i,state) in enumerate (states (js)))
264
264
eqs = equations (js)
265
- invttype = typeof (1 / prob. tspan[2 ])
265
+ invttype = prob . tspan[ 1 ] === nothing ? Float64 : typeof (1 / prob. tspan[2 ])
266
266
267
267
# handling parameter substition and empty param vecs
268
268
p = (prob. p == DiffEqBase. NullParameters ()) ? Num[] : prob. p
0 commit comments