@poe2-toolkit/tree-core 0.1.0

package/dist/ggg/normalize.js

@@ -0,0 +1,279 @@
+/**
+ * Normalise GGG's official skill-tree export (`data.json`) into the engine's
+ * {@link TreeData}.
+ *
+ * This is the only place that knows GGG's field names and quirks. Everything
+ * downstream works against the clean {@link TreeData} contract. The transform is
+ * deliberately tolerant: optional fields come and go across patches and missing
+ * data should never throw.
+ *
+ * The GGG quirks handled here:
+ *  - node positions are **baked** (`node.x`/`node.y`); the export ships none of
+ *    the orbit-radius constants needed to recompute them, so they are read as-is;
+ *  - edges are split across `in` + `out` id lists, merged into one set here;
+ *  - arc geometry lives in a separate top-level `edges` table, not on the node;
+ *  - attribute choices live in a global `skillOverrides` table, not per node;
+ *  - ascendancy ids are internal (`Ranger1`) and mapped to display names here;
+ *  - centre/ring dimensions are absent — filled from stable atlas frame sizes.
+ */
+// --- centre/ring sizes (GGG atlas frame dimensions, stable across classes) --
+/** Class portrait atlas frame (`background-<class>` Class0..3), 1500². */
+const PORTRAIT_SIZE = 1500;
+/** Ornate + rotating ring atlas frames (`group-background`), 2000². */
+const RING_SIZE = 2000;
+/** Ascendancy disc portrait, 1500². */
+const ASCENDANCY_DISC_SIZE = 1500;
+/** Central opening radius — the game's `PSSCentreInnerRadius` constant. */
+const CENTRE_INNER_RADIUS = 130;
+/**
+ * @param raw     parsed GGG `data.json`
+ * @param version tree/patch version (e.g. "0_5") — GGG does not store it inside
+ *                the file, so it is supplied here
+ */
+export function normalizeGggTree(raw, version) {
+    const ascendancyNames = mapAscendancyNames(raw.classes);
+    const attributeOptions = mapAttributeOptions(raw.skillOverrides);
+    const classNames = raw.classes.map((cls) => cls.name);
+    const edgeArcs = mapEdgeArcs(raw.edges);
+    const nodes = normalizeNodes(raw, ascendancyNames, attributeOptions, classNames, edgeArcs);
+    const ascendancyStarts = mapAscendancyStarts(raw.nodes);
+    const startNodeByClass = mapClassStartNodes(raw.nodes);
+    return {
+        version,
+        constants: { centreInnerRadius: CENTRE_INNER_RADIUS },
+        groups: normalizeGroups(raw.groups),
+        nodes,
+        classes: raw.classes.map((cls, index) => normalizeClass(cls, index, startNodeByClass, ascendancyStarts)),
+        jewelSlots: (raw.jewelSlots ?? []).map(Number),
+        bounds: { minX: raw.min_x, minY: raw.min_y, maxX: raw.max_x, maxY: raw.max_y },
+    };
+}
+/** GGG `groups` is keyed by group id (1-based numeric strings) with no holes. */
+function normalizeGroups(raw) {
+    const groups = {};
+    for (const [key, group] of Object.entries(raw)) {
+        groups[Number(key)] = {
+            x: group.x,
+            y: group.y,
+            orbits: group.orbits ?? [],
+            nodes: (group.nodes ?? []).map(Number),
+        };
+    }
+    return groups;
+}
+/** Undirected key for an edge between two skill ids. */
+function edgeKey(a, b) {
+    return a < b ? `${a}|${b}` : `${b}|${a}`;
+}
+/**
+ * GGG's top-level `edges` table marks arcs and gives each arc's world centre
+ * directly (`orbitX`/`orbitY`). Map it by undirected edge key; only entries with
+ * a centre are kept (arcs without one fall back to the geometric rule).
+ */
+function mapEdgeArcs(edges) {
+    const arcs = new Map();
+    for (const edge of edges ?? []) {
+        if (edge.orbitX !== undefined && edge.orbitY !== undefined) {
+            arcs.set(edgeKey(Number(edge.from), Number(edge.to)), { x: edge.orbitX, y: edge.orbitY });
+        }
+    }
+    return arcs;
+}
+function normalizeNodes(raw, ascendancyNames, attributeOptions, classNames, edgeArcs) {
+    const nodes = {};
+    for (const [key, node] of Object.entries(raw.nodes)) {
+        const skill = node.skill ?? Number(key);
+        nodes[skill] = normalizeNode(skill, node, ascendancyNames, attributeOptions, classNames, edgeArcs);
+    }
+    return nodes;
+}
+function normalizeNode(skill, raw, ascendancyNames, attributeOptions, classNames, edgeArcs) {
+    const name = raw.name ?? '';
+    // GGG ships edges split across `in` and `out`; merge + dedupe into one set.
+    const neighbours = new Set([
+        ...(raw.in ?? []).map(Number),
+        ...(raw.out ?? []).map(Number),
+    ]);
+    const ascendancyName = raw.ascendancyId
+        ? ascendancyNames.get(raw.ascendancyId) ?? raw.ascendancyId
+        : undefined;
+    return {
+        skill,
+        group: raw.group ?? -1,
+        orbit: raw.orbit ?? 0,
+        orbitIndex: raw.orbitIndex ?? 0,
+        x: raw.x ?? 0,
+        y: raw.y ?? 0,
+        connections: [...neighbours].map((id) => {
+            const arcCentre = edgeArcs.get(edgeKey(skill, id));
+            return arcCentre ? { id, arcCentre } : { id };
+        }),
+        name,
+        icon: raw.icon ?? '',
+        stats: cleanStats(raw.stats),
+        // Kind flags and metadata are added only when present, so absence stays
+        // absent (exactOptionalPropertyTypes-friendly).
+        ...(raw.isNotable ? { isNotable: true } : {}),
+        ...(raw.isKeystone ? { isKeystone: true } : {}),
+        ...(raw.isJewelSocket ? { isJewelSocket: true } : {}),
+        // GGG has no `noRadius`; the hidden Sinister sockets are identified by name.
+        ...(raw.isJewelSocket && name.includes('SinisterJewelSocket') ? { noRadius: true } : {}),
+        ...(raw.isMastery ? { isMastery: true } : {}),
+        ...(raw.isAscendancyStart ? { isAscendancyStart: true } : {}),
+        ...(raw.isGenericAttribute ? { isAttribute: true } : {}),
+        ...(raw.activeEffectImage !== undefined ? { activeEffectImage: raw.activeEffectImage } : {}),
+        ...(ascendancyName !== undefined ? { ascendancyName } : {}),
+        ...(raw.flavourText !== undefined ? { flavourText: joinFlavour(raw.flavourText) } : {}),
+        ...(raw.recipe !== undefined ? { recipe: raw.recipe } : {}),
+        // Generic +attribute nodes share the three global Str/Dex/Int choices.
+        ...(raw.isGenericAttribute && attributeOptions.length > 0 ? { options: attributeOptions } : {}),
+        ...(raw.unlockConstraint ? { conditional: true } : {}),
+        ...(raw.unlockConstraint?.ascendancy !== undefined ? { unlockAscendancy: raw.unlockConstraint.ascendancy } : {}),
+        ...(raw.classStartIndex && raw.classStartIndex.length > 0
+            ? { classesStart: raw.classStartIndex.map((i) => classNames[i] ?? String(i)) }
+            : {}),
+    };
+}
+/** GGG ships keystone flavour text as an array of lines; join into one string. */
+function joinFlavour(flavour) {
+    return Array.isArray(flavour) ? flavour.join('\n') : flavour;
+}
+/**
+ * GGG stat lines carry inline reference tags: `[ref|display]` renders as
+ * `display`, `[ref]` as `ref` (e.g. `[Critical|Critical Hit Chance]` ->
+ * "Critical Hit Chance", `[Curse|Curses]` -> "Curses", `[Shock]` -> "Shock").
+ * The `display` side is the player-facing text, including the correct plural —
+ * strip the tags down to it.
+ */
+function cleanStatText(line) {
+    return line.replace(/\[(?:[^|\]]*\|)?([^\]]+)\]/g, '$1');
+}
+/** Apply {@link cleanStatText} across a list of stat lines. */
+function cleanStats(stats) {
+    return (stats ?? []).map(cleanStatText);
+}
+/**
+ * Map GGG's internal ascendancy ids ("Ranger1") to display names ("Deadeye").
+ * The display name is what a build's chosen ascendancy is keyed by, so node and
+ * allocation agree. Unreleased ascendancies carry no name and are skipped.
+ */
+function mapAscendancyNames(classes) {
+    const names = new Map();
+    for (const cls of classes) {
+        for (const asc of cls.ascendancies ?? []) {
+            if (asc.name) {
+                names.set(asc.id, asc.name);
+            }
+        }
+    }
+    return names;
+}
+/** Preferred display order of attribute choices (GGG keys them by numeric id). */
+const ATTRIBUTE_ORDER = ['Strength', 'Dexterity', 'Intelligence'];
+/**
+ * The three shared attribute choices (Str / Dex / Int), read from GGG's global
+ * `skillOverrides` table. That table also holds unrelated overrides (Pathfinder
+ * alternates, per-class node swaps), so it is filtered to the `generic_attribute`
+ * entries. Every generic-attribute node reuses these, ordered Str/Dex/Int.
+ */
+function mapAttributeOptions(overrides) {
+    if (!overrides) {
+        return [];
+    }
+    return Object.entries(overrides)
+        .filter(([, override]) => override.id?.startsWith('generic_attribute'))
+        .map(([key, override]) => ({
+        id: override.skill ?? Number(key),
+        name: override.name ?? '',
+        stats: cleanStats(override.stats),
+        icon: override.icon ?? '',
+    }))
+        .sort((a, b) => orderIndex(a.name) - orderIndex(b.name));
+}
+function orderIndex(name) {
+    const index = ATTRIBUTE_ORDER.indexOf(name);
+    return index === -1 ? ATTRIBUTE_ORDER.length : index;
+}
+/**
+ * The world position of each ascendancy's start node (the diamond), keyed by
+ * GGG ascendancy id. GGG bakes every ascendancy at a far-flung cluster; the
+ * start node is the anchor the renderer relocates onto the hub. Ascendancies
+ * with no nodes (e.g. unreleased "Abyssal Lich") are simply absent.
+ */
+function mapAscendancyStarts(nodes) {
+    const starts = new Map();
+    for (const node of Object.values(nodes)) {
+        if (node.isAscendancyStart && node.ascendancyId && node.x !== undefined && node.y !== undefined) {
+            starts.set(node.ascendancyId, { x: node.x, y: node.y });
+        }
+    }
+    return starts;
+}
+/**
+ * Build a class-index -> start-node-skill-id map. A class-start node lists the
+ * class indices that start there in `classStartIndex` (often two); the same node
+ * can serve several classes.
+ */
+function mapClassStartNodes(nodes) {
+    const byClass = new Map();
+    for (const [key, node] of Object.entries(nodes)) {
+        const skill = node.skill ?? Number(key);
+        for (const classIndex of node.classStartIndex ?? []) {
+            if (!byClass.has(classIndex)) {
+                byClass.set(classIndex, skill);
+            }
+        }
+    }
+    return byClass;
+}
+function normalizeClass(raw, index, startNodeByClass, ascendancyStarts) {
+    return {
+        name: raw.name,
+        id: index,
+        baseStr: raw.base_str,
+        baseDex: raw.base_dex,
+        baseInt: raw.base_int,
+        startNode: startNodeByClass.get(index) ?? -1,
+        centre: {
+            image: `Classes${raw.name}`,
+            x: 0,
+            y: 0,
+            art: { width: PORTRAIT_SIZE, height: PORTRAIT_SIZE },
+            active: { width: RING_SIZE, height: RING_SIZE },
+            frame: { width: RING_SIZE, height: RING_SIZE },
+        },
+        // Keep only released ascendancies — ones with a name AND a start node (i.e.
+        // actual nodes; e.g. "Abyssal Lich" is named but has none yet, so dropped).
+        ascendancies: (raw.ascendancies ?? [])
+            .filter((asc) => Boolean(asc.name) && ascendancyStarts.has(asc.id))
+            .map((asc) => normalizeAscendancy(asc, ascendancyStarts)),
+        ...(raw.overridePairs ? { overridePairs: normalizeOverrides(raw.overridePairs) } : {}),
+    };
+}
+/** Normalise the override map's string keys to numeric skill ids. */
+function normalizeOverrides(raw) {
+    const out = {};
+    for (const [base, target] of Object.entries(raw)) {
+        out[Number(base)] = target;
+    }
+    return out;
+}
+function normalizeAscendancy(raw, ascendancyStarts) {
+    const start = ascendancyStarts.get(raw.id) ?? { x: 0, y: 0 };
+    // The renderer relocates each disc node by `centre − worldAnchor`. GGG's
+    // `offsetX/offsetY` is where the start diamond must land in the hub — on the
+    // class's quatrefoil axis, 1332u out (verified against the original PoB
+    // layout, exact to ~10u). So worldAnchor = startNode + offset places the
+    // diamond on the quatrefoil axis and the rest of the cluster around it.
+    const offsetX = raw.offsetX ?? 0;
+    const offsetY = raw.offsetY ?? 0;
+    return {
+        id: raw.name,
+        name: raw.name,
+        internalId: raw.id,
+        image: `Classes${raw.name.replace(/\s+/g, '')}`,
+        worldAnchor: { x: start.x + offsetX, y: start.y + offsetY },
+        size: { width: ASCENDANCY_DISC_SIZE, height: ASCENDANCY_DISC_SIZE },
+    };
+}
+//# sourceMappingURL=normalize.js.map

package/dist/ggg/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sourceRoot":"","sources":["../../src/ggg/normalize.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAoGH,+EAA+E;AAE/E,0EAA0E;AAC1E,MAAM,aAAa,GAAG,IAAI,CAAC;AAC3B,uEAAuE;AACvE,MAAM,SAAS,GAAG,IAAI,CAAC;AACvB,uCAAuC;AACvC,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAClC,2EAA2E;AAC3E,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAgB,EAAE,OAAe;IAChE,MAAM,eAAe,GAAG,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IACjE,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,EAAE,eAAe,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC3F,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACxD,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAEvD,OAAO;QACL,OAAO;QACP,SAAS,EAAE,EAAE,iBAAiB,EAAE,mBAAmB,EAAE;QACrD,MAAM,EAAE,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;QACnC,KAAK;QACL,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CACtC,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,CAAC,CAC/D;QACD,UAAU,EAAE,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QAC9C,MAAM,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE;KAC/E,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,SAAS,eAAe,CAAC,GAA6B;IACpD,MAAM,MAAM,GAA0B,EAAE,CAAC;IAEzC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG;YACpB,CAAC,EAAE,KAAK,CAAC,CAAC;YACV,CAAC,EAAE,KAAK,CAAC,CAAC;YACV,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,EAAE;YAC1B,KAAK,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;SACvC,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,wDAAwD;AACxD,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,KAA4B;IAC/C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;IAEtC,KAAK,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC3D,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5F,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,cAAc,CACrB,GAAgB,EAChB,eAAoC,EACpC,gBAA8B,EAC9B,UAAoB,EACpB,QAA4B;IAE5B,MAAM,KAAK,GAA6B,EAAE,CAAC;IAE3C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;QACxC,KAAK,CAAC,KAAK,CAAC,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;IACrG,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,aAAa,CACpB,KAAa,EACb,GAAY,EACZ,eAAoC,EACpC,gBAA8B,EAC9B,UAAoB,EACpB,QAA4B;IAE5B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;IAC5B,4EAA4E;IAC5E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS;QACjC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;KAC/B,CAAC,CAAC;IACH,MAAM,cAAc,GAAG,GAAG,CAAC,YAAY;QACrC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC,YAAY;QAC3D,CAAC,CAAC,SAAS,CAAC;IAEd,OAAO;QACL,KAAK;QACL,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC;QACtB,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC;QACrB,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,CAAC;QAC/B,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC;QACb,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC;QACb,WAAW,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;YACtC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;YAEnD,OAAO,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;QAChD,CAAC,CAAC;QACF,IAAI;QACJ,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE;QACpB,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC;QAC5B,wEAAwE;QACxE,gDAAgD;QAChD,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrD,6EAA6E;QAC7E,GAAG,CAAC,GAAG,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxF,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,GAAG,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,GAAG,CAAC,GAAG,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,GAAG,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5F,GAAG,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,GAAG,CAAC,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvF,GAAG,CAAC,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3D,uEAAuE;QACvE,GAAG,CAAC,GAAG,CAAC,kBAAkB,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/F,GAAG,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACtD,GAAG,CAAC,GAAG,CAAC,gBAAgB,EAAE,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,GAAG,CAAC,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChH,GAAG,CAAC,GAAG,CAAC,eAAe,IAAI,GAAG,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC;YACvD,CAAC,CAAC,EAAE,YAAY,EAAE,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC9E,CAAC,CAAC,EAAE,CAAC;KACR,CAAC;AACJ,CAAC;AAED,kFAAkF;AAClF,SAAS,WAAW,CAAC,OAA0B;IAC7C,OAAO,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;AAC/D,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,OAAO,CAAC,6BAA6B,EAAE,IAAI,CAAC,CAAC;AAC3D,CAAC;AAED,+DAA+D;AAC/D,SAAS,UAAU,CAAC,KAA2B;IAC7C,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,OAAmB;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;gBACb,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kFAAkF;AAClF,MAAM,eAAe,GAAG,CAAC,UAAU,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;AAElE;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,SAAuD;IAClF,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,UAAU,CAAC,mBAAmB,CAAC,CAAC;SACtE,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;QACzB,EAAE,EAAE,QAAQ,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,CAAC;QACjC,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,EAAE;QACzB,KAAK,EAAE,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC;QACjC,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,EAAE;KAC1B,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC9B,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;AACvD,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAAC,KAA8B;IACzD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAChG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,KAA8B;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE1C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;QAExC,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,eAAe,IAAI,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,cAAc,CACrB,GAAa,EACb,KAAa,EACb,gBAAqC,EACrC,gBAAoC;IAEpC,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,EAAE,EAAE,KAAK;QACT,OAAO,EAAE,GAAG,CAAC,QAAQ;QACrB,OAAO,EAAE,GAAG,CAAC,QAAQ;QACrB,OAAO,EAAE,GAAG,CAAC,QAAQ;QACrB,SAAS,EAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,EAAE;YACN,KAAK,EAAE,UAAU,GAAG,CAAC,IAAI,EAAE;YAC3B,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;YACJ,GAAG,EAAE,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,EAAE;YACpD,MAAM,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE;YAC/C,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE;SAC/C;QACD,4EAA4E;QAC5E,4EAA4E;QAC5E,YAAY,EAAE,CAAC,GAAG,CAAC,YAAY,IAAI,EAAE,CAAC;aACnC,MAAM,CAAC,CAAC,GAAG,EAA2C,EAAE,CACvD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAClD;aACA,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;QAC3D,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,kBAAkB,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACvF,CAAC;AACJ,CAAC;AAED,qEAAqE;AACrE,SAAS,kBAAkB,CAAC,GAAoC;IAC9D,MAAM,GAAG,GAA2B,EAAE,CAAC;IAEvC,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACjD,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;IAC7B,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,mBAAmB,CAC1B,GAAqC,EACrC,gBAAoC;IAEpC,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAC7D,yEAAyE;IACzE,6EAA6E;IAC7E,wEAAwE;IACxE,yEAAyE;IACzE,wEAAwE;IACxE,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC;IAEjC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,IAAI;QACZ,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,UAAU,EAAE,GAAG,CAAC,EAAE;QAClB,KAAK,EAAE,UAAU,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC/C,WAAW,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,OAAO,EAAE;QAC3D,IAAI,EAAE,EAAE,KAAK,EAAE,oBAAoB,EAAE,MAAM,EAAE,oBAAoB,EAAE;KACpE,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,25 @@
+/**
+ * `@poe2-toolkit/tree-core` — headless geometry engine for the Path of Exile 2 passive
+ * tree. Pure TypeScript, zero runtime dependencies, no DOM, no canvas.
+ *
+ * This entry point is **source-agnostic**: it works against the {@link TreeData}
+ * contract and knows nothing about where the data came from. The pipeline is
+ * `TreeData` → `buildScene` → `project` / `nodeAt`, plus the helpers a UI needs
+ * (interactive allocation, hit-testing, view framing).
+ *
+ * Producing `TreeData` is a separate, swappable adapter. The one for GGG's
+ * official export lives in the `@poe2-toolkit/tree-core/ggg` subpath, so the engine
+ * itself carries no dependency on any particular source shape.
+ */
+export type { TreeData, TreeConstants, Group, TreeNode, NodeOption, AttributeChoice, JewelInfo, NodeConnection, Size, ClassDef, CentreArt, AscendancyDef, SpriteFrame, SpriteManifest, Point, WorldRect, Scene, PlacedNode, NodeKind, PlacedConnection, PlacedEffect, CentreLayout, ClassAnchor, BuildAllocation, SceneOptions, Viewport, ScreenScene, ScreenNode, ScreenConnection, ScreenEffect, } from './types.js';
+export { nodePosition } from './geometry/orbit.js';
+export { computeCentreLayout } from './geometry/centre.js';
+export { project, projectPoint, screenToWorld, nodeAt } from './geometry/project.js';
+export { allocatedBounds, allocatedBoundsWithCentre, classBounds } from './geometry/framing.js';
+export { buildScene, chosenAttributeOption, classOverrideNode } from './scene/buildScene.js';
+export { ascendancyStartNode, buildAscendancyGraph, buildTreeGraph, pathToNode, reachable, removalSet, toggleAllocation, toggleAscendancyAllocation, } from './scene/allocate.js';
+export type { TreeGraph } from './scene/allocate.js';
+export { placeConnection } from './scene/connections.js';
+export { classifyNode, nodeTargetSize } from './scene/nodeSize.js';
+export type { NodeSize } from './scene/nodeSize.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,YAAY,EACV,QAAQ,EACR,aAAa,EACb,KAAK,EACL,QAAQ,EACR,UAAU,EACV,eAAe,EACf,SAAS,EACT,cAAc,EACd,IAAI,EACJ,QAAQ,EACR,SAAS,EACT,aAAa,EACb,WAAW,EACX,cAAc,EACd,KAAK,EACL,SAAS,EACT,KAAK,EACL,UAAU,EACV,QAAQ,EACR,gBAAgB,EAChB,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,eAAe,EACf,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,UAAU,EACV,gBAAgB,EAChB,YAAY,GACb,MAAM,YAAY,CAAC;AAEpB,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAErF,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEhG,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC7F,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,cAAc,EACd,UAAU,EACV,SAAS,EACT,UAAU,EACV,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACnE,YAAY,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/index.js

@@ -0,0 +1,24 @@
+/**
+ * `@poe2-toolkit/tree-core` — headless geometry engine for the Path of Exile 2 passive
+ * tree. Pure TypeScript, zero runtime dependencies, no DOM, no canvas.
+ *
+ * This entry point is **source-agnostic**: it works against the {@link TreeData}
+ * contract and knows nothing about where the data came from. The pipeline is
+ * `TreeData` → `buildScene` → `project` / `nodeAt`, plus the helpers a UI needs
+ * (interactive allocation, hit-testing, view framing).
+ *
+ * Producing `TreeData` is a separate, swappable adapter. The one for GGG's
+ * official export lives in the `@poe2-toolkit/tree-core/ggg` subpath, so the engine
+ * itself carries no dependency on any particular source shape.
+ */
+export { nodePosition } from './geometry/orbit.js';
+export { computeCentreLayout } from './geometry/centre.js';
+export { project, projectPoint, screenToWorld, nodeAt } from './geometry/project.js';
+export { allocatedBounds, allocatedBoundsWithCentre, classBounds } from './geometry/framing.js';
+export { buildScene, chosenAttributeOption, classOverrideNode } from './scene/buildScene.js';
+export { ascendancyStartNode, buildAscendancyGraph, buildTreeGraph, pathToNode, reachable, removalSet, toggleAllocation, toggleAscendancyAllocation, } from './scene/allocate.js';
+export { placeConnection } from './scene/connections.js';
+export { classifyNode, nodeTargetSize } from './scene/nodeSize.js';
+// Data-source adapters live in their own subpaths (e.g. `@poe2-toolkit/tree-core/ggg`)
+// so this entry point stays source-agnostic — see ./ggg/normalize.ts.
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAmCH,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,mBAAmB,EAAE,MAAM,sBAAsB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAErF,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEhG,OAAO,EAAE,UAAU,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC7F,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,cAAc,EACd,UAAU,EACV,SAAS,EACT,UAAU,EACV,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAGnE,uFAAuF;AACvF,sEAAsE"}

package/dist/scene/allocate.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Interactive allocation over the passive tree graph: click a node to allocate
+ * the shortest path to it from the class start (and the current allocation), or
+ * click an allocated node to remove it and anything it orphaned.
+ *
+ * Pure graph logic — no rendering. The page owns the allocation state and feeds
+ * clicks through {@link toggleAllocation}.
+ */
+import type { TreeData } from '../types.js';
+/** Adjacency list of the walkable tree: node id -> connected node ids. */
+export type TreeGraph = Map<number, Set<number>>;
+/**
+ * Build the undirected adjacency graph of walkable nodes. Class-start edges are
+ * kept (unlike in the drawn scene) so paths can root at the start node.
+ */
+export declare function buildTreeGraph(data: TreeData): TreeGraph;
+/**
+ * The start node of an ascendancy panel (its pathing root), or undefined when
+ * the ascendancy has none in the data.
+ */
+export declare function ascendancyStartNode(data: TreeData, ascendancy: string): number | undefined;
+/**
+ * Adjacency graph of a single ascendancy's nodes (its start node included as the
+ * root). Ascendancy points are separate from the main tree, so the editor paths
+ * within this self-contained subgraph — never across the main-tree boundary.
+ */
+export declare function buildAscendancyGraph(data: TreeData, ascendancy: string): TreeGraph;
+/**
+ * Shortest path (BFS) from any of `sources` to `target`, as the list of nodes
+ * to add — excluding the sources, including the target. `[]` when the target is
+ * already a source; `null` when unreachable.
+ */
+export declare function pathToNode(graph: TreeGraph, sources: ReadonlySet<number>, target: number): number[] | null;
+/**
+ * The nodes a click on an allocated `target` removes: everything beyond it (the
+ * nodes that lose their connection to the start once it's cut), keeping the
+ * target itself — clicking shortens the path *back* to the clicked node. When
+ * nothing lies beyond (the target is a tip), the target itself is removed.
+ */
+export declare function removalSet(graph: TreeGraph, startNode: number, allocated: ReadonlySet<number>, target: number): Set<number>;
+/** The subset of `allowed` still reachable from `roots` through the graph. */
+export declare function reachable(graph: TreeGraph, roots: Iterable<number>, allowed: ReadonlySet<number>): Set<number>;
+/**
+ * Toggle a node in a manual build:
+ *  - allocated target -> remove it and prune any node it orphaned from the start
+ *  - unallocated target -> allocate the shortest path to it
+ *
+ * Returns the new allocated node ids (start node excluded — it's implicit).
+ * Pass a prebuilt `graph` to avoid recomputing it per click.
+ */
+export declare function toggleAllocation(data: TreeData, startNode: number, allocated: ReadonlySet<number>, target: number, graph?: TreeGraph): number[];
+/**
+ * Toggle an ascendancy node, pathing only within that ascendancy's own subgraph
+ * (rooted at its start node). The main-tree allocation is carried through
+ * untouched, so this is the ascendancy counterpart to {@link toggleAllocation}
+ * — clicks allocate the path from the ascendancy start, or remove beyond.
+ *
+ * Returns the new full allocated set (main tree + this ascendancy's nodes).
+ */
+export declare function toggleAscendancyAllocation(data: TreeData, ascendancy: string, allocated: ReadonlySet<number>, target: number, graph?: TreeGraph): number[];
+//# sourceMappingURL=allocate.d.ts.map

package/dist/scene/allocate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"allocate.d.ts","sourceRoot":"","sources":["../../src/scene/allocate.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAY,MAAM,aAAa,CAAC;AAEtD,0EAA0E;AAC1E,MAAM,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;AA+BjD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAmCxD;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAQ1F;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,SAAS,CAmClF;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAqC1G;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,SAAS,EAChB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,EAC9B,MAAM,EAAE,MAAM,GACb,GAAG,CAAC,MAAM,CAAC,CAkBb;AAED,8EAA8E;AAC9E,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAyB9G;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,QAAQ,EACd,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,EAC9B,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,SAAgC,GACtC,MAAM,EAAE,CAoBV;AAED;;;;;;;GAOG;AACH,wBAAgB,0BAA0B,CACxC,IAAI,EAAE,QAAQ,EACd,UAAU,EAAE,MAAM,EAClB,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,EAC9B,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,SAAkD,GACxD,MAAM,EAAE,CAsBV"}

package/dist/scene/allocate.js

@@ -0,0 +1,239 @@
+/**
+ * Interactive allocation over the passive tree graph: click a node to allocate
+ * the shortest path to it from the class start (and the current allocation), or
+ * click an allocated node to remove it and anything it orphaned.
+ *
+ * Pure graph logic — no rendering. The page owns the allocation state and feeds
+ * clicks through {@link toggleAllocation}.
+ */
+/**
+ * Walkable for pathing: real main-tree nodes plus the class-start roots.
+ * Masteries (not pathed through), ascendancy nodes (separate panel), hidden
+ * sockets and conditional/unlock nodes are excluded.
+ *
+ * The GGG tree's synthetic centre node (keyed `root`, so it has no numeric skill
+ * id and parses to NaN) wires every class start together through the hub. Left
+ * walkable, a path could shortcut across the centre and surface at whichever rim
+ * gateway is fewest hops from the target — even another class's — so it looks
+ * like it starts at "the nearest point of the circle". Pathing must root at the
+ * class start (or the nearest allocated node) and stay in the tree, never cross
+ * the hub, so the centre node is excluded.
+ */
+function isWalkable(node) {
+    if (Number.isNaN(node.skill)) {
+        return false;
+    }
+    if (node.ascendancyName || node.isMastery || node.conditional) {
+        return false;
+    }
+    if (node.noRadius && node.isJewelSocket) {
+        return false;
+    }
+    return true;
+}
+/**
+ * Build the undirected adjacency graph of walkable nodes. Class-start edges are
+ * kept (unlike in the drawn scene) so paths can root at the start node.
+ */
+export function buildTreeGraph(data) {
+    const graph = new Map();
+    const link = (from, to) => {
+        let set = graph.get(from);
+        if (!set) {
+            set = new Set();
+            graph.set(from, set);
+        }
+        set.add(to);
+    };
+    for (const node of Object.values(data.nodes)) {
+        if (!isWalkable(node)) {
+            continue;
+        }
+        if (!graph.has(node.skill)) {
+            graph.set(node.skill, new Set());
+        }
+        for (const conn of node.connections) {
+            const target = data.nodes[conn.id];
+            if (!target || !isWalkable(target)) {
+                continue;
+            }
+            link(node.skill, conn.id);
+            link(conn.id, node.skill);
+        }
+    }
+    return graph;
+}
+/**
+ * The start node of an ascendancy panel (its pathing root), or undefined when
+ * the ascendancy has none in the data.
+ */
+export function ascendancyStartNode(data, ascendancy) {
+    for (const node of Object.values(data.nodes)) {
+        if (node.isAscendancyStart && node.ascendancyName === ascendancy) {
+            return node.skill;
+        }
+    }
+    return undefined;
+}
+/**
+ * Adjacency graph of a single ascendancy's nodes (its start node included as the
+ * root). Ascendancy points are separate from the main tree, so the editor paths
+ * within this self-contained subgraph — never across the main-tree boundary.
+ */
+export function buildAscendancyGraph(data, ascendancy) {
+    const graph = new Map();
+    const link = (from, to) => {
+        let set = graph.get(from);
+        if (!set) {
+            set = new Set();
+            graph.set(from, set);
+        }
+        set.add(to);
+    };
+    for (const node of Object.values(data.nodes)) {
+        if (node.ascendancyName !== ascendancy) {
+            continue;
+        }
+        if (!graph.has(node.skill)) {
+            graph.set(node.skill, new Set());
+        }
+        for (const conn of node.connections) {
+            const target = data.nodes[conn.id];
+            if (!target || target.ascendancyName !== ascendancy) {
+                continue;
+            }
+            link(node.skill, conn.id);
+            link(conn.id, node.skill);
+        }
+    }
+    return graph;
+}
+/**
+ * Shortest path (BFS) from any of `sources` to `target`, as the list of nodes
+ * to add — excluding the sources, including the target. `[]` when the target is
+ * already a source; `null` when unreachable.
+ */
+export function pathToNode(graph, sources, target) {
+    if (sources.has(target)) {
+        return [];
+    }
+    const prev = new Map();
+    const seen = new Set(sources);
+    const queue = [...sources];
+    for (let head = 0; head < queue.length; head++) {
+        const current = queue[head];
+        for (const next of graph.get(current) ?? []) {
+            if (seen.has(next)) {
+                continue;
+            }
+            seen.add(next);
+            prev.set(next, current);
+            if (next === target) {
+                const path = [];
+                let step = target;
+                while (step !== undefined && !sources.has(step)) {
+                    path.push(step);
+                    step = prev.get(step);
+                }
+                return path.reverse();
+            }
+            queue.push(next);
+        }
+    }
+    return null;
+}
+/**
+ * The nodes a click on an allocated `target` removes: everything beyond it (the
+ * nodes that lose their connection to the start once it's cut), keeping the
+ * target itself — clicking shortens the path *back* to the clicked node. When
+ * nothing lies beyond (the target is a tip), the target itself is removed.
+ */
+export function removalSet(graph, startNode, allocated, target) {
+    if (!allocated.has(target)) {
+        return new Set();
+    }
+    const remaining = new Set(allocated);
+    remaining.delete(target);
+    const keep = reachable(graph, [startNode], remaining);
+    const beyond = new Set();
+    for (const id of allocated) {
+        if (id !== target && !keep.has(id)) {
+            beyond.add(id);
+        }
+    }
+    return beyond.size > 0 ? beyond : new Set([target]);
+}
+/** The subset of `allowed` still reachable from `roots` through the graph. */
+export function reachable(graph, roots, allowed) {
+    const kept = new Set();
+    const seen = new Set();
+    const queue = [];
+    for (const root of roots) {
+        seen.add(root);
+        queue.push(root);
+    }
+    for (let head = 0; head < queue.length; head++) {
+        const current = queue[head];
+        for (const next of graph.get(current) ?? []) {
+            if (seen.has(next) || !allowed.has(next)) {
+                continue;
+            }
+            seen.add(next);
+            kept.add(next);
+            queue.push(next);
+        }
+    }
+    return kept;
+}
+/**
+ * Toggle a node in a manual build:
+ *  - allocated target -> remove it and prune any node it orphaned from the start
+ *  - unallocated target -> allocate the shortest path to it
+ *
+ * Returns the new allocated node ids (start node excluded — it's implicit).
+ * Pass a prebuilt `graph` to avoid recomputing it per click.
+ */
+export function toggleAllocation(data, startNode, allocated, target, graph = buildTreeGraph(data)) {
+    if (target === startNode) {
+        return [...allocated];
+    }
+    if (allocated.has(target)) {
+        const removed = removalSet(graph, startNode, allocated, target);
+        return [...allocated].filter((id) => !removed.has(id));
+    }
+    const sources = new Set(allocated);
+    sources.add(startNode);
+    const path = pathToNode(graph, sources, target);
+    if (!path) {
+        return [...allocated];
+    }
+    return [...new Set([...allocated, ...path])];
+}
+/**
+ * Toggle an ascendancy node, pathing only within that ascendancy's own subgraph
+ * (rooted at its start node). The main-tree allocation is carried through
+ * untouched, so this is the ascendancy counterpart to {@link toggleAllocation}
+ * — clicks allocate the path from the ascendancy start, or remove beyond.
+ *
+ * Returns the new full allocated set (main tree + this ascendancy's nodes).
+ */
+export function toggleAscendancyAllocation(data, ascendancy, allocated, target, graph = buildAscendancyGraph(data, ascendancy)) {
+    const start = ascendancyStartNode(data, ascendancy);
+    if (start === undefined) {
+        return [...allocated];
+    }
+    // Split off this ascendancy's slice; everything else stays exactly as-is.
+    const ascAllocated = new Set();
+    const rest = [];
+    for (const id of allocated) {
+        if (graph.has(id)) {
+            ascAllocated.add(id);
+        }
+        else {
+            rest.push(id);
+        }
+    }
+    const nextAsc = toggleAllocation(data, start, ascAllocated, target, graph);
+    return [...rest, ...nextAsc];
+}
+//# sourceMappingURL=allocate.js.map