ghagga-core 2.8.0 → 2.9.0

package/dist/compress/index.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Context compression for static analysis tool output.
+ *
+ * Static analysis tools often return redundant, verbose output.
+ * This module compresses tool findings BEFORE sending to the LLM
+ * to reduce token usage while preserving the most important information.
+ */
+export interface CompressionResult {
+    original: string;
+    compressed: string;
+    reductionPercent: number;
+    droppedCount: number;
+}
+export interface ToolFinding {
+    tool: string;
+    file: string;
+    line?: number;
+    message: string;
+    severity?: string;
+}
+export interface CompressOptions {
+    /** Max findings per file (default: 5) */
+    maxPerFile?: number;
+    /** Max findings per tool (default: 20) */
+    maxPerTool?: number;
+    /** Deduplicate by message prefix (default: true) */
+    deduplicateMessages?: boolean;
+    /** Rough token budget — 1 token ≈ 4 chars (default: 4000) */
+    maxTotalTokens?: number;
+}
+/**
+ * Compress a list of tool findings using deduplication, per-tool and per-file caps,
+ * and a total token budget guard.
+ *
+ * @param findings  - Raw findings from static analysis tools
+ * @param opts      - Compression options
+ * @returns Compressed finding list + stats
+ */
+export declare function compressToolFindings(findings: ToolFinding[], opts?: CompressOptions): {
+    findings: ToolFinding[];
+    stats: CompressionResult;
+};
+/**
+ * Compress a raw static analysis block (string output from a tool).
+ *
+ * Finds repeated patterns — lines that are identical except for line numbers —
+ * and collapses them into "... and N similar issues". Returns a compressed string
+ * with reduction stats.
+ *
+ * @param rawOutput  - Raw string output from a static analysis tool
+ * @param maxTokens  - Max token budget (1 token ≈ 4 chars). Default: 4000
+ * @returns Compression result with original, compressed, and stats
+ */
+export declare function compressStaticAnalysisBlock(rawOutput: string, maxTokens?: number): CompressionResult;
+//# sourceMappingURL=index.d.ts.map

package/dist/compress/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/compress/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC9B,yCAAyC;IACzC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,0CAA0C;IAC1C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,oDAAoD;IACpD,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,6DAA6D;IAC7D,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAsBD;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,WAAW,EAAE,EACvB,IAAI,CAAC,EAAE,eAAe,GACrB;IAAE,QAAQ,EAAE,WAAW,EAAE,CAAC;IAAC,KAAK,EAAE,iBAAiB,CAAA;CAAE,CA8EvD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,2BAA2B,CACzC,SAAS,EAAE,MAAM,EACjB,SAAS,SAAO,GACf,iBAAiB,CAyDnB"}

package/dist/compress/index.js

@@ -0,0 +1,166 @@
+/**
+ * Context compression for static analysis tool output.
+ *
+ * Static analysis tools often return redundant, verbose output.
+ * This module compresses tool findings BEFORE sending to the LLM
+ * to reduce token usage while preserving the most important information.
+ */
+// ─── Severity ordering ───────────────────────────────────────────
+const SEVERITY_ORDER = {
+    critical: 0,
+    error: 1,
+    high: 2,
+    medium: 3,
+    warning: 4,
+    low: 5,
+    info: 6,
+    note: 7,
+};
+function severityRank(severity) {
+    if (!severity)
+        return 99;
+    return SEVERITY_ORDER[severity.toLowerCase()] ?? 99;
+}
+// ─── Core Functions ──────────────────────────────────────────────
+/**
+ * Compress a list of tool findings using deduplication, per-tool and per-file caps,
+ * and a total token budget guard.
+ *
+ * @param findings  - Raw findings from static analysis tools
+ * @param opts      - Compression options
+ * @returns Compressed finding list + stats
+ */
+export function compressToolFindings(findings, opts) {
+    const maxPerFile = opts?.maxPerFile ?? 5;
+    const maxPerTool = opts?.maxPerTool ?? 20;
+    const dedup = opts?.deduplicateMessages ?? true;
+    const maxTotalTokens = opts?.maxTotalTokens ?? 4000;
+    const maxTotalChars = maxTotalTokens * 4;
+    const originalCount = findings.length;
+    // ── Step 1: Group by tool ──────────────────────────────────
+    const byTool = new Map();
+    for (const finding of findings) {
+        const list = byTool.get(finding.tool) ?? [];
+        list.push(finding);
+        byTool.set(finding.tool, list);
+    }
+    const compressed = [];
+    for (const [, toolFindings] of byTool) {
+        // ── Step 2: Deduplicate by message prefix (first 60 chars) ──
+        let deduped = toolFindings;
+        if (dedup) {
+            const seen = new Set();
+            deduped = toolFindings.filter((f) => {
+                const prefix = f.message.slice(0, 60);
+                if (seen.has(prefix))
+                    return false;
+                seen.add(prefix);
+                return true;
+            });
+        }
+        // ── Step 3: Sort by severity (highest first) then cap per tool ──
+        const sorted = [...deduped].sort((a, b) => severityRank(a.severity) - severityRank(b.severity));
+        const cappedByTool = sorted.slice(0, maxPerTool);
+        // ── Step 4: Cap per file within remaining findings ──────────
+        const byFile = new Map();
+        for (const finding of cappedByTool) {
+            const list = byFile.get(finding.file) ?? [];
+            list.push(finding);
+            byFile.set(finding.file, list);
+        }
+        for (const fileFindings of byFile.values()) {
+            compressed.push(...fileFindings.slice(0, maxPerFile));
+        }
+    }
+    // ── Step 5: Token budget guard ──────────────────────────────
+    const roughSize = (f) => (f.tool + f.file + (f.message ?? '')).length + 30;
+    let totalChars = 0;
+    const budgeted = [];
+    for (const f of compressed) {
+        const size = roughSize(f);
+        if (totalChars + size > maxTotalChars)
+            break;
+        budgeted.push(f);
+        totalChars += size;
+    }
+    const droppedCount = originalCount - budgeted.length;
+    const originalStr = JSON.stringify(findings);
+    const compressedStr = JSON.stringify(budgeted);
+    const reductionPercent = originalStr.length > 0
+        ? Math.round(((originalStr.length - compressedStr.length) / originalStr.length) * 100)
+        : 0;
+    return {
+        findings: budgeted,
+        stats: {
+            original: originalStr,
+            compressed: compressedStr,
+            reductionPercent,
+            droppedCount,
+        },
+    };
+}
+/**
+ * Compress a raw static analysis block (string output from a tool).
+ *
+ * Finds repeated patterns — lines that are identical except for line numbers —
+ * and collapses them into "... and N similar issues". Returns a compressed string
+ * with reduction stats.
+ *
+ * @param rawOutput  - Raw string output from a static analysis tool
+ * @param maxTokens  - Max token budget (1 token ≈ 4 chars). Default: 4000
+ * @returns Compression result with original, compressed, and stats
+ */
+export function compressStaticAnalysisBlock(rawOutput, maxTokens = 4000) {
+    const lines = rawOutput.split('\n');
+    // Strip line-number references to find structurally similar lines.
+    // E.g. "src/foo.ts:123: unused variable 'x'" → "src/foo.ts:XX: unused variable 'x'"
+    const normalize = (line) => line.replace(/:\d+/g, ':XX').replace(/\b\d+\b/g, 'N');
+    // Group consecutive similar lines
+    const groups = [];
+    for (const line of lines) {
+        const key = normalize(line);
+        const last = groups[groups.length - 1];
+        if (last && last.canonical === key) {
+            last.lines.push(line);
+        }
+        else {
+            groups.push({ canonical: key, lines: [line] });
+        }
+    }
+    // Collapse groups with multiple similar lines
+    const compressedLines = [];
+    for (const group of groups) {
+        if (group.lines.length === 1) {
+            const first = group.lines[0];
+            if (first !== undefined)
+                compressedLines.push(first);
+        }
+        else {
+            const first = group.lines[0];
+            if (first !== undefined) {
+                compressedLines.push(first);
+                compressedLines.push(`  ... and ${group.lines.length - 1} similar issue(s)`);
+            }
+        }
+    }
+    let compressed = compressedLines.join('\n');
+    // Hard-cap to token budget
+    const maxChars = maxTokens * 4;
+    if (compressed.length > maxChars) {
+        const cutoff = compressed.lastIndexOf('\n', maxChars);
+        compressed =
+            (cutoff > 0 ? compressed.slice(0, cutoff) : compressed.slice(0, maxChars)) +
+                '\n[... output truncated to fit token budget ...]';
+    }
+    const droppedCount = lines.length - compressedLines.length;
+    const reductionPercent = rawOutput.length > 0
+        ? Math.round(((rawOutput.length - compressed.length) / rawOutput.length) * 100)
+        : 0;
+    return {
+        original: rawOutput,
+        compressed,
+        reductionPercent,
+        droppedCount,
+    };
+}
+//# sourceMappingURL=index.js.map

package/dist/compress/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/compress/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AA8BH,oEAAoE;AAEpE,MAAM,cAAc,GAA2B;IAC7C,QAAQ,EAAE,CAAC;IACX,KAAK,EAAE,CAAC;IACR,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,OAAO,EAAE,CAAC;IACV,GAAG,EAAE,CAAC;IACN,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC;CACR,CAAC;AAEF,SAAS,YAAY,CAAC,QAA4B;IAChD,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,OAAO,cAAc,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;AACtD,CAAC;AAED,oEAAoE;AAEpE;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAAuB,EACvB,IAAsB;IAEtB,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,CAAC,CAAC;IACzC,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,EAAE,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,EAAE,mBAAmB,IAAI,IAAI,CAAC;IAChD,MAAM,cAAc,GAAG,IAAI,EAAE,cAAc,IAAI,IAAI,CAAC;IACpD,MAAM,aAAa,GAAG,cAAc,GAAG,CAAC,CAAC;IAEzC,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;IAEtC,8DAA8D;IAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAChD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,UAAU,GAAkB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,MAAM,EAAE,CAAC;QACtC,+DAA+D;QAC/D,IAAI,OAAO,GAAG,YAAY,CAAC;QAC3B,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;gBAClC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACtC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACnC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACjB,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;QACL,CAAC;QAED,mEAAmE;QACnE,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChG,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAEjD,+DAA+D;QAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAChD,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,MAAM,SAAS,GAAG,CAAC,CAAc,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC;IAExF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,UAAU,GAAG,IAAI,GAAG,aAAa;YAAE,MAAM;QAC7C,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,UAAU,IAAI,IAAI,CAAC;IACrB,CAAC;IAED,MAAM,YAAY,GAAG,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;IACrD,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAE/C,MAAM,gBAAgB,GACpB,WAAW,CAAC,MAAM,GAAG,CAAC;QACpB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;QACtF,CAAC,CAAC,CAAC,CAAC;IAER,OAAO;QACL,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE;YACL,QAAQ,EAAE,WAAW;YACrB,UAAU,EAAE,aAAa;YACzB,gBAAgB;YAChB,YAAY;SACb;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,2BAA2B,CACzC,SAAiB,EACjB,SAAS,GAAG,IAAI;IAEhB,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEpC,mEAAmE;IACnE,oFAAoF;IACpF,MAAM,SAAS,GAAG,CAAC,IAAY,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IAE1F,kCAAkC;IAClC,MAAM,MAAM,GAAkD,EAAE,CAAC;IACjE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvC,IAAI,IAAI,IAAI,IAAI,CAAC,SAAS,KAAK,GAAG,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,KAAK,KAAK,SAAS;gBAAE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC5B,eAAe,CAAC,IAAI,CAAC,aAAa,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC;YAC/E,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE5C,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;IAC/B,IAAI,UAAU,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACtD,UAAU;YACR,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBAC1E,kDAAkD,CAAC;IACvD,CAAC;IAED,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;IAC3D,MAAM,gBAAgB,GACpB,SAAS,CAAC,MAAM,GAAG,CAAC;QAClB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;QAC/E,CAAC,CAAC,CAAC,CAAC;IAER,OAAO;QACL,QAAQ,EAAE,SAAS;QACnB,UAAU;QACV,gBAAgB;QAChB,YAAY;KACb,CAAC;AACJ,CAAC"}

package/dist/cost-footer.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Cost footer — calculates and formats review cost from token usage
+ * and model pricing. Appended to PR review comments so teams can
+ * track AI review spend.
+ */
+export interface ModelPricing {
+    inputPerMTok: number;
+    outputPerMTok: number;
+}
+/**
+ * Approximate pricing per model family. Input/output split is estimated
+ * at 70/30 when only total tokens are available.
+ */
+export declare const MODEL_PRICING: Record<string, ModelPricing>;
+export declare function getModelPricing(model: string): ModelPricing | null;
+export interface ReviewCost {
+    totalTokens: number;
+    estimatedInputTokens: number;
+    estimatedOutputTokens: number;
+    costUSD: number;
+    model: string;
+    pricingFound: boolean;
+}
+/**
+ * Estimate cost from total token count and model.
+ * When only total tokens are known (no input/output split),
+ * we estimate 70% input / 30% output based on typical review patterns.
+ */
+export declare function calculateReviewCost(totalTokens: number, model: string, options?: {
+    inputTokens?: number;
+    outputTokens?: number;
+}): ReviewCost;
+/**
+ * Format cost as a compact footer line for PR comments.
+ * Returns empty string when tokens are 0 (static-only review).
+ */
+export declare function formatCostFooter(cost: ReviewCost): string;
+//# sourceMappingURL=cost-footer.d.ts.map

package/dist/cost-footer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost-footer.d.ts","sourceRoot":"","sources":["../src/cost-footer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,WAAW,YAAY;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,eAAO,MAAM,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAiBtD,CAAC;AAEF,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI,CAYlE;AAID,MAAM,WAAW,UAAU;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,OAAO,CAAC;CACvB;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE;IAAE,WAAW,CAAC,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GACxD,UAAU,CA6BZ;AAUD;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAgBzD"}

package/dist/cost-footer.js

@@ -0,0 +1,95 @@
+/**
+ * Cost footer — calculates and formats review cost from token usage
+ * and model pricing. Appended to PR review comments so teams can
+ * track AI review spend.
+ */
+/**
+ * Approximate pricing per model family. Input/output split is estimated
+ * at 70/30 when only total tokens are available.
+ */
+export const MODEL_PRICING = {
+    // Anthropic
+    'claude-opus-4': { inputPerMTok: 15, outputPerMTok: 75 },
+    'claude-sonnet-4': { inputPerMTok: 3, outputPerMTok: 15 },
+    'claude-haiku-4': { inputPerMTok: 0.8, outputPerMTok: 4 },
+    'claude-3.5-sonnet': { inputPerMTok: 3, outputPerMTok: 15 },
+    'claude-3-haiku': { inputPerMTok: 0.25, outputPerMTok: 1.25 },
+    // OpenAI
+    'gpt-4o': { inputPerMTok: 2.5, outputPerMTok: 10 },
+    'gpt-4o-mini': { inputPerMTok: 0.15, outputPerMTok: 0.6 },
+    'gpt-4-turbo': { inputPerMTok: 10, outputPerMTok: 30 },
+    // Google
+    'gemini-2.5-pro': { inputPerMTok: 1.25, outputPerMTok: 10 },
+    'gemini-2.5-flash': { inputPerMTok: 0.15, outputPerMTok: 0.6 },
+    // Groq (free tier — cost is effectively 0)
+    'llama-3': { inputPerMTok: 0, outputPerMTok: 0 },
+    mixtral: { inputPerMTok: 0, outputPerMTok: 0 },
+};
+export function getModelPricing(model) {
+    // Direct match
+    if (MODEL_PRICING[model])
+        return MODEL_PRICING[model];
+    // Prefix match (handles version suffixes like claude-sonnet-4-20250514)
+    for (const [key, pricing] of Object.entries(MODEL_PRICING)) {
+        if (model.includes(key) || key.includes(model.split('-').slice(0, -1).join('-'))) {
+            return pricing;
+        }
+    }
+    return null;
+}
+/**
+ * Estimate cost from total token count and model.
+ * When only total tokens are known (no input/output split),
+ * we estimate 70% input / 30% output based on typical review patterns.
+ */
+export function calculateReviewCost(totalTokens, model, options) {
+    const pricing = getModelPricing(model);
+    const inputTokens = options?.inputTokens ?? Math.round(totalTokens * 0.7);
+    const outputTokens = options?.outputTokens ?? Math.round(totalTokens * 0.3);
+    if (!pricing) {
+        return {
+            totalTokens,
+            estimatedInputTokens: inputTokens,
+            estimatedOutputTokens: outputTokens,
+            costUSD: 0,
+            model,
+            pricingFound: false,
+        };
+    }
+    const cost = (inputTokens / 1_000_000) * pricing.inputPerMTok +
+        (outputTokens / 1_000_000) * pricing.outputPerMTok;
+    return {
+        totalTokens,
+        estimatedInputTokens: inputTokens,
+        estimatedOutputTokens: outputTokens,
+        costUSD: Math.round(cost * 10000) / 10000,
+        model,
+        pricingFound: true,
+    };
+}
+// ── Formatting ──
+function formatTokens(n) {
+    if (n >= 1_000_000)
+        return `${(n / 1_000_000).toFixed(1)}M`;
+    if (n >= 1_000)
+        return `${(n / 1_000).toFixed(0)}K`;
+    return String(n);
+}
+/**
+ * Format cost as a compact footer line for PR comments.
+ * Returns empty string when tokens are 0 (static-only review).
+ */
+export function formatCostFooter(cost) {
+    if (cost.totalTokens === 0)
+        return '';
+    const tokens = formatTokens(cost.totalTokens);
+    if (!cost.pricingFound) {
+        return `\n<sub>📊 ${tokens} tokens · \`${cost.model}\` · pricing unavailable</sub>\n`;
+    }
+    if (cost.costUSD === 0) {
+        return `\n<sub>📊 ${tokens} tokens · \`${cost.model}\` · free tier</sub>\n`;
+    }
+    const dollars = cost.costUSD >= 1 ? `$${cost.costUSD.toFixed(2)}` : `$${cost.costUSD.toFixed(4)}`;
+    return `\n<sub>📊 ${tokens} tokens · ${dollars} · \`${cost.model}\`</sub>\n`;
+}
+//# sourceMappingURL=cost-footer.js.map

package/dist/cost-footer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost-footer.js","sourceRoot":"","sources":["../src/cost-footer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AASH;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAiC;IACzD,YAAY;IACZ,eAAe,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE;IACxD,iBAAiB,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,EAAE,EAAE;IACzD,gBAAgB,EAAE,EAAE,YAAY,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,EAAE;IACzD,mBAAmB,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,EAAE,EAAE;IAC3D,gBAAgB,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE;IAC7D,SAAS;IACT,QAAQ,EAAE,EAAE,YAAY,EAAE,GAAG,EAAE,aAAa,EAAE,EAAE,EAAE;IAClD,aAAa,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE;IACzD,aAAa,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE;IACtD,SAAS;IACT,gBAAgB,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,EAAE;IAC3D,kBAAkB,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE;IAC9D,2CAA2C;IAC3C,SAAS,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE;IAChD,OAAO,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE;CAC/C,CAAC;AAEF,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,eAAe;IACf,IAAI,aAAa,CAAC,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC;IAEtD,wEAAwE;IACxE,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAC3D,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACjF,OAAO,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAaD;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,WAAmB,EACnB,KAAa,EACb,OAAyD;IAEzD,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAEvC,MAAM,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;IAE5E,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO;YACL,WAAW;YACX,oBAAoB,EAAE,WAAW;YACjC,qBAAqB,EAAE,YAAY;YACnC,OAAO,EAAE,CAAC;YACV,KAAK;YACL,YAAY,EAAE,KAAK;SACpB,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GACR,CAAC,WAAW,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,YAAY;QAChD,CAAC,YAAY,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC;IAErD,OAAO;QACL,WAAW;QACX,oBAAoB,EAAE,WAAW;QACjC,qBAAqB,EAAE,YAAY;QACnC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,KAAK;QACzC,KAAK;QACL,YAAY,EAAE,IAAI;KACnB,CAAC;AACJ,CAAC;AAED,mBAAmB;AAEnB,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,CAAC,IAAI,SAAS;QAAE,OAAO,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAC5D,IAAI,CAAC,IAAI,KAAK;QAAE,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IACpD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAgB;IAC/C,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEtC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAE9C,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;QACvB,OAAO,aAAa,MAAM,eAAe,IAAI,CAAC,KAAK,kCAAkC,CAAC;IACxF,CAAC;IAED,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,aAAa,MAAM,eAAe,IAAI,CAAC,KAAK,wBAAwB,CAAC;IAC9E,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAElG,OAAO,aAAa,MAAM,aAAa,OAAO,QAAQ,IAAI,CAAC,KAAK,YAAY,CAAC;AAC/E,CAAC"}

package/dist/critique/critique.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Dual-critique review loop implementation.
+ *
+ * 3-agent pattern: initial review → self-critique → refined review.
+ * The self-critique step catches overreactions, false positives, and
+ * vague findings, producing a higher-quality final review.
+ */
+import type { GenerateTextFn } from '../providers/generate-fn.js';
+import type { ProgressCallback, ReviewFinding, ReviewResult } from '../types.js';
+import type { CritiqueResult, DualCritiqueInput, DualCritiqueResult } from './types.js';
+/**
+ * Parse the self-critique agent's structured response.
+ *
+ * Extracts OVERALL_ASSESSMENT and individual CRITIQUES with
+ * FINDING_INDEX, VERDICT, REASONING, and optional SUGGESTED_SEVERITY.
+ */
+export declare function parseCritiqueResponse(text: string): CritiqueResult;
+/**
+ * Apply critique verdicts to the initial findings.
+ * Returns the filtered and adjusted findings.
+ */
+export declare function applyCritique(findings: ReviewFinding[], critique: CritiqueResult): {
+    refined: ReviewFinding[];
+    removedCount: number;
+    adjustedCount: number;
+};
+/**
+ * Run the dual-critique review loop.
+ *
+ * Takes an already-completed initial review and runs it through
+ * the self-critique → refined review pipeline.
+ *
+ * @param initialReview - The initial review result from any agent mode
+ * @param input - Context needed for the critique agents
+ * @param generateFn - LLM generation function
+ * @param onProgress - Optional progress callback
+ * @returns DualCritiqueResult with refined findings
+ */
+export declare function runDualCritique(initialReview: ReviewResult, input: DualCritiqueInput, generateFn: GenerateTextFn, onProgress?: ProgressCallback): Promise<DualCritiqueResult>;
+//# sourceMappingURL=critique.d.ts.map

package/dist/critique/critique.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"critique.d.ts","sourceRoot":"","sources":["../../src/critique/critique.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAClE,OAAO,KAAK,EAAmB,gBAAgB,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAElG,OAAO,KAAK,EACV,cAAc,EAGd,iBAAiB,EACjB,kBAAkB,EAEnB,MAAM,YAAY,CAAC;AAiBpB;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,cAAc,CAwClE;AAoBD;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,aAAa,EAAE,EACzB,QAAQ,EAAE,cAAc,GACvB;IACD,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;CACvB,CA6CA;AAID;;;;;;;;;;;GAWG;AACH,wBAAsB,eAAe,CACnC,aAAa,EAAE,YAAY,EAC3B,KAAK,EAAE,iBAAiB,EACxB,UAAU,EAAE,cAAc,EAC1B,UAAU,CAAC,EAAE,gBAAgB,GAC5B,OAAO,CAAC,kBAAkB,CAAC,CAqF7B"}

package/dist/critique/critique.js

@@ -0,0 +1,194 @@
+/**
+ * Dual-critique review loop implementation.
+ *
+ * 3-agent pattern: initial review → self-critique → refined review.
+ * The self-critique step catches overreactions, false positives, and
+ * vague findings, producing a higher-quality final review.
+ */
+import { REFINED_REVIEW_SYSTEM, SELF_CRITIQUE_SYSTEM } from './prompts.js';
+import { DEFAULT_DUAL_CRITIQUE_CONFIG } from './types.js';
+// ─── Constants ─────────────────────────────────────────────────
+const VALID_VERDICTS = new Set([
+    'valid',
+    'false-positive',
+    'overreaction',
+    'vague',
+    'redundant',
+]);
+const VALID_SEVERITIES = new Set(['critical', 'high', 'medium', 'low', 'info']);
+// ─── Critique Parser ───────────────────────────────────────────
+/**
+ * Parse the self-critique agent's structured response.
+ *
+ * Extracts OVERALL_ASSESSMENT and individual CRITIQUES with
+ * FINDING_INDEX, VERDICT, REASONING, and optional SUGGESTED_SEVERITY.
+ */
+export function parseCritiqueResponse(text) {
+    // Extract overall assessment
+    const assessmentMatch = /OVERALL_ASSESSMENT:\s*(.+?)(?:\n\s*CRITIQUES:|$)/is.exec(text);
+    const overallAssessment = assessmentMatch?.[1]?.trim() ?? 'Assessment could not be parsed.';
+    // Extract individual critiques
+    const critiques = [];
+    const critiquePattern = /- FINDING_INDEX:\s*(\d+)\s*\n\s*VERDICT:\s*(\S+)\s*\n\s*REASONING:\s*(.+?)(?:\n\s*SUGGESTED_SEVERITY:\s*(\S+))?(?=\n\s*- FINDING_INDEX:|\n*$)/gis;
+    let match = critiquePattern.exec(text);
+    while (match !== null) {
+        const findingIndex = parseInt(match[1], 10);
+        const rawVerdict = match[2]?.toLowerCase();
+        const verdict = VALID_VERDICTS.has(rawVerdict) ? rawVerdict : 'valid';
+        const reasoning = match[3]?.trim() ?? '';
+        const critique = { findingIndex, verdict, reasoning };
+        if (verdict === 'overreaction' && match[4]) {
+            const rawSeverity = match[4].toLowerCase();
+            if (VALID_SEVERITIES.has(rawSeverity)) {
+                critique.suggestedSeverity = rawSeverity;
+            }
+        }
+        critiques.push(critique);
+        match = critiquePattern.exec(text);
+    }
+    const falsePositiveCount = critiques.filter((c) => c.verdict === 'false-positive').length;
+    const overreactionCount = critiques.filter((c) => c.verdict === 'overreaction').length;
+    return {
+        critiques,
+        overallAssessment,
+        falsePositiveCount,
+        overreactionCount,
+    };
+}
+// ─── Finding Serializer ────────────────────────────────────────
+/**
+ * Serialize findings into a text block for the critique agent.
+ */
+function serializeFindingsForCritique(findings) {
+    if (findings.length === 0)
+        return '(no findings)';
+    return findings
+        .map((f, i) => `[${i}] ${f.severity.toUpperCase()} | ${f.category} | ${f.file}:${f.line ?? 'N/A'}\n    ${f.message}${f.suggestion ? `\n    Suggestion: ${f.suggestion}` : ''}`)
+        .join('\n\n');
+}
+// ─── Apply Critique ────────────────────────────────────────────
+/**
+ * Apply critique verdicts to the initial findings.
+ * Returns the filtered and adjusted findings.
+ */
+export function applyCritique(findings, critique) {
+    // Build a map of critique by finding index
+    const critiqueMap = new Map();
+    for (const c of critique.critiques) {
+        critiqueMap.set(c.findingIndex, c);
+    }
+    const refined = [];
+    let removedCount = 0;
+    let adjustedCount = 0;
+    for (let i = 0; i < findings.length; i++) {
+        const finding = findings[i];
+        const crit = critiqueMap.get(i);
+        if (!crit) {
+            // No critique for this finding — keep as-is
+            refined.push(finding);
+            continue;
+        }
+        switch (crit.verdict) {
+            case 'false-positive':
+            case 'redundant':
+                removedCount++;
+                break;
+            case 'overreaction':
+                if (crit.suggestedSeverity) {
+                    refined.push({ ...finding, severity: crit.suggestedSeverity });
+                    adjustedCount++;
+                }
+                else {
+                    refined.push(finding);
+                }
+                break;
+            case 'vague':
+            case 'valid':
+            default:
+                refined.push(finding);
+                break;
+        }
+    }
+    return { refined, removedCount, adjustedCount };
+}
+// ─── Main Function ─────────────────────────────────────────────
+/**
+ * Run the dual-critique review loop.
+ *
+ * Takes an already-completed initial review and runs it through
+ * the self-critique → refined review pipeline.
+ *
+ * @param initialReview - The initial review result from any agent mode
+ * @param input - Context needed for the critique agents
+ * @param generateFn - LLM generation function
+ * @param onProgress - Optional progress callback
+ * @returns DualCritiqueResult with refined findings
+ */
+export async function runDualCritique(initialReview, input, generateFn, onProgress) {
+    const emit = onProgress ?? (() => { });
+    const config = {
+        ...DEFAULT_DUAL_CRITIQUE_CONFIG,
+        ...input.config,
+    };
+    const initialFindings = initialReview.findings.filter((f) => f.source === 'ai');
+    // Short-circuit: not enough findings to justify critique
+    if (initialFindings.length < config.minFindingsForCritique) {
+        emit({
+            step: 'dual-critique',
+            message: `Skipping critique — only ${initialFindings.length} AI finding(s) (min: ${config.minFindingsForCritique})`,
+        });
+        return {
+            status: initialReview.status,
+            summary: initialReview.summary,
+            findings: initialReview.findings,
+        };
+    }
+    // ── Step 1: Self-Critique ────────────────────────────────────
+    emit({
+        step: 'dual-critique',
+        message: `Running self-critique on ${initialFindings.length} AI finding(s)...`,
+    });
+    const critiquePrompt = `Here is the code diff:\n\n${input.diff}\n\nHere is the initial review with ${initialFindings.length} findings:\n\n${serializeFindingsForCritique(initialFindings)}\n\nPlease critique each finding.`;
+    const critiqueResponse = await generateFn(SELF_CRITIQUE_SYSTEM, critiquePrompt);
+    const critiqueResult = parseCritiqueResponse(critiqueResponse.text);
+    emit({
+        step: 'dual-critique',
+        message: `Critique complete: ${critiqueResult.falsePositiveCount} false positive(s), ${critiqueResult.overreactionCount} overreaction(s)`,
+    });
+    // ── Step 2: Apply Critique (deterministic) ───────────────────
+    // Apply the critique verdicts to filter/adjust findings
+    const { refined, removedCount, adjustedCount } = applyCritique(initialFindings, critiqueResult);
+    // Merge back non-AI findings (static analysis) untouched
+    const nonAiFindings = initialReview.findings.filter((f) => f.source !== 'ai');
+    const allRefinedFindings = [...refined, ...nonAiFindings];
+    emit({
+        step: 'dual-critique',
+        message: `Refined: ${removedCount} removed, ${adjustedCount} adjusted, ${refined.length} kept`,
+    });
+    // ── Step 3: Refined Summary ──────────────────────────────────
+    // Ask the LLM to produce a refined summary based on the surviving findings
+    const refinedPrompt = `Here is the code diff:\n\n${input.diff}\n\nInitial review summary: ${initialReview.summary}\n\nSelf-critique assessment: ${critiqueResult.overallAssessment}\n\nRemaining findings after critique (${refined.length}):\n${serializeFindingsForCritique(refined)}\n\nPlease produce the refined review.`;
+    const refinedResponse = await generateFn(REFINED_REVIEW_SYSTEM, refinedPrompt);
+    // Extract refined status and summary from response
+    const statusMatch = /STATUS:\s*(PASSED|FAILED|NEEDS_HUMAN_REVIEW|SKIPPED)/i.exec(refinedResponse.text);
+    const refinedStatus = statusMatch?.[1]?.toUpperCase() ?? initialReview.status;
+    const summaryMatch = /SUMMARY:\s*(.+?)(?:\n(?:FINDINGS:|$))/is.exec(refinedResponse.text);
+    const refinedSummary = summaryMatch?.[1]?.trim() ?? initialReview.summary;
+    // Build result
+    const result = {
+        status: refinedStatus,
+        summary: refinedSummary,
+        findings: allRefinedFindings,
+    };
+    if (config.includeCritiqueMetadata) {
+        result.critiqueMetadata = {
+            initialFindingCount: initialFindings.length,
+            finalFindingCount: refined.length,
+            removedAsFalsePositive: removedCount,
+            severityAdjusted: adjustedCount,
+            critiqueResult,
+        };
+    }
+    return result;
+}
+//# sourceMappingURL=critique.js.map

package/dist/critique/critique.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"critique.js","sourceRoot":"","sources":["../../src/critique/critique.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AAS3E,OAAO,EAAE,4BAA4B,EAAE,MAAM,YAAY,CAAC;AAE1D,kEAAkE;AAElE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAkB;IAC9C,OAAO;IACP,gBAAgB;IAChB,cAAc;IACd,OAAO;IACP,WAAW;CACZ,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AAEjG,kEAAkE;AAElE;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAY;IAChD,6BAA6B;IAC7B,MAAM,eAAe,GAAG,oDAAoD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxF,MAAM,iBAAiB,GAAG,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,iCAAiC,CAAC;IAE5F,+BAA+B;IAC/B,MAAM,SAAS,GAAsB,EAAE,CAAC;IAExC,MAAM,eAAe,GACnB,kJAAkJ,CAAC;IAErJ,IAAI,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,OAAO,KAAK,KAAK,IAAI,EAAE,CAAC;QACtB,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,EAAqB,CAAC;QAC9D,MAAM,OAAO,GAAoB,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC;QACvF,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QAEzC,MAAM,QAAQ,GAAoB,EAAE,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;QAEvE,IAAI,OAAO,KAAK,cAAc,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAqB,CAAC;YAC9D,IAAI,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtC,QAAQ,CAAC,iBAAiB,GAAG,WAAW,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,gBAAgB,CAAC,CAAC,MAAM,CAAC;IAC1F,MAAM,iBAAiB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,cAAc,CAAC,CAAC,MAAM,CAAC;IAEvF,OAAO;QACL,SAAS;QACT,iBAAiB;QACjB,kBAAkB;QAClB,iBAAiB;KAClB,CAAC;AACJ,CAAC;AAED,kEAAkE;AAElE;;GAEG;AACH,SAAS,4BAA4B,CAAC,QAAyB;IAC7D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,eAAe,CAAC;IAElD,OAAO,QAAQ;SACZ,GAAG,CACF,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,SAAS,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAClK;SACA,IAAI,CAAC,MAAM,CAAC,CAAC;AAClB,CAAC;AAED,kEAAkE;AAElE;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,QAAyB,EACzB,QAAwB;IAMxB,2CAA2C;IAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,EAA2B,CAAC;IACvD,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;QACnC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,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;QAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEhC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,4CAA4C;YAC5C,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtB,SAAS;QACX,CAAC;QAED,QAAQ,IAAI,CAAC,OAAO,EAAE,CAAC;YACrB,KAAK,gBAAgB,CAAC;YACtB,KAAK,WAAW;gBACd,YAAY,EAAE,CAAC;gBACf,MAAM;YAER,KAAK,cAAc;gBACjB,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC;oBAC/D,aAAa,EAAE,CAAC;gBAClB,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxB,CAAC;gBACD,MAAM;YAER,KAAK,OAAO,CAAC;YACb,KAAK,OAAO,CAAC;YACb;gBACE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtB,MAAM;QACV,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;AAClD,CAAC;AAED,kEAAkE;AAElE;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,aAA2B,EAC3B,KAAwB,EACxB,UAA0B,EAC1B,UAA6B;IAE7B,MAAM,IAAI,GAAG,UAAU,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACtC,MAAM,MAAM,GAAuB;QACjC,GAAG,4BAA4B;QAC/B,GAAG,KAAK,CAAC,MAAM;KAChB,CAAC;IAEF,MAAM,eAAe,GAAG,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;IAEhF,yDAAyD;IACzD,IAAI,eAAe,CAAC,MAAM,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QAC3D,IAAI,CAAC;YACH,IAAI,EAAE,eAAe;YACrB,OAAO,EAAE,4BAA4B,eAAe,CAAC,MAAM,wBAAwB,MAAM,CAAC,sBAAsB,GAAG;SACpH,CAAC,CAAC;QACH,OAAO;YACL,MAAM,EAAE,aAAa,CAAC,MAAM;YAC5B,OAAO,EAAE,aAAa,CAAC,OAAO;YAC9B,QAAQ,EAAE,aAAa,CAAC,QAAQ;SACjC,CAAC;IACJ,CAAC;IAED,gEAAgE;IAChE,IAAI,CAAC;QACH,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE,4BAA4B,eAAe,CAAC,MAAM,mBAAmB;KAC/E,CAAC,CAAC;IAEH,MAAM,cAAc,GAAG,6BAA6B,KAAK,CAAC,IAAI,uCAAuC,eAAe,CAAC,MAAM,iBAAiB,4BAA4B,CAAC,eAAe,CAAC,mCAAmC,CAAC;IAE7N,MAAM,gBAAgB,GAAG,MAAM,UAAU,CAAC,oBAAoB,EAAE,cAAc,CAAC,CAAC;IAChF,MAAM,cAAc,GAAG,qBAAqB,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAEpE,IAAI,CAAC;QACH,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE,sBAAsB,cAAc,CAAC,kBAAkB,uBAAuB,cAAc,CAAC,iBAAiB,kBAAkB;KAC1I,CAAC,CAAC;IAEH,gEAAgE;IAChE,wDAAwD;IACxD,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa,CAAC,eAAe,EAAE,cAAc,CAAC,CAAC;IAEhG,yDAAyD;IACzD,MAAM,aAAa,GAAG,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC;IAC9E,MAAM,kBAAkB,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,aAAa,CAAC,CAAC;IAE1D,IAAI,CAAC;QACH,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE,YAAY,YAAY,aAAa,aAAa,cAAc,OAAO,CAAC,MAAM,OAAO;KAC/F,CAAC,CAAC;IAEH,gEAAgE;IAChE,2EAA2E;IAC3E,MAAM,aAAa,GAAG,6BAA6B,KAAK,CAAC,IAAI,+BAA+B,aAAa,CAAC,OAAO,iCAAiC,cAAc,CAAC,iBAAiB,0CAA0C,OAAO,CAAC,MAAM,OAAO,4BAA4B,CAAC,OAAO,CAAC,wCAAwC,CAAC;IAE/T,MAAM,eAAe,GAAG,MAAM,UAAU,CAAC,qBAAqB,EAAE,aAAa,CAAC,CAAC;IAE/E,mDAAmD;IACnD,MAAM,WAAW,GAAG,uDAAuD,CAAC,IAAI,CAC9E,eAAe,CAAC,IAAI,CACrB,CAAC;IACF,MAAM,aAAa,GAChB,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAA6B,IAAI,aAAa,CAAC,MAAM,CAAC;IAEtF,MAAM,YAAY,GAAG,yCAAyC,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAC1F,MAAM,cAAc,GAAG,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,aAAa,CAAC,OAAO,CAAC;IAE1E,eAAe;IACf,MAAM,MAAM,GAAuB;QACjC,MAAM,EAAE,aAAa;QACrB,OAAO,EAAE,cAAc;QACvB,QAAQ,EAAE,kBAAkB;KAC7B,CAAC;IAEF,IAAI,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,MAAM,CAAC,gBAAgB,GAAG;YACxB,mBAAmB,EAAE,eAAe,CAAC,MAAM;YAC3C,iBAAiB,EAAE,OAAO,CAAC,MAAM;YACjC,sBAAsB,EAAE,YAAY;YACpC,gBAAgB,EAAE,aAAa;YAC/B,cAAc;SACf,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}