@dewtech/dare-cli 2.15.0 → 2.17.0

package/dist/utils/UpdateDetector.js

@@ -0,0 +1,164 @@
+/**
+ * Detects what `dare update` needs to do for a given project.
+ *
+ * Pure planning — it never writes to disk. Loads the manifest, reads the
+ * project's `dare.config.json`, and produces an `UpdatePlan` the applier can
+ * execute (or the dev can simply preview with `--dry-run`).
+ */
+import fs from 'fs-extra';
+import path from 'path';
+import crypto from 'crypto';
+import { createRequire } from 'module';
+import { fileURLToPath } from 'url';
+import { compareVersions, isNewerThan, sortVersionsAscending, } from './version-compare.js';
+const require = createRequire(import.meta.url);
+/** Path to `templates/UPDATE-MANIFEST.json`, shipped with the CLI. */
+function getManifestPath() {
+    // `import.meta.url` resolves to .../dist/utils/UpdateDetector.js once built.
+    // The manifest lives at .../templates/UPDATE-MANIFEST.json, two levels up.
+    const here = fileURLToPath(import.meta.url);
+    return path.resolve(path.dirname(here), '..', '..', 'templates', 'UPDATE-MANIFEST.json');
+}
+export async function loadManifest() {
+    const manifestPath = getManifestPath();
+    if (!(await fs.pathExists(manifestPath))) {
+        throw new Error(`UPDATE-MANIFEST.json not found at ${manifestPath}`);
+    }
+    const data = (await fs.readJSON(manifestPath));
+    if (data.schemaVersion !== 1) {
+        throw new Error(`Unsupported manifest schemaVersion ${data.schemaVersion} (this CLI understands 1).`);
+    }
+    return data;
+}
+/** Read the current CLI version from the bundled `package.json`. */
+export function getCliVersion() {
+    const pkg = require('../../package.json');
+    return pkg.version;
+}
+/**
+ * Legacy `dare init` versions (pre-2.17) wrote a hardcoded `"0.1.0"` placeholder
+ * that nothing read. Treat it as "this project was never tracked" — the update
+ * flow will assume the project is on 2.16.0 (the last release before this field
+ * carried meaning) and run the unification migration.
+ */
+const LEGACY_PLACEHOLDER_VERSION = '0.1.0';
+/** Baseline assumed for projects with the legacy placeholder or no `version`. */
+export const LEGACY_BASELINE_VERSION = '2.16.0';
+/**
+ * Resolve the "effective DARE version" of a project, handling the legacy
+ * `"0.1.0"` placeholder that was hardcoded by pre-2.17 `dare init`.
+ */
+export function resolveProjectVersion(cfg) {
+    const raw = cfg.version;
+    if (!raw || raw === LEGACY_PLACEHOLDER_VERSION) {
+        return { version: LEGACY_BASELINE_VERSION, isLegacy: true };
+    }
+    return { version: raw, isLegacy: false };
+}
+/** Load and return `dare.config.json` from the given project root. */
+export async function readProjectConfig(projectRoot) {
+    const configPath = path.join(projectRoot, 'dare.config.json');
+    if (!(await fs.pathExists(configPath))) {
+        throw new Error(`dare.config.json not found in ${projectRoot}. Is this a DARE project? Run \`dare init\` first.`);
+    }
+    return (await fs.readJSON(configPath));
+}
+/**
+ * Filter a single change against the IDE configured for this project. A change
+ * with `appliesTo: ['*']` (or no `appliesTo`) is universal.
+ *
+ * Hybrid setups (`hybrid` = cursor+antigravity, `claude-hybrid` = claude+cursor)
+ * accept changes targeted at any of their member IDEs.
+ */
+export function changeAppliesToIde(change, ide) {
+    const targets = change.appliesTo ?? ['*'];
+    if (targets.includes('*'))
+        return true;
+    if (!ide)
+        return false;
+    if (targets.includes(ide))
+        return true;
+    // Hybrid expansions
+    if (ide === 'hybrid') {
+        return targets.includes('cursor') || targets.includes('antigravity');
+    }
+    if (ide === 'claude-hybrid') {
+        return targets.includes('claude-code') || targets.includes('cursor');
+    }
+    return false;
+}
+/**
+ * Build the update plan: every release between `from` (exclusive) and `to`
+ * (inclusive), with its changes filtered down to what applies to this IDE.
+ */
+export function buildUpdatePlan(manifest, fromVersion, toVersion, ide) {
+    const allVersions = Object.keys(manifest.releases);
+    const sorted = sortVersionsAscending(allVersions);
+    const pending = sorted.filter((v) => {
+        const newerThanFrom = isNewerThan(v, fromVersion);
+        const notNewerThanTo = compareVersions(v, toVersion) !== 1;
+        return newerThanFrom && notNewerThanTo;
+    });
+    const pendingReleases = pending.map((version) => ({
+        version,
+        release: manifest.releases[version],
+    }));
+    const applicableChanges = [];
+    for (const { release } of pendingReleases) {
+        for (const change of release.changes) {
+            if (changeAppliesToIde(change, ide)) {
+                applicableChanges.push(change);
+            }
+        }
+    }
+    return {
+        fromVersion,
+        toVersion,
+        pendingReleases,
+        applicableChanges,
+    };
+}
+/** SHA-256 hex digest of file content; returns `null` if the file is absent. */
+export async function hashFile(absPath) {
+    if (!(await fs.pathExists(absPath)))
+        return null;
+    const buf = await fs.readFile(absPath);
+    return crypto.createHash('sha256').update(buf).digest('hex');
+}
+/**
+ * Classify what we'd be doing to a single file on disk:
+ *   - `identical`  → new template content already matches what's on disk
+ *   - `missing`    → file absent in the project, safe to create
+ *   - `apply`      → file present and matches `previousHash`, safe to overwrite
+ *   - `customized` → file present but doesn't match `previousHash`; ask the dev
+ *
+ * `newContent` is the bytes we'd write; `previousHash` is the manifest's record
+ * of what the file looked like in the prior version (optional — without it we
+ * can't tell `apply` from `customized` and conservatively return `customized`).
+ */
+export async function classifyChange(projectRoot, change, newContent) {
+    // Schema-only changes (path includes `#`) are handled by migrations,
+    // not by file copy. Treat them as `apply`.
+    if (change.path.includes('#'))
+        return 'apply';
+    const target = path.join(projectRoot, change.path);
+    const currentHash = await hashFile(target);
+    if (change.type === 'removed') {
+        return currentHash === null ? 'identical' : 'apply';
+    }
+    if (currentHash === null)
+        return 'missing';
+    if (newContent !== null) {
+        const newHash = crypto
+            .createHash('sha256')
+            .update(typeof newContent === 'string' ? Buffer.from(newContent) : newContent)
+            .digest('hex');
+        if (newHash === currentHash)
+            return 'identical';
+    }
+    if (change.previousHash && currentHash === change.previousHash) {
+        return 'apply';
+    }
+    return 'customized';
+}
+//# sourceMappingURL=UpdateDetector.js.map

package/dist/utils/UpdateDetector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UpdateDetector.js","sourceRoot":"","sources":["../../src/utils/UpdateDetector.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,UAAU,CAAC;AAC1B,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAC;AAQpC,OAAO,EACL,eAAe,EACf,WAAW,EACX,qBAAqB,GACtB,MAAM,sBAAsB,CAAC;AAE9B,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAE/C,sEAAsE;AACtE,SAAS,eAAe;IACtB,6EAA6E;IAC7E,2EAA2E;IAC3E,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,sBAAsB,CAAC,CAAC;AAC3F,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY;IAChC,MAAM,YAAY,GAAG,eAAe,EAAE,CAAC;IACvC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,qCAAqC,YAAY,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAmB,CAAC;IACjE,IAAI,IAAI,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CACb,sCAAsC,IAAI,CAAC,aAAa,4BAA4B,CACrF,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,aAAa;IAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,oBAAoB,CAAwB,CAAC;IACjE,OAAO,GAAG,CAAC,OAAO,CAAC;AACrB,CAAC;AAQD;;;;;GAKG;AACH,MAAM,0BAA0B,GAAG,OAAO,CAAC;AAC3C,iFAAiF;AACjF,MAAM,CAAC,MAAM,uBAAuB,GAAG,QAAQ,CAAC;AAEhD;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,GAAkB;IAItD,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC;IACxB,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK,0BAA0B,EAAE,CAAC;QAC/C,OAAO,EAAE,OAAO,EAAE,uBAAuB,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC3C,CAAC;AAED,sEAAsE;AACtE,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,WAAmB;IACzD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC;IAC9D,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CACb,iCAAiC,WAAW,oDAAoD,CACjG,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAkB,CAAC;AAC1D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAsB,EAAE,GAAuB;IAChF,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1C,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IAEvB,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAgB,CAAC;QAAE,OAAO,IAAI,CAAC;IAEpD,oBAAoB;IACpB,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;QACrB,OAAO,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,GAAG,KAAK,eAAe,EAAE,CAAC;QAC5B,OAAO,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,QAAwB,EACxB,WAAmB,EACnB,SAAiB,EACjB,GAAuB;IAEvB,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;IAElD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,MAAM,aAAa,GAAG,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QAClD,MAAM,cAAc,GAAG,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QAC3D,OAAO,aAAa,IAAI,cAAc,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChD,OAAO;QACP,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC;KACpC,CAAC,CAAC,CAAC;IAEJ,MAAM,iBAAiB,GAAqB,EAAE,CAAC;IAC/C,KAAK,MAAM,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;QAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACrC,IAAI,kBAAkB,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBACpC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,WAAW;QACX,SAAS;QACT,eAAe;QACf,iBAAiB;KAClB,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAAe;IAC5C,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACjD,MAAM,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACvC,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,WAAmB,EACnB,MAAsB,EACtB,UAAkC;IAElC,qEAAqE;IACrE,2CAA2C;IAC3C,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,OAAO,CAAC;IAE9C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,CAAC;IAE3C,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;IACtD,CAAC;IAED,IAAI,WAAW,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IAE3C,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,MAAM;aACnB,UAAU,CAAC,QAAQ,CAAC;aACpB,MAAM,CAAC,OAAO,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;aAC7E,MAAM,CAAC,KAAK,CAAC,CAAC;QACjB,IAAI,OAAO,KAAK,WAAW;YAAE,OAAO,WAAW,CAAC;IAClD,CAAC;IAED,IAAI,MAAM,CAAC,YAAY,IAAI,WAAW,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC;QAC/D,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/dist/utils/complexity-analyzer.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Deterministic complexity heuristic for `dare refine`.
+ *
+ * Scans a task spec for signals that correlate with implementation effort
+ * and aggregates them into a single score → bucket. The breakdown is
+ * preserved so the CLI / agent can explain *why* a task scored high.
+ *
+ * Signals (weights tuned empirically — start conservative; bump as we learn):
+ *   - Files to create/modify (1 each, cap at 10)
+ *   - Public functions/endpoints declared in spec (1.5 each, cap at 10)
+ *   - Test cases listed (0.5 each, cap at 8)
+ *   - Inbound dependencies in dare-dag.yaml (0.5 each, no cap)
+ *   - "Heavy" keywords in prompt/spec (+2 each: refactor, migrate, integrate,
+ *     multiple, audit, replace, rewrite, parallelize, cross-cutting)
+ *   - HIGH complexity declared by author (+3 baseline)
+ *
+ * Buckets:
+ *   0–5    → LOW
+ *   6–12   → MED
+ *   13–20  → HIGH       ← recommends split
+ *   21+    → CRITICAL   ← strongly recommends split
+ *
+ * The thresholds are tunable via `dare.config.json#refine.thresholds` (see
+ * Frente 4) — defaults below.
+ */
+import type { ComplexityLevel, ComplexityReport, SplitProposal } from '../types/Refine.types.js';
+export interface ComplexityThresholds {
+    low: number;
+    med: number;
+    high: number;
+}
+export declare const DEFAULT_THRESHOLDS: ComplexityThresholds;
+export declare function levelFromScore(score: number, thresholds?: ComplexityThresholds): ComplexityLevel;
+export interface AnalyzeOptions {
+    /** Override default thresholds (e.g. from dare.config.json#refine). */
+    thresholds?: ComplexityThresholds;
+    /** Extra `depends_on` count from `dare-dag.yaml` (optional — caller resolves). */
+    dependsOnCount?: number;
+}
+/**
+ * Build a complexity report for a single task. Returns `null` if the spec
+ * can't be found, so the caller can produce a user-friendly error.
+ */
+export declare function analyzeTaskComplexity(taskId: string, projectRoot: string, options?: AnalyzeOptions): Promise<ComplexityReport | null>;
+/**
+ * Produce a coarse split proposal. The algorithm:
+ *   1. Group files by top-level directory (e.g. `src/auth/*` vs `tests/*`
+ *      vs `migrations/*`).
+ *   2. Each group becomes a candidate sub-task. If a group has more than
+ *      `maxFilesPerSubtask` files, split it further alphabetically.
+ *   3. Generate suffixed ids: `task-034a`, `task-034b`, ...
+ *
+ * Intentionally not too clever — the IDE agent (via the `dare-refine` skill)
+ * is expected to refine this with semantic awareness. The CLI proposal is
+ * a sane default that gets it 70% of the way there.
+ */
+export declare function proposeSplit(taskId: string, files: string[], options?: {
+    maxFilesPerSubtask?: number;
+}): SplitProposal;
+//# sourceMappingURL=complexity-analyzer.d.ts.map

package/dist/utils/complexity-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-analyzer.d.ts","sourceRoot":"","sources":["../../src/utils/complexity-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAKH,OAAO,KAAK,EACV,eAAe,EACf,gBAAgB,EAGhB,aAAa,EACd,MAAM,0BAA0B,CAAC;AAIlC,MAAM,WAAW,oBAAoB;IACnC,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;CACd;AAED,eAAO,MAAM,kBAAkB,EAAE,oBAIhC,CAAC;AA+GF,wBAAgB,cAAc,CAC5B,KAAK,EAAE,MAAM,EACb,UAAU,GAAE,oBAAyC,GACpD,eAAe,CAKjB;AAID,MAAM,WAAW,cAAc;IAC7B,uEAAuE;IACvE,UAAU,CAAC,EAAE,oBAAoB,CAAC;IAClC,kFAAkF;IAClF,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,wBAAsB,qBAAqB,CACzC,MAAM,EAAE,MAAM,EACd,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE,cAAmB,GAC3B,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAuFlC;AAID;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EAAE,EACf,OAAO,GAAE;IAAE,kBAAkB,CAAC,EAAE,MAAM,CAAA;CAAO,GAC5C,aAAa,CAoDf"}

package/dist/utils/complexity-analyzer.js

@@ -0,0 +1,292 @@
+/**
+ * Deterministic complexity heuristic for `dare refine`.
+ *
+ * Scans a task spec for signals that correlate with implementation effort
+ * and aggregates them into a single score → bucket. The breakdown is
+ * preserved so the CLI / agent can explain *why* a task scored high.
+ *
+ * Signals (weights tuned empirically — start conservative; bump as we learn):
+ *   - Files to create/modify (1 each, cap at 10)
+ *   - Public functions/endpoints declared in spec (1.5 each, cap at 10)
+ *   - Test cases listed (0.5 each, cap at 8)
+ *   - Inbound dependencies in dare-dag.yaml (0.5 each, no cap)
+ *   - "Heavy" keywords in prompt/spec (+2 each: refactor, migrate, integrate,
+ *     multiple, audit, replace, rewrite, parallelize, cross-cutting)
+ *   - HIGH complexity declared by author (+3 baseline)
+ *
+ * Buckets:
+ *   0–5    → LOW
+ *   6–12   → MED
+ *   13–20  → HIGH       ← recommends split
+ *   21+    → CRITICAL   ← strongly recommends split
+ *
+ * The thresholds are tunable via `dare.config.json#refine.thresholds` (see
+ * Frente 4) — defaults below.
+ */
+import fs from 'fs-extra';
+import path from 'path';
+import { findSpecFile, parseFilesFromSpec } from './ReviewRunner.js';
+export const DEFAULT_THRESHOLDS = {
+    low: 5,
+    med: 12,
+    high: 20,
+};
+/** Maximum contribution from any single signal — keeps the score bounded. */
+const SIGNAL_CAPS = {
+    files: 10,
+    functions: 10,
+    tests: 8,
+};
+/** Weights per occurrence. */
+const WEIGHTS = {
+    perFile: 1,
+    perFunction: 1.5,
+    perTest: 0.5,
+    perDependency: 0.5,
+    heavyKeyword: 2,
+    authorDeclaredHigh: 3,
+};
+/** Keywords that historically correlate with "this is bigger than it looks". */
+const HEAVY_KEYWORDS = [
+    'refactor',
+    'refatorar',
+    'migrate',
+    'migrar',
+    'migração',
+    'integrate',
+    'integrar',
+    'integração',
+    'multiple',
+    'múltiplos',
+    'audit',
+    'auditar',
+    'replace',
+    'substituir',
+    'rewrite',
+    'reescrever',
+    'parallelize',
+    'paralelizar',
+    'cross-cutting',
+    'orchestrate',
+    'orquestrar',
+];
+// ── Signal extractors ────────────────────────────────────────────────────────
+/**
+ * Count public functions/endpoints declared in the spec. We look at:
+ *   - "Implementar `POST /…`" style mentions
+ *   - "função `name()`" / "function `name()`"
+ *   - Code-fence assinaturas (`fn x() -> ...`, `function x()`, `def x()`)
+ *
+ * Imperfect, but consistent — the test for refinement is "does this slope
+ * up monotonically with effort?", not "is this exact?".
+ */
+function countDeclaredFunctions(specMarkdown) {
+    const patterns = [
+        // HTTP verbs inside backticks: `POST /auth/login`, `GET /users/:id`
+        /`(GET|POST|PUT|PATCH|DELETE|HEAD|OPTIONS)\s+\/[^`]+`/gi,
+        // Function-like in backticks: `name()`, `name(arg: Type)`
+        /`\w+\s*\([^)]*\)`/g,
+        // Inline `fn x(...)` / `function x(...)` / `def x(...)` / `func x(...)`
+        /\b(function|fn|func|def|method)\s+\w+\s*\(/g,
+    ];
+    let total = 0;
+    for (const re of patterns) {
+        const matches = specMarkdown.match(re);
+        if (matches)
+            total += matches.length;
+    }
+    // Deduplicate-ish: a single endpoint may match both verb pattern and code-block.
+    // Halve to avoid double-counting; floor so a single hit still counts as 1.
+    return Math.max(1, Math.floor(total / 2));
+}
+/**
+ * Count test cases listed in the spec. We look at checkbox-style entries
+ * under the "Testes" / "Testing" section and `should_*` / `it(...)` names.
+ */
+function countDeclaredTests(specMarkdown) {
+    const patterns = [
+        /^\s*-\s*\[\s*\]\s*(Teste|Test)\b/gim,
+        /\bshould_[a-z_]+/g,
+        /\bit\(['"]/g,
+    ];
+    let total = 0;
+    for (const re of patterns) {
+        const matches = specMarkdown.match(re);
+        if (matches)
+            total += matches.length;
+    }
+    return total;
+}
+/** Count occurrences of heavy keywords (case-insensitive, word-boundary). */
+function countHeavyKeywords(specMarkdown) {
+    const lower = specMarkdown.toLowerCase();
+    let total = 0;
+    for (const kw of HEAVY_KEYWORDS) {
+        const re = new RegExp(`\\b${kw.toLowerCase()}\\b`, 'g');
+        const matches = lower.match(re);
+        if (matches)
+            total += matches.length;
+    }
+    return total;
+}
+/** Parse `**Complexidade:** HIGH` or similar from the spec header. */
+function authorDeclaredHigh(specMarkdown) {
+    return /\*\*Complexidade:\*\*\s*HIGH/i.test(specMarkdown);
+}
+// ── Bucket selection ─────────────────────────────────────────────────────────
+export function levelFromScore(score, thresholds = DEFAULT_THRESHOLDS) {
+    if (score <= thresholds.low)
+        return 'LOW';
+    if (score <= thresholds.med)
+        return 'MED';
+    if (score <= thresholds.high)
+        return 'HIGH';
+    return 'CRITICAL';
+}
+/**
+ * Build a complexity report for a single task. Returns `null` if the spec
+ * can't be found, so the caller can produce a user-friendly error.
+ */
+export async function analyzeTaskComplexity(taskId, projectRoot, options = {}) {
+    const specPath = await findSpecFile(projectRoot, taskId);
+    if (!specPath) {
+        return {
+            taskId,
+            specPath: null,
+            score: 0,
+            level: 'LOW',
+            recommendsSplit: false,
+            signals: [
+                { kind: 'no-spec', weight: 0, detail: 'Spec não encontrada — refinamento ignorado.' },
+            ],
+        };
+    }
+    const md = await fs.readFile(specPath, 'utf-8');
+    const projectRelSpec = path.relative(projectRoot, specPath).replace(/\\/g, '/');
+    const fileCount = parseFilesFromSpec(md).length;
+    const fnCount = countDeclaredFunctions(md);
+    const testCount = countDeclaredTests(md);
+    const kwCount = countHeavyKeywords(md);
+    const deps = options.dependsOnCount ?? 0;
+    const high = authorDeclaredHigh(md);
+    const signals = [];
+    if (fileCount > 0) {
+        const w = Math.min(fileCount, SIGNAL_CAPS.files) * WEIGHTS.perFile;
+        signals.push({
+            kind: 'files',
+            weight: w,
+            detail: `${fileCount} arquivo(s) a criar/modificar`,
+        });
+    }
+    if (fnCount > 0) {
+        const w = Math.min(fnCount, SIGNAL_CAPS.functions) * WEIGHTS.perFunction;
+        signals.push({
+            kind: 'functions',
+            weight: w,
+            detail: `${fnCount} função(ões)/endpoint(s) público(s)`,
+        });
+    }
+    if (testCount > 0) {
+        const w = Math.min(testCount, SIGNAL_CAPS.tests) * WEIGHTS.perTest;
+        signals.push({
+            kind: 'tests',
+            weight: w,
+            detail: `${testCount} teste(s) declarado(s)`,
+        });
+    }
+    if (deps > 0) {
+        signals.push({
+            kind: 'dependencies',
+            weight: deps * WEIGHTS.perDependency,
+            detail: `${deps} dependência(s) (depends_on)`,
+        });
+    }
+    if (kwCount > 0) {
+        signals.push({
+            kind: 'keywords',
+            weight: kwCount * WEIGHTS.heavyKeyword,
+            detail: `${kwCount} palavra-chave(s) "pesada(s)" (refactor/migrate/integrate/...)`,
+        });
+    }
+    if (high) {
+        signals.push({
+            kind: 'author-high',
+            weight: WEIGHTS.authorDeclaredHigh,
+            detail: 'Spec já declarada como HIGH pelo autor',
+        });
+    }
+    signals.sort((a, b) => b.weight - a.weight);
+    const score = signals.reduce((acc, s) => acc + s.weight, 0);
+    const level = levelFromScore(score, options.thresholds ?? DEFAULT_THRESHOLDS);
+    const recommendsSplit = level === 'HIGH' || level === 'CRITICAL';
+    return {
+        taskId,
+        specPath: projectRelSpec,
+        score,
+        level,
+        recommendsSplit,
+        signals,
+    };
+}
+// ── Split proposal ───────────────────────────────────────────────────────────
+/**
+ * Produce a coarse split proposal. The algorithm:
+ *   1. Group files by top-level directory (e.g. `src/auth/*` vs `tests/*`
+ *      vs `migrations/*`).
+ *   2. Each group becomes a candidate sub-task. If a group has more than
+ *      `maxFilesPerSubtask` files, split it further alphabetically.
+ *   3. Generate suffixed ids: `task-034a`, `task-034b`, ...
+ *
+ * Intentionally not too clever — the IDE agent (via the `dare-refine` skill)
+ * is expected to refine this with semantic awareness. The CLI proposal is
+ * a sane default that gets it 70% of the way there.
+ */
+export function proposeSplit(taskId, files, options = {}) {
+    const maxFiles = options.maxFilesPerSubtask ?? 4;
+    if (files.length === 0) {
+        return {
+            originalTaskId: taskId,
+            subtasks: [],
+            notes: 'Nenhum arquivo listado na spec — split automático impossível. ' +
+                'Adicione a tabela "ARQUIVOS A CRIAR / MODIFICAR" ou rode `/dare-refine <id>` para o agente sugerir.',
+        };
+    }
+    // Group by top-level directory (or first 2 segments if same root).
+    const groups = new Map();
+    for (const f of files) {
+        const parts = f.split('/');
+        const key = parts.length >= 2 ? `${parts[0]}/${parts[1]}` : parts[0];
+        if (!groups.has(key))
+            groups.set(key, []);
+        groups.get(key).push(f);
+    }
+    const subtasks = [];
+    let suffixIdx = 0;
+    for (const [groupKey, groupFiles] of groups) {
+        // Split overlarge groups alphabetically.
+        const sorted = [...groupFiles].sort();
+        const chunks = [];
+        for (let i = 0; i < sorted.length; i += maxFiles) {
+            chunks.push(sorted.slice(i, i + maxFiles));
+        }
+        for (const chunk of chunks) {
+            const suffix = String.fromCharCode(97 + suffixIdx); // a, b, c, ...
+            suffixIdx++;
+            subtasks.push({
+                id: `${taskId}${suffix}`,
+                title: `${taskId}${suffix}: ${groupKey}`,
+                files: chunk,
+                rationale: `Slice de ${groupKey} (${chunk.length} arquivo(s)) — cabe em uma conversa.`,
+                estimatedLevel: chunk.length >= maxFiles ? 'MED' : 'LOW',
+            });
+        }
+    }
+    return {
+        originalTaskId: taskId,
+        subtasks,
+        notes: `Split proposto em ${subtasks.length} sub-task(s) agrupando por diretório raiz. ` +
+            `Cada slice fica ≤ ${maxFiles} arquivos. Revise: o agrupamento por diretório é uma heurística — ` +
+            `o agente pode reorganizar se o domínio sugerir slices melhores.`,
+    };
+}
+//# sourceMappingURL=complexity-analyzer.js.map

package/dist/utils/complexity-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-analyzer.js","sourceRoot":"","sources":["../../src/utils/complexity-analyzer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,MAAM,UAAU,CAAC;AAC1B,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAiBrE,MAAM,CAAC,MAAM,kBAAkB,GAAyB;IACtD,GAAG,EAAE,CAAC;IACN,GAAG,EAAE,EAAE;IACP,IAAI,EAAE,EAAE;CACT,CAAC;AAEF,6EAA6E;AAC7E,MAAM,WAAW,GAAG;IAClB,KAAK,EAAE,EAAE;IACT,SAAS,EAAE,EAAE;IACb,KAAK,EAAE,CAAC;CACT,CAAC;AAEF,8BAA8B;AAC9B,MAAM,OAAO,GAAG;IACd,OAAO,EAAE,CAAC;IACV,WAAW,EAAE,GAAG;IAChB,OAAO,EAAE,GAAG;IACZ,aAAa,EAAE,GAAG;IAClB,YAAY,EAAE,CAAC;IACf,kBAAkB,EAAE,CAAC;CACtB,CAAC;AAEF,gFAAgF;AAChF,MAAM,cAAc,GAAG;IACrB,UAAU;IACV,WAAW;IACX,SAAS;IACT,QAAQ;IACR,UAAU;IACV,WAAW;IACX,UAAU;IACV,YAAY;IACZ,UAAU;IACV,WAAW;IACX,OAAO;IACP,SAAS;IACT,SAAS;IACT,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,aAAa;IACb,aAAa;IACb,eAAe;IACf,aAAa;IACb,YAAY;CACb,CAAC;AAEF,gFAAgF;AAEhF;;;;;;;;GAQG;AACH,SAAS,sBAAsB,CAAC,YAAoB;IAClD,MAAM,QAAQ,GAAa;QACzB,oEAAoE;QACpE,wDAAwD;QACxD,0DAA0D;QAC1D,oBAAoB;QACpB,wEAAwE;QACxE,6CAA6C;KAC9C,CAAC;IACF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,OAAO;YAAE,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IACvC,CAAC;IACD,iFAAiF;IACjF,2EAA2E;IAC3E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,YAAoB;IAC9C,MAAM,QAAQ,GAAa;QACzB,qCAAqC;QACrC,mBAAmB;QACnB,aAAa;KACd,CAAC;IACF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,OAAO;YAAE,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,6EAA6E;AAC7E,SAAS,kBAAkB,CAAC,YAAoB;IAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;QAChC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,OAAO;YAAE,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sEAAsE;AACtE,SAAS,kBAAkB,CAAC,YAAoB;IAC9C,OAAO,+BAA+B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;AAC5D,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,cAAc,CAC5B,KAAa,EACb,aAAmC,kBAAkB;IAErD,IAAI,KAAK,IAAI,UAAU,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,KAAK,IAAI,UAAU,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IAC1C,IAAI,KAAK,IAAI,UAAU,CAAC,IAAI;QAAE,OAAO,MAAM,CAAC;IAC5C,OAAO,UAAU,CAAC;AACpB,CAAC;AAWD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,MAAc,EACd,WAAmB,EACnB,UAA0B,EAAE;IAE5B,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACzD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO;YACL,MAAM;YACN,QAAQ,EAAE,IAAI;YACd,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,KAAK;YACZ,eAAe,EAAE,KAAK;YACtB,OAAO,EAAE;gBACP,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,6CAA6C,EAAE;aACtF;SACF,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAChD,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAEhF,MAAM,SAAS,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IAChD,MAAM,OAAO,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,OAAO,CAAC,cAAc,IAAI,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAEpC,MAAM,OAAO,GAAuB,EAAE,CAAC;IAEvC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;QACnE,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,GAAG,SAAS,+BAA+B;SACpD,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC;QACzE,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,WAAW;YACjB,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,GAAG,OAAO,qCAAqC;SACxD,CAAC,CAAC;IACL,CAAC;IACD,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;QACnE,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,GAAG,SAAS,wBAAwB;SAC7C,CAAC,CAAC;IACL,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,cAAc;YACpB,MAAM,EAAE,IAAI,GAAG,OAAO,CAAC,aAAa;YACpC,MAAM,EAAE,GAAG,IAAI,8BAA8B;SAC9C,CAAC,CAAC;IACL,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,UAAU;YAChB,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC,YAAY;YACtC,MAAM,EAAE,GAAG,OAAO,gEAAgE;SACnF,CAAC,CAAC;IACL,CAAC;IACD,IAAI,IAAI,EAAE,CAAC;QACT,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,aAAa;YACnB,MAAM,EAAE,OAAO,CAAC,kBAAkB;YAClC,MAAM,EAAE,wCAAwC;SACjD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE5C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,UAAU,IAAI,kBAAkB,CAAC,CAAC;IAC9E,MAAM,eAAe,GAAG,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,UAAU,CAAC;IAEjE,OAAO;QACL,MAAM;QACN,QAAQ,EAAE,cAAc;QACxB,KAAK;QACL,KAAK;QACL,eAAe;QACf,OAAO;KACR,CAAC;AACJ,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAc,EACd,KAAe,EACf,UAA2C,EAAE;IAE7C,MAAM,QAAQ,GAAG,OAAO,CAAC,kBAAkB,IAAI,CAAC,CAAC;IAEjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,cAAc,EAAE,MAAM;YACtB,QAAQ,EAAE,EAAE;YACZ,KAAK,EACH,gEAAgE;gBAChE,qGAAqG;SACxG,CAAC;IACJ,CAAC;IAED,mEAAmE;IACnE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,IAAI,MAAM,EAAE,CAAC;QAC5C,yCAAyC;QACzC,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC;QACtC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,eAAe;YACnE,SAAS,EAAE,CAAC;YACZ,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,GAAG,MAAM,GAAG,MAAM,EAAE;gBACxB,KAAK,EAAE,GAAG,MAAM,GAAG,MAAM,KAAK,QAAQ,EAAE;gBACxC,KAAK,EAAE,KAAK;gBACZ,SAAS,EAAE,YAAY,QAAQ,KAAK,KAAK,CAAC,MAAM,sCAAsC;gBACtF,cAAc,EAAE,KAAK,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK;aACzD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO;QACL,cAAc,EAAE,MAAM;QACtB,QAAQ;QACR,KAAK,EACH,qBAAqB,QAAQ,CAAC,MAAM,6CAA6C;YACjF,qBAAqB,QAAQ,oEAAoE;YACjG,iEAAiE;KACpE,CAAC;AACJ,CAAC"}

package/dist/utils/excalidraw-renderer.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Excalidraw Renderer for DARE DAG Visualization
+ *
+ * Converts a DARE DAG (task graph) to an Excalidraw JSON file.
+ * - Tasks are rendered as colored rectangles based on complexity
+ * - Dependencies are rendered as arrows
+ * - Tasks are grouped by rank in swim lanes
+ *
+ * Design tokens: /docs/DESIGN-TOKENS-EXCALIDRAW.md
+ * License: AGPL v3 (part of DARE CLI)
+ */
+import { Dag } from '../dag-runner/run_dag.js';
+/**
+ * Excalidraw element types
+ */
+interface ExcalidrawElement {
+    id: string;
+    type: string;
+    x: number;
+    y: number;
+    width?: number;
+    height?: number;
+    angle?: number;
+    strokeColor?: string;
+    backgroundColor?: string;
+    fillStyle?: string;
+    strokeWidth?: number;
+    strokeStyle?: string;
+    roughness?: number;
+    opacity?: number;
+    roundness?: {
+        type: number;
+        value: number;
+    };
+    text?: string;
+    fontSize?: number;
+    fontFamily?: number;
+    textAlign?: string;
+    verticalAlign?: string;
+    startBinding?: {
+        elementId: string;
+    };
+    endBinding?: {
+        elementId: string;
+    };
+    startArrowType?: string;
+    endArrowType?: string;
+    boundElements?: Array<{
+        id: string;
+        type: string;
+    }>;
+    updated?: number;
+    link?: null;
+    locked?: boolean;
+    seed?: number;
+    versionNonce?: number;
+}
+interface ExcalidrawData {
+    type: string;
+    version: number;
+    source: string;
+    elements: ExcalidrawElement[];
+    appState: {
+        gridMode: string;
+        gridSize: number;
+        viewBackgroundColor?: string;
+    };
+    files: Record<string, unknown>;
+}
+/**
+ * Render DAG to Excalidraw JSON
+ */
+export declare function renderDagExcalidraw(dag: Dag): ExcalidrawData;
+/**
+ * Serialize Excalidraw data to JSON string
+ */
+export declare function serializeExcalidraw(data: ExcalidrawData): string;
+export {};
+//# sourceMappingURL=excalidraw-renderer.d.ts.map

package/dist/utils/excalidraw-renderer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"excalidraw-renderer.d.ts","sourceRoot":"","sources":["../../src/utils/excalidraw-renderer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,GAAG,EAAqC,MAAM,0BAA0B,CAAC;AAElF;;GAEG;AACH,UAAU,iBAAiB;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,SAAS,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE;QAAE,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IACrC,UAAU,CAAC,EAAE;QAAE,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IACnC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,IAAI,CAAC;IACZ,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,UAAU,cAAc;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,QAAQ,EAAE;QACR,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,mBAAmB,CAAC,EAAE,MAAM,CAAC;KAC9B,CAAC;IACF,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAyID;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,GAAG,GAAG,cAAc,CAyD5D;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,cAAc,GAAG,MAAM,CAEhE"}