@mclawnet/swarm 0.1.13 → 0.1.15

package/dist/always-on/task-sources/idea-dedupe.d.ts

@@ -0,0 +1,62 @@
+export declare const DEDUPE_BODY_PREFIX_CHARS = 500;
+export declare const DEDUPE_SHINGLE_K = 4;
+export declare const DEDUPE_JACCARD_THRESHOLD = 0.7;
+/**
+ * Lowercase, strip punctuation/symbols (Unicode-aware), collapse runs of
+ * whitespace, trim. Two titles that normalize to the same string are treated
+ * as identical for dedupe purposes.
+ */
+export declare function normalizeTitle(title: string): string;
+/**
+ * Character k-shingle set over a lowercased + whitespace-collapsed copy of
+ * `text`. Returns an empty set for input shorter than `k` *after*
+ * normalization (so {whitespace-only, empty, "ab"} all return empty sets at
+ * k=4), since a single shingle would otherwise produce spurious Jaccard=1
+ * matches against any other tiny input.
+ */
+export declare function shingles(text: string, k?: number): Set<string>;
+export declare function jaccard(a: Set<string>, b: Set<string>): number;
+export interface DedupeIndexEntry {
+    id: string;
+    normalizedTitle: string;
+    bodyShingles: Set<string>;
+}
+export interface DedupeCandidate {
+    title: string;
+    body: string;
+}
+export interface DedupeMatch {
+    matchedIdeaId: string;
+    reason: "title-exact" | "shingle-jaccard";
+    /** Jaccard score when reason === "shingle-jaccard"; omitted otherwise. */
+    score?: number;
+}
+/**
+ * Pre-compute an index over the existing ideas pulled from the hub so each
+ * incoming candidate is checked in O(N) without re-tokenizing on every
+ * comparison. The index is built once per ingest cycle and discarded.
+ */
+export declare function buildDedupeIndex(existing: Array<{
+    id: string;
+    title: string;
+    body: string;
+}>): DedupeIndexEntry[];
+/**
+ * Linear scan: return the first index entry that matches the candidate, or
+ * null if none cross either threshold. Title-exact is checked before
+ * shingle-jaccard so the cheaper signal wins ties and the returned reason is
+ * the more interpretable one.
+ */
+export declare function findDuplicate(candidate: DedupeCandidate, index: DedupeIndexEntry[], threshold?: number): DedupeMatch | null;
+/**
+ * Convenience: extend an existing index with a freshly-inserted idea so the
+ * next candidate in the same cycle is checked against it too (prevents the
+ * queen from accidentally producing two near-identical ideas in one cohort
+ * and slipping both past the hub).
+ */
+export declare function appendToIndex(index: DedupeIndexEntry[], inserted: {
+    id: string;
+    title: string;
+    body: string;
+}): void;
+//# sourceMappingURL=idea-dedupe.d.ts.map

package/dist/always-on/task-sources/idea-dedupe.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"idea-dedupe.d.ts","sourceRoot":"","sources":["../../../src/always-on/task-sources/idea-dedupe.ts"],"names":[],"mappings":"AAwBA,eAAO,MAAM,wBAAwB,MAAM,CAAC;AAC5C,eAAO,MAAM,gBAAgB,IAAI,CAAC;AAClC,eAAO,MAAM,wBAAwB,MAAM,CAAC;AAE5C;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAMpD;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,GAAE,MAAyB,GAAG,GAAG,CAAC,MAAM,CAAC,CAQhF;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAQ9D;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,eAAe,EAAE,MAAM,CAAC;IACxB,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC3B;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,WAAW;IAC1B,aAAa,EAAE,MAAM,CAAC;IACtB,MAAM,EAAE,aAAa,GAAG,iBAAiB,CAAC;IAC1C,0EAA0E;IAC1E,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAC3D,gBAAgB,EAAE,CAMpB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,eAAe,EAC1B,KAAK,EAAE,gBAAgB,EAAE,EACzB,SAAS,GAAE,MAAiC,GAC3C,WAAW,GAAG,IAAI,CA2BpB;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,gBAAgB,EAAE,EACzB,QAAQ,EAAE;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACpD,IAAI,CAMN"}

package/dist/always-on/task-sources/idea-dedupe.js

@@ -0,0 +1,130 @@
+// M8.2 — cheap text-similarity dedupe for IntrospectionSource.
+//
+// Used by `introspection-source.ts` to avoid re-posting the same candidate
+// idea every introspection cycle (always-on can fire many ticks/day, and the
+// queen's gap analysis tends to converge on the same handful of obvious
+// "missing tests / missing docs / dead code" findings until the user actually
+// acts on them).
+//
+// Two cheap checks, OR'd together:
+//   1. Normalized-title exact match (lowercase + collapsed whitespace +
+//      stripped punctuation). Catches the dominant duplicate case where the
+//      queen produces an identical title across cycles.
+//   2. Body-prefix k-shingle Jaccard similarity over the first
+//      `DEDUPE_BODY_PREFIX_CHARS` characters. Catches re-phrasings where
+//      title drifts slightly ("Add input validation" vs "Validate inputs")
+//      but body remains effectively the same.
+//
+// No embeddings, no network, no external deps — pure string ops. The
+// reasoning is that the introspection corpus is tiny (≤ a few hundred ideas
+// per project even after months) and false positives are bounded by the
+// `INTROSPECTION_MAX_IDEAS` cap (3/cycle); even if dedupe occasionally
+// suppresses a borderline-novel idea, the user can still discover it by
+// re-running introspection after acting on prior suggestions.
+export const DEDUPE_BODY_PREFIX_CHARS = 500;
+export const DEDUPE_SHINGLE_K = 4;
+export const DEDUPE_JACCARD_THRESHOLD = 0.7;
+/**
+ * Lowercase, strip punctuation/symbols (Unicode-aware), collapse runs of
+ * whitespace, trim. Two titles that normalize to the same string are treated
+ * as identical for dedupe purposes.
+ */
+export function normalizeTitle(title) {
+    return title
+        .toLowerCase()
+        .replace(/[\p{P}\p{S}]+/gu, " ")
+        .replace(/\s+/g, " ")
+        .trim();
+}
+/**
+ * Character k-shingle set over a lowercased + whitespace-collapsed copy of
+ * `text`. Returns an empty set for input shorter than `k` *after*
+ * normalization (so {whitespace-only, empty, "ab"} all return empty sets at
+ * k=4), since a single shingle would otherwise produce spurious Jaccard=1
+ * matches against any other tiny input.
+ */
+export function shingles(text, k = DEDUPE_SHINGLE_K) {
+    const norm = text.toLowerCase().replace(/\s+/g, " ").trim();
+    const out = new Set();
+    if (norm.length < k)
+        return out;
+    for (let i = 0; i <= norm.length - k; i++) {
+        out.add(norm.slice(i, i + k));
+    }
+    return out;
+}
+export function jaccard(a, b) {
+    if (a.size === 0 || b.size === 0)
+        return 0;
+    const [small, large] = a.size < b.size ? [a, b] : [b, a];
+    let intersect = 0;
+    for (const s of small)
+        if (large.has(s))
+            intersect++;
+    const union = a.size + b.size - intersect;
+    if (union === 0)
+        return 0;
+    return intersect / union;
+}
+/**
+ * Pre-compute an index over the existing ideas pulled from the hub so each
+ * incoming candidate is checked in O(N) without re-tokenizing on every
+ * comparison. The index is built once per ingest cycle and discarded.
+ */
+export function buildDedupeIndex(existing) {
+    return existing.map((e) => ({
+        id: e.id,
+        normalizedTitle: normalizeTitle(e.title),
+        bodyShingles: shingles((e.body ?? "").slice(0, DEDUPE_BODY_PREFIX_CHARS)),
+    }));
+}
+/**
+ * Linear scan: return the first index entry that matches the candidate, or
+ * null if none cross either threshold. Title-exact is checked before
+ * shingle-jaccard so the cheaper signal wins ties and the returned reason is
+ * the more interpretable one.
+ */
+export function findDuplicate(candidate, index, threshold = DEDUPE_JACCARD_THRESHOLD) {
+    const normTitle = normalizeTitle(candidate.title);
+    if (normTitle.length > 0) {
+        for (const e of index) {
+            if (e.normalizedTitle.length > 0 && e.normalizedTitle === normTitle) {
+                return { matchedIdeaId: e.id, reason: "title-exact" };
+            }
+        }
+    }
+    const candShingles = shingles((candidate.body ?? "").slice(0, DEDUPE_BODY_PREFIX_CHARS));
+    if (candShingles.size === 0)
+        return null;
+    let best = null;
+    for (const e of index) {
+        if (e.bodyShingles.size === 0)
+            continue;
+        const score = jaccard(candShingles, e.bodyShingles);
+        if (score >= threshold && (!best || score > best.score)) {
+            best = { score, entry: e };
+        }
+    }
+    if (best) {
+        return {
+            matchedIdeaId: best.entry.id,
+            reason: "shingle-jaccard",
+            score: best.score,
+        };
+    }
+    return null;
+}
+/**
+ * Convenience: extend an existing index with a freshly-inserted idea so the
+ * next candidate in the same cycle is checked against it too (prevents the
+ * queen from accidentally producing two near-identical ideas in one cohort
+ * and slipping both past the hub).
+ */
+export function appendToIndex(index, inserted) {
+    index.push({
+        id: inserted.id,
+        normalizedTitle: normalizeTitle(inserted.title),
+        bodyShingles: shingles((inserted.body ?? "").slice(0, DEDUPE_BODY_PREFIX_CHARS)),
+    });
+}
+//# sourceMappingURL=idea-dedupe.js.map

package/dist/always-on/task-sources/idea-dedupe.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"idea-dedupe.js","sourceRoot":"","sources":["../../../src/always-on/task-sources/idea-dedupe.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,EAAE;AACF,2EAA2E;AAC3E,6EAA6E;AAC7E,wEAAwE;AACxE,8EAA8E;AAC9E,iBAAiB;AACjB,EAAE;AACF,mCAAmC;AACnC,wEAAwE;AACxE,4EAA4E;AAC5E,wDAAwD;AACxD,+DAA+D;AAC/D,yEAAyE;AACzE,2EAA2E;AAC3E,8CAA8C;AAC9C,EAAE;AACF,qEAAqE;AACrE,4EAA4E;AAC5E,wEAAwE;AACxE,uEAAuE;AACvE,wEAAwE;AACxE,8DAA8D;AAE9D,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAC5C,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAClC,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAE5C;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa;IAC1C,OAAO,KAAK;SACT,WAAW,EAAE;SACb,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,IAAY,gBAAgB;IACjE,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,CAAc,EAAE,CAAc;IACpD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,EAAE,CAAC;IACrD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;IAC1C,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,SAAS,GAAG,KAAK,CAAC;AAC3B,CAAC;AAoBD;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAA4D;IAE5D,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1B,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,eAAe,EAAE,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC;QACxC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC;KAC1E,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,SAA0B,EAC1B,KAAyB,EACzB,YAAoB,wBAAwB;IAE5C,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;gBACpE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;YACxD,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,SAAS,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC,CAAC;IACzF,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,IAAI,IAAI,GAAsD,IAAI,CAAC;IACnE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;QACpD,IAAI,KAAK,IAAI,SAAS,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACxD,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,IAAI,IAAI,EAAE,CAAC;QACT,OAAO;YACL,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE;YAC5B,MAAM,EAAE,iBAAiB;YACzB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAyB,EACzB,QAAqD;IAErD,KAAK,CAAC,IAAI,CAAC;QACT,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,eAAe,EAAE,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC;QAC/C,YAAY,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC;KACjF,CAAC,CAAC;AACL,CAAC"}

package/dist/always-on/task-sources/idea-research-source.d.ts

@@ -0,0 +1,46 @@
+import type { IdeasClient, ResearchConclusion } from "../ideas-client.js";
+import { sortIdeasByPriorityThenAge } from "./idea-sort.js";
+import type { TaskSource } from "./types.js";
+export interface IdeaResearchSourceOptions {
+    ideasClient: IdeasClient;
+    /**
+     * Per-cycle list cap forwarded to the ideas API. Default 50 — only the
+     * head after sorting is consumed each cycle.
+     */
+    listLimit?: number;
+    /** Optional warn logger; defaults to silent. */
+    warn?: (obj: Record<string, unknown>, msg?: string) => void;
+    /** Optional info logger; defaults to silent. */
+    info?: (obj: Record<string, unknown>, msg?: string) => void;
+    /**
+     * Test seam: override report directory resolution. Defaults to
+     * `<projectRoot>/.clawnet/ideas/<ideaId>`.
+     */
+    resolveReportDir?: (projectRoot: string, ideaId: string) => string;
+    /** Test seam: clock. */
+    now?: () => Date;
+}
+/**
+ * Re-export under the original name for back-compat (S5 hotfix moved the
+ * implementation into `./idea-sort` to deduplicate the two source files).
+ */
+export declare const sortIdeasForResearch: typeof sortIdeasByPriorityThenAge;
+/**
+ * Minimal YAML-frontmatter parser. We only need the `conclusion` field for
+ * M8.1, so a 20-line scanner is plenty — pulling in `gray-matter` for one
+ * key would be overkill and adds a new transitive dep (per M8.1 constraints).
+ *
+ * Recognises:
+ *   ---
+ *   conclusion: promote   ← keys are flat; values are unquoted single tokens
+ *   key: value
+ *   ---
+ *   body…
+ *
+ * Returns null if no frontmatter block is present. Unknown keys are ignored.
+ */
+export declare function parseReportFrontmatter(content: string): Record<string, string> | null;
+/** Tolerant casing + dash/space variants. Unknown → null (caller falls back). */
+export declare function normaliseConclusion(raw: string | undefined): ResearchConclusion | null;
+export declare function createIdeaResearchSource(opts: IdeaResearchSourceOptions): TaskSource;
+//# sourceMappingURL=idea-research-source.d.ts.map

package/dist/always-on/task-sources/idea-research-source.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"idea-research-source.d.ts","sourceRoot":"","sources":["../../../src/always-on/task-sources/idea-research-source.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAEV,WAAW,EACX,kBAAkB,EAEnB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,0BAA0B,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,KAAK,EAAW,UAAU,EAAE,MAAM,YAAY,CAAC;AAEtD,MAAM,WAAW,yBAAyB;IACxC,WAAW,EAAE,WAAW,CAAC;IACzB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,gDAAgD;IAChD,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC5D,gDAAgD;IAChD,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC5D;;;OAGG;IACH,gBAAgB,CAAC,EAAE,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC;IACnE,wBAAwB;IACxB,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;CAClB;AAED;;;GAGG;AACH,eAAO,MAAM,oBAAoB,mCAA6B,CAAC;AAE/D;;;;;;;;;;;;;GAaG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAqBrF;AAUD,iFAAiF;AACjF,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,GAAG,kBAAkB,GAAG,IAAI,CAItF;AAwCD,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,yBAAyB,GAAG,UAAU,CAkPpF"}

package/dist/always-on/task-sources/idea-research-source.js

@@ -0,0 +1,308 @@
+// M8.1 — IdeaResearchSource: consumes ideas with status="idea" and drives
+// them through researching → todo/archived/idea via a research-only swarm
+// cycle (no code shipped, only a markdown report).
+//
+// Flow (D3 in design doc):
+//   idea.status="idea"
+//     → pick (highest priority + projectId match)
+//     → onClaim: PATCH status=researching, researchKind=investigate,
+//                linkedSwarmTaskId
+//     → swarm runs with cycleKind=research → research-only template
+//        on success: parse <projectRoot>/.clawnet/ideas/<id>/research-*.md
+//                    frontmatter, append ResearchRef, transition per conclusion:
+//                      promote    → status=todo
+//                      archive    → status=archived
+//                      needs-info → status=idea (await user input)
+//        on failure: revert status=idea, clear researchKind +
+//                    linkedSwarmTaskId
+//
+// Missing/malformed report = treated as needs-info (best-effort: never throws).
+import { existsSync, readFileSync, readdirSync, statSync } from "node:fs";
+import { join, relative } from "node:path";
+import { encodeCwd } from "@mclawnet/shared";
+import { sortIdeasByPriorityThenAge } from "./idea-sort.js";
+/**
+ * Re-export under the original name for back-compat (S5 hotfix moved the
+ * implementation into `./idea-sort` to deduplicate the two source files).
+ */
+export const sortIdeasForResearch = sortIdeasByPriorityThenAge;
+/**
+ * Minimal YAML-frontmatter parser. We only need the `conclusion` field for
+ * M8.1, so a 20-line scanner is plenty — pulling in `gray-matter` for one
+ * key would be overkill and adds a new transitive dep (per M8.1 constraints).
+ *
+ * Recognises:
+ *   ---
+ *   conclusion: promote   ← keys are flat; values are unquoted single tokens
+ *   key: value
+ *   ---
+ *   body…
+ *
+ * Returns null if no frontmatter block is present. Unknown keys are ignored.
+ */
+export function parseReportFrontmatter(content) {
+    // Normalise CRLF. N3 hotfix: the regex below requires `---` at column 0
+    // (no leading whitespace tolerated) — the previous comment claimed
+    // optional leading whitespace which was misleading. We deliberately keep
+    // the strict shape to match the standard YAML frontmatter convention.
+    const normalised = content.replace(/\r\n/g, "\n");
+    const m = normalised.match(/^---\n([\s\S]*?)\n---/);
+    if (!m)
+        return null;
+    const out = {};
+    for (const line of m[1].split("\n")) {
+        const kv = line.match(/^(\w+):\s*(.*)$/);
+        if (!kv)
+            continue;
+        const key = kv[1].trim();
+        let val = kv[2].trim();
+        // Strip wrapping quotes if any.
+        if ((val.startsWith('"') && val.endsWith('"')) || (val.startsWith("'") && val.endsWith("'"))) {
+            val = val.slice(1, -1);
+        }
+        out[key] = val;
+    }
+    return out;
+}
+const CONCLUSION_ALIASES = {
+    promote: "promote",
+    "needs-info": "needs-info",
+    needsinfo: "needs-info",
+    needinfo: "needs-info",
+    archive: "archive",
+};
+/** Tolerant casing + dash/space variants. Unknown → null (caller falls back). */
+export function normaliseConclusion(raw) {
+    if (!raw)
+        return null;
+    const key = raw.trim().toLowerCase().replace(/\s+/g, "-");
+    return CONCLUSION_ALIASES[key] ?? null;
+}
+function conclusionToStatus(c) {
+    switch (c) {
+        case "promote":
+            return "todo";
+        case "archive":
+            return "archived";
+        case "needs-info":
+            return "idea";
+    }
+}
+/**
+ * Scan a report directory for `research-*.md` files and return the path of
+ * the newest by mtime. Returns null when the dir is missing/empty.
+ */
+function findNewestReport(reportDir) {
+    if (!existsSync(reportDir))
+        return null;
+    let best = null;
+    try {
+        for (const name of readdirSync(reportDir)) {
+            if (!name.startsWith("research-") || !name.endsWith(".md"))
+                continue;
+            const full = join(reportDir, name);
+            try {
+                const s = statSync(full);
+                if (!s.isFile())
+                    continue;
+                if (!best || s.mtimeMs > best.mtimeMs) {
+                    best = { path: full, mtimeMs: s.mtimeMs };
+                }
+            }
+            catch {
+                // ignore individual stat errors
+            }
+        }
+    }
+    catch {
+        return null;
+    }
+    return best?.path ?? null;
+}
+export function createIdeaResearchSource(opts) {
+    const { ideasClient, listLimit = 50, warn, info, resolveReportDir = (projectRoot, ideaId) => join(projectRoot, ".clawnet", "ideas", ideaId), now = () => new Date(), } = opts;
+    return {
+        name: "idea-research",
+        kind: "idea-research",
+        async pick(projectRoot) {
+            let projectId;
+            try {
+                projectId = encodeCwd(projectRoot);
+            }
+            catch (err) {
+                warn?.({ err: err instanceof Error ? err.message : String(err), projectRoot }, "idea-research-source: encodeCwd failed");
+                return null;
+            }
+            let ideas;
+            try {
+                ideas = await ideasClient.list({
+                    status: "idea",
+                    projectId,
+                    limit: listLimit,
+                });
+            }
+            catch (err) {
+                warn?.({ err: err instanceof Error ? err.message : String(err), projectId }, "idea-research-source: list failed");
+                return null;
+            }
+            const matching = ideas.filter((i) => i.status === "idea" && i.projectId === projectId);
+            if (matching.length === 0)
+                return null;
+            const sorted = sortIdeasByPriorityThenAge(matching);
+            const head = sorted[0];
+            const description = head.body && head.body.trim().length > 0 ? head.body : undefined;
+            const taskRef = {
+                id: head.id,
+                title: head.title,
+                ...(description ? { description } : {}),
+                sourceKind: "idea-research",
+                sourceId: head.id,
+                // Stamp projectRoot + cycleKind so the runner picks the right template
+                // and onSuccess can locate the report file post-cycle.
+                projectRoot,
+                cycleKind: "research",
+            };
+            info?.({ ideaId: head.id, priority: head.priority, projectId }, "idea-research-source: picked");
+            return taskRef;
+        },
+        async onClaim(taskRef, swarmId) {
+            const ideaId = taskRef.sourceId ?? taskRef.id;
+            try {
+                // S3 hotfix note (M8 holistic review): `linkedSwarmTaskId` is a
+                // legacy column name — it stores a swarmId, not a taskId. The DB
+                // column shipped in migration 0014; renaming requires a destructive
+                // migration so we keep the name and document the mismatch here.
+                // S9 note: races between two cascade cycles (e.g. simultaneous
+                // research + execute claim attempts) can both flip an idea — M8
+                // assumes single-agent installs; M9+ may add optimistic locking.
+                await ideasClient.patch(ideaId, {
+                    status: "researching",
+                    researchKind: "investigate",
+                    linkedSwarmTaskId: swarmId,
+                });
+                info?.({ ideaId, swarmId }, "idea-research-source: claimed → researching (investigate)");
+            }
+            catch (err) {
+                warn?.({ err: err instanceof Error ? err.message : String(err), ideaId, swarmId }, "idea-research-source: onClaim patch failed");
+            }
+        },
+        async onSuccess(taskRef, swarmId) {
+            const ideaId = taskRef.sourceId ?? taskRef.id;
+            const projectRoot = taskRef.projectRoot;
+            // Default conclusion if anything goes wrong below — "needs-info" keeps
+            // the idea in front of the user without false-positive promote/archive.
+            let conclusion = "needs-info";
+            let reportPath = null;
+            if (!projectRoot) {
+                warn?.({ ideaId, swarmId }, "idea-research-source: onSuccess missing projectRoot — treating as needs-info");
+            }
+            else {
+                try {
+                    const reportDir = resolveReportDir(projectRoot, ideaId);
+                    const found = findNewestReport(reportDir);
+                    if (!found) {
+                        warn?.({ ideaId, swarmId, reportDir }, "idea-research-source: no research report found — treating as needs-info");
+                    }
+                    else {
+                        reportPath = found;
+                        try {
+                            const body = readFileSync(found, "utf-8");
+                            const fm = parseReportFrontmatter(body);
+                            if (!fm) {
+                                warn?.({ ideaId, swarmId, found }, "idea-research-source: report missing frontmatter — needs-info");
+                            }
+                            else {
+                                const parsed = normaliseConclusion(fm.conclusion);
+                                if (!parsed) {
+                                    warn?.({ ideaId, swarmId, raw: fm.conclusion }, "idea-research-source: unknown conclusion — needs-info");
+                                }
+                                else {
+                                    conclusion = parsed;
+                                }
+                            }
+                        }
+                        catch (err) {
+                            warn?.({ err: err instanceof Error ? err.message : String(err), ideaId, swarmId, found }, "idea-research-source: failed to read report — needs-info");
+                        }
+                    }
+                }
+                catch (err) {
+                    warn?.({ err: err instanceof Error ? err.message : String(err), ideaId, swarmId }, "idea-research-source: resolveReportDir threw — needs-info");
+                }
+            }
+            // Build the ResearchRef, normalising path to projectRoot-relative when
+            // possible (matches the schema convention in
+            // packages/@clawnet/shared/src/schemas.ts).
+            const ranAt = now().toISOString();
+            let storedReportPath;
+            if (reportPath && projectRoot) {
+                // Hotfix I5 — use path.relative so we get a proper separator
+                // boundary. The prior `startsWith(projectRoot)` check would happily
+                // strip the wrong prefix for sibling directories sharing a name
+                // prefix (`/x/proj` vs `/x/proj-other` → `-other/...`). When the
+                // report sits outside the project tree we fall back to the absolute
+                // path so the breadcrumb still points somewhere meaningful.
+                const rel = relative(projectRoot, reportPath);
+                storedReportPath = rel.startsWith("..") ? reportPath : rel;
+            }
+            else {
+                storedReportPath = reportPath ?? `.clawnet/ideas/${ideaId}/research-missing.md`;
+            }
+            const ref = {
+                reportPath: storedReportPath,
+                swarmId,
+                conclusion,
+                ranAt,
+            };
+            // Read-modify-write the researchReports array so we don't clobber
+            // earlier reports. Best-effort: a hub read error degrades to a
+            // single-element array (caller can still see this run).
+            let nextReports = [ref];
+            try {
+                const current = await ideasClient.get(ideaId);
+                const existing = current?.researchReports ?? [];
+                // Newest-first ordering per design doc D2.
+                nextReports = [ref, ...existing];
+            }
+            catch (err) {
+                warn?.({ err: err instanceof Error ? err.message : String(err), ideaId, swarmId }, "idea-research-source: failed to read existing researchReports — overwriting with single entry");
+            }
+            const nextStatus = conclusionToStatus(conclusion);
+            try {
+                await ideasClient.patch(ideaId, {
+                    status: nextStatus,
+                    researchKind: null,
+                    researchReports: nextReports,
+                });
+                info?.({ ideaId, swarmId, conclusion, nextStatus }, "idea-research-source: research cycle complete");
+            }
+            catch (err) {
+                warn?.({ err: err instanceof Error ? err.message : String(err), ideaId, swarmId }, "idea-research-source: onSuccess patch failed");
+            }
+        },
+        async onFailure(taskRef, swarmId, error) {
+            const ideaId = taskRef.sourceId ?? taskRef.id;
+            try {
+                // Revert to status=idea so the user (or a future cycle) can re-pick.
+                // Clear both researchKind and linkedSwarmTaskId — the failed cycle is
+                // no longer relevant breadcrumbs (vs IdeaTodoSource which keeps the
+                // linkedSwarmTaskId for debugging).
+                await ideasClient.patch(ideaId, {
+                    status: "idea",
+                    researchKind: null,
+                    linkedSwarmTaskId: null,
+                });
+                info?.({ ideaId, swarmId, error: error ?? null }, "idea-research-source: reverted to idea after failure");
+            }
+            catch (err) {
+                warn?.({
+                    err: err instanceof Error ? err.message : String(err),
+                    ideaId,
+                    swarmId,
+                    originalError: error,
+                }, "idea-research-source: onFailure revert failed");
+            }
+        },
+    };
+}
+//# sourceMappingURL=idea-research-source.js.map

package/dist/always-on/task-sources/idea-research-source.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"idea-research-source.js","sourceRoot":"","sources":["../../../src/always-on/task-sources/idea-research-source.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,0EAA0E;AAC1E,mDAAmD;AACnD,EAAE;AACF,2BAA2B;AAC3B,uBAAuB;AACvB,kDAAkD;AAClD,qEAAqE;AACrE,mCAAmC;AACnC,oEAAoE;AACpE,2EAA2E;AAC3E,iFAAiF;AACjF,gDAAgD;AAChD,oDAAoD;AACpD,mEAAmE;AACnE,8DAA8D;AAC9D,uCAAuC;AACvC,EAAE;AACF,gFAAgF;AAEhF,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAO7C,OAAO,EAAE,0BAA0B,EAAE,MAAM,gBAAgB,CAAC;AAuB5D;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,0BAA0B,CAAC;AAE/D;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAe;IACpD,wEAAwE;IACxE,mEAAmE;IACnE,yEAAyE;IACzE,sEAAsE;IACtE,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAClD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAC;IACpD,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QACzC,IAAI,CAAC,EAAE;YAAE,SAAS;QAClB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACvB,gCAAgC;QAChC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC7F,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,kBAAkB,GAAuC;IAC7D,OAAO,EAAE,SAAS;IAClB,YAAY,EAAE,YAAY;IAC1B,SAAS,EAAE,YAAY;IACvB,QAAQ,EAAE,YAAY;IACtB,OAAO,EAAE,SAAS;CACnB,CAAC;AAEF,iFAAiF;AACjF,MAAM,UAAU,mBAAmB,CAAC,GAAuB;IACzD,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC1D,OAAO,kBAAkB,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;AACzC,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAqB;IAC/C,QAAQ,CAAC,EAAE,CAAC;QACV,KAAK,SAAS;YACZ,OAAO,MAAM,CAAC;QAChB,KAAK,SAAS;YACZ,OAAO,UAAU,CAAC;QACpB,KAAK,YAAY;YACf,OAAO,MAAM,CAAC;IAClB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,SAAiB;IACzC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACxC,IAAI,IAAI,GAA6C,IAAI,CAAC;IAC1D,IAAI,CAAC;QACH,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,SAAS;YACrE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC;gBACH,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE;oBAAE,SAAS;gBAC1B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBACtC,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBAC5C,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,gCAAgC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,IAA+B;IACtE,MAAM,EACJ,WAAW,EACX,SAAS,GAAG,EAAE,EACd,IAAI,EACJ,IAAI,EACJ,gBAAgB,GAAG,CAAC,WAAmB,EAAE,MAAc,EAAE,EAAE,CACzD,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAChD,GAAG,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,GACvB,GAAG,IAAI,CAAC;IAET,OAAO;QACL,IAAI,EAAE,eAAe;QACrB,IAAI,EAAE,eAAe;QACrB,KAAK,CAAC,IAAI,CAAC,WAAmB;YAC5B,IAAI,SAAiB,CAAC;YACtB,IAAI,CAAC;gBACH,SAAS,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;YACrC,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,EACtE,wCAAwC,CACzC,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,KAAa,CAAC;YAClB,IAAI,CAAC;gBACH,KAAK,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC;oBAC7B,MAAM,EAAE,MAAM;oBACd,SAAS;oBACT,KAAK,EAAE,SAAS;iBACjB,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE,EACpE,mCAAmC,CACpC,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;YAED,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS,CACxD,CAAC;YACF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAEvC,MAAM,MAAM,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAEvB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;YACrF,MAAM,OAAO,GAAY;gBACvB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,UAAU,EAAE,eAAe;gBAC3B,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACjB,uEAAuE;gBACvE,uDAAuD;gBACvD,WAAW;gBACX,SAAS,EAAE,UAAU;aACtB,CAAC;YAEF,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,EACvD,8BAA8B,CAC/B,CAAC;YACF,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,OAAO,CAAC,OAAgB,EAAE,OAAe;YAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC;gBACH,gEAAgE;gBAChE,iEAAiE;gBACjE,oEAAoE;gBACpE,gEAAgE;gBAChE,+DAA+D;gBAC/D,gEAAgE;gBAChE,iEAAiE;gBACjE,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE;oBAC9B,MAAM,EAAE,aAAa;oBACrB,YAAY,EAAE,aAAa;oBAC3B,iBAAiB,EAAE,OAAO;iBAC3B,CAAC,CAAC;gBACH,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,EACnB,2DAA2D,CAC5D,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAC1E,4CAA4C,CAC7C,CAAC;YACJ,CAAC;QACH,CAAC;QAED,KAAK,CAAC,SAAS,CAAC,OAAgB,EAAE,OAAe;YAC/C,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,EAAE,CAAC;YAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;YACxC,uEAAuE;YACvE,wEAAwE;YACxE,IAAI,UAAU,GAAuB,YAAY,CAAC;YAClD,IAAI,UAAU,GAAkB,IAAI,CAAC;YAErC,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjB,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,EACnB,8EAA8E,CAC/E,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,gBAAgB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;oBACxD,MAAM,KAAK,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;oBAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;wBACX,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,EAC9B,yEAAyE,CAC1E,CAAC;oBACJ,CAAC;yBAAM,CAAC;wBACN,UAAU,GAAG,KAAK,CAAC;wBACnB,IAAI,CAAC;4BACH,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;4BAC1C,MAAM,EAAE,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;4BACxC,IAAI,CAAC,EAAE,EAAE,CAAC;gCACR,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EAC1B,+DAA+D,CAChE,CAAC;4BACJ,CAAC;iCAAM,CAAC;gCACN,MAAM,MAAM,GAAG,mBAAmB,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;gCAClD,IAAI,CAAC,MAAM,EAAE,CAAC;oCACZ,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,UAAU,EAAE,EACvC,uDAAuD,CACxD,CAAC;gCACJ,CAAC;qCAAM,CAAC;oCACN,UAAU,GAAG,MAAM,CAAC;gCACtB,CAAC;4BACH,CAAC;wBACH,CAAC;wBAAC,OAAO,GAAG,EAAE,CAAC;4BACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EACjF,0DAA0D,CAC3D,CAAC;wBACJ,CAAC;oBACH,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAC1E,2DAA2D,CAC5D,CAAC;gBACJ,CAAC;YACH,CAAC;YAED,uEAAuE;YACvE,6CAA6C;YAC7C,4CAA4C;YAC5C,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;YAClC,IAAI,gBAAwB,CAAC;YAC7B,IAAI,UAAU,IAAI,WAAW,EAAE,CAAC;gBAC9B,6DAA6D;gBAC7D,oEAAoE;gBACpE,gEAAgE;gBAChE,iEAAiE;gBACjE,oEAAoE;gBACpE,4DAA4D;gBAC5D,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBAC9C,gBAAgB,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;YAC7D,CAAC;iBAAM,CAAC;gBACN,gBAAgB,GAAG,UAAU,IAAI,kBAAkB,MAAM,sBAAsB,CAAC;YAClF,CAAC;YACD,MAAM,GAAG,GAAgB;gBACvB,UAAU,EAAE,gBAAgB;gBAC5B,OAAO;gBACP,UAAU;gBACV,KAAK;aACN,CAAC;YAEF,kEAAkE;YAClE,+DAA+D;YAC/D,wDAAwD;YACxD,IAAI,WAAW,GAAkB,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,OAAO,EAAE,eAAe,IAAI,EAAE,CAAC;gBAChD,2CAA2C;gBAC3C,WAAW,GAAG,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,CAAC;YACnC,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAC1E,+FAA+F,CAChG,CAAC;YACJ,CAAC;YAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;YAClD,IAAI,CAAC;gBACH,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE;oBAC9B,MAAM,EAAE,UAAU;oBAClB,YAAY,EAAE,IAAI;oBAClB,eAAe,EAAE,WAAW;iBAC7B,CAAC,CAAC;gBACH,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,EAC3C,+CAA+C,CAChD,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,EAAE,CACJ,EAAE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAC1E,8CAA8C,CAC/C,CAAC;YACJ,CAAC;QACH,CAAC;QAED,KAAK,CAAC,SAAS,CAAC,OAAgB,EAAE,OAAe,EAAE,KAAc;YAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC;gBACH,qEAAqE;gBACrE,sEAAsE;gBACtE,oEAAoE;gBACpE,oCAAoC;gBACpC,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE;oBAC9B,MAAM,EAAE,MAAM;oBACd,YAAY,EAAE,IAAI;oBAClB,iBAAiB,EAAE,IAAI;iBACxB,CAAC,CAAC;gBACH,IAAI,EAAE,CACJ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,IAAI,IAAI,EAAE,EACzC,sDAAsD,CACvD,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,EAAE,CACJ;oBACE,GAAG,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;oBACrD,MAAM;oBACN,OAAO;oBACP,aAAa,EAAE,KAAK;iBACrB,EACD,+CAA+C,CAChD,CAAC;YACJ,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/always-on/task-sources/idea-sort.d.ts

@@ -0,0 +1,3 @@
+import type { Idea } from "../ideas-client.js";
+export declare function sortIdeasByPriorityThenAge(ideas: Idea[]): Idea[];
+//# sourceMappingURL=idea-sort.d.ts.map

package/dist/always-on/task-sources/idea-sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"idea-sort.d.ts","sourceRoot":"","sources":["../../../src/always-on/task-sources/idea-sort.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,IAAI,EAAgB,MAAM,oBAAoB,CAAC;AAQ7D,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAMhE"}

package/dist/always-on/task-sources/idea-sort.js

@@ -0,0 +1,25 @@
+// M8 hotfix S5 — shared sort helper used by both IdeaTodoSource (status=todo
+// cycle) and IdeaResearchSource (status=idea research cycle). Originally
+// duplicated as `sortIdeasForPicking` / `sortIdeasForResearch`; both used
+// the same priority + updatedAt ordering, only the type was identical.
+// Extracting here keeps the two sources in lockstep and removes a future
+// drift risk.
+//
+// Sort order:
+//   1. priority DESC (high > medium > low)
+//   2. updatedAt ASC (oldest first — avoids starving early-written ideas
+//      when fresh edits keep landing on newer ones).
+const PRIORITY_RANK = {
+    high: 3,
+    medium: 2,
+    low: 1,
+};
+export function sortIdeasByPriorityThenAge(ideas) {
+    return [...ideas].sort((a, b) => {
+        const pdiff = (PRIORITY_RANK[b.priority] ?? 0) - (PRIORITY_RANK[a.priority] ?? 0);
+        if (pdiff !== 0)
+            return pdiff;
+        return a.updatedAt.localeCompare(b.updatedAt);
+    });
+}
+//# sourceMappingURL=idea-sort.js.map

package/dist/always-on/task-sources/idea-sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"idea-sort.js","sourceRoot":"","sources":["../../../src/always-on/task-sources/idea-sort.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,yEAAyE;AACzE,0EAA0E;AAC1E,uEAAuE;AACvE,yEAAyE;AACzE,cAAc;AACd,EAAE;AACF,cAAc;AACd,2CAA2C;AAC3C,yEAAyE;AACzE,qDAAqD;AAIrD,MAAM,aAAa,GAAiC;IAClD,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;CACP,CAAC;AAEF,MAAM,UAAU,0BAA0B,CAAC,KAAa;IACtD,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAClF,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9B,OAAO,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC"}