File size: 2,894 Bytes
0a3edb6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 | """Prototype: annotate every lane of a human design with the items it carries,
by propagating demand (what consumers downstream want) backward and supply
(what producers upstream make) forward over the engine's lane graph."""
from collections import defaultdict
import numpy as np
import factorion_rs
from factorion import Channel, items
RECIPES = factorion_rs.py_recipes()
SMELT = {next(iter(r["consumes"])): p for p, r in RECIPES.items() if r["produced_by"] and any("furnace" in m for m in r["produced_by"])}
UNSMELT = defaultdict(set)
for ing, prod in SMELT.items():
UNSMELT[prod].add(ing)
LANE = set("bduY")
MACHINE_A, FURNACE = "a", set("fFx")
def parse(label):
kind, rest = label.split("@")
xy, _, lane = rest.partition(":")
x, y = map(int, xy.split(","))
return kind, x, y, lane or None
def annotate(world):
"""(nodes, demand, supply, succ, pred) for a (C, W, H) world."""
labels, edges = factorion_rs.py_build_graph(np.ascontiguousarray(world.transpose(1, 2, 0)))
nodes = [parse(l) for l in labels]
succ, pred = defaultdict(list), defaultdict(list)
for a, b in edges:
succ[a].append(b)
pred[b].append(a)
recipe = {}
for i, (k, x, y, _) in enumerate(nodes):
if k == MACHINE_A:
it = int(world[Channel.ITEMS.value, x, y])
r = RECIPES.get(items[it].name) if it else None
recipe[i] = r
demand = [set() for _ in nodes]
supply = [set() for _ in nodes]
changed = True
while changed:
changed = False
for i, (k, *_ ) in enumerate(nodes):
if k == MACHINE_A:
want = set(recipe[i]["consumes"]) if recipe.get(i) else set()
elif k in FURNACE:
downstream = set().union(*(demand[j] for j in succ[i]))
want = set().union(*(UNSMELT[p] for p in downstream)) if downstream else set()
elif k in ("S", "K"):
want = set()
else:
want = set().union(*(demand[j] for j in succ[i]))
if not want <= demand[i]:
demand[i] |= want
changed = True
changed = True
while changed:
changed = False
for i, (k, *_ ) in enumerate(nodes):
if k == MACHINE_A:
have = set(recipe[i]["produces"]) if recipe.get(i) else set()
elif k in FURNACE:
arrived = set().union(*(supply[j] for j in pred[i]))
have = {SMELT[x] for x in arrived if x in SMELT}
elif k in LANE and not pred[i]:
have = set(demand[i]) # an entry: assume the world outside feeds what's wanted
else:
have = set().union(*(supply[j] for j in pred[i]))
if not have <= supply[i]:
supply[i] |= have
changed = True
return nodes, demand, supply, succ, pred
|