Skip to content
Snippets Groups Projects
Commit 9d52b2eb authored by Bentriou Mahmoud's avatar Bentriou Mahmoud
Browse files

Replaced access of fields in models with getfield. Improvement of... 

Replaced access of fields in models with getfield. Improvement of distribute_mean_lha_value: number of accepts are computed simultaneously.3
parent 41228ee9
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
core/model.jl
+ 97
− 80
View file @ 9d52b2eb
...@@ -30,43 +30,46 @@ Simulates a model. If `m::SynchronizedModel`, the simulation is synchronized wit ...@@ -30,43 +30,46 @@ Simulates a model. If `m::SynchronizedModel`, the simulation is synchronized wit
Linear Hybrid Automaton. Linear Hybrid Automaton.
""" """
function simulate(m::ContinuousTimeModel; p::Union{Nothing,AbstractVector{Float64}} = nothing) function simulate(m::ContinuousTimeModel; p::Union{Nothing,AbstractVector{Float64}} = nothing)
p_sim = m.p p_sim = getfield(m, :p)
if p != nothing if p != nothing
p_sim = p p_sim = p
end end
time_bound = getfield(m, :time_bound)
buffer_size = getfield(m, :buffer_size)
estim_min_states = getfield(m, :estim_min_states)
# First alloc # First alloc
full_values = Vector{Vector{Int}}(undef, m.dim_state) full_values = Vector{Vector{Int}}(undef, getfield(m, :dim_state))
for i = eachindex(full_values) full_values[i] = zeros(Int, m.estim_min_states) end for i = eachindex(full_values) full_values[i] = zeros(Int, estim_min_states) end
times = zeros(Float64, m.estim_min_states) times = zeros(Float64, estim_min_states)
transitions = Vector{Transition}(undef, m.estim_min_states) transitions = Vector{Transition}(undef, estim_min_states)
# Initial values # Initial values
for i = eachindex(full_values) full_values[i][1] = m.x0[i] end for i = eachindex(full_values) full_values[i][1] = getfield(m, :x0)[i] end
times[1] = m.t0 times[1] = getfield(m, :t0)
transitions[1] = nothing transitions[1] = nothing
# Values at time n # Values at time n
n = 1 n = 1
xn = copy(m.x0) xn = copy(getfield(m, :x0))
tn = m.t0 tn = getfield(m, :t0)
# at time n+1 # at time n+1
isabsorbing::Bool = m.isabsorbing(p_sim,xn) isabsorbing::Bool = getfield(m, :isabsorbing)(p_sim,xn)
# If x0 is absorbing # If x0 is absorbing
if isabsorbing if isabsorbing
_resize_trajectory!(full_values, times, transitions, 1) _resize_trajectory!(full_values, times, transitions, 1)
values = full_values[m._g_idx] values = full_values[getfield(m, :_g_idx)]
if isbounded(m) if isbounded(m)
_finish_bounded_trajectory!(values, times, transitions, m.time_bound) _finish_bounded_trajectory!(values, times, transitions, time_bound)
end end
return Trajectory(m, values, times, transitions) return Trajectory(m, values, times, transitions)
end end
# Alloc of vectors where we stock n+1 values # Alloc of vectors where we stock n+1 values
vec_x = zeros(Int, m.dim_state) vec_x = zeros(Int, getfield(m, :dim_state))
l_t = Float64[0.0] l_t = Float64[0.0]
l_tr = Transition[nothing] l_tr = Transition[nothing]
# First we fill the allocated array # First we fill the allocated array
for i = 2:m.estim_min_states for i = 2:estim_min_states
m.f!(vec_x, l_t, l_tr, xn, tn, p_sim) getfield(m, :f!)(vec_x, l_t, l_tr, xn, tn, p_sim)
tn = l_t[1] tn = l_t[1]
if tn > m.time_bound || vec_x == xn if tn > time_bound || vec_x == xn
isabsorbing = (vec_x == xn) isabsorbing = (vec_x == xn)
break break
end end
...@@ -75,25 +78,25 @@ function simulate(m::ContinuousTimeModel; p::Union{Nothing,AbstractVector{Float6 ...@@ -75,25 +78,25 @@ function simulate(m::ContinuousTimeModel; p::Union{Nothing,AbstractVector{Float6
_update_values!(full_values, times, transitions, xn, tn, l_tr[1], i) _update_values!(full_values, times, transitions, xn, tn, l_tr[1], i)
end end
# If simulation ended before the estimation of states # If simulation ended before the estimation of states
if n < m.estim_min_states if n < estim_min_states
_resize_trajectory!(full_values, times, transitions, n) _resize_trajectory!(full_values, times, transitions, n)
values = full_values[m._g_idx] values = full_values[getfield(m, :_g_idx)]
if isbounded(m) if isbounded(m)
_finish_bounded_trajectory!(values, times, transitions, m.time_bound) _finish_bounded_trajectory!(values, times, transitions, time_bound)
end end
return Trajectory(m, values, times, transitions) return Trajectory(m, values, times, transitions)
end end
# Otherwise, buffering system # Otherwise, buffering system
size_tmp = 0 size_tmp = 0
while !isabsorbing && tn <= m.time_bound while !isabsorbing && tn <= time_bound
# Alloc buffer # Alloc buffer
_resize_trajectory!(full_values, times, transitions, m.estim_min_states+size_tmp+m.buffer_size) _resize_trajectory!(full_values, times, transitions, estim_min_states+size_tmp+buffer_size)
i = 0 i = 0
while i < m.buffer_size while i < buffer_size
i += 1 i += 1
m.f!(vec_x, l_t, l_tr, xn, tn, p_sim) getfield(m, :f!)(vec_x, l_t, l_tr, xn, tn, p_sim)
tn = l_t[1] tn = l_t[1]
if tn > m.time_bound if tn > time_bound
i -= 1 i -= 1
break break
end end
...@@ -104,72 +107,75 @@ function simulate(m::ContinuousTimeModel; p::Union{Nothing,AbstractVector{Float6 ...@@ -104,72 +107,75 @@ function simulate(m::ContinuousTimeModel; p::Union{Nothing,AbstractVector{Float6
end end
copyto!(xn, vec_x) copyto!(xn, vec_x)
_update_values!(full_values, times, transitions, _update_values!(full_values, times, transitions,
xn, tn, l_tr[1], m.estim_min_states+size_tmp+i) xn, tn, l_tr[1], estim_min_states+size_tmp+i)
end end
# If simulation ended before the end of buffer # If simulation ended before the end of buffer
if i < m.buffer_size if i < buffer_size
_resize_trajectory!(full_values, times, transitions, m.estim_min_states+size_tmp+i) _resize_trajectory!(full_values, times, transitions, estim_min_states+size_tmp+i)
end end
size_tmp += i size_tmp += i
n += i n += i
end end
values = full_values[m._g_idx] values = full_values[getfield(m, :_g_idx)]
if isbounded(m) if isbounded(m)
# Add last value: the convention is the last transition is nothing, # Add last value: the convention is the last transition is nothing,
# the trajectory is bounded # the trajectory is bounded
_finish_bounded_trajectory!(values, times, transitions, m.time_bound) _finish_bounded_trajectory!(values, times, transitions, time_bound)
end end
return Trajectory(m, values, times, transitions) return Trajectory(m, values, times, transitions)
end end
function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Float64}} = nothing, function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Float64}} = nothing,
verbose::Bool = false) verbose::Bool = false)
m = product.m m = getfield(product, :m)
A = product.automaton A = getfield(product, :automaton)
p_sim = m.p p_sim = getfield(m, :p)
if p != nothing if p != nothing
p_sim = p p_sim = p
end end
time_bound = getfield(m, :time_bound)
buffer_size = getfield(m, :buffer_size)
estim_min_states = getfield(m, :estim_min_states)
# First alloc # First alloc
full_values = Vector{Vector{Int}}(undef, m.dim_state) full_values = Vector{Vector{Int}}(undef, getfield(m, :dim_state))
for i = eachindex(full_values) full_values[i] = zeros(Int, m.estim_min_states) end for i = eachindex(full_values) full_values[i] = zeros(Int, estim_min_states) end
times = zeros(Float64, m.estim_min_states) times = zeros(Float64, estim_min_states)
transitions = Vector{Transition}(undef, m.estim_min_states) transitions = Vector{Transition}(undef, estim_min_states)
# Initial values # Initial values
for i = eachindex(full_values) full_values[i][1] = m.x0[i] end for i = eachindex(full_values) full_values[i][1] = getfield(m, :x0)[i] end
times[1] = m.t0 times[1] = getfield(m, :t0)
transitions[1] = nothing transitions[1] = nothing
S0 = init_state(A, m.x0, m.t0) S0 = init_state(A, getfield(m, :x0), getfield(m, :t0))
# Values at time n # Values at time n
n = 1 n = 1
xn = copy(m.x0) xn = copy(getfield(m, :x0))
tn = m.t0 tn = getfield(m, :t0)
Sn = copy(S0) Sn = copy(S0)
isabsorbing::Bool = m.isabsorbing(p_sim,xn) isabsorbing::Bool = getfield(m, :isabsorbing)(p_sim,xn)
isacceptedLHA::Bool = isaccepted(Sn) isacceptedLHA::Bool = isaccepted(Sn)
# Alloc of vectors where we stock n+1 values # Alloc of vectors where we stock n+1 values
vec_x = zeros(Int, m.dim_state) vec_x = zeros(Int, getfield(m, :dim_state))
l_t = Float64[0.0] l_t = Float64[0.0]
l_tr = Transition[nothing] l_tr = Transition[nothing]
Snplus1 = copy(Sn) Snplus1 = copy(Sn)
# If x0 is absorbing # If x0 is absorbing
if isabsorbing || isacceptedLHA if isabsorbing || isacceptedLHA
_resize_trajectory!(full_values, times, transitions, 1) _resize_trajectory!(full_values, times, transitions, 1)
values = full_values[m._g_idx] values = full_values[getfield(m, :_g_idx)]
if isbounded(m) if isbounded(m)
_finish_bounded_trajectory!(values, times, transitions, m.time_bound) _finish_bounded_trajectory!(values, times, transitions, time_bound)
end end
if isabsorbing && !isacceptedLHA if isabsorbing && !isacceptedLHA
next_state!(Snplus1, A, xn, m.time_bound, nothing, Sn; verbose = verbose) next_state!(Snplus1, A, xn, time_bound, nothing, Sn; verbose = verbose)
copyto!(Sn, Snplus1) copyto!(Sn, Snplus1)
end end
return SynchronizedTrajectory(Sn, product, values, times, transitions) return SynchronizedTrajectory(Sn, product, values, times, transitions)
end end
# First we fill the allocated array # First we fill the allocated array
for i = 2:m.estim_min_states for i = 2:estim_min_states
m.f!(vec_x, l_t, l_tr, xn, tn, p_sim) getfield(m, :f!)(vec_x, l_t, l_tr, xn, tn, p_sim)
tn = l_t[1] tn = l_t[1]
if tn > m.time_bound || vec_x == xn if tn > time_bound || vec_x == xn
isabsorbing = (vec_x == xn) isabsorbing = (vec_x == xn)
break break
end end
...@@ -185,29 +191,29 @@ function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Fl ...@@ -185,29 +191,29 @@ function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Fl
end end
end end
# If simulation ended before the estimation of states # If simulation ended before the estimation of states
if n < m.estim_min_states if n < estim_min_states
_resize_trajectory!(full_values, times, transitions, n) _resize_trajectory!(full_values, times, transitions, n)
values = full_values[m._g_idx] values = full_values[getfield(m, :_g_idx)]
if isbounded(m) if isbounded(m)
_finish_bounded_trajectory!(values, times, transitions, m.time_bound) _finish_bounded_trajectory!(values, times, transitions, time_bound)
end end
if isabsorbing && !isacceptedLHA if isabsorbing && !isacceptedLHA
next_state!(Snplus1, A, xn, m.time_bound, nothing, Sn; verbose = verbose) next_state!(Snplus1, A, xn, time_bound, nothing, Sn; verbose = verbose)
copyto!(Sn, Snplus1) copyto!(Sn, Snplus1)
end end
return SynchronizedTrajectory(Sn, product, values, times, transitions) return SynchronizedTrajectory(Sn, product, values, times, transitions)
end end
# Otherwise, buffering system # Otherwise, buffering system
size_tmp = 0 size_tmp = 0
while !isabsorbing && tn <= m.time_bound && !isacceptedLHA while !isabsorbing && tn <= time_bound && !isacceptedLHA
# Alloc buffer # Alloc buffer
_resize_trajectory!(full_values, times, transitions, m.estim_min_states+size_tmp+m.buffer_size) _resize_trajectory!(full_values, times, transitions, estim_min_states+size_tmp+buffer_size)
i = 0 i = 0
while i < m.buffer_size while i < buffer_size
i += 1 i += 1
m.f!(vec_x, l_t, l_tr, xn, tn, p_sim) getfield(m, :f!)(vec_x, l_t, l_tr, xn, tn, p_sim)
tn = l_t[1] tn = l_t[1]
if tn > m.time_bound if tn > time_bound
i -= 1 i -= 1
break break
end end
...@@ -220,7 +226,7 @@ function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Fl ...@@ -220,7 +226,7 @@ function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Fl
tr_n = l_tr[1] tr_n = l_tr[1]
next_state!(Snplus1, A, xn, tn, tr_n, Sn; verbose = verbose) next_state!(Snplus1, A, xn, tn, tr_n, Sn; verbose = verbose)
_update_values!(full_values, times, transitions, _update_values!(full_values, times, transitions,
xn, tn, tr_n, m.estim_min_states+size_tmp+i) xn, tn, tr_n, estim_min_states+size_tmp+i)
copyto!(Sn, Snplus1) copyto!(Sn, Snplus1)
isacceptedLHA = isaccepted(Snplus1) isacceptedLHA = isaccepted(Snplus1)
if isabsorbing || isacceptedLHA if isabsorbing || isacceptedLHA
...@@ -228,20 +234,20 @@ function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Fl ...@@ -228,20 +234,20 @@ function simulate(product::SynchronizedModel; p::Union{Nothing,AbstractVector{Fl
end end
end end
# If simulation ended before the end of buffer # If simulation ended before the end of buffer
if i < m.buffer_size if i < buffer_size
_resize_trajectory!(full_values, times, transitions, m.estim_min_states+size_tmp+i) _resize_trajectory!(full_values, times, transitions, estim_min_states+size_tmp+i)
end end
size_tmp += i size_tmp += i
n += i n += i
end end
values = full_values[m._g_idx] values = full_values[getfield(m, :_g_idx)]
if isbounded(m) && !isaccepted(Sn) if isbounded(m) && !isaccepted(Sn)
# Add last value: the convention is the last transition is nothing, # Add last value: the convention is the last transition is nothing,
# the trajectory is bounded # the trajectory is bounded
_finish_bounded_trajectory!(values, times, transitions, m.time_bound) _finish_bounded_trajectory!(values, times, transitions, time_bound)
end end
if isabsorbing && !isacceptedLHA if isabsorbing && !isacceptedLHA
next_state!(Snplus1, A, xn, m.time_bound, nothing, Sn; verbose = verbose) next_state!(Snplus1, A, xn, time_bound, nothing, Sn; verbose = verbose)
copyto!(Sn, Snplus1) copyto!(Sn, Snplus1)
end end
return SynchronizedTrajectory(Sn, product, values, times, transitions) return SynchronizedTrajectory(Sn, product, values, times, transitions)
...@@ -257,35 +263,36 @@ function volatile_simulate(product::SynchronizedModel; ...@@ -257,35 +263,36 @@ function volatile_simulate(product::SynchronizedModel;
p::Union{Nothing,AbstractVector{Float64}} = nothing, verbose::Bool = false) p::Union{Nothing,AbstractVector{Float64}} = nothing, verbose::Bool = false)
m = product.m m = product.m
A = product.automaton A = product.automaton
p_sim = m.p p_sim = getfield(m, :p)
if p != nothing if p != nothing
p_sim = p p_sim = p
end end
S0 = init_state(A, m.x0, m.t0) time_bound = getfield(m, :time_bound)
S0 = init_state(A, getfield(m, :x0), getfield(m, :t0))
# Values at time n # Values at time n
n = 1 n = 1
xn = copy(m.x0) xn = copy(getfield(m, :x0))
tn = m.t0 tn = getfield(m, :t0)
Sn = copy(S0) Sn = copy(S0)
isabsorbing::Bool = m.isabsorbing(p_sim,xn) isabsorbing::Bool = getfield(m, :isabsorbing)(p_sim,xn)
isacceptedLHA::Bool = isaccepted(Sn) isacceptedLHA::Bool = isaccepted(Sn)
# Alloc of vectors where we stock n+1 values # Alloc of vectors where we stock n+1 values
vec_x = zeros(Int, m.dim_state) vec_x = zeros(Int, getfield(m, :dim_state))
l_t = Float64[0.0] l_t = Float64[0.0]
l_tr = Transition[nothing] l_tr = Transition[nothing]
Snplus1 = copy(Sn) Snplus1 = copy(Sn)
# If x0 is absorbing # If x0 is absorbing
if isabsorbing || isacceptedLHA if isabsorbing || isacceptedLHA
if !isacceptedLHA if !isacceptedLHA
next_state!(Snplus1, A, xn, m.time_bound, nothing, Sn; verbose = verbose) next_state!(Snplus1, A, xn, time_bound, nothing, Sn; verbose = verbose)
copyto!(Sn, Snplus1) copyto!(Sn, Snplus1)
end end
return Sn return Sn
end end
while !isabsorbing && tn <= m.time_bound && !isacceptedLHA while !isabsorbing && tn <= time_bound && !isacceptedLHA
m.f!(vec_x, l_t, l_tr, xn, tn, p_sim) getfield(m, :f!)(vec_x, l_t, l_tr, xn, tn, p_sim)
tn = l_t[1] tn = l_t[1]
if tn > m.time_bound if tn > time_bound
i -= 1 i -= 1
break break
end end
...@@ -301,7 +308,7 @@ function volatile_simulate(product::SynchronizedModel; ...@@ -301,7 +308,7 @@ function volatile_simulate(product::SynchronizedModel;
n += 1 n += 1
end end
if isabsorbing && !isacceptedLHA if isabsorbing && !isacceptedLHA
next_state!(Snplus1, A, xn, m.time_bound, nothing, Sn; verbose = verbose) next_state!(Snplus1, A, xn, time_bound, nothing, Sn; verbose = verbose)
copyto!(Sn, Snplus1) copyto!(Sn, Snplus1)
end end
return Sn return Sn
...@@ -341,16 +348,26 @@ end ...@@ -341,16 +348,26 @@ end
Distribute over workers the computation of the mean value Distribute over workers the computation of the mean value
of a LHA over `nbr_sim` simulations of the model. of a LHA over `nbr_sim` simulations of the model.
""" """
function distribute_mean_value_lha(sm::SynchronizedModel, sym_var::VariableAutomaton, nbr_sim::Int) function distribute_mean_value_lha(sm::SynchronizedModel, sym_var::VariableAutomaton, nbr_sim::Int; with_accepts::Bool = false)
sum_val = @distributed (+) for i = 1:nbr_sim sum_val = @distributed (+) for i = 1:nbr_sim
volatile_simulate(sm)[sym_var] S = volatile_simulate(sm)
if !with_accepts
S[sym_var]
else
[S[sym_var], isaccepted(S)]
end
end end
return sum_val / nbr_sim return sum_val / nbr_sim
end end
function distribute_mean_value_lha(sm::SynchronizedModel, sym_var::Vector{VariableAutomaton}, nbr_sim::Int) function distribute_mean_value_lha(sm::SynchronizedModel, sym_var::Vector{VariableAutomaton}, nbr_sim::Int; with_accepts::Bool = false)
sum_val = @distributed (+) for i = 1:nbr_sim sum_val = @distributed (+) for i = 1:nbr_sim
volatile_simulate(sm)[sym_var] S = volatile_simulate(sm)
if !with_accepts
S[sym_var]
else
vcat(S[sym_var], isaccepted(S))
end
end end
return sum_val / nbr_sim return sum_val / nbr_sim
end end
......
tests/cosmos/distance_F/ER_1D.jl
+ 1
− 2
View file @ 9d52b2eb
...@@ -52,8 +52,7 @@ for exp in l_exp ...@@ -52,8 +52,7 @@ for exp in l_exp
# MarkovProcesses estimation # MarkovProcesses estimation
set_param!(ER, :k3, convert(Float64, k3)) set_param!(ER, :k3, convert(Float64, k3))
sync_ER = ER*A_F sync_ER = ER*A_F
l_dist_pkg[i] = distribute_mean_value_lha(sync_ER, :d, nb_sim) l_dist_pkg[i], nb_accepts_pkg = distribute_mean_value_lha(sync_ER, :d, nb_sim; with_accepts = true)
nb_accepts_pkg = distribute_prob_accept_lha(sync_ER, nb_sim)
#@info "About accepts" nb_sim nb_accepted nb_accepts_pkg #@info "About accepts" nb_sim nb_accepted nb_accepts_pkg
test = isapprox(l_dist_cosmos[i], l_dist_pkg[i]; atol = width*1.01) || test = isapprox(l_dist_cosmos[i], l_dist_pkg[i]; atol = width*1.01) ||
(l_dist_cosmos[i] == 9997999 && l_dist_pkg[i] == Inf) (l_dist_cosmos[i] == 9997999 && l_dist_pkg[i] == Inf)
......
tests/cosmos/distance_G/ER_R5.jl
+ 1
− 2
View file @ 9d52b2eb
...@@ -47,8 +47,7 @@ for i = 1:nb_k1 ...@@ -47,8 +47,7 @@ for i = 1:nb_k1
set_param!(ER, :k1, convert(Float64, k1)) set_param!(ER, :k1, convert(Float64, k1))
set_param!(ER, :k2, convert(Float64, k2)) set_param!(ER, :k2, convert(Float64, k2))
sync_ER = ER*A_G sync_ER = ER*A_G
mat_dist_pkg[i,j] = distribute_mean_value_lha(sync_ER, :d, nb_sim) mat_dist_pkg[i,j], nb_accepts_pkg = distribute_mean_value_lha(sync_ER, :d, nb_sim; with_accepts = true)
nb_accepts_pkg = distribute_prob_accept_lha(sync_ER, nb_sim)
#@info "About accepts" nb_sim nb_accepted nb_accepts_pkg #@info "About accepts" nb_sim nb_accepted nb_accepts_pkg
test = isapprox(mat_dist_cosmos[i,j], mat_dist_pkg[i,j]; atol = width*1.01) test = isapprox(mat_dist_cosmos[i,j], mat_dist_pkg[i,j]; atol = width*1.01)
test2 = nb_accepts_pkg == (nb_sim / nb_accepted) test2 = nb_accepts_pkg == (nb_sim / nb_accepted)
......
tests/cosmos/distance_G_F/ER_R6.jl
+ 1
− 2
View file @ 9d52b2eb
...@@ -51,8 +51,7 @@ for i = 1:nb_k1 ...@@ -51,8 +51,7 @@ for i = 1:nb_k1
set_param!(ER, :k1, convert(Float64, k1)) set_param!(ER, :k1, convert(Float64, k1))
set_param!(ER, :k2, convert(Float64, k2)) set_param!(ER, :k2, convert(Float64, k2))
sync_ER = ER*A_G_F sync_ER = ER*A_G_F
mat_dist_pkg[i,j], mat_dist_prime_pkg[i,j] = distribute_mean_value_lha(sync_ER, [:d,:dprime], nb_sim) mat_dist_pkg[i,j], mat_dist_prime_pkg[i,j], nb_accepts_pkg = distribute_mean_value_lha(sync_ER, [:d,:dprime], nb_sim; with_accepts = true)
nb_accepts_pkg = distribute_prob_accept_lha(sync_ER, nb_sim)
#@info "Computed distances" mat_dist_pkg[i,j] mat_dist_prime_pkg[i,j] mat_dist_cosmos[i,j] mat_dist_prime_cosmos[i,j] #@info "Computed distances" mat_dist_pkg[i,j] mat_dist_prime_pkg[i,j] mat_dist_cosmos[i,j] mat_dist_prime_cosmos[i,j]
#@info "About accepts" nb_sim nb_accepted nb_accepts_pkg #@info "About accepts" nb_sim nb_accepted nb_accepts_pkg
test = (isapprox(mat_dist_cosmos[i,j], mat_dist_pkg[i,j]; atol = width*1.01)) || test = (isapprox(mat_dist_cosmos[i,j], mat_dist_pkg[i,j]; atol = width*1.01)) ||
......
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment