feat(kæde): ét flow pr. bygning, slutprodukter sælges straks (Sælg/Behold), tomme kædeflows foldes sammen; såmaskine ikke gødningsspreder (v1.61.4.0)

2026-09-30 17:44:06 +02:00
parent d2970a1bda
commit 74537f7ec2
13 changed files with 297 additions and 40 deletions
@@ -65,3 +65,80 @@ function ADChainActions.flowsToStop(runs, activeRootKeys)
    end
    return list
 end
+
+-- ---- ét kædeflow pr. bygning (in-game 30/9: ét flow pr. vare og bygning gav mange stoppede flows) ----
+
+-- Manglende kanter samlet pr. modtagerbygning: {consumer, consumerName, rootKey, fillTypes} i fundet rækkefølge.
+function ADChainActions.groupMissing(missing)
+    local groups, byConsumer = {}, {}
+    for _, edge in ipairs(missing or {}) do
+        local group = byConsumer[edge.consumer]
+        if group == nil then
+            group = {consumer = edge.consumer, consumerName = edge.consumerName, rootKey = edge.rootKey, fillTypes = {}}
+            byConsumer[edge.consumer] = group
+            table.insert(groups, group)
+        end
+        if not contains(group.fillTypes, edge.fillType) then table.insert(group.fillTypes, edge.fillType) end
+    end
+    return groups
+end
+
+local function isChainRun(run)
+    return run.chain ~= nil and run.chain ~= "" and run.kind == "supply" and run.ingredientMode == "manual"
+end
+
+-- Kædens eget flow (manuelle varer) til bygningen -> run-id, så nye varer lægges i det i stedet for et nyt flow.
+function ADChainActions.chainRunFor(runs, consumer)
+    for _, run in ipairs(runs or {}) do
+        if isChainRun(run) and contains(run.targetBuildingIds, consumer) then return run.id end
+    end
+    return nil
+end
+
+-- Flere tomme kædeflows (uden traktorer) til samme bygning: det første beholdes med alle varerne, resten slettes.
+-- -> {{keepId, add = {varer}, deleteIds = {id}}}
+function ADChainActions.mergeIdle(runs)
+    local byConsumer, order = {}, {}
+    for _, run in ipairs(runs or {}) do
+        local target = (run.targetBuildingIds or {})[1]
+        if isChainRun(run) and target ~= nil and #(run.targetBuildingIds or {}) == 1 and #(run.vehicleIds or {}) == 0 then
+            if byConsumer[target] == nil then byConsumer[target] = {}; table.insert(order, target) end
+            table.insert(byConsumer[target], run)
+        end
+    end
+    local merges = {}
+    for _, target in ipairs(order) do
+        local list = byConsumer[target]
+        if #list > 1 then
+            local keep, add, deleteIds = list[1], {}, {}
+            for index = 2, #list do
+                for _, name in ipairs(list[index].ingredients or {}) do
+                    if not contains(keep.ingredients, name) and not contains(add, name) then table.insert(add, name) end
+                end
+                table.insert(deleteIds, list[index].id)
+            end
+            table.insert(merges, {keepId = keep.id, add = add, deleteIds = deleteIds})
+        end
+    end
+    return merges
+end
+
+-- Slutprodukter der skal sælges straks: aktive rødders udgange, som ikke selv er en kant i kæden (mellemvare).
+-- keep = {[rodnøgle] = true} for rødder spilleren har sat til "Behold". -> {{key, fillType}}
+function ADChainActions.finalSales(chain, recipes, edges, keep)
+    local intermediate, byKey, list = {}, {}, {}
+    for _, edge in ipairs(edges or {}) do intermediate[edge.fillType] = true end
+    for _, recipe in ipairs(recipes or {}) do byKey[recipe.key] = recipe end
+    for _, root in ipairs((chain or {}).roots or {}) do
+        local recipe = byKey[root.key]
+        if recipe ~= nil and not (keep or {})[root.key] then
+            local names = {}
+            for name in pairs(recipe.outputs or {}) do table.insert(names, name) end
+            table.sort(names)
+            for _, name in ipairs(names) do
+                if not intermediate[name] then table.insert(list, {key = root.key, fillType = name}) end
+            end
+        end
+    end
+    return list
+end