@femtomc/mu-issue 26.2.90 → 26.2.91

package/dist/dag.d.ts

@@ -0,0 +1,46 @@
+import type { Issue } from "@femtomc/mu-core";
+export type ValidationResult = {
+    is_final: boolean;
+    reason: string;
+};
+export type RetryableDagCandidate = {
+    issue: Issue;
+    reason: string;
+};
+/**
+ * Deterministic DAG reconcile primitives used by issue-graph reconciliation.
+ *
+ * Contract: these helpers are pure functions over the provided issue snapshot and must remain
+ * side-effect free so reconcile passes are replayable/idempotent.
+ */
+export declare const DAG_RECONCILE_PRIMITIVE_INVARIANTS: readonly ["DAG-RECON-001: `readyLeaves` only returns open, unblocked, leaf issues within the requested subtree scope.", "DAG-RECON-002: `readyLeaves` ordering is deterministic for a fixed input snapshot (priority-ordered candidate set).", "DAG-RECON-003: `validateDag(...).is_final=true` implies no remaining non-expanded open work in the subtree.", "DAG-RECON-004: closed(failure|needs_work) and expanded-without-children are non-final and require reconcile action.", "DAG-RECON-005: `retryableDagCandidates` selection is deterministic and side-effect free for a fixed snapshot + attempts map."];
+export declare function subtreeIds(issues: readonly Issue[], rootId: string): string[];
+/**
+ * Reconcile selection primitive: dispatch should only draw from this ready set (or an
+ * equivalent deterministic adapter) to preserve replayability.
+ */
+export declare function readyLeaves(issues: readonly Issue[], opts?: {
+    root_id?: string;
+    tags?: readonly string[];
+}): Issue[];
+/**
+ * Reconcile retry primitive.
+ *
+ * Produces a deterministic list of closed nodes that are eligible to be reopened.
+ * Callers decide whether/when to apply the reopen side effect.
+ */
+export declare function retryableDagCandidates(issues: readonly Issue[], opts: {
+    root_id: string;
+    retry_outcomes?: readonly string[];
+    attempts_by_issue_id?: ReadonlyMap<string, number>;
+    max_attempts?: number;
+}): RetryableDagCandidate[];
+export declare function collapsible(issues: readonly Issue[], rootId: string): Issue[];
+/**
+ * Reconcile termination primitive.
+ *
+ * `is_final=false` is a hard signal that callers must continue reconciling
+ * (or repair invalid expanded state) before the root run can be considered terminal.
+ */
+export declare function validateDag(issues: readonly Issue[], rootId: string): ValidationResult;
+//# sourceMappingURL=dag.d.ts.map

package/dist/dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../src/dag.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C,MAAM,MAAM,gBAAgB,GAAG;IAC9B,QAAQ,EAAE,OAAO,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAAG;IACnC,KAAK,EAAE,KAAK,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CACf,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,kCAAkC,slBAMrC,CAAC;AA0BX,wBAAgB,UAAU,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAuB7E;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAC1B,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CAAO,GACvD,KAAK,EAAE,CAuCT;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACrC,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,IAAI,EAAE;IACL,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC,oBAAoB,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnD,YAAY,CAAC,EAAE,MAAM,CAAC;CACtB,GACC,qBAAqB,EAAE,CAsCzB;AAED,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE,CA6B7E;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAqDtF"}

package/dist/dag.js

@@ -0,0 +1,212 @@
+/**
+ * Deterministic DAG reconcile primitives used by issue-graph reconciliation.
+ *
+ * Contract: these helpers are pure functions over the provided issue snapshot and must remain
+ * side-effect free so reconcile passes are replayable/idempotent.
+ */
+export const DAG_RECONCILE_PRIMITIVE_INVARIANTS = [
+    "DAG-RECON-001: `readyLeaves` only returns open, unblocked, leaf issues within the requested subtree scope.",
+    "DAG-RECON-002: `readyLeaves` ordering is deterministic for a fixed input snapshot (priority-ordered candidate set).",
+    "DAG-RECON-003: `validateDag(...).is_final=true` implies no remaining non-expanded open work in the subtree.",
+    "DAG-RECON-004: closed(failure|needs_work) and expanded-without-children are non-final and require reconcile action.",
+    "DAG-RECON-005: `retryableDagCandidates` selection is deterministic and side-effect free for a fixed snapshot + attempts map.",
+];
+function childrenByParent(issues) {
+    const byParent = new Map();
+    for (const issue of issues) {
+        for (const dep of issue.deps) {
+            if (dep.type !== "parent") {
+                continue;
+            }
+            const list = byParent.get(dep.target) ?? [];
+            list.push(issue);
+            byParent.set(dep.target, list);
+        }
+    }
+    return byParent;
+}
+function compareByPriorityThenId(a, b) {
+    const pa = a.priority ?? 3;
+    const pb = b.priority ?? 3;
+    if (pa !== pb) {
+        return pa - pb;
+    }
+    return a.id.localeCompare(b.id);
+}
+export function subtreeIds(issues, rootId) {
+    const children = childrenByParent(issues);
+    const result = [];
+    const q = [rootId];
+    const seen = new Set();
+    while (q.length > 0) {
+        const nodeId = q.shift();
+        if (!nodeId) {
+            continue;
+        }
+        if (seen.has(nodeId)) {
+            continue;
+        }
+        seen.add(nodeId);
+        result.push(nodeId);
+        for (const child of children.get(nodeId) ?? []) {
+            q.push(child.id);
+        }
+    }
+    return result;
+}
+/**
+ * Reconcile selection primitive: dispatch should only draw from this ready set (or an
+ * equivalent deterministic adapter) to preserve replayability.
+ */
+export function readyLeaves(issues, opts = {}) {
+    const byId = new Map(issues.map((i) => [i.id, i]));
+    const idsInScope = new Set(opts.root_id ? subtreeIds(issues, opts.root_id) : byId.keys());
+    const blocked = new Set();
+    for (const issue of issues) {
+        for (const dep of issue.deps) {
+            if (dep.type !== "blocks") {
+                continue;
+            }
+            if (issue.status !== "closed" || issue.outcome === "expanded") {
+                blocked.add(dep.target);
+            }
+        }
+    }
+    const children = childrenByParent(issues);
+    const result = [];
+    for (const issueId of idsInScope) {
+        const issue = byId.get(issueId);
+        if (!issue || issue.status !== "open") {
+            continue;
+        }
+        if (blocked.has(issueId)) {
+            continue;
+        }
+        const kids = children.get(issueId) ?? [];
+        if (kids.some((kid) => kid.status !== "closed")) {
+            continue;
+        }
+        if (opts.tags && !opts.tags.every((tag) => issue.tags.includes(tag))) {
+            continue;
+        }
+        result.push(issue);
+    }
+    result.sort(compareByPriorityThenId);
+    return result;
+}
+/**
+ * Reconcile retry primitive.
+ *
+ * Produces a deterministic list of closed nodes that are eligible to be reopened.
+ * Callers decide whether/when to apply the reopen side effect.
+ */
+export function retryableDagCandidates(issues, opts) {
+    const idsInScope = new Set(subtreeIds(issues, opts.root_id));
+    const children = childrenByParent(issues);
+    const retryOutcomes = new Set(opts.retry_outcomes ?? ["failure", "needs_work"]);
+    const maxAttempts = typeof opts.max_attempts === "number" && Number.isFinite(opts.max_attempts)
+        ? Math.max(1, Math.trunc(opts.max_attempts))
+        : Number.POSITIVE_INFINITY;
+    const out = [];
+    for (const issue of issues) {
+        if (!idsInScope.has(issue.id)) {
+            continue;
+        }
+        if (issue.status !== "closed") {
+            continue;
+        }
+        const attempts = opts.attempts_by_issue_id?.get(issue.id) ?? 0;
+        if (attempts >= maxAttempts) {
+            continue;
+        }
+        if (issue.outcome && retryOutcomes.has(issue.outcome)) {
+            const hasOpenChildren = (children.get(issue.id) ?? []).some((child) => child.status !== "closed");
+            if (!hasOpenChildren) {
+                out.push({ issue, reason: `outcome=${issue.outcome}` });
+            }
+            continue;
+        }
+        if (issue.outcome === "expanded" && (children.get(issue.id)?.length ?? 0) === 0) {
+            out.push({ issue, reason: "outcome=expanded_without_children" });
+        }
+    }
+    out.sort((a, b) => compareByPriorityThenId(a.issue, b.issue));
+    return out;
+}
+export function collapsible(issues, rootId) {
+    const byId = new Map(issues.map((i) => [i.id, i]));
+    const idsInScope = new Set(subtreeIds(issues, rootId));
+    const children = childrenByParent(issues);
+    // `refine` is terminal for a closed review node; refinement itself is
+    // handled by the caller via DAG reconciliation transitions.
+    const terminalOutcomes = new Set(["success", "skipped", "refine"]);
+    const result = [];
+    for (const issueId of idsInScope) {
+        const node = byId.get(issueId);
+        if (!node) {
+            continue;
+        }
+        if (node.status !== "closed" || node.outcome !== "expanded") {
+            continue;
+        }
+        const kids = children.get(issueId) ?? [];
+        if (kids.length === 0) {
+            continue;
+        }
+        if (kids.every((kid) => kid.status === "closed" && kid.outcome != null && terminalOutcomes.has(kid.outcome))) {
+            result.push(node);
+        }
+    }
+    result.sort((a, b) => a.id.localeCompare(b.id));
+    return result;
+}
+/**
+ * Reconcile termination primitive.
+ *
+ * `is_final=false` is a hard signal that callers must continue reconciling
+ * (or repair invalid expanded state) before the root run can be considered terminal.
+ */
+export function validateDag(issues, rootId) {
+    const byId = new Map(issues.map((i) => [i.id, i]));
+    const ids = new Set(subtreeIds(issues, rootId));
+    const root = byId.get(rootId);
+    if (!root) {
+        return { is_final: true, reason: "root not found" };
+    }
+    const children = childrenByParent(issues);
+    const needsReorch = [...ids]
+        .filter((issueId) => {
+        const issue = byId.get(issueId);
+        return issue?.status === "closed" && (issue.outcome === "failure" || issue.outcome === "needs_work");
+    })
+        .sort();
+    if (needsReorch.length > 0) {
+        return { is_final: false, reason: `needs work: ${needsReorch.join(",")}` };
+    }
+    const badExpanded = [...ids]
+        .filter((issueId) => {
+        const issue = byId.get(issueId);
+        return (issue?.status === "closed" && issue.outcome === "expanded" && (children.get(issueId)?.length ?? 0) === 0);
+    })
+        .sort();
+    if (badExpanded.length > 0) {
+        return { is_final: false, reason: `expanded without children: ${badExpanded.join(",")}` };
+    }
+    const pending = [...ids].filter((issueId) => {
+        const issue = byId.get(issueId);
+        if (!issue) {
+            return false;
+        }
+        if (issue.status === "closed" && issue.outcome === "expanded") {
+            return false;
+        }
+        return issue.status !== "closed";
+    });
+    if (pending.length === 0) {
+        return { is_final: true, reason: "all work completed" };
+    }
+    if (pending.length === 1 && pending[0] === rootId && ids.size > 1) {
+        return { is_final: false, reason: "all children closed, root still open" };
+    }
+    return { is_final: false, reason: "in progress" };
+}

package/dist/index.d.ts

@@ -1,3 +1,5 @@
+export type { RetryableDagCandidate, ValidationResult } from "./dag.js";
+export { collapsible, DAG_RECONCILE_PRIMITIVE_INVARIANTS, readyLeaves, retryableDagCandidates, subtreeIds, validateDag, } from "./dag.js";
 export type { CreateIssueOpts, ListIssueOpts, ReadyIssueOpts } from "./issue_store.js";
 export { IssueStore } from "./issue_store.js";
 export { DEFAULT_ISSUE_QUERY_LIMIT, ISSUE_STATUS_VALUES, MAX_ISSUE_QUERY_LIMIT, IssueStoreError, IssueStoreNotFoundError, IssueStoreValidationError, normalizeIssueContainsFilter, normalizeIssueDepInput, normalizeIssueQueryLimit, normalizeIssueStatusFilter, normalizeIssueTagFilter, } from "./contracts.js";

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACvF,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EACN,yBAAyB,EACzB,mBAAmB,EACnB,qBAAqB,EACrB,eAAe,EACf,uBAAuB,EACvB,yBAAyB,EACzB,4BAA4B,EAC5B,sBAAsB,EACtB,wBAAwB,EACxB,0BAA0B,EAC1B,uBAAuB,GACvB,MAAM,gBAAgB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACxE,OAAO,EACN,WAAW,EACX,kCAAkC,EAClC,WAAW,EACX,sBAAsB,EACtB,UAAU,EACV,WAAW,GACX,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACvF,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EACN,yBAAyB,EACzB,mBAAmB,EACnB,qBAAqB,EACrB,eAAe,EACf,uBAAuB,EACvB,yBAAyB,EACzB,4BAA4B,EAC5B,sBAAsB,EACtB,wBAAwB,EACxB,0BAA0B,EAC1B,uBAAuB,GACvB,MAAM,gBAAgB,CAAC"}

package/dist/index.js

@@ -1,2 +1,3 @@
+export { collapsible, DAG_RECONCILE_PRIMITIVE_INVARIANTS, readyLeaves, retryableDagCandidates, subtreeIds, validateDag, } from "./dag.js";
 export { IssueStore } from "./issue_store.js";
 export { DEFAULT_ISSUE_QUERY_LIMIT, ISSUE_STATUS_VALUES, MAX_ISSUE_QUERY_LIMIT, IssueStoreError, IssueStoreNotFoundError, IssueStoreValidationError, normalizeIssueContainsFilter, normalizeIssueDepInput, normalizeIssueQueryLimit, normalizeIssueStatusFilter, normalizeIssueTagFilter, } from "./contracts.js";

package/dist/issue_store.d.ts

@@ -1,5 +1,6 @@
-import type { Issue, JsonlStore, ValidationResult } from "@femtomc/mu-core";
+import type { Issue, JsonlStore } from "@femtomc/mu-core";
 import { EventLog } from "@femtomc/mu-core";
+import { type ValidationResult } from "./dag.js";
 export type CreateIssueOpts = {
     body?: string;
     tags?: string[];

package/dist/issue_store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"issue_store.d.ts","sourceRoot":"","sources":["../src/issue_store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAC5E,OAAO,EAGN,QAAQ,EAOR,MAAM,kBAAkB,CAAC;AAW1B,MAAM,MAAM,eAAe,GAAG;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC3B,MAAM,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;IAChC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC5B,IAAI,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAqDF,qBAAa,UAAU;;IACtB,SAAgB,MAAM,EAAE,QAAQ,CAAC;gBAGd,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,IAAI,GAAE;QAAE,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAO;IA0CnE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,eAAoB,GAAG,OAAO,CAAC,KAAK,CAAC;IA0BjE,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;IAM3C,IAAI,CAAC,IAAI,GAAE,aAAkB,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IA0ChD,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IA8ExE,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IA+BxC,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,GAAE,MAAkB,GAAG,OAAO,CAAC,KAAK,CAAC;IAInE,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAmBpD,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAuCrE,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAmC3E,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAK5C,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAS9C,KAAK,CAAC,MAAM,GAAE,MAAM,GAAG,IAAW,EAAE,IAAI,GAAE,cAAmB,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAgBhF,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAK7C,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC;CAIhE"}
+{"version":3,"file":"issue_store.d.ts","sourceRoot":"","sources":["../src/issue_store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC1D,OAAO,EAAE,QAAQ,EAA8C,MAAM,kBAAkB,CAAC;AACxF,OAAO,EAIN,KAAK,gBAAgB,EAErB,MAAM,UAAU,CAAC;AAWlB,MAAM,MAAM,eAAe,GAAG;IAC7B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC3B,MAAM,CAAC,EAAE,KAAK,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;IAChC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC5B,IAAI,CAAC,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAqDF,qBAAa,UAAU;;IACtB,SAAgB,MAAM,EAAE,QAAQ,CAAC;gBAGd,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,IAAI,GAAE;QAAE,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAO;IA0CnE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,eAAoB,GAAG,OAAO,CAAC,KAAK,CAAC;IA0BjE,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;IAM3C,IAAI,CAAC,IAAI,GAAE,aAAkB,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IA0ChD,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IA8ExE,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IA+BxC,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,GAAE,MAAkB,GAAG,OAAO,CAAC,KAAK,CAAC;IAInE,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAmBpD,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAuCrE,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAmC3E,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAK5C,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAS9C,KAAK,CAAC,MAAM,GAAE,MAAM,GAAG,IAAW,EAAE,IAAI,GAAE,cAAmB,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAgBhF,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAK7C,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC;CAIhE"}

package/dist/issue_store.js

@@ -1,4 +1,5 @@
-import { collapsible as dagCollapsible, subtreeIds as dagSubtreeIds, EventLog, IssueSchema, NullEventSink, nowTs, readyLeaves, shortId, validateDag, } from "@femtomc/mu-core";
+import { EventLog, IssueSchema, NullEventSink, nowTs, shortId } from "@femtomc/mu-core";
+import { collapsible as dagCollapsible, readyLeaves, subtreeIds as dagSubtreeIds, validateDag, } from "./dag.js";
 import { IssueStoreNotFoundError, IssueStoreValidationError, normalizeIssueContainsFilter, normalizeIssueDepInput, normalizeIssueQueryLimit, normalizeIssueStatusFilter, normalizeIssueTagFilter, } from "./contracts.js";
 function deepEqualJson(a, b) {
     if (a === b) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@femtomc/mu-issue",
-  "version": "26.2.90",
+  "version": "26.2.91",
   "description": "Work item store with dependency graph helpers for mu.",
   "keywords": [
     "mu",
@@ -22,6 +22,6 @@
     "dist/**"
   ],
   "dependencies": {
-    "@femtomc/mu-core": "26.2.90"
+    "@femtomc/mu-core": "26.2.91"
   }
 }