@gracker/smartperfetto 1.0.13

package/dist/agentv3/projectMemory.js

@@ -0,0 +1,334 @@
+"use strict";
+// SPDX-License-Identifier: AGPL-3.0-or-later
+// Copyright (C) 2024-2026 Gracker (Chris)
+// This file is part of SmartPerfetto. See LICENSE for details.
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ProjectMemory = void 0;
+/**
+ * ProjectMemory — independent storage for project- and world-scope
+ * memory entries (Plan 44).
+ *
+ * Codex round 1 P1#3 locked in: this module does NOT modify
+ * `analysisPatternMemory.ts`. Session-scope entries stay in the
+ * existing 200-entry weighted-Jaccard store with the supersede
+ * integration intact; project + world entries live here, in
+ * `backend/logs/analysis_project_memory.json`, on a separate
+ * lifecycle.
+ *
+ * Plan 44 M0 scope (this file):
+ * - Save / get / remove / list `ProjectMemoryEntry` records.
+ * - Service-layer invariants the schema does NOT enforce so older
+ *   snapshots remain readable:
+ *     - `scope='world'` requires `promotionPolicy` (Codex round 3
+ *       P1#2 testability fix). Save throws when missing.
+ *     - `promoteEntry()` rejects any trigger outside the enum —
+ *       auto promotion is forbidden by design.
+ *     - `recallProjectMemory()` MUST NOT write — Codex round 2 P1#1
+ *       caught `recall_patterns` quietly mutating the supersede
+ *       store via `openSupersedeStore`. The recall path here calls
+ *       a single in-memory load (idempotent) and never persists.
+ * - Promotion audit log: every promote() call appends to
+ *   `promotionAudit[]` so the reviewer trail survives even if the
+ *   target entry is later removed.
+ *
+ * Out of scope:
+ * - The feedback → case → skill draft pipeline (M1, separate file).
+ * - The `recall_project_memory` MCP tool (M1, in claudeMcpServer.ts).
+ * - The admin-only `/api/memory/promote` route + `consolidate_to_world_memory`
+ *   (M2).
+ *
+ * @module projectMemory
+ */
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const scopedKnowledgeStore_1 = require("../services/scopedKnowledgeStore");
+const VALID_PROMOTION_TRIGGERS = new Set([
+    'user_feedback',
+    'reviewer_approval',
+    'skill_eval_pass',
+]);
+const KNOWLEDGE_KIND = 'project_memory';
+const MEMORY_ROW_SCOPE_PREFIX = 'memory:';
+/**
+ * ProjectMemory — local file-backed store for project + world entries.
+ * Session entries stay in `analysisPatternMemory.ts` and are not
+ * touched by this class.
+ */
+class ProjectMemory {
+    constructor(storagePath) {
+        this.entries = new Map();
+        this.auditLog = [];
+        this.loaded = false;
+        this.storagePath = storagePath;
+    }
+    /** Idempotently load on-disk state into memory. */
+    load() {
+        if (this.loaded)
+            return;
+        this.loaded = true;
+        if (!fs.existsSync(this.storagePath))
+            return;
+        try {
+            const raw = fs.readFileSync(this.storagePath, 'utf-8');
+            const parsed = JSON.parse(raw);
+            if (parsed.schemaVersion !== 1 ||
+                !Array.isArray(parsed.entries) ||
+                !Array.isArray(parsed.promotionAudit)) {
+                return;
+            }
+            for (const e of parsed.entries)
+                this.entries.set(e.entryId, e);
+            this.auditLog.push(...parsed.promotionAudit);
+        }
+        catch {
+            // Corrupted JSON: preserve file for inspection, leave cache empty.
+        }
+    }
+    /**
+     * Save (insert or replace) an entry. Throws when:
+     *   - scope is 'session' (those belong in analysisPatternMemory.ts)
+     *   - scope is 'world' but promotionPolicy is missing
+     *   - promotionPolicy carries a trigger outside the canonical enum
+     */
+    saveProjectMemoryEntry(entry, storageScope) {
+        this.load();
+        this.assertSaveInvariants(entry);
+        if ((0, scopedKnowledgeStore_1.legacyKnowledgeFilesystemWritesEnabled)()) {
+            this.entries.set(entry.entryId, entry);
+            this.persist();
+        }
+        if ((0, scopedKnowledgeStore_1.enterpriseKnowledgeDbWritesEnabled)()) {
+            (0, scopedKnowledgeStore_1.upsertScopedKnowledgeRecord)(KNOWLEDGE_KIND, entry.entryId, memoryRowScope(entry.scope), entry, storageScope, {
+                createdAt: entry.createdAt,
+                updatedAt: entry.lastSeenAt ?? entry.createdAt,
+                sourceRunId: storageScope?.sourceRunId ?? storageScope?.runId,
+            });
+        }
+    }
+    /** Get an entry by id. */
+    getProjectMemoryEntry(entryId, storageScope) {
+        if ((0, scopedKnowledgeStore_1.enterpriseKnowledgeStoreEnabled)()) {
+            return (0, scopedKnowledgeStore_1.getScopedKnowledgeRecord)(KNOWLEDGE_KIND, entryId, storageScope)?.record;
+        }
+        this.load();
+        return this.entries.get(entryId);
+    }
+    /** Remove an entry. Returns whether it was present. The promotion
+     * audit log is NOT redacted — past promotions stay traceable. */
+    removeProjectMemoryEntry(entryId, storageScope) {
+        let removed = false;
+        if ((0, scopedKnowledgeStore_1.enterpriseKnowledgeDbWritesEnabled)()) {
+            removed = (0, scopedKnowledgeStore_1.removeScopedKnowledgeRecord)(KNOWLEDGE_KIND, entryId, storageScope) || removed;
+        }
+        if ((0, scopedKnowledgeStore_1.legacyKnowledgeFilesystemWritesEnabled)()) {
+            this.load();
+            const had = this.entries.delete(entryId);
+            if (had)
+                this.persist();
+            removed = had || removed;
+        }
+        return removed;
+    }
+    /** Filtered list, deterministically ordered by entryId. */
+    listProjectMemoryEntries(opts = {}, storageScope) {
+        this.load();
+        let out = (0, scopedKnowledgeStore_1.enterpriseKnowledgeStoreEnabled)()
+            ? (0, scopedKnowledgeStore_1.listScopedKnowledgeRecords)(KNOWLEDGE_KIND, storageScope, {
+                rowScope: opts.scope ? memoryRowScope(opts.scope) : undefined,
+                rowScopePrefix: opts.scope ? undefined : MEMORY_ROW_SCOPE_PREFIX,
+            }).map(row => row.record)
+            : Array.from(this.entries.values());
+        if (opts.scope)
+            out = out.filter(e => e.scope === opts.scope);
+        if (opts.projectKey)
+            out = out.filter(e => e.projectKey === opts.projectKey);
+        if (opts.anyOfTags && opts.anyOfTags.length > 0) {
+            const wanted = new Set(opts.anyOfTags);
+            out = out.filter(e => e.tags.some(t => wanted.has(t)));
+        }
+        out.sort((a, b) => a.entryId.localeCompare(b.entryId));
+        return out;
+    }
+    /**
+     * Pure-read recall. Scores entries by tag overlap with the query
+     * tags. Never writes — `lastSeenAt` and any other mutable counters
+     * remain frozen even after thousands of recall calls.
+     */
+    recallProjectMemory(opts = {}, storageScope) {
+        this.load();
+        const topK = opts.topK ?? 5;
+        const wantedTags = opts.tags ? new Set(opts.tags) : null;
+        const candidates = [];
+        const entries = (0, scopedKnowledgeStore_1.enterpriseKnowledgeStoreEnabled)()
+            ? (0, scopedKnowledgeStore_1.listScopedKnowledgeRecords)(KNOWLEDGE_KIND, storageScope, {
+                rowScope: opts.scope ? memoryRowScope(opts.scope) : undefined,
+                rowScopePrefix: opts.scope ? undefined : MEMORY_ROW_SCOPE_PREFIX,
+            }).map(row => row.record)
+            : Array.from(this.entries.values());
+        for (const entry of entries) {
+            if (opts.scope && entry.scope !== opts.scope)
+                continue;
+            if (opts.projectKey && entry.projectKey !== opts.projectKey)
+                continue;
+            if (entry.unsupportedReason)
+                continue;
+            let score = 0;
+            if (wantedTags) {
+                for (const t of entry.tags)
+                    if (wantedTags.has(t))
+                        score += 1;
+                if (score === 0)
+                    continue;
+                score = score / Math.max(wantedTags.size, 1);
+            }
+            else {
+                // No tag query — rank everything by confidence.
+                score = entry.confidence;
+            }
+            // Defensive copy so callers cannot mutate stored state via the hit.
+            candidates.push({ entry: { ...entry, tags: [...entry.tags] }, score });
+        }
+        candidates.sort((a, b) => b.score - a.score);
+        return candidates.slice(0, topK);
+    }
+    /**
+     * Promote an entry across scopes per the supplied policy. Throws on
+     * any trigger outside the enum; appends a row to the promotion
+     * audit log; sets `entry.promotionPolicy` to the supplied policy.
+     */
+    promoteEntry(entryId, policy, storageScope) {
+        this.load();
+        if (!VALID_PROMOTION_TRIGGERS.has(policy.trigger)) {
+            throw new Error(`Invalid promotion trigger '${policy.trigger}'; auto-promotion is forbidden`);
+        }
+        if (policy.toScope === 'world' && policy.trigger !== 'reviewer_approval') {
+            throw new Error(`Promotion to scope='world' requires trigger='reviewer_approval'; got '${policy.trigger}'`);
+        }
+        if (policy.trigger === 'reviewer_approval' && !policy.reviewer) {
+            throw new Error("Promotion with trigger='reviewer_approval' requires a `reviewer` field");
+        }
+        if (policy.trigger === 'skill_eval_pass' && !policy.evalCaseId) {
+            throw new Error("Promotion with trigger='skill_eval_pass' requires an `evalCaseId` field");
+        }
+        const entry = (0, scopedKnowledgeStore_1.enterpriseKnowledgeStoreEnabled)()
+            ? (0, scopedKnowledgeStore_1.getScopedKnowledgeRecord)(KNOWLEDGE_KIND, entryId, storageScope)?.record
+            : this.entries.get(entryId);
+        if (!entry) {
+            throw new Error(`Cannot promote: entry '${entryId}' not found`);
+        }
+        if (entry.scope !== policy.fromScope) {
+            throw new Error(`Promotion fromScope='${policy.fromScope}' does not match current scope '${entry.scope}'`);
+        }
+        const promoted = {
+            ...entry,
+            scope: policy.toScope,
+            promotionLevel: (entry.promotionLevel ?? 0) + 1,
+            promotionPolicy: policy,
+        };
+        const auditEntry = { entryId, policy, auditedAt: Date.now() };
+        let auditRecorded = false;
+        if ((0, scopedKnowledgeStore_1.legacyKnowledgeFilesystemWritesEnabled)()) {
+            this.entries.set(entryId, promoted);
+            this.auditLog.push(auditEntry);
+            this.persist();
+            auditRecorded = true;
+        }
+        if ((0, scopedKnowledgeStore_1.enterpriseKnowledgeDbWritesEnabled)()) {
+            (0, scopedKnowledgeStore_1.upsertScopedKnowledgeRecord)(KNOWLEDGE_KIND, entryId, memoryRowScope(promoted.scope), promoted, storageScope, {
+                createdAt: promoted.createdAt,
+                updatedAt: Date.now(),
+                sourceRunId: storageScope?.sourceRunId ?? storageScope?.runId,
+            });
+            if (!auditRecorded)
+                this.auditLog.push(auditEntry);
+        }
+    }
+    /** Read-only view of the audit log, sorted by audit time ascending. */
+    getPromotionAudit() {
+        this.load();
+        return [...this.auditLog].sort((a, b) => a.auditedAt - b.auditedAt);
+    }
+    /** Count entries currently in storage by scope. */
+    getStats(storageScope) {
+        this.load();
+        const out = { project: 0, world: 0 };
+        const entries = (0, scopedKnowledgeStore_1.enterpriseKnowledgeStoreEnabled)()
+            ? (0, scopedKnowledgeStore_1.listScopedKnowledgeRecords)(KNOWLEDGE_KIND, storageScope, { rowScopePrefix: MEMORY_ROW_SCOPE_PREFIX }).map(row => row.record)
+            : Array.from(this.entries.values());
+        for (const entry of entries) {
+            if (entry.scope === 'project')
+                out.project++;
+            else if (entry.scope === 'world')
+                out.world++;
+        }
+        return out;
+    }
+    assertSaveInvariants(entry) {
+        if (entry.scope === 'session') {
+            throw new Error(`ProjectMemory does not store session-scope entries; use analysisPatternMemory.ts instead`);
+        }
+        if (entry.scope === 'world' && !entry.promotionPolicy) {
+            throw new Error(`Entry '${entry.entryId}' with scope='world' must carry a promotionPolicy`);
+        }
+        if (entry.promotionPolicy &&
+            !VALID_PROMOTION_TRIGGERS.has(entry.promotionPolicy.trigger)) {
+            throw new Error(`Entry '${entry.entryId}' has an invalid promotion trigger '${entry.promotionPolicy.trigger}'`);
+        }
+    }
+    /** Atomic temp+rename. Same contract as ragStore / baselineStore. */
+    persist() {
+        const dir = path.dirname(this.storagePath);
+        if (!fs.existsSync(dir))
+            fs.mkdirSync(dir, { recursive: true });
+        // Per-process unique tmp suffix — Codex round E P1#5.
+        const tmp = `${this.storagePath}.tmp.${process.pid}.${Math.random().toString(36).slice(2)}`;
+        const envelope = {
+            schemaVersion: 1,
+            entries: Array.from(this.entries.values()),
+            promotionAudit: [...this.auditLog],
+        };
+        fs.writeFileSync(tmp, JSON.stringify(envelope, null, 2), 'utf-8');
+        fs.renameSync(tmp, this.storagePath);
+    }
+}
+exports.ProjectMemory = ProjectMemory;
+function memoryRowScope(scope) {
+    if (scope === 'session') {
+        throw new Error(`ProjectMemory does not store session-scope entries`);
+    }
+    return `${MEMORY_ROW_SCOPE_PREFIX}${scope}`;
+}
+//# sourceMappingURL=projectMemory.js.map

package/dist/agentv3/projectMemory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"projectMemory.js","sourceRoot":"","sources":["../../src/agentv3/projectMemory.ts"],"names":[],"mappings":";AAAA,6CAA6C;AAC7C,0CAA0C;AAC1C,+DAA+D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAE/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAEH,uCAAyB;AACzB,2CAA6B;AAQ7B,2EAS0C;AAE1C,MAAM,wBAAwB,GAAwC,IAAI,GAAG,CAAC;IAC5E,eAAe;IACf,mBAAmB;IACnB,iBAAiB;CAClB,CAAC,CAAC;AAiBH,MAAM,cAAc,GAAG,gBAAgB,CAAC;AACxC,MAAM,uBAAuB,GAAG,SAAS,CAAC;AA4B1C;;;;GAIG;AACH,MAAa,aAAa;IAMxB,YAAY,WAAmB;QAJd,YAAO,GAAG,IAAI,GAAG,EAA8B,CAAC;QAChD,aAAQ,GAA0B,EAAE,CAAC;QAC9C,WAAM,GAAG,KAAK,CAAC;QAGrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,mDAAmD;IACnD,IAAI;QACF,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC;YAAE,OAAO;QAC7C,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;YACvD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAoB,CAAC;YAClD,IACE,MAAM,CAAC,aAAa,KAAK,CAAC;gBAC1B,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC;gBAC9B,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,EACrC,CAAC;gBACD,OAAO;YACT,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC/D,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,mEAAmE;QACrE,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,sBAAsB,CACpB,KAAyB,EACzB,YAA6B;QAE7B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,IAAA,6DAAsC,GAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACvC,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC;QACD,IAAI,IAAA,yDAAkC,GAAE,EAAE,CAAC;YACzC,IAAA,kDAA2B,EACzB,cAAc,EACd,KAAK,CAAC,OAAO,EACb,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,EAC3B,KAAK,EACL,YAAY,EACZ;gBACE,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,SAAS,EAAE,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,SAAS;gBAC9C,WAAW,EAAE,YAAY,EAAE,WAAW,IAAI,YAAY,EAAE,KAAK;aAC9D,CACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,qBAAqB,CACnB,OAAe,EACf,YAA6B;QAE7B,IAAI,IAAA,sDAA+B,GAAE,EAAE,CAAC;YACtC,OAAO,IAAA,+CAAwB,EAC7B,cAAc,EACd,OAAO,EACP,YAAY,CACb,EAAE,MAAM,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED;qEACiE;IACjE,wBAAwB,CACtB,OAAe,EACf,YAA6B;QAE7B,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,IAAA,yDAAkC,GAAE,EAAE,CAAC;YACzC,OAAO,GAAG,IAAA,kDAA2B,EAAC,cAAc,EAAE,OAAO,EAAE,YAAY,CAAC,IAAI,OAAO,CAAC;QAC1F,CAAC;QACD,IAAI,IAAA,6DAAsC,GAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACzC,IAAI,GAAG;gBAAE,IAAI,CAAC,OAAO,EAAE,CAAC;YACxB,OAAO,GAAG,GAAG,IAAI,OAAO,CAAC;QAC3B,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,2DAA2D;IAC3D,wBAAwB,CACtB,OAAoB,EAAE,EACtB,YAA6B;QAE7B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,GAAG,GAAG,IAAA,sDAA+B,GAAE;YACzC,CAAC,CAAC,IAAA,iDAA0B,EACxB,cAAc,EACd,YAAY,EACZ;gBACE,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC7D,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,uBAAuB;aACjE,CACF,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;YAC1B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK;YAAE,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,UAAU;YACjB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QACvD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,mBAAmB,CACjB,OAAsB,EAAE,EACxB,YAA6B;QAE7B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;QAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACzD,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAA,sDAA+B,GAAE;YAC/C,CAAC,CAAC,IAAA,iDAA0B,EACxB,cAAc,EACd,YAAY,EACZ;gBACE,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC7D,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,uBAAuB;aACjE,CACF,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;YAC1B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAEtC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK;gBAAE,SAAS;YACvD,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU;gBAAE,SAAS;YACtE,IAAI,KAAK,CAAC,iBAAiB;gBAAE,SAAS;YACtC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,UAAU,EAAE,CAAC;gBACf,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI;oBAAE,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,KAAK,IAAI,CAAC,CAAC;gBAC9D,IAAI,KAAK,KAAK,CAAC;oBAAE,SAAS;gBAC1B,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACN,gDAAgD;gBAChD,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC;YAC3B,CAAC;YACD,oEAAoE;YACpE,UAAU,CAAC,IAAI,CAAC,EAAC,KAAK,EAAE,EAAC,GAAG,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,EAAE,KAAK,EAAC,CAAC,CAAC;QACrE,CAAC;QAED,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,YAAY,CACV,OAAe,EACf,MAA6B,EAC7B,YAA6B;QAE7B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,KAAK,CACb,8BAA8B,MAAM,CAAC,OAAO,gCAAgC,CAC7E,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,KAAK,OAAO,IAAI,MAAM,CAAC,OAAO,KAAK,mBAAmB,EAAE,CAAC;YACzE,MAAM,IAAI,KAAK,CACb,yEAAyE,MAAM,CAAC,OAAO,GAAG,CAC3F,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,KAAK,mBAAmB,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC/D,MAAM,IAAI,KAAK,CACb,wEAAwE,CACzE,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,OAAO,KAAK,iBAAiB,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAC/D,MAAM,IAAI,KAAK,CACb,yEAAyE,CAC1E,CAAC;QACJ,CAAC;QACD,MAAM,KAAK,GAAG,IAAA,sDAA+B,GAAE;YAC7C,CAAC,CAAC,IAAA,+CAAwB,EACtB,cAAc,EACd,OAAO,EACP,YAAY,CACb,EAAE,MAAM;YACX,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,0BAA0B,OAAO,aAAa,CAAC,CAAC;QAClE,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC,SAAS,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CACb,wBAAwB,MAAM,CAAC,SAAS,mCAAmC,KAAK,CAAC,KAAK,GAAG,CAC1F,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAuB;YACnC,GAAG,KAAK;YACR,KAAK,EAAE,MAAM,CAAC,OAAO;YACrB,cAAc,EAAE,CAAC,KAAK,CAAC,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC;YAC/C,eAAe,EAAE,MAAM;SACxB,CAAC;QACF,MAAM,UAAU,GAAG,EAAC,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAC,CAAC;QAC5D,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,IAAI,IAAA,6DAAsC,GAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YACpC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/B,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,aAAa,GAAG,IAAI,CAAC;QACvB,CAAC;QACD,IAAI,IAAA,yDAAkC,GAAE,EAAE,CAAC;YACzC,IAAA,kDAA2B,EACzB,cAAc,EACd,OAAO,EACP,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,EAC9B,QAAQ,EACR,YAAY,EACZ;gBACE,SAAS,EAAE,QAAQ,CAAC,SAAS;gBAC7B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,WAAW,EAAE,YAAY,EAAE,WAAW,IAAI,YAAY,EAAE,KAAK;aAC9D,CACF,CAAC;YACF,IAAI,CAAC,aAAa;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,iBAAiB;QACf,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IACtE,CAAC;IAED,mDAAmD;IACnD,QAAQ,CAAC,YAA6B;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,GAAG,GAAG,EAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC;QACnC,MAAM,OAAO,GAAG,IAAA,sDAA+B,GAAE;YAC/C,CAAC,CAAC,IAAA,iDAA0B,EACxB,cAAc,EACd,YAAY,EACZ,EAAC,cAAc,EAAE,uBAAuB,EAAC,CAC1C,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;YAC1B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;gBAAE,GAAG,CAAC,OAAO,EAAE,CAAC;iBACxC,IAAI,KAAK,CAAC,KAAK,KAAK,OAAO;gBAAE,GAAG,CAAC,KAAK,EAAE,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,oBAAoB,CAAC,KAAyB;QACpD,IAAK,KAAK,CAAC,KAAgB,KAAK,SAAS,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CACb,0FAA0F,CAC3F,CAAC;QACJ,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CACb,UAAU,KAAK,CAAC,OAAO,mDAAmD,CAC3E,CAAC;QACJ,CAAC;QACD,IACE,KAAK,CAAC,eAAe;YACrB,CAAC,wBAAwB,CAAC,GAAG,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,EAC5D,CAAC;YACD,MAAM,IAAI,KAAK,CACb,UAAU,KAAK,CAAC,OAAO,uCAAuC,KAAK,CAAC,eAAe,CAAC,OAAO,GAAG,CAC/F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,qEAAqE;IAC7D,OAAO;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC3C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAC,SAAS,EAAE,IAAI,EAAC,CAAC,CAAC;QAC9D,sDAAsD;QACtD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,WAAW,QAAQ,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5F,MAAM,QAAQ,GAAoB;YAChC,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1C,cAAc,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;SACnC,CAAC;QACF,EAAE,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAClE,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC;CACF;AAnTD,sCAmTC;AAED,SAAS,cAAc,CAAC,KAAkB;IACxC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,GAAG,uBAAuB,GAAG,KAAK,EAAE,CAAC;AAC9C,CAAC"}

package/dist/agentv3/queryComplexityClassifier.d.ts

@@ -0,0 +1,21 @@
+import { type ClaudeAgentConfig } from './claudeConfig';
+import type { ComplexityClassifierInput, QueryComplexity } from './types';
+/**
+ * Local-only classification using keyword pre-filter + hard rules.
+ * Returns null when no local rule matches, so callers can decide their own
+ * AI fallback. Provider-agnostic: zero LLM/SDK dependency.
+ */
+export declare function classifyQueryComplexityLocal(input: ComplexityClassifierInput): {
+    complexity: QueryComplexity;
+    reason: string;
+    source: 'hard_rule';
+} | null;
+/**
+ * Classify query complexity using hard rules + optional AI classification.
+ */
+export declare function classifyQueryComplexity(input: ComplexityClassifierInput, config?: Pick<ClaudeAgentConfig, 'lightModel' | 'classifierTimeoutMs'>): Promise<{
+    complexity: QueryComplexity;
+    reason: string;
+    source: 'hard_rule' | 'ai';
+}>;
+//# sourceMappingURL=queryComplexityClassifier.d.ts.map

package/dist/agentv3/queryComplexityClassifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queryComplexityClassifier.d.ts","sourceRoot":"","sources":["../../src/agentv3/queryComplexityClassifier.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAoC,KAAK,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAE1F,OAAO,KAAK,EAAE,yBAAyB,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAgC1E;;;;GAIG;AACH,wBAAgB,4BAA4B,CAC1C,KAAK,EAAE,yBAAyB,GAC/B;IAAE,UAAU,EAAE,eAAe,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,CAAA;CAAE,GAAG,IAAI,CAc7E;AAED;;GAEG;AACH,wBAAsB,uBAAuB,CAC3C,KAAK,EAAE,yBAAyB,EAChC,MAAM,CAAC,EAAE,IAAI,CAAC,iBAAiB,EAAE,YAAY,GAAG,qBAAqB,CAAC,GACrE,OAAO,CAAC;IAAE,UAAU,EAAE,eAAe,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,GAAG,IAAI,CAAA;CAAE,CAAC,CAYtF"}

package/dist/agentv3/queryComplexityClassifier.js

@@ -0,0 +1,196 @@
+"use strict";
+// SPDX-License-Identifier: AGPL-3.0-or-later
+// Copyright (C) 2024-2026 Gracker (Chris)
+// This file is part of SmartPerfetto. See LICENSE for details.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.classifyQueryComplexityLocal = classifyQueryComplexityLocal;
+exports.classifyQueryComplexity = classifyQueryComplexity;
+/**
+ * Query Complexity Classifier — routes queries to quick vs full analysis pipeline.
+ *
+ * Two-stage classification:
+ * 1. Hard rules (instant, no LLM): selection context → scoped quick,
+ *    comparison/drill-down/deterministic scenes → full
+ * 2. AI classification (Haiku, ~1-2s): for remaining queries, determine if the question
+ *    is a simple factual lookup or requires multi-step analysis
+ *
+ * Graceful degradation: if Haiku call fails, defaults to 'full' (safe fallback).
+ */
+const claude_agent_sdk_1 = require("@anthropic-ai/claude-agent-sdk");
+const claudeConfig_1 = require("./claudeConfig");
+const strategyLoader_1 = require("./strategyLoader");
+/** Drill-down keywords force 'full' — user explicitly wants deeper analysis even as follow-up.
+ *  These short-circuit Haiku classification to save 1-2s latency on obvious drill-downs. */
+const DRILL_DOWN_KEYWORDS = [
+    // 中文
+    '为什么', '根因', '原因', '深入', '进一步', '详细分析',
+    '具体看看', '哪里慢', '细说', '为啥',
+    // 英文 (matched case-insensitive)
+    'why', 'root cause', 'deeper', 'drill down', 'investigate', 'detail', 'explain', 'dig into',
+];
+/** Confirm-like keywords force 'quick' when the query is short — covers "谢谢"/"ok" style follow-ups. */
+const CONFIRM_KEYWORDS = [
+    // 中文
+    '谢谢', '好的', '明白了', '嗯', '收到', '知道了', '了解',
+    // 英文
+    'thanks', 'thank you', 'ok', 'okay', 'got it', 'understood',
+];
+/** Upper bound for treating CONFIRM_KEYWORDS as a pure confirmation.
+ *  Longer queries (e.g., "谢谢你，但具体第几帧最卡") mix confirmation with real follow-up intent. */
+const CONFIRM_MAX_LENGTH = 20;
+/** Scenes that always require full analysis (prescriptive multi-step workflows).
+ *  Note: memory/game/overview/touch-tracking are intentionally NOT included — they have
+ *  valid quick-query use cases (e.g., "内存多少？", "帧率是多少？"). Only `general` uses Haiku fallback. */
+const DETERMINISTIC_SCENES = new Set([
+    'scrolling', 'startup', 'anr', 'interaction', 'scroll_response',
+    'teaching', 'pipeline',
+]);
+/**
+ * Local-only classification using keyword pre-filter + hard rules.
+ * Returns null when no local rule matches, so callers can decide their own
+ * AI fallback. Provider-agnostic: zero LLM/SDK dependency.
+ */
+function classifyQueryComplexityLocal(input) {
+    const kwResult = applyKeywordRules(input.query);
+    if (kwResult) {
+        console.log(`[ComplexityClassifier] Keyword → ${kwResult.complexity}: ${kwResult.reason}`);
+        return { ...kwResult, source: 'hard_rule' };
+    }
+    const hardResult = applyHardRules(input);
+    if (hardResult) {
+        console.log(`[ComplexityClassifier] Hard rule → ${hardResult.complexity}: ${hardResult.reason}`);
+        return { ...hardResult, source: 'hard_rule' };
+    }
+    return null;
+}
+/**
+ * Classify query complexity using hard rules + optional AI classification.
+ */
+async function classifyQueryComplexity(input, config) {
+    const local = classifyQueryComplexityLocal(input);
+    if (local)
+        return local;
+    try {
+        const aiResult = await classifyWithHaiku(input.query, config?.lightModel, config?.classifierTimeoutMs);
+        console.log(`[ComplexityClassifier] AI → ${aiResult.complexity}: ${aiResult.reason}`);
+        return { ...aiResult, source: 'ai' };
+    }
+    catch (err) {
+        console.warn('[ComplexityClassifier] Haiku classification failed, defaulting to full:', err.message);
+        return { complexity: 'full', reason: 'AI classification failed (graceful degradation)', source: 'ai' };
+    }
+}
+/**
+ * Hard rules that route without needing AI.
+ * Returns null if no hard rule matches (proceed to AI classification).
+ */
+function applyHardRules(input) {
+    if (input.hasReferenceTrace) {
+        return { complexity: 'full', reason: 'comparison mode' };
+    }
+    if (input.hasSelectionContext) {
+        const kind = input.selectionContext?.kind ?? 'unknown';
+        return { complexity: 'quick', reason: `UI ${kind} selection context present` };
+    }
+    if (input.hasExistingFindings) {
+        return { complexity: 'full', reason: 'prior findings exist' };
+    }
+    if (input.hasPriorFullAnalysis) {
+        return { complexity: 'full', reason: 'multi-turn continuity' };
+    }
+    if (DETERMINISTIC_SCENES.has(input.sceneType)) {
+        return { complexity: 'full', reason: `deterministic scene: ${input.sceneType}` };
+    }
+    return null;
+}
+/**
+ * Keyword-based pre-filter (runs before applyHardRules).
+ * - Drill-down keywords → force full (user explicitly wants depth even as follow-up)
+ * - Confirm-like keywords in short queries → force quick (pure acknowledgement follow-ups)
+ * Returns null when nothing matches, so hard rules + Haiku still get a turn.
+ */
+function applyKeywordRules(query) {
+    const lower = query.toLowerCase();
+    for (const kw of DRILL_DOWN_KEYWORDS) {
+        if (lower.includes(kw.toLowerCase())) {
+            return { complexity: 'full', reason: `drill-down keyword match: "${kw}"` };
+        }
+    }
+    if (query.length < CONFIRM_MAX_LENGTH) {
+        for (const kw of CONFIRM_KEYWORDS) {
+            if (lower.includes(kw.toLowerCase())) {
+                return { complexity: 'quick', reason: `confirm-like follow-up: "${kw}"` };
+            }
+        }
+    }
+    return null;
+}
+/**
+ * AI-based classification using Claude Haiku.
+ * Prompt loaded from prompt-complexity-classifier.template.md.
+ */
+async function classifyWithHaiku(query, model, timeoutMs) {
+    const template = (0, strategyLoader_1.loadPromptTemplate)('prompt-complexity-classifier');
+    const prompt = template
+        ? (0, strategyLoader_1.renderTemplate)(template, { query })
+        : `Classify this Android trace analysis query as "quick" (factual) or "full" (analysis).\nQuery: ${query}\nOutput JSON: {"complexity": "quick" or "full", "reason": "..."}`;
+    // Default 30s; Haiku usually finishes in 1-2s, but non-Haiku light models can need longer.
+    const CLASSIFY_TIMEOUT_MS = timeoutMs ?? 30000;
+    const sdkEnv = (0, claudeConfig_1.createSdkEnv)();
+    const stream = (0, claude_agent_sdk_1.query)({
+        prompt,
+        options: {
+            model: model ?? 'claude-haiku-4-5',
+            maxTurns: 1,
+            permissionMode: 'bypassPermissions',
+            allowDangerouslySkipPermissions: true,
+            env: sdkEnv,
+            stderr: (data) => {
+                console.warn(`[ComplexityClassifier] SDK stderr: ${data.trimEnd()}`);
+            },
+            ...(0, claudeConfig_1.getSdkBinaryOption)(sdkEnv),
+        },
+    });
+    let result = '';
+    let timedOut = false;
+    const timer = setTimeout(() => {
+        timedOut = true;
+        console.warn(`[ComplexityClassifier] Classification timed out after ${CLASSIFY_TIMEOUT_MS / 1000}s`);
+        try {
+            stream.close();
+        }
+        catch { /* ignore */ }
+    }, CLASSIFY_TIMEOUT_MS);
+    try {
+        for await (const msg of stream) {
+            if (timedOut)
+                break;
+            if (msg.type === 'result' && msg.subtype === 'success') {
+                result = msg.result || '';
+            }
+        }
+    }
+    finally {
+        clearTimeout(timer);
+        try {
+            stream.close();
+        }
+        catch { /* ignore */ }
+    }
+    if (timedOut) {
+        return { complexity: 'full', reason: 'classification timed out (graceful degradation)' };
+    }
+    const jsonMatch = result.match(/\{[\s\S]*?\}/);
+    if (jsonMatch) {
+        try {
+            const parsed = JSON.parse(jsonMatch[0]);
+            const complexity = parsed.complexity === 'quick' ? 'quick' : 'full';
+            return { complexity, reason: parsed.reason || 'AI classification' };
+        }
+        catch {
+            return { complexity: 'full', reason: 'failed to parse AI JSON response' };
+        }
+    }
+    return { complexity: 'full', reason: 'no JSON in AI response' };
+}
+//# sourceMappingURL=queryComplexityClassifier.js.map

package/dist/agentv3/queryComplexityClassifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queryComplexityClassifier.js","sourceRoot":"","sources":["../../src/agentv3/queryComplexityClassifier.ts"],"names":[],"mappings":";AAAA,6CAA6C;AAC7C,0CAA0C;AAC1C,+DAA+D;;AAsD/D,oEAgBC;AAKD,0DAeC;AAxFD;;;;;;;;;;GAUG;AAEH,qEAAmE;AACnE,iDAA0F;AAC1F,qDAAsE;AAGtE;4FAC4F;AAC5F,MAAM,mBAAmB,GAAG;IAC1B,KAAK;IACL,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM;IACtC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI;IACzB,gCAAgC;IAChC,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU;CAC5F,CAAC;AAEF,uGAAuG;AACvG,MAAM,gBAAgB,GAAG;IACvB,KAAK;IACL,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IACzC,KAAK;IACL,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY;CAC5D,CAAC;AAEF;yFACyF;AACzF,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAE9B;;iGAEiG;AACjG,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC;IACnC,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,iBAAiB;IAC/D,UAAU,EAAE,UAAU;CACvB,CAAC,CAAC;AAEH;;;;GAIG;AACH,SAAgB,4BAA4B,CAC1C,KAAgC;IAEhC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChD,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,CAAC,GAAG,CAAC,oCAAoC,QAAQ,CAAC,UAAU,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3F,OAAO,EAAE,GAAG,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAC9C,CAAC;IAED,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,CAAC,GAAG,CAAC,sCAAsC,UAAU,CAAC,UAAU,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;QACjG,OAAO,EAAE,GAAG,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAChD,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,uBAAuB,CAC3C,KAAgC,EAChC,MAAsE;IAEtE,MAAM,KAAK,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IAExB,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,mBAAmB,CAAC,CAAC;QACvG,OAAO,CAAC,GAAG,CAAC,+BAA+B,QAAQ,CAAC,UAAU,KAAK,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QACtF,OAAO,EAAE,GAAG,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACvC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,yEAAyE,EAAG,GAAa,CAAC,OAAO,CAAC,CAAC;QAChH,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,iDAAiD,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IACzG,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACrB,KAAgC;IAEhC,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;IAC3D,CAAC;IACD,IAAI,KAAK,CAAC,mBAAmB,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,EAAE,IAAI,IAAI,SAAS,CAAC;QACvD,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,4BAA4B,EAAE,CAAC;IACjF,CAAC;IACD,IAAI,KAAK,CAAC,mBAAmB,EAAE,CAAC;QAC9B,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,sBAAsB,EAAE,CAAC;IAChE,CAAC;IACD,IAAI,KAAK,CAAC,oBAAoB,EAAE,CAAC;QAC/B,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,uBAAuB,EAAE,CAAC;IACjE,CAAC;IACD,IAAI,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,wBAAwB,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;IACnF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CACxB,KAAa;IAEb,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,mBAAmB,EAAE,CAAC;QACrC,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YACrC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,8BAA8B,EAAE,GAAG,EAAE,CAAC;QAC7E,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,kBAAkB,EAAE,CAAC;QACtC,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;gBACrC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,4BAA4B,EAAE,GAAG,EAAE,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,iBAAiB,CAC9B,KAAa,EACb,KAAc,EACd,SAAkB;IAElB,MAAM,QAAQ,GAAG,IAAA,mCAAkB,EAAC,8BAA8B,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,QAAQ;QACrB,CAAC,CAAC,IAAA,+BAAc,EAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,CAAC;QACrC,CAAC,CAAC,iGAAiG,KAAK,mEAAmE,CAAC;IAE9K,2FAA2F;IAC3F,MAAM,mBAAmB,GAAG,SAAS,IAAI,KAAM,CAAC;IAChD,MAAM,MAAM,GAAG,IAAA,2BAAY,GAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,IAAA,wBAAQ,EAAC;QACtB,MAAM;QACN,OAAO,EAAE;YACP,KAAK,EAAE,KAAK,IAAI,kBAAkB;YAClC,QAAQ,EAAE,CAAC;YACX,cAAc,EAAE,mBAA4B;YAC5C,+BAA+B,EAAE,IAAI;YACrC,GAAG,EAAE,MAAM;YACX,MAAM,EAAE,CAAC,IAAY,EAAE,EAAE;gBACvB,OAAO,CAAC,IAAI,CAAC,sCAAsC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACvE,CAAC;YACD,GAAG,IAAA,iCAAkB,EAAC,MAAM,CAAC;SAC9B;KACF,CAAC,CAAC;IAEH,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;QAC5B,QAAQ,GAAG,IAAI,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,yDAAyD,mBAAmB,GAAG,IAAI,GAAG,CAAC,CAAC;QACrG,IAAI,CAAC;YAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IAChD,CAAC,EAAE,mBAAmB,CAAC,CAAC;IAExB,IAAI,CAAC;QACH,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YAC/B,IAAI,QAAQ;gBAAE,MAAM;YACpB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAK,GAAW,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAChE,MAAM,GAAI,GAAW,CAAC,MAAM,IAAI,EAAE,CAAC;YACrC,CAAC;QACH,CAAC;IACH,CAAC;YAAS,CAAC;QACT,YAAY,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC;YAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,iDAAiD,EAAE,CAAC;IAC3F,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAC/C,IAAI,SAAS,EAAE,CAAC;QACd,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,UAAU,GAAoB,MAAM,CAAC,UAAU,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YACrF,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,mBAAmB,EAAE,CAAC;QACtE,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,kCAAkC,EAAE,CAAC;QAC5E,CAAC;IACH,CAAC;IAED,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,wBAAwB,EAAE,CAAC;AAClE,CAAC"}

package/dist/agentv3/rawSqlNormalizer.d.ts

@@ -0,0 +1,11 @@
+export interface RawSqlNormalizationResult {
+    sql: string;
+    rewrites: string[];
+}
+/**
+ * Normalize high-confidence Perfetto SQL footguns before trace_processor sees
+ * them. This is intentionally conservative: rewrite only when the dropped
+ * table alias is not referenced by the rest of the query.
+ */
+export declare function normalizeRawSql(sql: string): RawSqlNormalizationResult;
+//# sourceMappingURL=rawSqlNormalizer.d.ts.map

package/dist/agentv3/rawSqlNormalizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rawSqlNormalizer.d.ts","sourceRoot":"","sources":["../../src/agentv3/rawSqlNormalizer.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,yBAAyB;IACxC,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAwlBD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,yBAAyB,CAsHtE"}