ghscout 0.1.0

package/README.md

@@ -0,0 +1,195 @@
+# ghscout — evidence engine for product discovery from GitHub issues
+
+Every idea tool mines Reddit. Nobody mines GitHub issues. **ghscout** does.
+
+GitHub issues are the richest source of developer pain: structured reactions, labels, linked PRs, repo stars, and code context. ghscout scans them at scale, clusters recurring pain patterns, and scores each opportunity.
+
+## Install
+
+```bash
+npx ghscout scan vercel/next.js
+
+# or install globally
+npm install -g ghscout
+```
+
+Requires Node.js 18+. Works without a GitHub token (60 req/h), but set `GITHUB_TOKEN` or use `gh auth` for 5,000 req/h.
+
+## Scan a repo
+
+```
+$ ghscout scan vercel/next.js --top 5
+
+#1 [100/100] server actions
+   Issues: 25 | Reactions: 740 | Labels: bug
+   Demand: 100  Frequency: 100  Frustration: 100  Market: 100  Gap: 100
+   → [65 👍] Unable to import react-dom/server in a server component (1200d)
+     https://github.com/vercel/next.js/issues/43810
+   → [57 👍] Turbopack dev server uses too much RAM and CPU (263d)
+     https://github.com/vercel/next.js/issues/81161
+
+#2 [80/100] pages router
+   Issues: 13 | Reactions: 663 | Labels: none
+   Demand: 92  Frequency: 48  Frustration: 67  Market: 100  Gap: 100
+   → [325 👍] App router issue with Framer Motion shared layout animatio... (1051d)
+     https://github.com/vercel/next.js/issues/49279
+
+#3 [58/100] compress false
+   Issues: 10 | Reactions: 258 | Labels: Runtime, bug
+   → [49 👍] middleware matcher should support template literals (899d)
+
+#4 [54/100] parallel routes
+   Issues: 8 | Reactions: 217 | Labels: bug
+   → [54 👍] Parallel routes are rendered unnecessarily (967d)
+
+#5 [48/100] image
+   Issues: 8 | Reactions: 203 | Labels: Image (next/image), bug
+   → [46 👍] next/image not properly sizing images (1186d)
+```
+
+## Scan across repos (org or topic)
+
+```
+$ ghscout scan --topic developer-tools --min-stars 1000 --top 5
+
+Scanning 1/10: puppeteer/puppeteer...
+Scanning 2/10: hoppscotch/hoppscotch...
+...
+
+#1 [97/100] st dataframe
+   Issues: 71 | Reactions: 2312 | Labels: type:enhancement
+   → [99 👍] st.tabs & st.expander - Improve handling of frontend... (746d)
+
+#2 [61/100] bruno cli
+   Issues: 37 | Reactions: 461 | Labels: enhancement
+   → [131 👍] Import Open API / Swagger 2.x Spec into Bruno (1147d)
+
+#3 [60/100] sandbox creation
+   Issues: 44 | Reactions: 13
+   → [2 👍] Live File Synchronization (daytona sandbox sync) (72d)
+```
+
+## AI scoring (via Claude Code)
+
+Uses your existing Claude Code subscription. Zero extra cost, zero API key.
+
+```
+$ ghscout scan vercel/next.js --top 3 --ai-score
+
+#1 [3/10] server actions  SKIP
+   Issues: 25 | Reactions: 740 | Heuristic: 100/100
+   AI: "These are Next.js framework bugs that need fixes from the
+   core team, not standalone products. No indie tool can meaningfully
+   solve server action cookie reloads or Turbopack memory leaks."
+
+#2 [3/10] pages router  SKIP
+   AI: "Framework-level routing bugs tightly coupled to Next.js
+   internals. Best resolved upstream via PRs to the library itself."
+
+#3 [3/10] parallel routes  SKIP
+   AI: "Parallel routes issues are framework-level bugs in Next.js's
+   routing engine that require fixes within Next.js itself."
+```
+
+The AI separates "real pain but not a product opportunity" from "pain you can build a product around." Heuristics gave server actions 100/100. AI gave it 3/10 with a clear rationale.
+
+## Deep-dive with evidence
+
+```
+$ ghscout evidence vercel/next.js "middleware"
+
+# Evidence: "middleware" in vercel/next.js
+
+## Summary
+- **17 open issues** across 16 unique authors
+- **1,111 total 👍 reactions** — strong demand signal
+- **20 related PRs**
+
+## Top Issues by Demand
+1. [195 👍] [RFC] Dynamic Routes (#7607)
+   Opened 2468 days ago | 90 comments
+2. [136 👍] trailing slash in link for legit page works for client side...
+   Opened 2740 days ago | 124 comments
+```
+
+Output is plain markdown — paste it into a pitch deck, README, or blog post.
+
+## Trending pain
+
+```
+$ ghscout trending --top 3
+
+#1 [67/100] claude code
+   Issues: 7 | Reactions: 513
+   → [119 👍] Support multiple Connector accounts (29d)
+   → [79 👍] remote-control shows misleading error (25d)
+
+#2 [58/100] option
+   Issues: 5 | Reactions: 583
+   → [283 👍] Add collision presets (godot-proposals) (25d)
+
+#3 [28/100] code
+   Issues: 3 | Reactions: 263
+   → [118 👍] Add a Shader Code variable previewer (18d)
+```
+
+## Scoring model
+
+Scores are **relative within each scan** — the top cluster always gets the highest demand score, differentiating clusters from each other.
+
+| Signal | Weight (single-repo) | Weight (cross-repo) | What it measures |
+|---|---|---|---|
+| **Demand** | 35% | 30% | Total 👍 reactions across issues |
+| **Frequency** | 30% | 25% | Number of separate issues about the same pain |
+| **Frustration** | 20% | 15% | Negative reactions, frustration keywords in title+body, issue age |
+| **Market size** | 0% | 15% | Repo stars (constant in single-repo, varies in cross-repo) |
+| **Gap** | 15% | 15% | Percentage of issues still open (no solution yet) |
+
+## Autoresearch
+
+ghscout ships with a `program.md` — a structured instruction file (inspired by [karpathy/autoresearch](https://github.com/karpathy/autoresearch)) that teaches AI coding agents to run autonomous product discovery sessions.
+
+```bash
+# In Claude Code, just say:
+"Read program.md and run a research session"
+```
+
+The agent scans topics, evaluates clusters, and writes findings to `discoveries/YYYY-MM-DD.md` with BUILD/SKIP/WATCH verdicts.
+
+## CLI reference
+
+```
+ghscout scan <repo>              Scan a repo for opportunity clusters
+ghscout scan --org <org>         Scan an org's repos
+ghscout scan --topic <topic>     Scan repos by GitHub topic
+ghscout evidence <repo> <query>  Deep-dive on a specific pain topic
+ghscout trending                 Top pain clusters across GitHub
+
+Options:
+  --output <format>    json | table | pretty (default: pretty)
+  --json               Shorthand for --output json
+  --ai-score           Score with AI via Claude Code CLI
+  --limit <n>          Max issues per repo (default: 200)
+  --period <duration>  Time window: 7d, 30d, 90d (default: all open)
+  --min-stars <n>      Min stars to include (default: 100)
+  --top <n>            Show top N clusters
+  --min-reactions <n>  Min reactions per cluster
+  --verbose            Show API calls and rate limits
+  --no-cache           Fetch fresh data
+```
+
+## Comparison
+
+| | **ghscout** | SaasFinder | GummySearch |
+|---|---|---|---|
+| Data source | GitHub issues | Reddit | Reddit |
+| AI scoring | Yes (Claude Code) | No | No |
+| Structured signals | Reactions, labels, PRs | Upvotes, comments | Upvotes, comments |
+| Cross-repo analysis | Yes | N/A | N/A |
+| Rejected PR detection | Yes | N/A | N/A |
+| Evidence packages | Yes (markdown) | No | No |
+| Price | Free / open source | $29/mo+ | $48/mo+ |
+
+## License
+
+MIT

package/dist/analysis/ai-scorer.d.ts

@@ -0,0 +1,34 @@
+import type { ScoredCluster } from "./scorer.js";
+import type { RepoMeta } from "../github/types.js";
+export interface AIScoredCluster extends ScoredCluster {
+    aiScore: number;
+    verdict: "BUILD" | "SKIP" | "WATCH";
+    rationale: string;
+}
+interface AIResponse {
+    score: number;
+    verdict: "BUILD" | "SKIP" | "WATCH";
+    rationale: string;
+}
+/**
+ * Check if the claude CLI is available.
+ */
+export declare function isClaudeAvailable(): boolean;
+/**
+ * Build the scoring prompt for a cluster.
+ */
+export declare function buildPrompt(cluster: ScoredCluster, repoMeta: RepoMeta): string;
+/**
+ * Call claude CLI to score a single cluster.
+ */
+export declare function callClaude(prompt: string, verbose: boolean): AIResponse | null;
+/**
+ * Score clusters using AI via the user's Claude Code CLI.
+ * Falls back to heuristic score if claude is not available or call fails.
+ */
+export declare function aiScoreClusters(clusters: ScoredCluster[], repoMeta: RepoMeta, opts: {
+    verbose: boolean;
+    minHeuristicScore?: number;
+}): Promise<AIScoredCluster[]>;
+export {};
+//# sourceMappingURL=ai-scorer.d.ts.map

package/dist/analysis/ai-scorer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ai-scorer.d.ts","sourceRoot":"","sources":["../../src/analysis/ai-scorer.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AACjD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAEnD,MAAM,WAAW,eAAgB,SAAQ,aAAa;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC;IACpC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,UAAU,UAAU;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC;IACpC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,IAAI,OAAO,CAO3C;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAmC9E;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,UAAU,GAAG,IAAI,CAkD9E;AAED;;;GAGG;AACH,wBAAsB,eAAe,CACnC,QAAQ,EAAE,aAAa,EAAE,EACzB,QAAQ,EAAE,QAAQ,EAClB,IAAI,EAAE;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAAE,GACrD,OAAO,CAAC,eAAe,EAAE,CAAC,CA0C5B"}

package/dist/analysis/ai-scorer.js

@@ -0,0 +1,139 @@
+import { execSync } from "node:child_process";
+/**
+ * Check if the claude CLI is available.
+ */
+export function isClaudeAvailable() {
+    try {
+        execSync("claude --version", { stdio: "pipe", timeout: 5000 });
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Build the scoring prompt for a cluster.
+ */
+export function buildPrompt(cluster, repoMeta) {
+    const topIssues = cluster.issues
+        .slice()
+        .sort((a, b) => b.reactions.total - a.reactions.total)
+        .slice(0, 5)
+        .map((i) => {
+        const ageDays = Math.floor((Date.now() - new Date(i.createdAt).getTime()) / (1000 * 60 * 60 * 24));
+        return `- [${i.reactions.total} 👍] ${i.title} (${ageDays}d old)`;
+    })
+        .join("\n");
+    const labels = cluster.labels.length > 0 ? cluster.labels.join(", ") : "none";
+    return `You are evaluating a product opportunity found by analyzing GitHub issues.
+
+Cluster: "${cluster.name}"
+Repository: ${repoMeta.fullName} (${repoMeta.stars.toLocaleString()} stars)
+Issues: ${cluster.issueCount} open issues
+Total reactions: ${cluster.totalReactions} 👍
+Labels: ${labels}
+Heuristic score: ${cluster.score}/100
+
+Top issues in this cluster:
+${topIssues}
+
+Score this opportunity on a scale of 0-10 based on these criteria:
+1. Product viability: Could someone build a standalone tool, extension, or service for this?
+2. Market demand: Is this pain widespread beyond just this repo?
+3. Solution gap: Do adequate solutions already exist, or are people stuck?
+4. Indie feasibility: Could one developer build an MVP in 2-4 weeks?
+
+Respond ONLY with valid JSON, no markdown, no explanation outside the JSON:
+{"score": <0-10>, "verdict": "<BUILD|SKIP|WATCH>", "rationale": "<1-2 sentences explaining your assessment>"}`;
+}
+/**
+ * Call claude CLI to score a single cluster.
+ */
+export function callClaude(prompt, verbose) {
+    try {
+        if (verbose) {
+            process.stderr.write("  Calling Claude for AI scoring...\n");
+        }
+        // Escape the prompt for shell safety
+        const escaped = prompt.replace(/'/g, "'\\''");
+        const result = execSync(`echo '${escaped}' | claude --print --output-format text`, {
+            encoding: "utf-8",
+            timeout: 60000,
+            stdio: ["pipe", "pipe", "pipe"],
+        });
+        // Extract JSON from response (claude might add extra text)
+        const jsonMatch = result.match(/\{[\s\S]*?"score"[\s\S]*?"verdict"[\s\S]*?"rationale"[\s\S]*?\}/);
+        if (!jsonMatch) {
+            if (verbose) {
+                process.stderr.write(`  Warning: Could not parse AI response\n`);
+            }
+            return null;
+        }
+        const parsed = JSON.parse(jsonMatch[0]);
+        // Validate
+        if (typeof parsed.score !== "number" ||
+            parsed.score < 0 ||
+            parsed.score > 10 ||
+            !["BUILD", "SKIP", "WATCH"].includes(parsed.verdict) ||
+            typeof parsed.rationale !== "string") {
+            if (verbose) {
+                process.stderr.write(`  Warning: Invalid AI response format\n`);
+            }
+            return null;
+        }
+        return parsed;
+    }
+    catch (err) {
+        if (verbose) {
+            const msg = err instanceof Error ? err.message : String(err);
+            process.stderr.write(`  Warning: Claude call failed (${msg})\n`);
+        }
+        return null;
+    }
+}
+/**
+ * Score clusters using AI via the user's Claude Code CLI.
+ * Falls back to heuristic score if claude is not available or call fails.
+ */
+export async function aiScoreClusters(clusters, repoMeta, opts) {
+    if (!isClaudeAvailable()) {
+        process.stderr.write("Warning: claude CLI not found. Install Claude Code to use --ai-score.\n" +
+            "Falling back to heuristic scoring.\n");
+        return clusters.map(fallback);
+    }
+    const minScore = opts.minHeuristicScore ?? 30;
+    const results = [];
+    for (let i = 0; i < clusters.length; i++) {
+        const cluster = clusters[i];
+        // Skip low-scoring clusters and "other" bucket
+        if (cluster.score < minScore || cluster.name === "other") {
+            results.push(fallback(cluster));
+            continue;
+        }
+        process.stderr.write(`AI scoring ${i + 1}/${clusters.length}: "${cluster.name}"...\n`);
+        const prompt = buildPrompt(cluster, repoMeta);
+        const response = callClaude(prompt, opts.verbose);
+        if (response) {
+            results.push({
+                ...cluster,
+                aiScore: response.score,
+                verdict: response.verdict,
+                rationale: response.rationale,
+            });
+        }
+        else {
+            results.push(fallback(cluster));
+        }
+    }
+    // Sort by AI score descending (fallbacks use heuristic/10)
+    return results.sort((a, b) => b.aiScore - a.aiScore);
+}
+function fallback(cluster) {
+    return {
+        ...cluster,
+        aiScore: Math.round(cluster.score / 10),
+        verdict: cluster.score >= 70 ? "WATCH" : "SKIP",
+        rationale: "Heuristic score (AI scoring skipped)",
+    };
+}
+//# sourceMappingURL=ai-scorer.js.map

package/dist/analysis/ai-scorer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ai-scorer.js","sourceRoot":"","sources":["../../src/analysis/ai-scorer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAgB9C;;GAEG;AACH,MAAM,UAAU,iBAAiB;IAC/B,IAAI,CAAC;QACH,QAAQ,CAAC,kBAAkB,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,OAAsB,EAAE,QAAkB;IACpE,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM;SAC7B,KAAK,EAAE;SACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;SACrD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACT,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CACxB,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CACvE,CAAC;QACF,OAAO,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,QAAQ,CAAC,CAAC,KAAK,KAAK,OAAO,QAAQ,CAAC;IACpE,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAE9E,OAAO;;YAEG,OAAO,CAAC,IAAI;cACV,QAAQ,CAAC,QAAQ,KAAK,QAAQ,CAAC,KAAK,CAAC,cAAc,EAAE;UACzD,OAAO,CAAC,UAAU;mBACT,OAAO,CAAC,cAAc;UAC/B,MAAM;mBACG,OAAO,CAAC,KAAK;;;EAG9B,SAAS;;;;;;;;;8GASmG,CAAC;AAC/G,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,MAAc,EAAE,OAAgB;IACzD,IAAI,CAAC;QACH,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC/D,CAAC;QAED,qCAAqC;QACrC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,QAAQ,CACrB,SAAS,OAAO,yCAAyC,EACzD;YACE,QAAQ,EAAE,OAAO;YACjB,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;SAChC,CACF,CAAC;QAEF,2DAA2D;QAC3D,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,iEAAiE,CAAC,CAAC;QAClG,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,0CAA0C,CAAC,CAAC;YACnE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAe,CAAC;QAEtD,WAAW;QACX,IACE,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ;YAChC,MAAM,CAAC,KAAK,GAAG,CAAC;YAChB,MAAM,CAAC,KAAK,GAAG,EAAE;YACjB,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;YACpD,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,EACpC,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,yCAAyC,CAAC,CAAC;YAClE,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC7D,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,kCAAkC,GAAG,KAAK,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,QAAyB,EACzB,QAAkB,EAClB,IAAsD;IAEtD,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC;QACzB,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,yEAAyE;YACvE,sCAAsC,CACzC,CAAC;QACF,OAAO,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,IAAI,EAAE,CAAC;IAC9C,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE5B,+CAA+C;QAC/C,IAAI,OAAO,CAAC,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzD,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;YAChC,SAAS;QACX,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,KAAK,CAClB,cAAc,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,MAAM,OAAO,CAAC,IAAI,QAAQ,CACjE,CAAC;QAEF,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAElD,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,CAAC,IAAI,CAAC;gBACX,GAAG,OAAO;gBACV,OAAO,EAAE,QAAQ,CAAC,KAAK;gBACvB,OAAO,EAAE,QAAQ,CAAC,OAAO;gBACzB,SAAS,EAAE,QAAQ,CAAC,SAAS;aAC9B,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;AACvD,CAAC;AAED,SAAS,QAAQ,CAAC,OAAsB;IACtC,OAAO;QACL,GAAG,OAAO;QACV,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,GAAG,EAAE,CAAC;QACvC,OAAO,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM;QAC/C,SAAS,EAAE,sCAAsC;KAClD,CAAC;AACJ,CAAC"}

package/dist/analysis/cluster.d.ts

@@ -0,0 +1,14 @@
+import type { Issue } from "../github/types.js";
+export interface Cluster {
+    name: string;
+    issues: Issue[];
+    issueCount: number;
+    totalReactions: number;
+    labels: string[];
+}
+/**
+ * Cluster issues by shared title tokens (bigrams preferred) with label overlap
+ * as a secondary signal.
+ */
+export declare function clusterIssues(issues: Issue[]): Cluster[];
+//# sourceMappingURL=cluster.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.d.ts","sourceRoot":"","sources":["../../src/analysis/cluster.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAGhD,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAWD;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,EAAE,CAuKxD"}

package/dist/analysis/cluster.js

@@ -0,0 +1,223 @@
+import { tokenizeTitle, extractBigrams } from "./tokenizer.js";
+const GENERIC_LABELS = new Set([
+    "bug",
+    "feature",
+    "enhancement",
+    "question",
+    "help wanted",
+    "good first issue",
+]);
+/**
+ * Cluster issues by shared title tokens (bigrams preferred) with label overlap
+ * as a secondary signal.
+ */
+export function clusterIssues(issues) {
+    if (issues.length === 0)
+        return [];
+    // Step 1: Tokenize all issues and extract bigrams
+    const issueTokens = issues.map((issue) => {
+        const tokens = tokenizeTitle(issue.title);
+        const bigrams = extractBigrams(tokens);
+        return { issue, tokens, bigrams };
+    });
+    // Step 2: Count frequency of each bigram and unigram across ALL issues
+    const bigramFreq = new Map();
+    const unigramFreq = new Map();
+    for (const { tokens, bigrams } of issueTokens) {
+        // Count each bigram once per issue (deduplicate within a single issue)
+        const seenBigrams = new Set();
+        for (const bigram of bigrams) {
+            if (!seenBigrams.has(bigram)) {
+                seenBigrams.add(bigram);
+                bigramFreq.set(bigram, (bigramFreq.get(bigram) ?? 0) + 1);
+            }
+        }
+        const seenUnigrams = new Set();
+        for (const token of tokens) {
+            if (!seenUnigrams.has(token)) {
+                seenUnigrams.add(token);
+                unigramFreq.set(token, (unigramFreq.get(token) ?? 0) + 1);
+            }
+        }
+    }
+    // Step 3 & 6: For each issue, find its "top token" considering label overlap
+    // Build label-based affinity: map non-generic labels to issue indices
+    const labelToIssues = new Map();
+    for (let i = 0; i < issues.length; i++) {
+        for (const label of issues[i].labels) {
+            const lower = label.toLowerCase();
+            if (!GENERIC_LABELS.has(lower)) {
+                if (!labelToIssues.has(lower)) {
+                    labelToIssues.set(lower, new Set());
+                }
+                labelToIssues.get(lower).add(i);
+            }
+        }
+    }
+    // For each issue, compute the best token (bigram preferred)
+    const issueTopToken = [];
+    for (const { tokens, bigrams } of issueTokens) {
+        let bestToken = "";
+        let bestScore = -1;
+        let bestIsBigram = false;
+        // Check bigrams first
+        for (const bigram of bigrams) {
+            const freq = bigramFreq.get(bigram) ?? 0;
+            if (freq > bestScore || (freq === bestScore && !bestIsBigram)) {
+                bestScore = freq;
+                bestToken = bigram;
+                bestIsBigram = true;
+            }
+        }
+        // Check unigrams — only prefer unigram if its frequency is notably higher
+        for (const token of tokens) {
+            const freq = unigramFreq.get(token) ?? 0;
+            // Prefer bigrams when frequency is similar (bigram needs freq * 1.5 < unigram freq to lose)
+            if (bestIsBigram) {
+                if (freq > bestScore * 1.5) {
+                    bestScore = freq;
+                    bestToken = token;
+                    bestIsBigram = false;
+                }
+            }
+            else {
+                if (freq > bestScore) {
+                    bestScore = freq;
+                    bestToken = token;
+                    bestIsBigram = false;
+                }
+            }
+        }
+        issueTopToken.push(bestToken || "other");
+    }
+    // Step 6 (continued): Boost grouping via shared non-generic labels
+    // If two issues share a non-generic label and one of them has a top token with freq < 2,
+    // try to reassign it to match the other issue's top token
+    for (const [, issueIndices] of labelToIssues) {
+        if (issueIndices.size < 2)
+            continue;
+        const indices = Array.from(issueIndices);
+        // Find the most common top token among issues sharing this label
+        const tokenCounts = new Map();
+        for (const idx of indices) {
+            const token = issueTopToken[idx];
+            if (token !== "other") {
+                tokenCounts.set(token, (tokenCounts.get(token) ?? 0) + 1);
+            }
+        }
+        if (tokenCounts.size === 0)
+            continue;
+        let dominantToken = "";
+        let dominantCount = 0;
+        for (const [token, count] of tokenCounts) {
+            if (count > dominantCount) {
+                dominantCount = count;
+                dominantToken = token;
+            }
+        }
+        // Reassign issues with weak tokens to the dominant one in this label group
+        if (dominantCount >= 2) {
+            for (const idx of indices) {
+                const currentToken = issueTopToken[idx];
+                if (currentToken === "other") {
+                    issueTopToken[idx] = dominantToken;
+                    continue;
+                }
+                // Check if current token is weak (only appears once in global freq)
+                const currentFreq = bigramFreq.get(currentToken) ?? unigramFreq.get(currentToken) ?? 0;
+                if (currentFreq < 2 && currentToken !== dominantToken) {
+                    issueTopToken[idx] = dominantToken;
+                }
+            }
+        }
+    }
+    // Step 4: Group issues by their top token
+    const groups = new Map();
+    for (let i = 0; i < issues.length; i++) {
+        const token = issueTopToken[i];
+        if (!groups.has(token)) {
+            groups.set(token, []);
+        }
+        groups.get(token).push(issues[i]);
+    }
+    // Step 5: Merge small clusters (<2 issues) into "other"
+    // Then relabel each cluster with its most representative bigram
+    const clusters = [];
+    const otherIssues = [];
+    for (const [name, groupIssues] of groups) {
+        if (groupIssues.length < 2) {
+            otherIssues.push(...groupIssues);
+        }
+        else {
+            const relabeledName = pickBigramLabel(name, groupIssues);
+            clusters.push(buildCluster(relabeledName, groupIssues));
+        }
+    }
+    if (otherIssues.length > 0) {
+        clusters.push(buildCluster("other", otherIssues));
+    }
+    // Step 9: Sort by issueCount descending, then totalReactions descending
+    clusters.sort((a, b) => {
+        if (b.issueCount !== a.issueCount)
+            return b.issueCount - a.issueCount;
+        return b.totalReactions - a.totalReactions;
+    });
+    return clusters;
+}
+/**
+ * Pick the best bigram label for a cluster.
+ * Collects all bigrams from every issue in the cluster, counts frequency,
+ * and returns the most common bigram if it appears >= 2 times.
+ * Otherwise keeps the original (unigram) name.
+ */
+function pickBigramLabel(currentName, issues) {
+    // If the current name is already a bigram (contains a space), keep it
+    if (currentName.includes(" "))
+        return currentName;
+    const bigramCounts = new Map();
+    for (const issue of issues) {
+        const tokens = tokenizeTitle(issue.title);
+        const bigrams = extractBigrams(tokens);
+        const seen = new Set();
+        for (const bigram of bigrams) {
+            if (!seen.has(bigram)) {
+                seen.add(bigram);
+                bigramCounts.set(bigram, (bigramCounts.get(bigram) ?? 0) + 1);
+            }
+        }
+    }
+    let bestBigram = "";
+    let bestCount = 0;
+    for (const [bigram, count] of bigramCounts) {
+        if (count > bestCount) {
+            bestCount = count;
+            bestBigram = bigram;
+        }
+    }
+    return bestCount >= 2 ? bestBigram : currentName;
+}
+function buildCluster(name, issues) {
+    // Step 7: Calculate totalReactions
+    const totalReactions = issues.reduce((sum, issue) => sum + issue.reactions.total, 0);
+    // Step 8: Collect common labels
+    const labelCounts = new Map();
+    for (const issue of issues) {
+        for (const label of issue.labels) {
+            labelCounts.set(label, (labelCounts.get(label) ?? 0) + 1);
+        }
+    }
+    // Labels that appear in at least half the issues in the cluster
+    const threshold = Math.ceil(issues.length / 2);
+    const labels = Array.from(labelCounts.entries())
+        .filter(([, count]) => count >= threshold)
+        .map(([label]) => label)
+        .sort();
+    return {
+        name,
+        issues,
+        issueCount: issues.length,
+        totalReactions,
+        labels,
+    };
+}
+//# sourceMappingURL=cluster.js.map

package/dist/analysis/cluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.js","sourceRoot":"","sources":["../../src/analysis/cluster.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAU/D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC;IAC7B,KAAK;IACL,SAAS;IACT,aAAa;IACb,UAAU;IACV,aAAa;IACb,kBAAkB;CACnB,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,MAAe;IAC3C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,kDAAkD;IAClD,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACvC,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QACvC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,uEAAuE;IACvE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,WAAW,EAAE,CAAC;QAC9C,uEAAuE;QACvE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7B,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACxB,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7B,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACxB,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,sEAAsE;IACtE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;YAClC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACtC,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,KAAK,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,WAAW,EAAE,CAAC;QAC9C,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,YAAY,GAAG,KAAK,CAAC;QAEzB,sBAAsB;QACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,IAAI,GAAG,SAAS,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC9D,SAAS,GAAG,IAAI,CAAC;gBACjB,SAAS,GAAG,MAAM,CAAC;gBACnB,YAAY,GAAG,IAAI,CAAC;YACtB,CAAC;QACH,CAAC;QAED,0EAA0E;QAC1E,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzC,4FAA4F;YAC5F,IAAI,YAAY,EAAE,CAAC;gBACjB,IAAI,IAAI,GAAG,SAAS,GAAG,GAAG,EAAE,CAAC;oBAC3B,SAAS,GAAG,IAAI,CAAC;oBACjB,SAAS,GAAG,KAAK,CAAC;oBAClB,YAAY,GAAG,KAAK,CAAC;gBACvB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,IAAI,GAAG,SAAS,EAAE,CAAC;oBACrB,SAAS,GAAG,IAAI,CAAC;oBACjB,SAAS,GAAG,KAAK,CAAC;oBAClB,YAAY,GAAG,KAAK,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,aAAa,CAAC,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,CAAC;IAC3C,CAAC;IAED,mEAAmE;IACnE,yFAAyF;IACzF,0DAA0D;IAC1D,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,aAAa,EAAE,CAAC;QAC7C,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS;QACpC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAEzC,iEAAiE;QACjE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;gBACtB,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAErC,IAAI,aAAa,GAAG,EAAE,CAAC;QACvB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;YACzC,IAAI,KAAK,GAAG,aAAa,EAAE,CAAC;gBAC1B,aAAa,GAAG,KAAK,CAAC;gBACtB,aAAa,GAAG,KAAK,CAAC;YACxB,CAAC;QACH,CAAC;QAED,2EAA2E;QAC3E,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;YACvB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;gBACxC,IAAI,YAAY,KAAK,OAAO,EAAE,CAAC;oBAC7B,aAAa,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC;oBACnC,SAAS;gBACX,CAAC;gBACD,oEAAoE;gBACpE,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBACvF,IAAI,WAAW,GAAG,CAAC,IAAI,YAAY,KAAK,aAAa,EAAE,CAAC;oBACtD,aAAa,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,wDAAwD;IACxD,gEAAgE;IAChE,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAY,EAAE,CAAC;IAEhC,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;QACzC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,WAAW,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,MAAM,aAAa,GAAG,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,wEAAwE;IACxE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;YAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;QACtE,OAAO,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAS,eAAe,CAAC,WAAmB,EAAE,MAAe;IAC3D,sEAAsE;IACtE,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC;IAElD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjB,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;QAC3C,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;YAClB,UAAU,GAAG,MAAM,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;AACnD,CAAC;AAED,SAAS,YAAY,CAAC,IAAY,EAAE,MAAe;IACjD,mCAAmC;IACnC,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAClC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,EAC3C,CAAC,CACF,CAAC;IAEF,gCAAgC;IAChC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;SAC7C,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,SAAS,CAAC;SACzC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC;SACvB,IAAI,EAAE,CAAC;IAEV,OAAO;QACL,IAAI;QACJ,MAAM;QACN,UAAU,EAAE,MAAM,CAAC,MAAM;QACzB,cAAc;QACd,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/analysis/scorer.d.ts

@@ -0,0 +1,27 @@
+import type { Cluster } from "./cluster.js";
+import type { RepoMeta } from "../github/types.js";
+export interface ScoredCluster extends Cluster {
+    score: number;
+    breakdown: {
+        demand: number;
+        frequency: number;
+        frustration: number;
+        marketSize: number;
+        gap: number;
+    };
+}
+/**
+ * Score a single cluster. Used only when scoring one cluster in isolation.
+ * For proper relative scoring, use scoreClusters().
+ */
+export declare function scoreCluster(cluster: Cluster, repoMeta: RepoMeta): ScoredCluster;
+/**
+ * Score all clusters with relative normalization.
+ * Demand, frequency, and frustration are normalized against the min/max
+ * of the current dataset so they always spread 0-100.
+ *
+ * @param mode - "single" redistributes market size weight (constant in single-repo scans),
+ *               "cross" keeps original weights (market size varies across repos).
+ */
+export declare function scoreClusters(clusters: Cluster[], repoMeta: RepoMeta, mode?: "single" | "cross"): ScoredCluster[];
+//# sourceMappingURL=scorer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"scorer.d.ts","sourceRoot":"","sources":["../../src/analysis/scorer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAEnD,MAAM,WAAW,aAAc,SAAQ,OAAO;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE;QACT,MAAM,EAAE,MAAM,CAAC;QACf,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,EAAE,MAAM,CAAC;QACpB,UAAU,EAAE,MAAM,CAAC;QACnB,GAAG,EAAE,MAAM,CAAC;KACb,CAAC;CACH;AA0GD;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,OAAO,EAAE,OAAO,EAChB,QAAQ,EAAE,QAAQ,GACjB,aAAa,CA+Bf;AAQD;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,OAAO,EAAE,EACnB,QAAQ,EAAE,QAAQ,EAClB,IAAI,GAAE,QAAQ,GAAG,OAAkB,GAClC,aAAa,EAAE,CAyEjB"}