|
| 1 | +""" |
| 2 | +For a given model, collect all referenced models |
| 3 | +""" |
| 4 | +collect_model_dependencies(model) = unique!(_collect_model_dependencies(String[], model)) |
| 5 | +_collect_model_dependencies(deps, other) = deps |
| 6 | +function _collect_model_dependencies(deps, model::Union{OrderedDict,Vector}) |
| 7 | + for val in values(model) |
| 8 | + if val isa String |
| 9 | + m = match(r"^Models.(.*)$", val) |
| 10 | + if !isnothing(m) |
| 11 | + push!(deps, m[1]) |
| 12 | + end |
| 13 | + else |
| 14 | + _collect_model_dependencies(deps, val) |
| 15 | + end |
| 16 | + end |
| 17 | + deps |
| 18 | +end |
| 19 | + |
| 20 | +""" |
| 21 | + recursiv_resolve!(models, container) |
| 22 | +
|
| 23 | +Go through container, and replace every occurence of "Models.<modelname>" with |
| 24 | +deepcopy of actual model dict. |
| 25 | +""" |
| 26 | +recursive_resolve!(models, _) = nothing |
| 27 | +function recursive_resolve!(models, container::Union{OrderedDict,Vector}) |
| 28 | + for (key, value) in pairs(container) |
| 29 | + if value isa String |
| 30 | + m = match(r"^Models.(.*)$", value) |
| 31 | + if !isnothing(m) |
| 32 | + container[key] = deepcopy(models[m[1]]) |
| 33 | + end |
| 34 | + else |
| 35 | + recursive_resolve!(models, value) |
| 36 | + end |
| 37 | + end |
| 38 | + nothing |
| 39 | +end |
| 40 | + |
| 41 | +""" |
| 42 | + update_parent_property!(parent, key, value) |
| 43 | +
|
| 44 | +Update the property in the parent structure. |
| 45 | +- if key is nested (i.e. "a.b.c"), it will update parent["a"]["b"]["c"] |
| 46 | +- if key is indexed (i.e. "a[1]"), it will update parent["a"][1] |
| 47 | +""" |
| 48 | +function update_parent_property!(parent, key, value) |
| 49 | + @info "Update $key -> $value" |
| 50 | + if contains(key, ".") |
| 51 | + key_head, key_tail = split(key, ".", limit=2) |
| 52 | + @info "Found nested key $key_head -> $key_tail" |
| 53 | + m = match(r"^(.*)\[(.*)\]$", key_head) |
| 54 | + _parent = if !isnothing(m) |
| 55 | + parent[m[1]][parse(Int, m[2])] |
| 56 | + else |
| 57 | + parent[key] |
| 58 | + end |
| 59 | + @info m |
| 60 | + update_parent_property!(_parent, key_tail, value) |
| 61 | + else |
| 62 | + m = match(r"^(.*)\[(.*)\]$", key) |
| 63 | + if !isnothing(m) |
| 64 | + if !(value isa eltype(parent[m[1]])) |
| 65 | + # need to widen type |
| 66 | + parent[m[1]] = collect(Any, parent[m[1]]) |
| 67 | + end |
| 68 | + parent[m[1]][parse(Int, m[2])] = value |
| 69 | + else |
| 70 | + parent[key] = value |
| 71 | + end |
| 72 | + end |
| 73 | +end |
| 74 | +""" |
| 75 | + merge_properties!(parent, child) |
| 76 | +
|
| 77 | +Takes a child dict, and applies every key-value pair to the parent dict. |
| 78 | +keys will be resolved using update_parent_property! |
| 79 | +""" |
| 80 | +function merge_properties!(parent, child) |
| 81 | + for (key, value) in pairs(child) |
| 82 | + update_parent_property!(parent, key, value) |
| 83 | + end |
| 84 | + parent |
| 85 | +end |
| 86 | + |
| 87 | +""" |
| 88 | + depth_first_flatten!(container) |
| 89 | +
|
| 90 | +This goes through the container, and if it finds a dict with key "MODEL", it will |
| 91 | +merge the properties of the referenced parent model with the current dict. |
| 92 | +""" |
| 93 | +depth_first_flatten!(_) = nothing |
| 94 | +function depth_first_flatten!(container::Union{OrderedDict,Vector}) |
| 95 | + for (key, sub) in pairs(container) |
| 96 | + depth_first_flatten!(sub) |
| 97 | + if sub isa Union{OrderedDict} && haskey(sub, "MODEL") |
| 98 | + parent_model = sub["MODEL"] |
| 99 | + delete!(sub, "MODEL") |
| 100 | + container[key] = merge_properties!(parent_model, sub) |
| 101 | + end |
| 102 | + end |
| 103 | + nothing |
| 104 | +end |
| 105 | + |
| 106 | +function parse_network(file) |
| 107 | + data = YAML.load_file(file, dicttype=OrderedDict{Any,Any}) |
| 108 | + dependencies = OrderedDict(keys(data["Models"]) .=> map(collect_model_dependencies, values(data["Models"]))) |
| 109 | + |
| 110 | + # dependencies muss by subset of models |
| 111 | + @assert reduce(vcat, values(dependencies)) ⊆ keys(data["Models"]) |
| 112 | + resolved_models = findall(deps -> isempty(deps), dependencies) |
| 113 | + delete!.(Ref(dependencies), resolved_models) # delete resolve dependnecies |
| 114 | + |
| 115 | + # resolve all models, i.e. replace parent/template models with full dict |
| 116 | + while true |
| 117 | + isempty(dependencies) && break |
| 118 | + resolved_something = false |
| 119 | + for (mod, deps) in dependencies |
| 120 | + if deps ⊆ resolved_models |
| 121 | + @info "Resolving $mod -> $deps" |
| 122 | + recursive_resolve!(data["Models"], data["Models"][mod]) |
| 123 | + delete!(dependencies, mod) |
| 124 | + push!(resolved_models, mod) |
| 125 | + resolved_something = true |
| 126 | + else |
| 127 | + @info "Skip $mod -> $deps" |
| 128 | + end |
| 129 | + end |
| 130 | + resolved_something && continue |
| 131 | + error("Could not resolve all dependencies") |
| 132 | + end |
| 133 | + |
| 134 | + # with all deps resolve, we can replace the models edge and vertex list |
| 135 | + recursive_resolve!(data["Models"], data["Vertices"]) |
| 136 | + recursive_resolve!(data["Models"], data["Edges"]) |
| 137 | + |
| 138 | + # traverses the tree and flattens the model properties, i.e. merges |
| 139 | + # the local given properties with the parent/template model properties |
| 140 | + depth_first_flatten!(data) |
| 141 | + return data |
| 142 | +end |
| 143 | + |
| 144 | +recursive_construct(constructors, data) = _depth_first_construct!(constructors, deepcopy(data)) |
| 145 | +_depth_first_construct!(_, data) = data |
| 146 | +_depth_first_construct!(_, s::String) = startswith(s, ":") ? Symbol(s[2:end]) : s |
| 147 | +function _depth_first_construct!(constructors, data::Vector) |
| 148 | + if data isa Vector && eltype(data) !== Any |
| 149 | + data = convert(Vector{Any}, data) |
| 150 | + end |
| 151 | + for (key, value) in pairs(data) |
| 152 | + data[key] = _depth_first_construct!(constructors, value) |
| 153 | + end |
| 154 | + data |
| 155 | +end |
| 156 | +function _depth_first_construct!(constructors, data::OrderedDict) |
| 157 | + if data isa OrderedDict && eltype(values(data)) !== Any |
| 158 | + data = convert(OrderedDict{eltype(keys(data)), Any}, data) |
| 159 | + end |
| 160 | + |
| 161 | + for (key, value) in pairs(data) |
| 162 | + data[key] = _depth_first_construct!(constructors, value) |
| 163 | + end |
| 164 | + if haskey(data, "CONSTRUCTOR") |
| 165 | + if !haskey(constructors, data["CONSTRUCTOR"]) |
| 166 | + error("No constructor found for $(data["CONSTRUCTOR"])") |
| 167 | + end |
| 168 | + args = get(data, "ARGS", []) |
| 169 | + kwargs = Dict{Symbol, Any}() |
| 170 | + for (key, value) in data |
| 171 | + key ∈ ("CONSTRUCTOR", "ARGS") && continue |
| 172 | + kwargs[Symbol(key)] = value |
| 173 | + end |
| 174 | + return constructors[data["CONSTRUCTOR"]](args...; kwargs...) |
| 175 | + end |
| 176 | + data |
| 177 | +end |
| 178 | + |
| 179 | +function build_network(data, constructors) |
| 180 | + vertexm = VertexModel[] |
| 181 | + for (k, v) in data["Vertices"] |
| 182 | + vm = recursive_construct(constructors, v) |
| 183 | + set_graphelement!(vm, k) |
| 184 | + push!(vertexm, vm) |
| 185 | + end |
| 186 | + edgem = EdgeModel[] |
| 187 | + for (k, v) in data["Vertices"] |
| 188 | + vm = recursive_construct(constructors, v) |
| 189 | + |
| 190 | + m = match(r"^(.*)=>(.*)$", k) |
| 191 | + isnothing(m) && error("Edge key must be of form 'src=>dst', got $k") |
| 192 | + src = tryparse(Int, m[1]) |
| 193 | + dst = tryparse(Int, m[2]) |
| 194 | + isnothing(src) && src = m[1] |
| 195 | + isnothing(dst) && src = m[1] |
| 196 | + set_graphelement!(vm, src, dst) |
| 197 | + push!(vertexm, vm) |
| 198 | + end |
| 199 | +end |
0 commit comments