perttool 0.1.0-alpha.2

package/dist/analysis/precedence.js

@@ -0,0 +1,187 @@
+import { compareStableStrings } from "../model/diagnostics.js";
+import { ZERO, absolute, add, compare, isZero, subtract, } from "../model/rational.js";
+function pathFromEdges(edges) {
+    return {
+        edgeIds: edges.map((edge) => edge.id),
+        taskIds: edges.filter((edge) => edge.kind === "task").map((edge) => edge.id),
+        gateIds: edges.filter((edge) => edge.kind === "gate").map((edge) => edge.id),
+        variance: edges.reduce((sum, edge) => add(sum, edge.variance), ZERO),
+    };
+}
+function criticalPaths(graph, edgeTimings, maxPaths) {
+    const drivingOutgoing = new Map([...graph.vertices.keys()].map((id) => [id, []]));
+    for (const edge of edgeTimings) {
+        if (edge.isDriving)
+            drivingOutgoing.get(edge.source).push(edge);
+    }
+    for (const list of drivingOutgoing.values()) {
+        list.sort((left, right) => compareStableStrings(left.id, right.id));
+    }
+    const counts = new Map([[graph.finish, 1n]]);
+    for (const vertex of [...graph.topologicalOrder].reverse()) {
+        if (vertex === graph.finish)
+            continue;
+        const count = drivingOutgoing
+            .get(vertex)
+            .reduce((sum, edge) => sum + (counts.get(edge.target) ?? 0n), 0n);
+        counts.set(vertex, count);
+    }
+    const viableFrontier = graph.frontier
+        .filter((id) => (counts.get(id) ?? 0n) > 0n)
+        .sort(compareStableStrings);
+    const pathCount = viableFrontier.reduce((sum, id) => sum + (counts.get(id) ?? 0n), 0n);
+    if (pathCount === 0n)
+        throw new Error("precedence critical path invariant failed");
+    const emitted = [];
+    const visit = (vertex, current) => {
+        if (emitted.length >= maxPaths)
+            return;
+        if (vertex === graph.finish) {
+            emitted.push(pathFromEdges(current));
+            return;
+        }
+        for (const edge of drivingOutgoing.get(vertex)) {
+            if ((counts.get(edge.target) ?? 0n) === 0n)
+                continue;
+            visit(edge.target, [...current, edge]);
+            if (emitted.length >= maxPaths)
+                return;
+        }
+    };
+    for (const frontier of viableFrontier) {
+        visit(frontier, []);
+        if (emitted.length >= maxPaths)
+            break;
+    }
+    let representative;
+    const representativeEdges = [];
+    let vertex = viableFrontier[0];
+    while (vertex !== undefined && vertex !== graph.finish) {
+        const next = drivingOutgoing
+            .get(vertex)
+            .find((edge) => (counts.get(edge.target) ?? 0n) > 0n);
+        if (next === undefined)
+            throw new Error("precedence representative path invariant failed");
+        representativeEdges.push(next);
+        vertex = next.target;
+    }
+    representative = pathFromEdges(representativeEdges);
+    return {
+        representativePath: representative,
+        pathCount,
+        paths: emitted,
+        pathsTruncated: pathCount > BigInt(emitted.length),
+    };
+}
+export function analyzePrecedence(graph, maxPaths) {
+    const earliest = new Map();
+    const edgeEarly = new Map();
+    for (const vertex of graph.topologicalOrder) {
+        let value;
+        if (graph.frontier.includes(vertex)) {
+            value = ZERO;
+        }
+        else {
+            const incoming = graph.incoming.get(vertex);
+            if (incoming.length === 0)
+                throw new Error(`residual root ${vertex} is not frontier`);
+            value = incoming.reduce((maximum, edge, index) => {
+                const candidate = edgeEarly.get(edge.id).ef;
+                return index === 0 || compare(candidate, maximum) > 0 ? candidate : maximum;
+            }, ZERO);
+        }
+        earliest.set(vertex, value);
+        for (const edge of graph.outgoing.get(vertex)) {
+            edgeEarly.set(edge.id, { es: value, ef: add(value, edge.expected) });
+        }
+    }
+    const makespan = earliest.get(graph.finish);
+    if (makespan === undefined)
+        throw new Error("finish earliest time is missing");
+    const latest = new Map([[graph.finish, makespan]]);
+    const edgeLate = new Map();
+    for (const vertex of [...graph.topologicalOrder].reverse()) {
+        if (vertex !== graph.finish) {
+            const outgoing = graph.outgoing.get(vertex);
+            if (outgoing.length === 0)
+                throw new Error(`non-finish ${vertex} has no outgoing edge`);
+            let value;
+            for (const edge of outgoing) {
+                const targetLatest = latest.get(edge.target);
+                if (targetLatest === undefined)
+                    throw new Error(`latest time for ${edge.target} is missing`);
+                const candidate = subtract(targetLatest, edge.expected);
+                edgeLate.set(edge.id, { ls: candidate, lf: targetLatest });
+                if (value === undefined || compare(candidate, value) < 0)
+                    value = candidate;
+            }
+            latest.set(vertex, value);
+        }
+        const vertexLatest = latest.get(vertex);
+        for (const edge of graph.incoming.get(vertex)) {
+            edgeLate.set(edge.id, {
+                ls: subtract(vertexLatest, edge.expected),
+                lf: vertexLatest,
+            });
+        }
+    }
+    const position = new Map(graph.topologicalOrder.map((id, index) => [id, index]));
+    const edges = graph.edges
+        .map((edge) => {
+        const early = edgeEarly.get(edge.id);
+        const late = edgeLate.get(edge.id);
+        const totalFloat = subtract(late.ls, early.es);
+        const freeFloat = subtract(earliest.get(edge.target), early.ef);
+        if (compare(totalFloat, ZERO) < 0 || compare(freeFloat, ZERO) < 0) {
+            throw new Error(`negative float for edge ${edge.id}`);
+        }
+        return {
+            id: edge.id,
+            source: edge.source,
+            target: edge.target,
+            kind: edge.kind,
+            status: edge.status,
+            expected: edge.expected,
+            variance: edge.variance,
+            es: early.es,
+            ef: early.ef,
+            ls: late.ls,
+            lf: late.lf,
+            totalFloat,
+            freeFloat,
+            isCritical: compare(absolute(totalFloat), graph.criticalEpsilon) <= 0,
+            isDriving: isZero(totalFloat),
+            edge,
+        };
+    })
+        .sort((left, right) => {
+        const byPosition = position.get(left.source) - position.get(right.source);
+        return byPosition !== 0 ? byPosition : compareStableStrings(left.id, right.id);
+    });
+    const milestones = graph.topologicalOrder.map((id) => {
+        const milestoneEarliest = earliest.get(id);
+        const milestoneLatest = latest.get(id);
+        const slack = subtract(milestoneLatest, milestoneEarliest);
+        if (compare(slack, ZERO) < 0)
+            throw new Error(`negative milestone slack for ${id}`);
+        return { id, earliest: milestoneEarliest, latest: milestoneLatest, slack };
+    });
+    const pathResult = criticalPaths(graph, edges, maxPaths);
+    return {
+        makespan,
+        conditionalOnBlocksResolved: graph.blockedTaskIds.length > 0,
+        blockedTaskIds: graph.blockedTaskIds,
+        milestones,
+        edges,
+        critical: {
+            milestoneIds: milestones
+                .filter((milestone) => compare(absolute(milestone.slack), graph.criticalEpsilon) <= 0)
+                .map((milestone) => milestone.id),
+            taskIds: edges.filter((edge) => edge.kind === "task" && edge.isCritical).map((edge) => edge.id),
+            gateIds: edges.filter((edge) => edge.kind === "gate" && edge.isCritical).map((edge) => edge.id),
+            drivingEdgeIds: edges.filter((edge) => edge.isDriving).map((edge) => edge.id),
+            ...pathResult,
+        },
+    };
+}
+//# sourceMappingURL=precedence.js.map

package/dist/analysis/precedence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"precedence.js","sourceRoot":"","sources":["../../src/analysis/precedence.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAE/D,OAAO,EACL,IAAI,EACJ,QAAQ,EACR,GAAG,EACH,OAAO,EACP,MAAM,EACN,QAAQ,GACT,MAAM,sBAAsB,CAAC;AAwD9B,SAAS,aAAa,CAAC,KAA4B;IACjD,OAAO;QACL,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5E,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5E,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC;KACrE,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CACpB,KAAoB,EACpB,WAAkC,EAClC,QAAgB;IAEhB,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAkB,CAAC,CAAC,CACjE,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS;YAAE,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnE,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,IAAI,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,SAAS;QACtC,MAAM,KAAK,GAAG,eAAe;aAC1B,GAAG,CAAC,MAAM,CAAE;aACZ,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACpE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,QAAQ;SAClC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC;SAC3C,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACvF,IAAI,SAAS,KAAK,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;IAEnF,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,KAAK,GAAG,CAAC,MAAc,EAAE,OAAqB,EAAQ,EAAE;QAC5D,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;YAAE,OAAO;QACvC,IAAI,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;YACrC,OAAO;QACT,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;YAChD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE;gBAAE,SAAS;YACrD,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;YACvC,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;gBAAE,OAAO;QACzC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;QACtC,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACpB,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ;YAAE,MAAM;IACxC,CAAC;IAED,IAAI,cAAwC,CAAC;IAC7C,MAAM,mBAAmB,GAAiB,EAAE,CAAC;IAC7C,IAAI,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC/B,OAAO,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACvD,MAAM,IAAI,GAAG,eAAe;aACzB,GAAG,CAAC,MAAM,CAAE;aACZ,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QACxD,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;QAC3F,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IACD,cAAc,GAAG,aAAa,CAAC,mBAAmB,CAAC,CAAC;IACpD,OAAO;QACL,kBAAkB,EAAE,cAAc;QAClC,SAAS;QACT,KAAK,EAAE,OAAO;QACd,cAAc,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;KACnD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAAoB,EACpB,QAAgB;IAEhB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA4D,CAAC;IACtF,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC5C,IAAI,KAAe,CAAC;QACpB,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACpC,KAAK,GAAG,IAAI,CAAC;QACf,CAAC;aAAM,CAAC;YACN,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,MAAM,kBAAkB,CAAC,CAAC;YACtF,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAW,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;gBACzD,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC,EAAE,CAAC;gBAC7C,OAAO,KAAK,KAAK,CAAC,IAAI,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9E,CAAC,EAAE,IAAI,CAAC,CAAC;QACX,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;YAC/C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,QAAQ,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IAE/E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAmB,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4D,CAAC;IACrF,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,IAAI,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,cAAc,MAAM,uBAAuB,CAAC,CAAC;YACxF,IAAI,KAA2B,CAAC;YAChC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC7C,IAAI,YAAY,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,IAAI,CAAC,MAAM,aAAa,CAAC,CAAC;gBAC7F,MAAM,SAAS,GAAG,QAAQ,CAAC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACxD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;gBAC3D,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC;oBAAE,KAAK,GAAG,SAAS,CAAC;YAC9E,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAM,CAAC,CAAC;QAC7B,CAAC;QACD,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;YAC/C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gBACpB,EAAE,EAAE,QAAQ,CAAC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC;gBACzC,EAAE,EAAE,YAAY;aACjB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACjF,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK;SACtB,GAAG,CAAC,CAAC,IAAI,EAAc,EAAE;QACxB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;QACtC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;QACpC,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QACjE,IAAI,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,UAAU;YACV,SAAS;YACT,UAAU,EAAE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC;YACrE,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC;YAC7B,IAAI;SACL,CAAC;IACJ,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACpB,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAE,CAAC;QAC5E,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IACL,MAAM,UAAU,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAmB,EAAE;QACpE,MAAM,iBAAiB,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC5C,MAAM,eAAe,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,eAAe,EAAE,iBAAiB,CAAC,CAAC;QAC3D,IAAI,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,EAAE,EAAE,CAAC,CAAC;QACpF,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC;IAC7E,CAAC,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IACzD,OAAO;QACL,QAAQ;QACR,2BAA2B,EAAE,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC;QAC5D,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,UAAU;QACV,KAAK;QACL,QAAQ,EAAE;YACR,YAAY,EAAE,UAAU;iBACrB,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;iBACrF,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YACnC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/F,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/F,cAAc,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7E,GAAG,UAAU;SACd;KACF,CAAC;AACJ,CAAC"}

package/dist/analysis/resource.d.ts

@@ -0,0 +1,96 @@
+import type { Rational } from "../model/rational.js";
+import type { RequirementValue } from "../model/syntax.js";
+import type { ResidualGraph, TaskStatus } from "./graph.js";
+import type { PrecedenceResult } from "./precedence.js";
+export interface ScheduledTask {
+    readonly id: string;
+    readonly status: TaskStatus;
+    readonly expected: Rational;
+    readonly variance: Rational;
+    readonly eligibleTime: Rational;
+    readonly start: Rational;
+    readonly finish: Rational;
+    readonly resourceWait: Rational;
+    readonly requirements: readonly RequirementValue[];
+    readonly priorityKey: {
+        readonly priority: number;
+        readonly precedenceTotalFloat: Rational;
+        readonly expected: Rational;
+        readonly taskId: string;
+    };
+    readonly conditionalBlocked: boolean;
+}
+export interface ResourceCapacity {
+    readonly id: string;
+    readonly declared: number;
+    readonly override: number | null;
+    readonly effective: number;
+}
+export interface ResourceTimelineEntry {
+    readonly taskId: string;
+    readonly start: Rational;
+    readonly finish: Rational;
+    readonly units: number;
+}
+export interface ResourceStatistic {
+    readonly id: string;
+    readonly capacity: number;
+    readonly amountTime: Rational;
+    readonly utilization: Rational;
+    readonly peakUsage: number;
+    readonly lastRelease: Rational;
+    readonly timeline: readonly ResourceTimelineEntry[];
+}
+export interface ResourceArc {
+    readonly id: string;
+    readonly fromTaskId: string;
+    readonly toTaskId: string;
+    readonly atTime: Rational;
+    readonly waitFrom: Rational;
+    readonly resources: ReadonlyMap<string, number>;
+    readonly scheduleFloat: Rational;
+    readonly isCritical: boolean;
+    readonly isDriving: boolean;
+}
+export type ScheduleConstraintKind = "precedence" | "gate" | "resource";
+export interface SchedulePath {
+    readonly taskIds: readonly string[];
+    readonly constraints: readonly {
+        readonly fromTaskId: string;
+        readonly toTaskId: string;
+        readonly kind: ScheduleConstraintKind;
+        readonly resourceArcId: string | null;
+    }[];
+    readonly connectorIds: readonly string[];
+}
+export interface ScheduleCriticalResult {
+    readonly taskIds: readonly string[];
+    readonly resourceArcIds: readonly string[];
+    readonly drivingConstraintIds: readonly string[];
+    readonly representativePath: SchedulePath;
+    readonly pathCount: bigint;
+    readonly paths: readonly SchedulePath[];
+    readonly pathsTruncated: boolean;
+}
+export interface ResourceScheduleResult {
+    readonly algorithm: {
+        readonly id: "parallel-sgs";
+        readonly version: 1;
+        readonly optimal: false;
+    };
+    readonly conditionalOnBlocksResolved: boolean;
+    readonly blockedTaskIds: readonly string[];
+    readonly capacities: readonly ResourceCapacity[];
+    readonly precedenceLowerBound: Rational;
+    readonly makespan: Rational;
+    readonly resourceDelay: Rational;
+    readonly tasks: readonly ScheduledTask[];
+    readonly resources: readonly ResourceStatistic[];
+    readonly resourceArcs: readonly ResourceArc[];
+    readonly constraintGraphReplay: {
+        readonly ok: true;
+    };
+    readonly scheduleCritical: ScheduleCriticalResult;
+}
+export declare function analyzeResources(graph: ResidualGraph, precedence: PrecedenceResult, overrides: ReadonlyMap<string, number>, maxPaths: number): ResourceScheduleResult;
+//# sourceMappingURL=resource.d.ts.map

package/dist/analysis/resource.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resource.d.ts","sourceRoot":"","sources":["../../src/analysis/resource.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAYrD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,KAAK,EAAgB,aAAa,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAC1E,OAAO,KAAK,EAAc,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEpE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,YAAY,EAAE,QAAQ,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,YAAY,EAAE,QAAQ,CAAC;IAChC,QAAQ,CAAC,YAAY,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACnD,QAAQ,CAAC,WAAW,EAAE;QACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,CAAC;QACxC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;QAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC;CACtC;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC;IAC/B,QAAQ,CAAC,QAAQ,EAAE,SAAS,qBAAqB,EAAE,CAAC;CACrD;AAWD,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChD,QAAQ,CAAC,aAAa,EAAE,QAAQ,CAAC;IACjC,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC7B;AAED,MAAM,MAAM,sBAAsB,GAAG,YAAY,GAAG,MAAM,GAAG,UAAU,CAAC;AAExE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,WAAW,EAAE,SAAS;QAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;QAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;QAC1B,QAAQ,CAAC,IAAI,EAAE,sBAAsB,CAAC;QACtC,QAAQ,CAAC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;KACvC,EAAE,CAAC;IACJ,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;CAC1C;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,oBAAoB,EAAE,SAAS,MAAM,EAAE,CAAC;IACjD,QAAQ,CAAC,kBAAkB,EAAE,YAAY,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;CAClC;AAED,MAAM,WAAW,sBAAsB;IACrC,QAAQ,CAAC,SAAS,EAAE;QAClB,QAAQ,CAAC,EAAE,EAAE,cAAc,CAAC;QAC5B,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;QACpB,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC;KACzB,CAAC;IACF,QAAQ,CAAC,2BAA2B,EAAE,OAAO,CAAC;IAC9C,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,UAAU,EAAE,SAAS,gBAAgB,EAAE,CAAC;IACjD,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,CAAC;IACxC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,aAAa,EAAE,QAAQ,CAAC;IACjC,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,QAAQ,CAAC,SAAS,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACjD,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;IAC9C,QAAQ,CAAC,qBAAqB,EAAE;QAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAA;KAAE,CAAC;IACtD,QAAQ,CAAC,gBAAgB,EAAE,sBAAsB,CAAC;CACnD;AAsmBD,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,aAAa,EACpB,UAAU,EAAE,gBAAgB,EAC5B,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EACtC,QAAQ,EAAE,MAAM,GACf,sBAAsB,CAkCxB"}