@selvakumaresra/specship 0.7.0 → 0.10.0

package/dist/reflect/miner.js

@@ -0,0 +1,463 @@
+"use strict";
+/**
+ * Proposal miner (REQ-REFLECT-001 / 002).
+ *
+ * Reads the ingested `claude_*` transcript tables and detects recurring,
+ * actionable patterns, emitting one typed Proposal per finding with cited
+ * evidence and a severity. Each rule is a bounded SQL query (mirroring the tips
+ * engine's shape) feeding `buildProposal`, which resolves the concrete write
+ * target and the stable content hash.
+ *
+ * The *set* of rules is the implementation frontier the spec deliberately left
+ * open — new detectors slot in here without touching apply/store/surface.
+ *
+ * When the transcript tables are absent (a headless `specship reflect` against a
+ * project the dashboard has never ingested), the miner returns `[]` so the
+ * caller can render the empty state rather than erroring (REQ-REFLECT-001.A2).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mineProposals = mineProposals;
+const targets_1 = require("./targets");
+/** Tuning knobs — thresholds above which a pattern is worth proposing. */
+const THRESHOLDS = {
+    repeatedReadsPerSession: 10, // R1: same file Read ≥N times in one session
+    grepHabitTotal: 12, // R2: grep/find used ≥N times overall
+    repeatedPromptCount: 3, // R3: identical ask appears ≥N times
+    repeatedCmdSessions: 2, // R4: same bash command in ≥N sessions
+    repeatedCmdTotal: 5, // R4: …and ≥N times overall
+    destructiveMin: 2, // R5: a destructive shell op seen ≥N times
+    editHotspotTotal: 8, // R6: same file Edited ≥N times overall
+    editHotspotSessions: 2, // R6: …across ≥N sessions
+    correctionMin: 2, // R7: same corrective instruction repeated ≥N times
+    specshipColdReadMin: 15, // R8: reads/greps in a session to count as read-heavy
+    specshipColdSessions: 2, // R8: ≥N read-heavy sessions with zero specship calls
+    heavyOutputBytes: 50000, // R9: a Bash call whose result exceeds N "tokens"
+    heavyOutputMin: 2, // R9: …seen ≥N times
+    refDocSessions: 3, // R10: a doc file Read across ≥N distinct sessions
+};
+/** Per-rule cap so a noisy corpus can't flood the Improvements list. */
+const PER_RULE_LIMIT = 5;
+function tableExists(db, name) {
+    try {
+        const row = db
+            .prepare(`SELECT 1 AS x FROM sqlite_master WHERE type='table' AND name=?`)
+            .get(name);
+        return !!row;
+    }
+    catch {
+        return false;
+    }
+}
+/** Mine all rules. Pure read — never writes the DB or disk. */
+function mineProposals(db, ctx) {
+    if (!tableExists(db, 'claude_tool_calls') || !tableExists(db, 'claude_prompts')) {
+        return [];
+    }
+    const out = [];
+    out.push(...ruleRepeatedReads(db, ctx));
+    out.push(...ruleGrepHabit(db, ctx));
+    out.push(...ruleRepeatedPrompts(db, ctx));
+    out.push(...ruleRepeatedCommands(db, ctx));
+    // Round 2 detectors.
+    out.push(...ruleDestructiveCommands(db, ctx));
+    out.push(...ruleEditHotspot(db, ctx));
+    out.push(...ruleRecurringCorrection(db, ctx));
+    // Round 3 detectors.
+    out.push(...ruleSpecshipCold(db, ctx));
+    out.push(...ruleHeavyOutput(db, ctx));
+    out.push(...ruleReferenceDoc(db, ctx));
+    return out;
+}
+/**
+ * R1 → memory_rule (project CLAUDE.md): the agent Read the same file many times
+ * in a single session. A project-specific rule steering it to specship_explore
+ * for that area is the durable fix.
+ */
+function ruleRepeatedReads(db, ctx) {
+    const rows = db
+        .prepare(`SELECT session_id, input_summary AS file, COUNT(*) AS n
+       FROM claude_tool_calls
+       WHERE tool_name = 'Read' AND input_summary != ''
+       GROUP BY session_id, input_summary
+       HAVING n >= ?
+       ORDER BY n DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.repeatedReadsPerSession, PER_RULE_LIMIT);
+    return rows.map((r) => {
+        const base = r.file.split('/').pop() || r.file;
+        return (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'high',
+            nameSeed: base,
+            title: `Prefer specship_explore over re-reading ${base}`,
+            body: `${base} was Read ${r.n} times in a single session. A structural specship_explore query returns its callers, callees, and linked specs in one call — cheaper and complete.`,
+            content: `When you need to understand \`${base}\` (or the area around it), call \`specship_explore\` with the relevant symbol names first and treat the returned source as already Read — do not re-Read the file repeatedly.`,
+            evidence: {
+                sessions: [r.session_id],
+                prompts: [],
+                detail: `Read(${r.file}) × ${r.n} in one session`,
+            },
+        });
+    });
+}
+/**
+ * R2 → memory_rule (portable ~/.claude/memory): heavy grep/find usage is a
+ * cross-project habit, so the learning is portable, not repo-specific.
+ */
+function ruleGrepHabit(db, ctx) {
+    const row = db
+        .prepare(`SELECT COUNT(*) AS n, COUNT(DISTINCT session_id) AS s
+       FROM claude_tool_calls
+       WHERE tool_name = 'Bash'
+         AND (input_summary LIKE 'grep%' OR input_summary LIKE '%grep %'
+              OR input_summary LIKE 'find %' OR input_summary LIKE 'rg %')`)
+        .get();
+    if (!row || row.n < THRESHOLDS.grepHabitTotal)
+        return [];
+    const sessRows = db
+        .prepare(`SELECT DISTINCT session_id FROM claude_tool_calls
+       WHERE tool_name = 'Bash' AND (input_summary LIKE '%grep %' OR input_summary LIKE 'grep%'
+             OR input_summary LIKE 'find %' OR input_summary LIKE 'rg %')
+       LIMIT 8`)
+        .all();
+    return [
+        (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'portable',
+            severity: 'warn',
+            nameSeed: 'prefer-specship-search-over-grep',
+            title: 'Prefer specship_search over grep/find',
+            body: `grep/find ran ${row.n} times across ${row.s} sessions. specship_search hits the pre-built FTS index and returns symbol locations directly — usually one call instead of a grep+read loop.`,
+            content: 'For "where is X" / "find the symbol named X" questions, reach for `specship_search` (or `specship_explore` for "how does X work") before shelling out to grep/find/rg — SpecShip is the pre-built search index, so a grep+read loop repeats work it already did.',
+            evidence: {
+                sessions: sessRows.map((s) => s.session_id),
+                prompts: [],
+                detail: `grep/find/rg × ${row.n} across ${row.s} sessions`,
+            },
+        }),
+    ];
+}
+/** Normalize a prompt for grouping: trim, lowercase, collapse whitespace. */
+function normalizePrompt(t) {
+    return t.replace(/\s+/g, ' ').trim().toLowerCase();
+}
+/**
+ * R3 → skill (commands/ss-<name>.md): the user typed essentially the same ask
+ * many times. A reusable slash command captures the routine.
+ */
+function ruleRepeatedPrompts(db, ctx) {
+    const rows = db
+        .prepare(`SELECT id, text FROM claude_prompts
+       WHERE text IS NOT NULL AND length(text) BETWEEN 12 AND 200
+         AND text NOT LIKE '<%' AND text NOT LIKE '%<command-name>%'
+         AND is_sidechain = 0
+       ORDER BY ts DESC
+       LIMIT 4000`)
+        .all();
+    const groups = new Map();
+    for (const r of rows) {
+        const key = normalizePrompt(r.text);
+        if (!key)
+            continue;
+        const g = groups.get(key) ?? { count: 0, prompts: [], sample: r.text.trim() };
+        g.count++;
+        if (g.prompts.length < 8)
+            g.prompts.push(r.id);
+        groups.set(key, g);
+    }
+    const repeated = [...groups.values()]
+        .filter((g) => g.count >= THRESHOLDS.repeatedPromptCount)
+        .sort((a, b) => b.count - a.count)
+        .slice(0, PER_RULE_LIMIT);
+    return repeated.map((g) => (0, targets_1.buildProposal)(ctx, {
+        type: 'skill',
+        severity: 'warn',
+        nameSeed: g.sample,
+        title: `Capture "${truncate(g.sample, 48)}" as a command`,
+        body: `This ask appeared ${g.count} times. A slash command turns the repeated instruction into one reusable invocation.`,
+        content: `Run the following routine:\n\n${g.sample}`,
+        evidence: {
+            sessions: [],
+            prompts: g.prompts,
+            detail: `Same ask repeated ${g.count}×`,
+        },
+    }));
+}
+/**
+ * R4 → hook (.claude/settings.json): the agent ran the same shell command after
+ * edits across multiple sessions. A PostToolUse hook automates the manual step.
+ */
+function ruleRepeatedCommands(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS cmd, COUNT(*) AS n, COUNT(DISTINCT session_id) AS s,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name = 'Bash' AND input_summary != ''
+         AND input_summary NOT LIKE 'grep%' AND input_summary NOT LIKE '%grep %'
+         AND input_summary NOT LIKE 'find %' AND input_summary NOT LIKE 'cd %'
+         AND input_summary NOT LIKE 'ls%' AND input_summary NOT LIKE 'cat %'
+       GROUP BY input_summary
+       HAVING s >= ? AND n >= ?
+       ORDER BY n DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.repeatedCmdSessions, THRESHOLDS.repeatedCmdTotal, PER_RULE_LIMIT);
+    return rows.map((r) => (0, targets_1.buildProposal)(ctx, {
+        type: 'hook',
+        severity: 'info',
+        nameSeed: r.cmd,
+        title: `Automate \`${truncate(r.cmd, 40)}\` with a hook`,
+        body: `\`${truncate(r.cmd, 80)}\` was run ${r.n} times across ${r.s} sessions, mostly by hand. A PostToolUse hook can run it automatically after edits.`,
+        content: r.cmd,
+        hook: { event: 'PostToolUse', matcher: 'Edit|Write', command: r.cmd },
+        evidence: {
+            sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+            prompts: [],
+            detail: `\`${truncate(r.cmd, 60)}\` × ${r.n} across ${r.s} sessions`,
+        },
+    }));
+}
+/** Destructive shell-operation categories the agent should treat with care. */
+const DESTRUCTIVE = [
+    { key: 'rm-rf', label: 'recursive force-delete (`rm -rf`)', re: /\brm\s+-[a-z]*r[a-z]*f[a-z]*\b|\brm\s+-[a-z]*f[a-z]*r[a-z]*\b/i },
+    { key: 'git-force-push', label: 'force push (`git push --force`)', re: /\bgit\s+push\b[^|;&]*(--force\b|--force-with-lease\b|\s-f\b)/i },
+    { key: 'git-reset-hard', label: 'hard reset (`git reset --hard`)', re: /\bgit\s+reset\b[^|;&]*--hard\b/i },
+    { key: 'git-clean', label: 'force clean (`git clean -fd`)', re: /\bgit\s+clean\b[^|;&]*-[a-z]*f/i },
+    { key: 'drop-db', label: 'dropping a table/database (`DROP …`)', re: /\bdrop\s+(table|database|schema)\b/i },
+];
+/**
+ * R5 → memory_rule (project CLAUDE.md): destructive shell operations showed up
+ * in the transcripts. A high-severity caution rule is the durable response — we
+ * deliberately propose a *rule* rather than auto-generating a fragile guard
+ * script (a guard-hook variant is a future detector).
+ */
+function ruleDestructiveCommands(db, ctx) {
+    const rows = db
+        .prepare(`SELECT session_id, input_summary AS cmd FROM claude_tool_calls WHERE tool_name = 'Bash' AND input_summary != ''`)
+        .all();
+    const buckets = new Map();
+    for (const r of rows) {
+        for (const d of DESTRUCTIVE) {
+            if (d.re.test(r.cmd)) {
+                const b = buckets.get(d.key) ?? { count: 0, sessions: new Set(), sample: r.cmd };
+                b.count++;
+                b.sessions.add(r.session_id);
+                buckets.set(d.key, b);
+            }
+        }
+    }
+    const out = [];
+    for (const d of DESTRUCTIVE) {
+        const b = buckets.get(d.key);
+        if (!b || b.count < THRESHOLDS.destructiveMin)
+            continue;
+        out.push((0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'high',
+            nameSeed: `caution-${d.key}`,
+            title: `Treat ${d.label} with care`,
+            body: `${d.label} ran ${b.count} times across ${b.sessions.size} session(s). A standing caution keeps an irreversible operation from being run without a beat of confirmation.`,
+            content: `Before running ${d.label}, pause and confirm the target is correct — these operations are irreversible. Prefer a dry-run or a narrower, reversible alternative when one exists.`,
+            evidence: {
+                sessions: [...b.sessions].slice(0, 8),
+                prompts: [],
+                detail: `${d.label} × ${b.count} across ${b.sessions.size} session(s)`,
+            },
+        }));
+    }
+    return out;
+}
+/**
+ * R6 → memory_rule (project CLAUDE.md): a file is edited over and over across
+ * sessions — a hotspot whose contract is worth documenting so future edits
+ * don't relearn it from scratch.
+ */
+function ruleEditHotspot(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS file, COUNT(*) AS n, COUNT(DISTINCT session_id) AS s,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name IN ('Edit', 'Write', 'MultiEdit') AND input_summary != ''
+       GROUP BY input_summary
+       HAVING n >= ? AND s >= ?
+       ORDER BY n DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.editHotspotTotal, THRESHOLDS.editHotspotSessions, PER_RULE_LIMIT);
+    return rows.map((r) => {
+        const base = r.file.split('/').pop() || r.file;
+        return (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'warn',
+            nameSeed: `hotspot-${base}`,
+            title: `Document the contract of ${base} — it changes often`,
+            body: `${base} was edited ${r.n} times across ${r.s} sessions. Capturing its invariants (and what must stay true after a change) saves rediscovering them on every edit.`,
+            content: `\`${base}\` is a frequently-edited hotspot. Before changing it, check \`specship_explore\` for its callers and document the invariants a change must preserve. Consider whether it needs tighter test coverage.`,
+            evidence: {
+                sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+                prompts: [],
+                detail: `${base} edited × ${r.n} across ${r.s} sessions`,
+            },
+        });
+    });
+}
+/** Leading cues that mark a prompt as a correction of the agent's behavior. */
+const CORRECTION_CUE = /^(no\b|don'?t\b|do not\b|never\b|always\b|stop\b|instead\b|actually\b|you should\b|please don'?t\b)/i;
+/**
+ * R7 → memory_rule (portable ~/.claude/memory): the user keeps issuing the same
+ * corrective instruction. That's a durable preference worth recording so it
+ * doesn't have to be repeated — the core Hermes "learn from corrections" idea.
+ */
+function ruleRecurringCorrection(db, ctx) {
+    const rows = db
+        .prepare(`SELECT id, text FROM claude_prompts
+       WHERE text IS NOT NULL AND length(text) BETWEEN 12 AND 200
+         AND text NOT LIKE '<%' AND text NOT LIKE '%<command-name>%'
+         AND is_sidechain = 0
+       ORDER BY ts DESC
+       LIMIT 4000`)
+        .all();
+    const groups = new Map();
+    for (const r of rows) {
+        const trimmed = r.text.trim();
+        if (!CORRECTION_CUE.test(trimmed))
+            continue;
+        const key = trimmed.replace(/\s+/g, ' ').toLowerCase();
+        const g = groups.get(key) ?? { count: 0, prompts: [], sample: trimmed };
+        g.count++;
+        if (g.prompts.length < 8)
+            g.prompts.push(r.id);
+        groups.set(key, g);
+    }
+    const repeated = [...groups.values()]
+        .filter((g) => g.count >= THRESHOLDS.correctionMin)
+        .sort((a, b) => b.count - a.count)
+        .slice(0, PER_RULE_LIMIT);
+    return repeated.map((g) => (0, targets_1.buildProposal)(ctx, {
+        type: 'memory_rule',
+        scope: 'portable',
+        severity: 'warn',
+        nameSeed: `correction-${g.sample}`,
+        title: `Recurring correction: "${truncate(g.sample, 48)}"`,
+        body: `You've given this correction ${g.count} times. Recording it as a durable preference means you shouldn't have to repeat it.`,
+        content: `Standing user preference (you have repeated this): ${g.sample}`,
+        evidence: {
+            sessions: [],
+            prompts: g.prompts,
+            detail: `Correction repeated ${g.count}×`,
+        },
+    }));
+}
+/**
+ * R8 → memory_rule (portable ~/.claude/memory): sessions that lean hard on
+ * Read/grep while making zero specship calls. SpecShip is indexed here, so a
+ * portable habit-note to query it first is the durable fix. Uses the
+ * `is_specship` classification on tool calls.
+ */
+function ruleSpecshipCold(db, ctx) {
+    const rows = db
+        .prepare(`SELECT session_id,
+              SUM(CASE WHEN tool_name IN ('Read','Grep')
+                        OR (tool_name='Bash' AND (input_summary LIKE 'grep%' OR input_summary LIKE '%grep %'
+                              OR input_summary LIKE 'find %' OR input_summary LIKE 'rg %'))
+                       THEN 1 ELSE 0 END) AS reads,
+              SUM(is_specship) AS ss
+       FROM claude_tool_calls
+       GROUP BY session_id
+       HAVING reads >= ? AND ss = 0`)
+        .all(THRESHOLDS.specshipColdReadMin);
+    if (rows.length < THRESHOLDS.specshipColdSessions)
+        return [];
+    const totalReads = rows.reduce((a, r) => a + r.reads, 0);
+    return [
+        (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'portable',
+            severity: 'warn',
+            nameSeed: 'query-specship-first',
+            title: 'Query SpecShip before reading or grepping',
+            body: `${rows.length} read-heavy sessions (${totalReads} Read/grep calls) made no specship calls at all. SpecShip is the pre-built index for this code — a structural query usually answers in one call what a grep+read loop takes many.`,
+            content: 'This project is indexed by SpecShip. For "how does X work" / "where is X" / trace / impact questions, call `specship_explore` (or `specship_search`) FIRST and treat the returned source as already Read — only fall back to Read/grep to confirm a detail it did not cover.',
+            evidence: {
+                sessions: rows.map((r) => r.session_id).slice(0, 8),
+                prompts: [],
+                detail: `${rows.length} read-heavy sessions with 0 specship calls`,
+            },
+        }),
+    ];
+}
+/**
+ * R9 → memory_rule (project CLAUDE.md): a Bash command that dumps a huge result
+ * into context, repeatedly. Scoping its output (or using a structural query) is
+ * the durable fix. Uses `result_length`.
+ */
+function ruleHeavyOutput(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS cmd, COUNT(*) AS n, MAX(result_length) AS maxlen,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name = 'Bash' AND input_summary != '' AND result_length > ?
+       GROUP BY input_summary
+       HAVING n >= ?
+       ORDER BY maxlen DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.heavyOutputBytes, THRESHOLDS.heavyOutputMin, PER_RULE_LIMIT);
+    return rows.map((r) => (0, targets_1.buildProposal)(ctx, {
+        type: 'memory_rule',
+        scope: 'project',
+        severity: 'warn',
+        nameSeed: `heavy-output-${r.cmd}`,
+        title: `Scope the output of \`${truncate(r.cmd, 40)}\``,
+        body: `\`${truncate(r.cmd, 80)}\` returned up to ~${Math.round(r.maxlen / 1000)}k tokens and ran ${r.n} times. Dumping large output into context is a dominant cost driver.`,
+        content: `When you need the result of \`${truncate(r.cmd, 80)}\`, scope it (filter, head, or target a path) — or answer the underlying question with a \`specship_search\`/\`specship_explore\` query instead of reading the full output into context.`,
+        evidence: {
+            sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+            prompts: [],
+            detail: `~${Math.round(r.maxlen / 1000)}k-token output × ${r.n}`,
+        },
+    }));
+}
+/**
+ * R10 → memory_rule (project CLAUDE.md): a documentation file read across many
+ * separate sessions is context the agent keeps rediscovering. Pointing at it
+ * from CLAUDE.md keeps it in context. Distinct from R1 (in-session re-reads of
+ * any file) — this keys on cross-session breadth of a *doc* file.
+ */
+function ruleReferenceDoc(db, ctx) {
+    const rows = db
+        .prepare(`SELECT input_summary AS file, COUNT(DISTINCT session_id) AS s,
+              GROUP_CONCAT(DISTINCT session_id) AS sessions
+       FROM claude_tool_calls
+       WHERE tool_name = 'Read' AND input_summary != ''
+         AND (input_summary LIKE '%.md' OR input_summary LIKE '%.mdx'
+              OR input_summary LIKE '%.txt' OR input_summary LIKE '%.rst'
+              OR input_summary LIKE '%.adoc')
+       GROUP BY input_summary
+       HAVING s >= ?
+       ORDER BY s DESC
+       LIMIT ?`)
+        .all(THRESHOLDS.refDocSessions, PER_RULE_LIMIT);
+    return rows.map((r) => {
+        const base = r.file.split('/').pop() || r.file;
+        return (0, targets_1.buildProposal)(ctx, {
+            type: 'memory_rule',
+            scope: 'project',
+            severity: 'warn',
+            nameSeed: `reference-${base}`,
+            title: `Reference ${base} from CLAUDE.md`,
+            body: `${base} was read in ${r.s} separate sessions — context the agent keeps rediscovering. Pointing at it from CLAUDE.md (or importing it with @path) keeps it on hand without a Read each time.`,
+            content: `\`${base}\` is frequently-needed context. Add a short pointer to it here (or import it with \`@${r.file}\`) so its guidance is always in context instead of re-Read each session.`,
+            evidence: {
+                sessions: (r.sessions || '').split(',').filter(Boolean).slice(0, 8),
+                prompts: [],
+                detail: `${base} read across ${r.s} sessions`,
+            },
+        });
+    });
+}
+function truncate(s, n) {
+    const t = s.replace(/\s+/g, ' ').trim();
+    return t.length > n ? t.slice(0, n) + '…' : t;
+}
+//# sourceMappingURL=miner.js.map

package/dist/reflect/miner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"miner.js","sourceRoot":"","sources":["../../src/reflect/miner.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;GAeG;;AAuCH,sCAkBC;AAtDD,uCAA0C;AAG1C,0EAA0E;AAC1E,MAAM,UAAU,GAAG;IACjB,uBAAuB,EAAE,EAAE,EAAE,6CAA6C;IAC1E,cAAc,EAAE,EAAE,EAAE,sCAAsC;IAC1D,mBAAmB,EAAE,CAAC,EAAE,qCAAqC;IAC7D,mBAAmB,EAAE,CAAC,EAAE,uCAAuC;IAC/D,gBAAgB,EAAE,CAAC,EAAE,4BAA4B;IACjD,cAAc,EAAE,CAAC,EAAE,2CAA2C;IAC9D,gBAAgB,EAAE,CAAC,EAAE,wCAAwC;IAC7D,mBAAmB,EAAE,CAAC,EAAE,0BAA0B;IAClD,aAAa,EAAE,CAAC,EAAE,oDAAoD;IACtE,mBAAmB,EAAE,EAAE,EAAE,sDAAsD;IAC/E,oBAAoB,EAAE,CAAC,EAAE,sDAAsD;IAC/E,gBAAgB,EAAE,KAAK,EAAE,kDAAkD;IAC3E,cAAc,EAAE,CAAC,EAAE,qBAAqB;IACxC,cAAc,EAAE,CAAC,EAAE,mDAAmD;CACvE,CAAC;AAEF,wEAAwE;AACxE,MAAM,cAAc,GAAG,CAAC,CAAC;AAEzB,SAAS,WAAW,CAAC,EAAkB,EAAE,IAAY;IACnD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE;aACX,OAAO,CAAC,gEAAgE,CAAC;aACzE,GAAG,CAAC,IAAI,CAAC,CAAC;QACb,OAAO,CAAC,CAAC,GAAG,CAAC;IACf,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,SAAgB,aAAa,CAAC,EAAkB,EAAE,GAAmB;IACnE,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,gBAAgB,CAAC,EAAE,CAAC;QAChF,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACxC,GAAG,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,GAAG,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1C,GAAG,CAAC,IAAI,CAAC,GAAG,oBAAoB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAC3C,qBAAqB;IACrB,GAAG,CAAC,IAAI,CAAC,GAAG,uBAAuB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9C,GAAG,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACtC,GAAG,CAAC,IAAI,CAAC,GAAG,uBAAuB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9C,qBAAqB;IACrB,GAAG,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACvC,GAAG,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACtC,GAAG,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACvC,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,EAAkB,EAAE,GAAmB;IAChE,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;eAMS,CACV;SACA,GAAG,CAAC,UAAU,CAAC,uBAAuB,EAAE,cAAc,CAIvD,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACpB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;QAC/C,OAAO,IAAA,uBAAa,EAAC,GAAG,EAAE;YACxB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,IAAI;YACd,KAAK,EAAE,2CAA2C,IAAI,EAAE;YACxD,IAAI,EAAE,GAAG,IAAI,aAAa,CAAC,CAAC,CAAC,oJAAoJ;YACjL,OAAO,EAAE,iCAAiC,IAAI,gLAAgL;YAC9N,QAAQ,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;gBACxB,OAAO,EAAE,EAAE;gBACX,MAAM,EAAE,QAAQ,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,iBAAiB;aAClD;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,EAAkB,EAAE,GAAmB;IAC5D,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CACN;;;;2EAIqE,CACtE;SACA,GAAG,EAA0C,CAAC;IACjD,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,cAAc;QAAE,OAAO,EAAE,CAAC;IACzD,MAAM,QAAQ,GAAG,EAAE;SAChB,OAAO,CACN;;;eAGS,CACV;SACA,GAAG,EAAmC,CAAC;IAC1C,OAAO;QACL,IAAA,uBAAa,EAAC,GAAG,EAAE;YACjB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,UAAU;YACjB,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,kCAAkC;YAC5C,KAAK,EAAE,uCAAuC;YAC9C,IAAI,EAAE,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,+IAA+I;YACjM,OAAO,EACL,kQAAkQ;YACpQ,QAAQ,EAAE;gBACR,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;gBAC3C,OAAO,EAAE,EAAE;gBACX,MAAM,EAAE,kBAAkB,GAAG,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW;aAC3D;SACF,CAAC;KACH,CAAC;AACJ,CAAC;AAED,6EAA6E;AAC7E,SAAS,eAAe,CAAC,CAAS;IAChC,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,EAAkB,EAAE,GAAmB;IAClE,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;kBAKY,CACb;SACA,GAAG,EAAyC,CAAC;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgE,CAAC;IACvF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9E,CAAC,CAAC,KAAK,EAAE,CAAC;QACV,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;SAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,UAAU,CAAC,mBAAmB,CAAC;SACxD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAC5B,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxB,IAAA,uBAAa,EAAC,GAAG,EAAE;QACjB,IAAI,EAAE,OAAO;QACb,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,CAAC,CAAC,MAAM;QAClB,KAAK,EAAE,YAAY,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,gBAAgB;QACzD,IAAI,EAAE,qBAAqB,CAAC,CAAC,KAAK,sFAAsF;QACxH,OAAO,EAAE,iCAAiC,CAAC,CAAC,MAAM,EAAE;QACpD,QAAQ,EAAE;YACR,QAAQ,EAAE,EAAE;YACZ,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,MAAM,EAAE,qBAAqB,CAAC,CAAC,KAAK,GAAG;SACxC;KACF,CAAC,CACH,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,EAAkB,EAAE,GAAmB;IACnE,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;;;;;eAUS,CACV;SACA,GAAG,CACF,UAAU,CAAC,mBAAmB,EAC9B,UAAU,CAAC,gBAAgB,EAC3B,cAAc,CACmD,CAAC;IACtE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,IAAA,uBAAa,EAAC,GAAG,EAAE;QACjB,IAAI,EAAE,MAAM;QACZ,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,CAAC,CAAC,GAAG;QACf,KAAK,EAAE,cAAc,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB;QACxD,IAAI,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,qFAAqF;QACxJ,OAAO,EAAE,CAAC,CAAC,GAAG;QACd,IAAI,EAAE,EAAE,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE;QACrE,QAAQ,EAAE;YACR,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACnE,OAAO,EAAE,EAAE;YACX,MAAM,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW;SACrE;KACF,CAAC,CACH,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,MAAM,WAAW,GAAsD;IACrE,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,mCAAmC,EAAE,EAAE,EAAE,gEAAgE,EAAE;IAClI,EAAE,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,iCAAiC,EAAE,EAAE,EAAE,+DAA+D,EAAE;IACxI,EAAE,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,iCAAiC,EAAE,EAAE,EAAE,iCAAiC,EAAE;IAC1G,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,+BAA+B,EAAE,EAAE,EAAE,iCAAiC,EAAE;IACnG,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,sCAAsC,EAAE,EAAE,EAAE,qCAAqC,EAAE;CAC7G,CAAC;AAEF;;;;;GAKG;AACH,SAAS,uBAAuB,CAAC,EAAkB,EAAE,GAAmB;IACtE,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,iHAAiH,CAAC;SAC1H,GAAG,EAAgD,CAAC;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoE,CAAC;IAC5F,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAU,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;gBACzF,CAAC,CAAC,KAAK,EAAE,CAAC;gBACV,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,UAAU,CAAC,cAAc;YAAE,SAAS;QACxD,GAAG,CAAC,IAAI,CACN,IAAA,uBAAa,EAAC,GAAG,EAAE;YACjB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,WAAW,CAAC,CAAC,GAAG,EAAE;YAC5B,KAAK,EAAE,SAAS,CAAC,CAAC,KAAK,YAAY;YACnC,IAAI,EAAE,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,KAAK,iBAAiB,CAAC,CAAC,QAAQ,CAAC,IAAI,gHAAgH;YAC/K,OAAO,EAAE,kBAAkB,CAAC,CAAC,KAAK,wJAAwJ;YAC1L,QAAQ,EAAE;gBACR,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrC,OAAO,EAAE,EAAE;gBACX,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,QAAQ,CAAC,IAAI,aAAa;aACvE;SACF,CAAC,CACH,CAAC;IACJ,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,EAAkB,EAAE,GAAmB;IAC9D,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;;eAOS,CACV;SACA,GAAG,CAAC,UAAU,CAAC,gBAAgB,EAAE,UAAU,CAAC,mBAAmB,EAAE,cAAc,CAKhF,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACpB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;QAC/C,OAAO,IAAA,uBAAa,EAAC,GAAG,EAAE;YACxB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,WAAW,IAAI,EAAE;YAC3B,KAAK,EAAE,4BAA4B,IAAI,qBAAqB;YAC5D,IAAI,EAAE,GAAG,IAAI,eAAe,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,sHAAsH;YACzK,OAAO,EAAE,KAAK,IAAI,wMAAwM;YAC1N,QAAQ,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnE,OAAO,EAAE,EAAE;gBACX,MAAM,EAAE,GAAG,IAAI,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW;aACzD;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,+EAA+E;AAC/E,MAAM,cAAc,GAAG,sGAAsG,CAAC;AAE9H;;;;GAIG;AACH,SAAS,uBAAuB,CAAC,EAAkB,EAAE,GAAmB;IACtE,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;kBAKY,CACb;SACA,GAAG,EAAyC,CAAC;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgE,CAAC;IACvF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QACvD,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;QACxE,CAAC,CAAC,KAAK,EAAE,CAAC;QACV,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;SAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,UAAU,CAAC,aAAa,CAAC;SAClD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAC5B,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACxB,IAAA,uBAAa,EAAC,GAAG,EAAE;QACjB,IAAI,EAAE,aAAa;QACnB,KAAK,EAAE,UAAU;QACjB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,cAAc,CAAC,CAAC,MAAM,EAAE;QAClC,KAAK,EAAE,0BAA0B,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,GAAG;QAC1D,IAAI,EAAE,gCAAgC,CAAC,CAAC,KAAK,qFAAqF;QAClI,OAAO,EAAE,sDAAsD,CAAC,CAAC,MAAM,EAAE;QACzE,QAAQ,EAAE;YACR,QAAQ,EAAE,EAAE;YACZ,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,MAAM,EAAE,uBAAuB,CAAC,CAAC,KAAK,GAAG;SAC1C;KACF,CAAC,CACH,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,EAAkB,EAAE,GAAmB;IAC/D,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;;;oCAQ8B,CAC/B;SACA,GAAG,CAAC,UAAU,CAAC,mBAAmB,CAA6D,CAAC;IACnG,IAAI,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,oBAAoB;QAAE,OAAO,EAAE,CAAC;IAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzD,OAAO;QACL,IAAA,uBAAa,EAAC,GAAG,EAAE;YACjB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,UAAU;YACjB,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,sBAAsB;YAChC,KAAK,EAAE,2CAA2C;YAClD,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,yBAAyB,UAAU,mLAAmL;YAC1O,OAAO,EACL,8QAA8Q;YAChR,QAAQ,EAAE;gBACR,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnD,OAAO,EAAE,EAAE;gBACX,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,4CAA4C;aACnE;SACF,CAAC;KACH,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,EAAkB,EAAE,GAAmB;IAC9D,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;;eAOS,CACV;SACA,GAAG,CAAC,UAAU,CAAC,gBAAgB,EAAE,UAAU,CAAC,cAAc,EAAE,cAAc,CAK3E,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACpB,IAAA,uBAAa,EAAC,GAAG,EAAE;QACjB,IAAI,EAAE,aAAa;QACnB,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,gBAAgB,CAAC,CAAC,GAAG,EAAE;QACjC,KAAK,EAAE,yBAAyB,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI;QACvD,IAAI,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,sBAAsB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,sEAAsE;QAC5K,OAAO,EAAE,iCAAiC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,0LAA0L;QACvP,QAAQ,EAAE;YACR,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACnE,OAAO,EAAE,EAAE;YACX,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE;SACjE;KACF,CAAC,CACH,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,EAAkB,EAAE,GAAmB;IAC/D,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CACN;;;;;;;;;;eAUS,CACV;SACA,GAAG,CAAC,UAAU,CAAC,cAAc,EAAE,cAAc,CAI9C,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACpB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC;QAC/C,OAAO,IAAA,uBAAa,EAAC,GAAG,EAAE;YACxB,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,SAAS;YAChB,QAAQ,EAAE,MAAM;YAChB,QAAQ,EAAE,aAAa,IAAI,EAAE;YAC7B,KAAK,EAAE,aAAa,IAAI,iBAAiB;YACzC,IAAI,EAAE,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,mKAAmK;YACnM,OAAO,EAAE,KAAK,IAAI,yFAAyF,CAAC,CAAC,IAAI,2EAA2E;YAC5L,QAAQ,EAAE;gBACR,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnE,OAAO,EAAE,EAAE;gBACX,MAAM,EAAE,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,WAAW;aAC9C;SACF,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IACpC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACxC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC"}

package/dist/reflect/store.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Proposal persistence (REQ-REFLECT-007).
+ *
+ * Wraps the `reflect_proposals` table. Proposals are keyed by `contentHash`, so
+ * re-mining the same pattern UPSERTs the existing row (refreshing the
+ * user-facing fields + evidence) while PRESERVING its state — a dismissed
+ * proposal stays dismissed, an applied one stays applied. `upsertMined` reports
+ * which hashes were freshly inserted, which the sweep uses to decide what's
+ * "new" and therefore notify-worthy (REQ-REFLECT-006).
+ */
+import { SqliteDatabase } from '../db/sqlite-adapter';
+import { Proposal, ProposalState } from './types';
+export declare class ReflectStore {
+    private db;
+    private now;
+    constructor(db: SqliteDatabase, now?: () => number);
+    /**
+     * Persist a freshly-mined batch. Returns the proposals as stored (with state
+     * resolved) plus the set of hashes that were newly inserted this call.
+     */
+    upsertMined(mined: Proposal[]): {
+        stored: Proposal[];
+        insertedHashes: Set<string>;
+    };
+    get(hash: string): Proposal | null;
+    /** List proposals, optionally filtered by state. Newest-updated first. */
+    list(state?: ProposalState): Proposal[];
+    /** Transition a proposal's state. `applied` stamps `applied_at` on first apply. */
+    setState(hash: string, state: ProposalState): void;
+}
+//# sourceMappingURL=store.d.ts.map

package/dist/reflect/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/reflect/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAoClD,qBAAa,YAAY;IACX,OAAO,CAAC,EAAE;IAAkB,OAAO,CAAC,GAAG;gBAA/B,EAAE,EAAE,cAAc,EAAU,GAAG,GAAE,MAAM,MAAyB;IAEpF;;;OAGG;IACH,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG;QAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;KAAE;IAwCnF,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IAOlC,0EAA0E;IAC1E,IAAI,CAAC,KAAK,CAAC,EAAE,aAAa,GAAG,QAAQ,EAAE;IASvC,mFAAmF;IACnF,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,GAAG,IAAI;CAgBnD"}

package/dist/reflect/store.js

@@ -0,0 +1,101 @@
+"use strict";
+/**
+ * Proposal persistence (REQ-REFLECT-007).
+ *
+ * Wraps the `reflect_proposals` table. Proposals are keyed by `contentHash`, so
+ * re-mining the same pattern UPSERTs the existing row (refreshing the
+ * user-facing fields + evidence) while PRESERVING its state — a dismissed
+ * proposal stays dismissed, an applied one stays applied. `upsertMined` reports
+ * which hashes were freshly inserted, which the sweep uses to decide what's
+ * "new" and therefore notify-worthy (REQ-REFLECT-006).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ReflectStore = void 0;
+function rowToProposal(r) {
+    return {
+        contentHash: r.content_hash,
+        type: r.type,
+        severity: r.severity,
+        title: r.title,
+        body: r.body,
+        targetKind: r.target_kind,
+        targetPath: r.target_path,
+        payload: JSON.parse(r.payload),
+        evidence: JSON.parse(r.evidence),
+        state: r.state,
+        createdAt: r.created_at,
+        updatedAt: r.updated_at,
+        appliedAt: r.applied_at,
+    };
+}
+class ReflectStore {
+    db;
+    now;
+    constructor(db, now = () => Date.now()) {
+        this.db = db;
+        this.now = now;
+    }
+    /**
+     * Persist a freshly-mined batch. Returns the proposals as stored (with state
+     * resolved) plus the set of hashes that were newly inserted this call.
+     */
+    upsertMined(mined) {
+        const insertedHashes = new Set();
+        const ts = this.now();
+        const existsStmt = this.db.prepare(`SELECT 1 AS x FROM reflect_proposals WHERE content_hash = ?`);
+        const insertStmt = this.db.prepare(`INSERT INTO reflect_proposals
+         (content_hash, type, severity, title, body, target_kind, target_path, payload, evidence, state, created_at, updated_at, applied_at)
+       VALUES (?,?,?,?,?,?,?,?,?, 'open', ?, ?, NULL)
+       ON CONFLICT(content_hash) DO UPDATE SET
+         severity = excluded.severity,
+         title    = excluded.title,
+         body     = excluded.body,
+         payload  = excluded.payload,
+         evidence = excluded.evidence,
+         updated_at = excluded.updated_at`);
+        const tx = this.db.transaction((items) => {
+            for (const p of items) {
+                const already = existsStmt.get(p.contentHash);
+                if (!already)
+                    insertedHashes.add(p.contentHash);
+                insertStmt.run(p.contentHash, p.type, p.severity, p.title, p.body, p.targetKind, p.targetPath, JSON.stringify(p.payload), JSON.stringify(p.evidence), ts, ts);
+            }
+        });
+        tx(mined);
+        const stored = mined.map((p) => this.get(p.contentHash)).filter((x) => !!x);
+        return { stored, insertedHashes };
+    }
+    get(hash) {
+        const r = this.db
+            .prepare(`SELECT * FROM reflect_proposals WHERE content_hash = ?`)
+            .get(hash);
+        return r ? rowToProposal(r) : null;
+    }
+    /** List proposals, optionally filtered by state. Newest-updated first. */
+    list(state) {
+        const rows = state
+            ? this.db
+                .prepare(`SELECT * FROM reflect_proposals WHERE state = ? ORDER BY updated_at DESC`)
+                .all(state)
+            : this.db.prepare(`SELECT * FROM reflect_proposals ORDER BY updated_at DESC`).all();
+        return rows.map(rowToProposal);
+    }
+    /** Transition a proposal's state. `applied` stamps `applied_at` on first apply. */
+    setState(hash, state) {
+        const ts = this.now();
+        if (state === 'applied') {
+            this.db
+                .prepare(`UPDATE reflect_proposals
+           SET state = ?, updated_at = ?, applied_at = COALESCE(applied_at, ?)
+           WHERE content_hash = ?`)
+                .run(state, ts, ts, hash);
+        }
+        else {
+            this.db
+                .prepare(`UPDATE reflect_proposals SET state = ?, updated_at = ? WHERE content_hash = ?`)
+                .run(state, ts, hash);
+        }
+    }
+}
+exports.ReflectStore = ReflectStore;
+//# sourceMappingURL=store.js.map

package/dist/reflect/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../src/reflect/store.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;;AAqBH,SAAS,aAAa,CAAC,CAAM;IAC3B,OAAO;QACL,WAAW,EAAE,CAAC,CAAC,YAAY;QAC3B,IAAI,EAAE,CAAC,CAAC,IAAwB;QAChC,QAAQ,EAAE,CAAC,CAAC,QAAgC;QAC5C,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,UAAU,EAAE,CAAC,CAAC,WAAqC;QACnD,UAAU,EAAE,CAAC,CAAC,WAAW;QACzB,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAwB;QACrD,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAyB;QACxD,KAAK,EAAE,CAAC,CAAC,KAAsB;QAC/B,SAAS,EAAE,CAAC,CAAC,UAAU;QACvB,SAAS,EAAE,CAAC,CAAC,UAAU;QACvB,SAAS,EAAE,CAAC,CAAC,UAAU;KACxB,CAAC;AACJ,CAAC;AAED,MAAa,YAAY;IACH;IAA4B;IAAhD,YAAoB,EAAkB,EAAU,MAAoB,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;QAAhE,OAAE,GAAF,EAAE,CAAgB;QAAU,QAAG,GAAH,GAAG,CAAiC;IAAG,CAAC;IAExF;;;OAGG;IACH,WAAW,CAAC,KAAiB;QAC3B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,6DAA6D,CAAC,CAAC;QAClG,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAChC;;;;;;;;;0CASoC,CACrC,CAAC;QACF,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,KAAiB,EAAE,EAAE;YACnD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBAC9C,IAAI,CAAC,OAAO;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBAChD,UAAU,CAAC,GAAG,CACZ,CAAC,CAAC,WAAW,EACb,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,QAAQ,EACV,CAAC,CAAC,KAAK,EACP,CAAC,CAAC,IAAI,EACN,CAAC,CAAC,UAAU,EACZ,CAAC,CAAC,UAAU,EACZ,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EACzB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,EAC1B,EAAE,EACF,EAAE,CACH,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,KAAK,CAAC,CAAC;QACV,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC;IACpC,CAAC;IAED,GAAG,CAAC,IAAY;QACd,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE;aACd,OAAO,CAAC,wDAAwD,CAAC;aACjE,GAAG,CAAC,IAAI,CAAoB,CAAC;QAChC,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACrC,CAAC;IAED,0EAA0E;IAC1E,IAAI,CAAC,KAAqB;QACxB,MAAM,IAAI,GAAG,KAAK;YAChB,CAAC,CAAE,IAAI,CAAC,EAAE;iBACL,OAAO,CAAC,0EAA0E,CAAC;iBACnF,GAAG,CAAC,KAAK,CAAW;YACzB,CAAC,CAAE,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,0DAA0D,CAAC,CAAC,GAAG,EAAY,CAAC;QACjG,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IAED,mFAAmF;IACnF,QAAQ,CAAC,IAAY,EAAE,KAAoB;QACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,EAAE;iBACJ,OAAO,CACN;;kCAEwB,CACzB;iBACA,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,EAAE;iBACJ,OAAO,CAAC,+EAA+E,CAAC;iBACxF,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;CACF;AAjFD,oCAiFC"}

package/dist/reflect/sweep.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Reflection orchestration (REQ-REFLECT-001 / 006).
+ *
+ * `analyze` runs the miner and persists the batch, returning the current open
+ * proposals — this is what the on-demand button and `specship reflect` call.
+ *
+ * `sweep` does the same but additionally returns the proposals that should fire
+ * a notification: freshly-inserted (not previously seen, applied, or dismissed)
+ * AND high-severity. Already-seen and lower-severity findings are persisted and
+ * listed, but never re-notified.
+ */
+import { SqliteDatabase } from '../db/sqlite-adapter';
+import { Proposal, ReflectContext } from './types';
+export interface AnalyzeResult {
+    /** All currently-open proposals after this run. */
+    open: Proposal[];
+    /** Whether the transcript corpus yielded any signal at all (REQ-REFLECT-001.A2). */
+    empty: boolean;
+}
+export interface SweepResult extends AnalyzeResult {
+    /** New high-severity proposals worth a notification (REQ-REFLECT-006.A2/A3). */
+    notify: Proposal[];
+}
+export declare function analyze(db: SqliteDatabase, ctx: ReflectContext, now?: () => number): AnalyzeResult;
+export declare function sweep(db: SqliteDatabase, ctx: ReflectContext, now?: () => number): SweepResult;
+//# sourceMappingURL=sweep.d.ts.map

package/dist/reflect/sweep.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sweep.d.ts","sourceRoot":"","sources":["../../src/reflect/sweep.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAGtD,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AAEnD,MAAM,WAAW,aAAa;IAC5B,mDAAmD;IACnD,IAAI,EAAE,QAAQ,EAAE,CAAC;IACjB,oFAAoF;IACpF,KAAK,EAAE,OAAO,CAAC;CAChB;AAED,MAAM,WAAW,WAAY,SAAQ,aAAa;IAChD,gFAAgF;IAChF,MAAM,EAAE,QAAQ,EAAE,CAAC;CACpB;AAED,wBAAgB,OAAO,CACrB,EAAE,EAAE,cAAc,EAClB,GAAG,EAAE,cAAc,EACnB,GAAG,GAAE,MAAM,MAAyB,GACnC,aAAa,CAKf;AAED,wBAAgB,KAAK,CACnB,EAAE,EAAE,cAAc,EAClB,GAAG,EAAE,cAAc,EACnB,GAAG,GAAE,MAAM,MAAyB,GACnC,WAAW,CAgBb"}