@wildorder/nightshift 0.1.0

package/dist/detect-package-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-package-manager.d.ts","sourceRoot":"","sources":["../src/detect-package-manager.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,gBAAgB,yCAA0C,CAAC;AAExE,MAAM,MAAM,cAAc,GAAG,CAAC,OAAO,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC;AAU/D,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,cAAc,CAQjE;AA4BD;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,GAAG,cAAc,CAShE;AAED,gFAAgF;AAChF,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAE9D;AAED,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,cAAc,EACvB,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE;IAAE,iBAAiB,CAAC,EAAE,OAAO,CAAA;CAAO,GAC5C,MAAM,CAYR"}

package/dist/detect-package-manager.js

@@ -0,0 +1,78 @@
+import { existsSync, readFileSync } from "node:fs";
+import { dirname, join, resolve } from "node:path";
+export const PACKAGE_MANAGERS = ["npm", "pnpm", "yarn", "bun"];
+const LOCKFILES = [
+    ["pnpm-lock.yaml", "pnpm"],
+    ["yarn.lock", "yarn"],
+    ["bun.lockb", "bun"],
+    ["bun.lock", "bun"],
+    ["package-lock.json", "npm"],
+];
+export function parsePackageManager(value) {
+    const normalized = value.trim().toLowerCase();
+    if (PACKAGE_MANAGERS.includes(normalized)) {
+        return normalized;
+    }
+    throw new Error(`unknown package manager "${value}"; expected one of: ${PACKAGE_MANAGERS.join(", ")}`);
+}
+function fromPackageManagerField(directory) {
+    const manifestPath = join(directory, "package.json");
+    if (!existsSync(manifestPath))
+        return undefined;
+    let manifest;
+    try {
+        manifest = JSON.parse(readFileSync(manifestPath, "utf8"));
+    }
+    catch {
+        return undefined;
+    }
+    if (typeof manifest.packageManager !== "string")
+        return undefined;
+    // Corepack convention: "<name>@<version>", e.g. "pnpm@9.1.0+sha256.…"
+    const name = manifest.packageManager.split("@", 1)[0]?.trim().toLowerCase();
+    return PACKAGE_MANAGERS.includes(name ?? "")
+        ? name
+        : undefined;
+}
+function fromLockfile(directory) {
+    for (const [lockfile, manager] of LOCKFILES) {
+        if (existsSync(join(directory, lockfile)))
+            return manager;
+    }
+    return undefined;
+}
+/**
+ * Detect the project's package manager, walking up from `cwd` because in
+ * workspaces the lockfile and `packageManager` field live at the repo root,
+ * not necessarily in the package directory. Falls back to npm.
+ */
+export function detectPackageManager(cwd) {
+    let directory = resolve(cwd);
+    for (;;) {
+        const manager = fromPackageManagerField(directory) ?? fromLockfile(directory);
+        if (manager)
+            return manager;
+        const parent = dirname(directory);
+        if (parent === directory)
+            return "npm";
+        directory = parent;
+    }
+}
+/** pnpm workspaces are always declared by a pnpm-workspace.yaml at the root. */
+export function isPnpmWorkspaceRoot(directory) {
+    return existsSync(join(directory, "pnpm-workspace.yaml"));
+}
+export function addDevDependencyCommand(manager, packageName, options = {}) {
+    switch (manager) {
+        case "npm":
+            return `npm install --save-dev ${packageName}`;
+        case "pnpm":
+            // pnpm refuses to add to a workspace root unless -w makes it explicit.
+            return `pnpm add -D${options.pnpmWorkspaceRoot ? " -w" : ""} ${packageName}`;
+        case "yarn":
+            return `yarn add -D ${packageName}`;
+        case "bun":
+            return `bun add -d ${packageName}`;
+    }
+}
+//# sourceMappingURL=detect-package-manager.js.map

package/dist/detect-package-manager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-package-manager.js","sourceRoot":"","sources":["../src/detect-package-manager.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEnD,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAU,CAAC;AAIxE,MAAM,SAAS,GAAqD;IAClE,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAC1B,CAAC,WAAW,EAAE,MAAM,CAAC;IACrB,CAAC,WAAW,EAAE,KAAK,CAAC;IACpB,CAAC,UAAU,EAAE,KAAK,CAAC;IACnB,CAAC,mBAAmB,EAAE,KAAK,CAAC;CAC7B,CAAC;AAEF,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC9C,IAAK,gBAAsC,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;QACjE,OAAO,UAA4B,CAAC;IACtC,CAAC;IACD,MAAM,IAAI,KAAK,CACb,4BAA4B,KAAK,uBAAuB,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACtF,CAAC;AACJ,CAAC;AAED,SAAS,uBAAuB,CAC9B,SAAiB;IAEjB,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IACrD,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC;QAAE,OAAO,SAAS,CAAC;IAChD,IAAI,QAAsC,CAAC;IAC3C,IAAI,CAAC;QACH,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,OAAO,QAAQ,CAAC,cAAc,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAClE,sEAAsE;IACtE,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC5E,OAAQ,gBAAsC,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;QACjE,CAAC,CAAE,IAAuB;QAC1B,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CAAC,SAAiB;IACrC,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,SAAS,EAAE,CAAC;QAC5C,IAAI,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YAAE,OAAO,OAAO,CAAC;IAC5D,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAW;IAC9C,IAAI,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC7B,SAAS,CAAC;QACR,MAAM,OAAO,GAAG,uBAAuB,CAAC,SAAS,CAAC,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9E,IAAI,OAAO;YAAE,OAAO,OAAO,CAAC;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACvC,SAAS,GAAG,MAAM,CAAC;IACrB,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,mBAAmB,CAAC,SAAiB;IACnD,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,OAAuB,EACvB,WAAmB,EACnB,UAA2C,EAAE;IAE7C,QAAQ,OAAO,EAAE,CAAC;QAChB,KAAK,KAAK;YACR,OAAO,0BAA0B,WAAW,EAAE,CAAC;QACjD,KAAK,MAAM;YACT,uEAAuE;YACvE,OAAO,cAAc,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,WAAW,EAAE,CAAC;QAC/E,KAAK,MAAM;YACT,OAAO,eAAe,WAAW,EAAE,CAAC;QACtC,KAAK,KAAK;YACR,OAAO,cAAc,WAAW,EAAE,CAAC;IACvC,CAAC;AACH,CAAC"}

package/dist/findings.d.ts

@@ -0,0 +1,106 @@
+/**
+ * `advisory` never fails a gate and never keeps the convergence loop running.
+ * It is where the severity policy puts observations that name no cause.
+ */
+export type Severity = "blocker" | "major" | "minor" | "advisory";
+export declare const SEVERITY_ORDER: readonly Severity[];
+/**
+ * A closed set, because finding identity is built from the category and the
+ * subject rather than from the prose. A critic that rewords an objection must
+ * not thereby create a "new" finding — that is what prevents the loop from
+ * oscillating forever between rounds.
+ */
+export declare const FINDING_CATEGORIES: readonly ["manifest", "coverage", "traceability", "dependency", "spec-format", "interface-contract", "test-quality", "acceptance-criteria", "redundancy", "scope-structure"];
+export type FindingCategory = (typeof FINDING_CATEGORIES)[number];
+/**
+ * Why a finding is true. The severity policy reads this and nothing else:
+ * a finding supported only by `measurement` is an observation, not a defect.
+ */
+export type Evidence = {
+    kind: "location";
+    file: string;
+    startLine: number;
+    endLine?: number;
+    excerpt?: string;
+} | {
+    kind: "concern";
+    named: string;
+    detail?: string;
+} | {
+    kind: "measurement";
+    metric: "lineCount" | "fileCount";
+    value: number;
+};
+export interface Finding {
+    severity: Severity;
+    category: FindingCategory;
+    /** Machine code for deterministic checks; absent on model-authored findings. */
+    code?: string;
+    /**
+     * Short, normalized noun phrase naming what the finding is about — `SC-03`,
+     * `AuthToken interface`, `Tests case 4`. Identity comes from this, not from
+     * `message`, so wording may change freely between rounds.
+     */
+    subject: string;
+    message: string;
+    evidence: Evidence[];
+    workstreamId?: string;
+    file?: string;
+    /**
+     * The fix is not an edit to a spec — the workstream must be split, a
+     * workstream is missing, the manifest's ordering is itself wrong. Ends the
+     * convergence loop immediately rather than spending further rounds
+     * polishing a spec that should not exist in that shape.
+     */
+    requiresReplan?: boolean;
+    /** Set by the policy layer when it downgrades, explaining why. */
+    downgradedFrom?: Severity;
+    downgradeReason?: string;
+}
+/** A finding carrying its fingerprint, for briefs and ledger bookkeeping. */
+export type IdentifiedFinding = Finding & {
+    id: string;
+};
+/** Proof that a model inspected a defect's whole equivalence class. */
+export interface ClassAnalysis {
+    subject: string;
+    scope: "isolated" | "systemic";
+    rootCause: string;
+    affectedSubjects: string[];
+    checkedSubjects: string[];
+    completenessBasis: string;
+}
+export declare function identify(finding: Finding): IdentifiedFinding;
+/**
+ * Critics recurrently merge criteria that share a root cause into one subject
+ * ("SC-05/SC-06"). The repair is a deterministic split — one subject per
+ * SC-id — so it happens here rather than by burning a correction retry on a
+ * transformation code can perform. A non-compound subject passes through as a
+ * one-element list.
+ */
+export declare function splitCriterionSubjects(subject: string): string[];
+/**
+ * Collapse incidental spelling differences without merging distinct subjects.
+ * Also the matching key wherever one model must reference subjects another
+ * model authored (e.g. replan resolution proofs against critic class
+ * analyses) — cross-model references must never fail on case or punctuation.
+ */
+export declare function normalizeSubject(subject: string): string;
+/**
+ * Stable identity across rounds: category + workstream + normalized subject.
+ * Deliberately excludes `message`, `severity`, and line numbers — a finding
+ * re-raised in different words, at a different severity, after the file has
+ * shifted by a few lines is the *same* finding, and the loop must see it that
+ * way to detect a round that produced nothing new.
+ */
+export declare function fingerprint(finding: Finding): string;
+export declare function isGateFailing(finding: Finding, strict: boolean): boolean;
+/** Blockers and majors are what keep the loop running; minors never do. */
+export declare function haltsConvergence(finding: Finding): boolean;
+export declare function countBySeverity(findings: readonly Finding[]): Record<Severity, number>;
+export declare function sortBySeverity(findings: readonly Finding[]): Finding[];
+/** Convenience constructors keep deterministic call sites terse. */
+export declare const at: (file: string, startLine: number, endLine?: number) => Evidence;
+export declare const because: (named: string, detail?: string) => Evidence;
+export declare const measured: (metric: "lineCount" | "fileCount", value: number) => Evidence;
+//# sourceMappingURL=findings.d.ts.map

package/dist/findings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"findings.d.ts","sourceRoot":"","sources":["../src/findings.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,MAAM,QAAQ,GAAG,SAAS,GAAG,OAAO,GAAG,OAAO,GAAG,UAAU,CAAC;AAElE,eAAO,MAAM,cAAc,EAAE,SAAS,QAAQ,EAKpC,CAAC;AAEX;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,8KAWrB,CAAC;AAEX,MAAM,MAAM,eAAe,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAElE;;;GAGG;AACH,MAAM,MAAM,QAAQ,GAChB;IACE,IAAI,EAAE,UAAU,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB,GACD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,GACnD;IACE,IAAI,EAAE,aAAa,CAAC;IACpB,MAAM,EAAE,WAAW,GAAG,WAAW,CAAC;IAClC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEN,MAAM,WAAW,OAAO;IACtB,QAAQ,EAAE,QAAQ,CAAC;IACnB,QAAQ,EAAE,eAAe,CAAC;IAC1B,gFAAgF;IAChF,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;OAIG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;OAKG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,kEAAkE;IAClE,cAAc,CAAC,EAAE,QAAQ,CAAC;IAC1B,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,6EAA6E;AAC7E,MAAM,MAAM,iBAAiB,GAAG,OAAO,GAAG;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAEzD,uEAAuE;AACvE,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,UAAU,GAAG,UAAU,CAAC;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED,wBAAgB,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,iBAAiB,CAE5D;AAID;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,CAIhE;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAQxD;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CAOpD;AAED,wBAAgB,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO,CAIxE;AAED,2EAA2E;AAC3E,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAE1D;AAED,wBAAgB,eAAe,CAC7B,QAAQ,EAAE,SAAS,OAAO,EAAE,GAC3B,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAS1B;AAED,wBAAgB,cAAc,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE,GAAG,OAAO,EAAE,CAKtE;AAED,oEAAoE;AACpE,eAAO,MAAM,EAAE,GACb,MAAM,MAAM,EACZ,WAAW,MAAM,EACjB,UAAU,MAAM,KACf,QAKD,CAAC;AAEH,eAAO,MAAM,OAAO,GAAI,OAAO,MAAM,EAAE,SAAS,MAAM,KAAG,QAIvD,CAAC;AAEH,eAAO,MAAM,QAAQ,GACnB,QAAQ,WAAW,GAAG,WAAW,EACjC,OAAO,MAAM,KACZ,QAAoD,CAAC"}

package/dist/findings.js

@@ -0,0 +1,107 @@
+import { createHash } from "node:crypto";
+export const SEVERITY_ORDER = [
+    "blocker",
+    "major",
+    "minor",
+    "advisory",
+];
+/**
+ * A closed set, because finding identity is built from the category and the
+ * subject rather than from the prose. A critic that rewords an objection must
+ * not thereby create a "new" finding — that is what prevents the loop from
+ * oscillating forever between rounds.
+ */
+export const FINDING_CATEGORIES = [
+    "manifest",
+    "coverage",
+    "traceability",
+    "dependency",
+    "spec-format",
+    "interface-contract",
+    "test-quality",
+    "acceptance-criteria",
+    "redundancy",
+    "scope-structure",
+];
+export function identify(finding) {
+    return { ...finding, id: fingerprint(finding) };
+}
+const COMPOUND_CRITERION_SUBJECT = /^SC-\d+(?:\s*[/,+&]\s*SC-\d+)+$/u;
+/**
+ * Critics recurrently merge criteria that share a root cause into one subject
+ * ("SC-05/SC-06"). The repair is a deterministic split — one subject per
+ * SC-id — so it happens here rather than by burning a correction retry on a
+ * transformation code can perform. A non-compound subject passes through as a
+ * one-element list.
+ */
+export function splitCriterionSubjects(subject) {
+    const trimmed = subject.trim();
+    if (!COMPOUND_CRITERION_SUBJECT.test(trimmed))
+        return [trimmed];
+    return [...new Set(trimmed.split(/\s*[/,+&]\s*/u))];
+}
+/**
+ * Collapse incidental spelling differences without merging distinct subjects.
+ * Also the matching key wherever one model must reference subjects another
+ * model authored (e.g. replan resolution proofs against critic class
+ * analyses) — cross-model references must never fail on case or punctuation.
+ */
+export function normalizeSubject(subject) {
+    return subject
+        .toLowerCase()
+        .normalize("NFKD")
+        .replace(/[̀-ͯ]/gu, "")
+        .replace(/[`"'*_]/gu, "")
+        .replace(/[^a-z0-9]+/gu, " ")
+        .trim();
+}
+/**
+ * Stable identity across rounds: category + workstream + normalized subject.
+ * Deliberately excludes `message`, `severity`, and line numbers — a finding
+ * re-raised in different words, at a different severity, after the file has
+ * shifted by a few lines is the *same* finding, and the loop must see it that
+ * way to detect a round that produced nothing new.
+ */
+export function fingerprint(finding) {
+    const parts = [
+        finding.category,
+        finding.workstreamId ?? "",
+        normalizeSubject(finding.subject),
+    ];
+    return createHash("sha256").update(parts.join("|")).digest("hex").slice(0, 16);
+}
+export function isGateFailing(finding, strict) {
+    return (finding.severity === "blocker" || (strict && finding.severity === "major"));
+}
+/** Blockers and majors are what keep the loop running; minors never do. */
+export function haltsConvergence(finding) {
+    return finding.severity === "blocker" || finding.severity === "major";
+}
+export function countBySeverity(findings) {
+    const counts = {
+        blocker: 0,
+        major: 0,
+        minor: 0,
+        advisory: 0,
+    };
+    for (const finding of findings)
+        counts[finding.severity] += 1;
+    return counts;
+}
+export function sortBySeverity(findings) {
+    return [...findings].sort((a, b) => SEVERITY_ORDER.indexOf(a.severity) - SEVERITY_ORDER.indexOf(b.severity));
+}
+/** Convenience constructors keep deterministic call sites terse. */
+export const at = (file, startLine, endLine) => ({
+    kind: "location",
+    file,
+    startLine,
+    ...(endLine === undefined ? {} : { endLine }),
+});
+export const because = (named, detail) => ({
+    kind: "concern",
+    named,
+    ...(detail === undefined ? {} : { detail }),
+});
+export const measured = (metric, value) => ({ kind: "measurement", metric, value });
+//# sourceMappingURL=findings.js.map

package/dist/findings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findings.js","sourceRoot":"","sources":["../src/findings.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAQzC,MAAM,CAAC,MAAM,cAAc,GAAwB;IACjD,SAAS;IACT,OAAO;IACP,OAAO;IACP,UAAU;CACF,CAAC;AAEX;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,UAAU;IACV,UAAU;IACV,cAAc;IACd,YAAY;IACZ,aAAa;IACb,oBAAoB;IACpB,cAAc;IACd,qBAAqB;IACrB,YAAY;IACZ,iBAAiB;CACT,CAAC;AA+DX,MAAM,UAAU,QAAQ,CAAC,OAAgB;IACvC,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC;AAClD,CAAC;AAED,MAAM,0BAA0B,GAAG,kCAAkC,CAAC;AAEtE;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAe;IACpD,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IAChE,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,OAAO,OAAO;SACX,WAAW,EAAE;SACb,SAAS,CAAC,MAAM,CAAC;SACjB,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;SACtB,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;SACxB,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,OAAgB;IAC1C,MAAM,KAAK,GAAG;QACZ,OAAO,CAAC,QAAQ;QAChB,OAAO,CAAC,YAAY,IAAI,EAAE;QAC1B,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC;KAClC,CAAC;IACF,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACjF,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,OAAgB,EAAE,MAAe;IAC7D,OAAO,CACL,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC,CAC3E,CAAC;AACJ,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,gBAAgB,CAAC,OAAgB;IAC/C,OAAO,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC;AACxE,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,QAA4B;IAE5B,MAAM,MAAM,GAA6B;QACvC,OAAO,EAAE,CAAC;QACV,KAAK,EAAE,CAAC;QACR,KAAK,EAAE,CAAC;QACR,QAAQ,EAAE,CAAC;KACZ,CAAC;IACF,KAAK,MAAM,OAAO,IAAI,QAAQ;QAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,QAA4B;IACzD,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CACvB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAC1E,CAAC;AACJ,CAAC;AAED,oEAAoE;AACpE,MAAM,CAAC,MAAM,EAAE,GAAG,CAChB,IAAY,EACZ,SAAiB,EACjB,OAAgB,EACN,EAAE,CAAC,CAAC;IACd,IAAI,EAAE,UAAU;IAChB,IAAI;IACJ,SAAS;IACT,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;CAC9C,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,MAAe,EAAY,EAAE,CAAC,CAAC;IACpE,IAAI,EAAE,SAAS;IACf,KAAK;IACL,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5C,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,MAAiC,EACjC,KAAa,EACH,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC"}

package/dist/graph.d.ts

@@ -0,0 +1,30 @@
+export interface GraphNode {
+    id: string;
+    dependencies: string[];
+}
+/**
+ * Dependency-first order that preserves input order whenever multiple nodes
+ * are ready. Dependencies that do not exist in the graph are ignored here;
+ * validation reports them separately as blockers.
+ */
+export declare function stableTopologicalOrder<T extends GraphNode>(nodes: T[]): T[];
+/**
+ * The same dependency-first ordering as {@link stableTopologicalOrder}, but
+ * grouped into levels: every node in a level has all of its known
+ * dependencies satisfied by an earlier level, so a whole level can be
+ * processed concurrently.
+ *
+ * Authoring uses this instead of the flat order because a flat fan-out
+ * authors dependent workstreams in isolation from each other, and two
+ * specs written that way disagree about the interface between them. Walking
+ * levels lets each author read the finished specs of what it depends on,
+ * while independent workstreams still run at the same time — only genuine
+ * dependency chains serialize.
+ *
+ * Input order is preserved within each level, matching the stable ordering's
+ * behavior. Dependencies outside the graph are ignored here; validation
+ * reports them separately as blockers.
+ */
+export declare function topologicalLevels<T extends GraphNode>(nodes: T[]): T[][];
+export declare function findCycles(nodes: GraphNode[]): string[][];
+//# sourceMappingURL=graph.d.ts.map

package/dist/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,SAAS,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAyB3E;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CA2BxE;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,MAAM,EAAE,EAAE,CAwBzD"}

package/dist/graph.js

@@ -0,0 +1,87 @@
+/**
+ * Dependency-first order that preserves input order whenever multiple nodes
+ * are ready. Dependencies that do not exist in the graph are ignored here;
+ * validation reports them separately as blockers.
+ */
+export function stableTopologicalOrder(nodes) {
+    const known = new Set(nodes.map(({ id }) => id));
+    const done = new Set();
+    const remaining = [...nodes];
+    const ordered = [];
+    while (remaining.length > 0) {
+        const index = remaining.findIndex((node) => node.dependencies.every((dependency) => done.has(dependency) || !known.has(dependency)));
+        if (index < 0) {
+            const blocked = remaining.map(({ id }) => id).join(", ");
+            throw new Error(`Cannot resolve dependency order; check for cycles among: ${blocked}`);
+        }
+        const next = remaining[index];
+        remaining.splice(index, 1);
+        ordered.push(next);
+        done.add(next.id);
+    }
+    return ordered;
+}
+/**
+ * The same dependency-first ordering as {@link stableTopologicalOrder}, but
+ * grouped into levels: every node in a level has all of its known
+ * dependencies satisfied by an earlier level, so a whole level can be
+ * processed concurrently.
+ *
+ * Authoring uses this instead of the flat order because a flat fan-out
+ * authors dependent workstreams in isolation from each other, and two
+ * specs written that way disagree about the interface between them. Walking
+ * levels lets each author read the finished specs of what it depends on,
+ * while independent workstreams still run at the same time — only genuine
+ * dependency chains serialize.
+ *
+ * Input order is preserved within each level, matching the stable ordering's
+ * behavior. Dependencies outside the graph are ignored here; validation
+ * reports them separately as blockers.
+ */
+export function topologicalLevels(nodes) {
+    const known = new Set(nodes.map(({ id }) => id));
+    const done = new Set();
+    let remaining = [...nodes];
+    const levels = [];
+    while (remaining.length > 0) {
+        // Computed against `done` as it stood before this level, so a node can
+        // never land in the same level as something it depends on.
+        const ready = remaining.filter((node) => node.dependencies.every((dependency) => done.has(dependency) || !known.has(dependency)));
+        if (ready.length === 0) {
+            const blocked = remaining.map(({ id }) => id).join(", ");
+            throw new Error(`Cannot resolve dependency order; check for cycles among: ${blocked}`);
+        }
+        levels.push(ready);
+        const placed = new Set(ready.map(({ id }) => id));
+        for (const id of placed)
+            done.add(id);
+        remaining = remaining.filter(({ id }) => !placed.has(id));
+    }
+    return levels;
+}
+export function findCycles(nodes) {
+    const graph = new Map(nodes.map((node) => [node.id, node.dependencies]));
+    const visiting = new Set();
+    const visited = new Set();
+    const cycles = [];
+    function visit(id, path) {
+        if (visiting.has(id)) {
+            const start = path.indexOf(id);
+            cycles.push([...path.slice(start), id]);
+            return;
+        }
+        if (visited.has(id))
+            return;
+        visiting.add(id);
+        for (const dependency of graph.get(id) ?? []) {
+            if (graph.has(dependency))
+                visit(dependency, [...path, id]);
+        }
+        visiting.delete(id);
+        visited.add(id);
+    }
+    for (const id of graph.keys())
+        visit(id, []);
+    return cycles;
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAKA;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAsB,KAAU;IACpE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC7B,MAAM,OAAO,GAAQ,EAAE,CAAC;IAExB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CACzC,IAAI,CAAC,YAAY,CAAC,KAAK,CACrB,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAC/D,CACF,CAAC;QACF,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzD,MAAM,IAAI,KAAK,CACb,4DAA4D,OAAO,EAAE,CACtE,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,CAAM,CAAC;QACnC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,iBAAiB,CAAsB,KAAU;IAC/D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAU,EAAE,CAAC;IAEzB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,uEAAuE;QACvE,2DAA2D;QAC3D,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CACtC,IAAI,CAAC,YAAY,CAAC,KAAK,CACrB,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAC/D,CACF,CAAC;QACF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzD,MAAM,IAAI,KAAK,CACb,4DAA4D,OAAO,EAAE,CACtE,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,KAAK,MAAM,EAAE,IAAI,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAkB;IAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,SAAS,KAAK,CAAC,EAAU,EAAE,IAAc;QACvC,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACxC,OAAO;QACT,CAAC;QACD,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QAE5B,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,KAAK,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,EAAE;QAAE,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7C,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,10 @@
+export * from "./config.js";
+export * from "./agent-runner.js";
+export * from "./agent-summary.js";
+export * from "./graph.js";
+export * from "./findings.js";
+export * from "./project-manifest.js";
+export * from "./program-memory.js";
+export * from "./worktree-guard.js";
+export * from "./detect-package-manager.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,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,6BAA6B,CAAC"}

package/dist/index.js

@@ -0,0 +1,10 @@
+export * from "./config.js";
+export * from "./agent-runner.js";
+export * from "./agent-summary.js";
+export * from "./graph.js";
+export * from "./findings.js";
+export * from "./project-manifest.js";
+export * from "./program-memory.js";
+export * from "./worktree-guard.js";
+export * from "./detect-package-manager.js";
+//# 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,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,YAAY,CAAC;AAC3B,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,6BAA6B,CAAC"}