@promptwheel/core 0.6.0

package/dist/proposals/shared.d.ts

@@ -0,0 +1,137 @@
+/**
+ * Proposals shared algorithms — pure functions for proposal validation,
+ * review, scoring, balancing, and formatting.
+ *
+ * No filesystem, database, or LLM I/O. MCP and CLI import these and
+ * wrap with their own I/O and UX layers.
+ */
+/** Raw proposal as received from LLM output (all fields optional). */
+export interface RawProposal {
+    category?: string;
+    title?: string;
+    description?: string;
+    acceptance_criteria?: string[];
+    verification_commands?: string[];
+    allowed_paths?: string[];
+    files?: string[];
+    confidence?: number;
+    impact_score?: number;
+    rationale?: string;
+    estimated_complexity?: string;
+    risk?: string;
+    touched_files_estimate?: number;
+    rollback_note?: string;
+}
+/** Proposal with all required fields validated and defaults applied. */
+export interface ValidatedProposal {
+    category: string;
+    title: string;
+    description: string;
+    acceptance_criteria: string[];
+    verification_commands: string[];
+    allowed_paths: string[];
+    files: string[];
+    confidence: number;
+    impact_score: number;
+    rationale: string;
+    estimated_complexity: string;
+    risk: string;
+    touched_files_estimate: number;
+    rollback_note: string;
+}
+/** Result of adversarial review — revised scores for a single proposal. */
+export interface ReviewedProposal {
+    title: string;
+    confidence: number;
+    impact_score: number;
+    review_note?: string;
+}
+export declare const PROPOSALS_DEFAULTS: {
+    /** Maximum deferred proposals to keep across cycles */
+    readonly MAX_DEFERRED: 20;
+    /** Maximum ratio of test-only proposals in a batch */
+    readonly MAX_TEST_RATIO: 0.4;
+    /** Default impact score when not provided */
+    readonly DEFAULT_IMPACT: 5;
+    /** Minimum confidence to pass (0 = fundamentally flawed) */
+    readonly MIN_CONFIDENCE: 1;
+    /** Default minimum impact score filter */
+    readonly DEFAULT_MIN_IMPACT: 3;
+    /** Dedup similarity threshold */
+    readonly DEDUP_THRESHOLD: 0.6;
+};
+/** Fields required for a proposal to pass schema validation. */
+export declare const REQUIRED_FIELDS: (keyof ValidatedProposal)[];
+/**
+ * Validate that a raw proposal has all required fields.
+ * Returns a comma-separated string of missing fields, or null if valid.
+ */
+export declare function validateProposalSchema(raw: RawProposal): string | null;
+/**
+ * Normalize a raw proposal into a validated proposal with defaults applied.
+ * Caller must ensure schema validation passed first.
+ */
+export declare function normalizeProposal(raw: RawProposal): ValidatedProposal;
+/** Minimal proposal shape accepted by the review prompt builder. */
+export interface ReviewableProposal {
+    title: string;
+    category: string;
+    confidence: number;
+    impact_score?: number;
+    files: string[];
+    description: string;
+    verification_commands?: string[];
+    risk?: string;
+}
+/**
+ * Build a prompt for adversarial (second-pass) review of proposals.
+ *
+ * The prompt asks the LLM to critically evaluate each proposal and revise
+ * confidence/impact scores. Setting confidence=0 means "fundamentally flawed".
+ *
+ * Works with both TicketProposal (CLI) and ValidatedProposal (MCP).
+ */
+export declare function buildProposalReviewPrompt(proposals: ReviewableProposal[]): string;
+/**
+ * Parse the <reviewed-proposals> XML block from an LLM response.
+ * Returns null if parsing fails.
+ */
+export declare function parseReviewedProposals(response: string): ReviewedProposal[] | null;
+/**
+ * Apply reviewed scores to the original proposals.
+ * Matches by title (case-insensitive). Unmatched proposals keep original scores.
+ * Returns a new array (does not mutate originals).
+ */
+export declare function applyReviewToProposals<T extends {
+    title: string;
+    confidence: number;
+    impact_score?: number;
+}>(proposals: T[], reviewed: ReviewedProposal[]): T[];
+/**
+ * Score proposals by impact × confidence and return the top N.
+ * Does not mutate the input array.
+ */
+export declare function scoreAndRank<T extends {
+    confidence: number;
+    impact_score?: number;
+}>(proposals: T[], maxCount?: number): T[];
+/**
+ * Balance test vs non-test proposals by capping the ratio of test-only proposals.
+ *
+ * If test proposals exceed maxTestRatio, keeps only the highest-impact tests
+ * (minimum 1). Does not mutate the input.
+ */
+export declare function balanceProposals<T extends {
+    category: string;
+    impact_score?: number | null;
+}>(proposals: T[], maxTestRatio?: number): T[];
+/**
+ * Format a validated proposal into a structured ticket description.
+ */
+export declare function formatProposalDescription(p: ValidatedProposal): string;
+/**
+ * Compute ticket priority from impact score and confidence.
+ * Priority = round(impact × confidence / 10)
+ */
+export declare function computePriority(impactScore: number, confidence: number): number;
+//# sourceMappingURL=shared.d.ts.map

package/dist/proposals/shared.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.d.ts","sourceRoot":"","sources":["../../src/proposals/shared.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAMH,sEAAsE;AACtE,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC/B,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC;IACjC,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;IACzB,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,wEAAwE;AACxE,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,qBAAqB,EAAE,MAAM,EAAE,CAAC;IAChC,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,sBAAsB,EAAE,MAAM,CAAC;IAC/B,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,2EAA2E;AAC3E,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAMD,eAAO,MAAM,kBAAkB;IAC7B,uDAAuD;;IAEvD,sDAAsD;;IAEtD,6CAA6C;;IAE7C,4DAA4D;;IAE5D,0CAA0C;;IAE1C,iCAAiC;;CAEzB,CAAC;AAEX,gEAAgE;AAChE,eAAO,MAAM,eAAe,EAAE,CAAC,MAAM,iBAAiB,CAAC,EAItD,CAAC;AAMF;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,WAAW,GAAG,MAAM,GAAG,IAAI,CAmBtE;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,WAAW,GAAG,iBAAiB,CAiBrE;AAMD,oEAAoE;AACpE,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,qBAAqB,CAAC,EAAE,MAAM,EAAE,CAAC;IACjC,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,wBAAgB,yBAAyB,CAAC,SAAS,EAAE,kBAAkB,EAAE,GAAG,MAAM,CAqDjF;AAMD;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,GAAG,gBAAgB,EAAE,GAAG,IAAI,CA2BlF;AAMD;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,SAAS;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,EAC3G,SAAS,EAAE,CAAC,EAAE,EACd,QAAQ,EAAE,gBAAgB,EAAE,GAC3B,CAAC,EAAE,CAgBL;AAMD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,EAClF,SAAS,EAAE,CAAC,EAAE,EACd,QAAQ,CAAC,EAAE,MAAM,GAChB,CAAC,EAAE,CAUL;AAMD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,EAC3F,SAAS,EAAE,CAAC,EAAE,EACd,YAAY,GAAE,MAA0C,GACvD,CAAC,EAAE,CAmBL;AAMD;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,iBAAiB,GAAG,MAAM,CA2BtE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAE/E"}

package/dist/proposals/shared.js

@@ -0,0 +1,254 @@
+/**
+ * Proposals shared algorithms — pure functions for proposal validation,
+ * review, scoring, balancing, and formatting.
+ *
+ * No filesystem, database, or LLM I/O. MCP and CLI import these and
+ * wrap with their own I/O and UX layers.
+ */
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+export const PROPOSALS_DEFAULTS = {
+    /** Maximum deferred proposals to keep across cycles */
+    MAX_DEFERRED: 20,
+    /** Maximum ratio of test-only proposals in a batch */
+    MAX_TEST_RATIO: 0.4,
+    /** Default impact score when not provided */
+    DEFAULT_IMPACT: 5,
+    /** Minimum confidence to pass (0 = fundamentally flawed) */
+    MIN_CONFIDENCE: 1,
+    /** Default minimum impact score filter */
+    DEFAULT_MIN_IMPACT: 3,
+    /** Dedup similarity threshold */
+    DEDUP_THRESHOLD: 0.6,
+};
+/** Fields required for a proposal to pass schema validation. */
+export const REQUIRED_FIELDS = [
+    'category', 'title', 'description', 'allowed_paths',
+    'files', 'confidence', 'verification_commands',
+    'risk', 'touched_files_estimate', 'rollback_note',
+];
+// ---------------------------------------------------------------------------
+// Schema validation
+// ---------------------------------------------------------------------------
+/**
+ * Validate that a raw proposal has all required fields.
+ * Returns a comma-separated string of missing fields, or null if valid.
+ */
+export function validateProposalSchema(raw) {
+    const missing = [];
+    // Hard-required: no sensible default possible
+    if (!raw.category || typeof raw.category !== 'string')
+        missing.push('category');
+    if (!raw.title || typeof raw.title !== 'string')
+        missing.push('title');
+    if (!raw.description || typeof raw.description !== 'string')
+        missing.push('description');
+    if (!Array.isArray(raw.allowed_paths))
+        missing.push('allowed_paths');
+    if (typeof raw.confidence !== 'number')
+        missing.push('confidence');
+    if (!raw.risk || typeof raw.risk !== 'string')
+        missing.push('risk');
+    // Soft-required: normalizeProposal provides safe defaults for these.
+    // We still validate type when present, but missing is not fatal.
+    if (raw.files !== null && raw.files !== undefined && !Array.isArray(raw.files))
+        missing.push('files');
+    if (raw.verification_commands !== null && raw.verification_commands !== undefined && !Array.isArray(raw.verification_commands))
+        missing.push('verification_commands');
+    if (raw.touched_files_estimate !== null && raw.touched_files_estimate !== undefined && typeof raw.touched_files_estimate !== 'number')
+        missing.push('touched_files_estimate');
+    if (raw.rollback_note !== null && raw.rollback_note !== undefined && typeof raw.rollback_note !== 'string')
+        missing.push('rollback_note');
+    return missing.length > 0 ? missing.join(', ') : null;
+}
+/**
+ * Normalize a raw proposal into a validated proposal with defaults applied.
+ * Caller must ensure schema validation passed first.
+ */
+export function normalizeProposal(raw) {
+    return {
+        category: raw.category,
+        title: raw.title,
+        description: raw.description,
+        acceptance_criteria: raw.acceptance_criteria ?? [],
+        verification_commands: raw.verification_commands ?? [],
+        allowed_paths: raw.allowed_paths ?? [],
+        files: raw.files ?? [],
+        confidence: raw.confidence,
+        impact_score: raw.impact_score ?? PROPOSALS_DEFAULTS.DEFAULT_IMPACT,
+        rationale: raw.rationale ?? '',
+        estimated_complexity: raw.estimated_complexity ?? 'moderate',
+        risk: raw.risk,
+        touched_files_estimate: raw.touched_files_estimate ?? (raw.allowed_paths?.length ?? 1),
+        rollback_note: raw.rollback_note ?? 'git revert',
+    };
+}
+/**
+ * Build a prompt for adversarial (second-pass) review of proposals.
+ *
+ * The prompt asks the LLM to critically evaluate each proposal and revise
+ * confidence/impact scores. Setting confidence=0 means "fundamentally flawed".
+ *
+ * Works with both TicketProposal (CLI) and ValidatedProposal (MCP).
+ */
+export function buildProposalReviewPrompt(proposals) {
+    const parts = [
+        '# Adversarial Proposal Review',
+        '',
+        'You previously generated the proposals below. Now review them critically as a skeptical senior engineer.',
+        'For each proposal, evaluate:',
+        '',
+        '1. **Is the confidence inflated?** Would you bet your reputation on this score?',
+        '2. **Will the verification commands actually validate the change?** Or are they too generic (e.g. just `npm test`)?',
+        '3. **Missing edge cases?** What could break that you didn\'t consider?',
+        '4. **Feasibility:** Can this actually be implemented within the file set listed, or does it require changes elsewhere?',
+        '',
+        '## Proposals to Review',
+        '',
+    ];
+    for (let i = 0; i < proposals.length; i++) {
+        const p = proposals[i];
+        parts.push(`### ${i + 1}. ${p.title}`, `- **Category:** ${p.category}`, `- **Confidence:** ${p.confidence}`, `- **Impact:** ${p.impact_score ?? PROPOSALS_DEFAULTS.DEFAULT_IMPACT}/10`, `- **Files:** ${p.files.join(', ') || '(none listed)'}`, `- **Risk:** ${p.risk ?? '(not specified)'}`, `- **Verification:** ${(p.verification_commands ?? []).join(', ') || '(none)'}`, `- **Description:** ${p.description}`, '');
+    }
+    parts.push('## Output', '', 'For each proposal, revise the `confidence` (0-100) and `impact_score` (1-10).', 'If a proposal is fundamentally flawed, set its confidence to 0.', 'Optionally add a `review_note` (string) explaining your reasoning.', '', 'Call `promptwheel_ingest_event` with type `PROPOSALS_REVIEWED` and payload:', '`{ "reviewed_proposals": [{ "title": "...", "confidence": N, "impact_score": N, "review_note": "..." }, ...] }`', '', 'Example payload:', '```json', '{', '  "reviewed_proposals": [', '    { "title": "Add missing null check", "confidence": 75, "impact_score": 6, "review_note": "Solid but verify edge case X" },', '    { "title": "Refactor auth module", "confidence": 0, "impact_score": 2, "review_note": "Requires changes outside allowed_paths" }', '  ]', '}', '```');
+    return parts.join('\n');
+}
+// ---------------------------------------------------------------------------
+// Parse reviewed proposals
+// ---------------------------------------------------------------------------
+/**
+ * Parse the <reviewed-proposals> XML block from an LLM response.
+ * Returns null if parsing fails.
+ */
+export function parseReviewedProposals(response) {
+    const match = response.match(/<reviewed-proposals>\s*([\s\S]*?)\s*<\/reviewed-proposals>/);
+    if (!match)
+        return null;
+    let jsonStr = match[1].trim();
+    // Strip markdown code fences if present
+    jsonStr = jsonStr.replace(/^```(?:json)?\s*/, '').replace(/\s*```$/, '');
+    try {
+        const parsed = JSON.parse(jsonStr);
+        if (!Array.isArray(parsed))
+            return null;
+        const results = [];
+        for (const item of parsed) {
+            if (typeof item.title !== 'string')
+                continue;
+            results.push({
+                title: item.title,
+                confidence: typeof item.confidence === 'number' ? item.confidence : 50,
+                impact_score: typeof item.impact_score === 'number' ? item.impact_score : PROPOSALS_DEFAULTS.DEFAULT_IMPACT,
+                review_note: typeof item.review_note === 'string' ? item.review_note : undefined,
+            });
+        }
+        return results.length > 0 ? results : null;
+    }
+    catch {
+        return null;
+    }
+}
+// ---------------------------------------------------------------------------
+// Apply review results
+// ---------------------------------------------------------------------------
+/**
+ * Apply reviewed scores to the original proposals.
+ * Matches by title (case-insensitive). Unmatched proposals keep original scores.
+ * Returns a new array (does not mutate originals).
+ */
+export function applyReviewToProposals(proposals, reviewed) {
+    const reviewMap = new Map();
+    for (const r of reviewed) {
+        reviewMap.set(r.title.toLowerCase(), r);
+    }
+    return proposals.map(p => {
+        const review = reviewMap.get(p.title.toLowerCase());
+        if (!review)
+            return p;
+        return {
+            ...p,
+            confidence: review.confidence,
+            impact_score: review.impact_score,
+        };
+    });
+}
+// ---------------------------------------------------------------------------
+// Scoring and ranking
+// ---------------------------------------------------------------------------
+/**
+ * Score proposals by impact × confidence and return the top N.
+ * Does not mutate the input array.
+ */
+export function scoreAndRank(proposals, maxCount) {
+    const scored = [...proposals]
+        .map(p => ({
+        proposal: p,
+        score: (p.impact_score ?? PROPOSALS_DEFAULTS.DEFAULT_IMPACT) * p.confidence,
+    }))
+        .sort((a, b) => b.score - a.score);
+    const capped = maxCount !== undefined ? scored.slice(0, maxCount) : scored;
+    return capped.map(s => s.proposal);
+}
+// ---------------------------------------------------------------------------
+// Test balance
+// ---------------------------------------------------------------------------
+/**
+ * Balance test vs non-test proposals by capping the ratio of test-only proposals.
+ *
+ * If test proposals exceed maxTestRatio, keeps only the highest-impact tests
+ * (minimum 1). Does not mutate the input.
+ */
+export function balanceProposals(proposals, maxTestRatio = PROPOSALS_DEFAULTS.MAX_TEST_RATIO) {
+    const tests = proposals.filter(p => (p.category || '').toLowerCase() === 'test');
+    const nonTests = proposals.filter(p => (p.category || '').toLowerCase() !== 'test');
+    const total = proposals.length;
+    const maxTests = Math.floor(total * maxTestRatio);
+    if (tests.length <= maxTests)
+        return [...proposals];
+    // Sort tests by impact descending, keep only the top N
+    const sortedTests = [...tests].sort((a, b) => (b.impact_score ?? PROPOSALS_DEFAULTS.DEFAULT_IMPACT) - (a.impact_score ?? PROPOSALS_DEFAULTS.DEFAULT_IMPACT));
+    // Hard-cap tests — even if ALL proposals are tests, keep at most maxTests (min 1)
+    const allowedTests = Math.max(maxTests, 1);
+    const keptTests = sortedTests.slice(0, allowedTests);
+    return [...nonTests, ...keptTests];
+}
+// ---------------------------------------------------------------------------
+// Description formatting
+// ---------------------------------------------------------------------------
+/**
+ * Format a validated proposal into a structured ticket description.
+ */
+export function formatProposalDescription(p) {
+    const parts = [
+        p.description,
+        '',
+        '## Acceptance Criteria',
+        ...p.acceptance_criteria.map(c => `- ${c}`),
+        '',
+        '## Details',
+        `**Risk:** ${p.risk}`,
+        `**Complexity:** ${p.estimated_complexity}`,
+        `**Confidence:** ${p.confidence}%`,
+        `**Impact:** ${p.impact_score}/10`,
+        `**Estimated files:** ${p.touched_files_estimate}`,
+        '',
+        '## Rollback',
+        p.rollback_note,
+    ];
+    if (p.rationale) {
+        parts.push('', '## Rationale', p.rationale);
+    }
+    if (p.files.length > 0) {
+        parts.push('', '## Files', ...p.files.map(f => `- \`${f}\``));
+    }
+    return parts.join('\n');
+}
+/**
+ * Compute ticket priority from impact score and confidence.
+ * Priority = round(impact × confidence / 10)
+ */
+export function computePriority(impactScore, confidence) {
+    return Math.round(impactScore * confidence / 10);
+}
+//# sourceMappingURL=shared.js.map

package/dist/proposals/shared.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.js","sourceRoot":"","sources":["../../src/proposals/shared.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAkDH,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,uDAAuD;IACvD,YAAY,EAAE,EAAE;IAChB,sDAAsD;IACtD,cAAc,EAAE,GAAG;IACnB,6CAA6C;IAC7C,cAAc,EAAE,CAAC;IACjB,4DAA4D;IAC5D,cAAc,EAAE,CAAC;IACjB,0CAA0C;IAC1C,kBAAkB,EAAE,CAAC;IACrB,iCAAiC;IACjC,eAAe,EAAE,GAAG;CACZ,CAAC;AAEX,gEAAgE;AAChE,MAAM,CAAC,MAAM,eAAe,GAAgC;IAC1D,UAAU,EAAE,OAAO,EAAE,aAAa,EAAE,eAAe;IACnD,OAAO,EAAE,YAAY,EAAE,uBAAuB;IAC9C,MAAM,EAAE,wBAAwB,EAAE,eAAe;CAClD,CAAC;AAEF,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAgB;IACrD,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,8CAA8C;IAC9C,IAAI,CAAC,GAAG,CAAC,QAAQ,IAAI,OAAO,GAAG,CAAC,QAAQ,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAChF,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvE,IAAI,CAAC,GAAG,CAAC,WAAW,IAAI,OAAO,GAAG,CAAC,WAAW,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACzF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACrE,IAAI,OAAO,GAAG,CAAC,UAAU,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACnE,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEpE,qEAAqE;IACrE,iEAAiE;IACjE,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,IAAI,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtG,IAAI,GAAG,CAAC,qBAAqB,KAAK,IAAI,IAAI,GAAG,CAAC,qBAAqB,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,qBAAqB,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IACtK,IAAI,GAAG,CAAC,sBAAsB,KAAK,IAAI,IAAI,GAAG,CAAC,sBAAsB,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,sBAAsB,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IAC9K,IAAI,GAAG,CAAC,aAAa,KAAK,IAAI,IAAI,GAAG,CAAC,aAAa,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,aAAa,KAAK,QAAQ;QAAE,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAE1I,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACxD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAgB;IAChD,OAAO;QACL,QAAQ,EAAE,GAAG,CAAC,QAAS;QACvB,KAAK,EAAE,GAAG,CAAC,KAAM;QACjB,WAAW,EAAE,GAAG,CAAC,WAAY;QAC7B,mBAAmB,EAAE,GAAG,CAAC,mBAAmB,IAAI,EAAE;QAClD,qBAAqB,EAAE,GAAG,CAAC,qBAAqB,IAAI,EAAE;QACtD,aAAa,EAAE,GAAG,CAAC,aAAa,IAAI,EAAE;QACtC,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,EAAE;QACtB,UAAU,EAAE,GAAG,CAAC,UAAW;QAC3B,YAAY,EAAE,GAAG,CAAC,YAAY,IAAI,kBAAkB,CAAC,cAAc;QACnE,SAAS,EAAE,GAAG,CAAC,SAAS,IAAI,EAAE;QAC9B,oBAAoB,EAAE,GAAG,CAAC,oBAAoB,IAAI,UAAU;QAC5D,IAAI,EAAE,GAAG,CAAC,IAAK;QACf,sBAAsB,EAAE,GAAG,CAAC,sBAAsB,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,IAAI,CAAC,CAAC;QACtF,aAAa,EAAE,GAAG,CAAC,aAAa,IAAI,YAAY;KACjD,CAAC;AACJ,CAAC;AAkBD;;;;;;;GAOG;AACH,MAAM,UAAU,yBAAyB,CAAC,SAA+B;IACvE,MAAM,KAAK,GAAG;QACZ,+BAA+B;QAC/B,EAAE;QACF,0GAA0G;QAC1G,8BAA8B;QAC9B,EAAE;QACF,iFAAiF;QACjF,qHAAqH;QACrH,wEAAwE;QACxE,wHAAwH;QACxH,EAAE;QACF,wBAAwB;QACxB,EAAE;KACH,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACvB,KAAK,CAAC,IAAI,CACR,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAC1B,mBAAmB,CAAC,CAAC,QAAQ,EAAE,EAC/B,qBAAqB,CAAC,CAAC,UAAU,EAAE,EACnC,iBAAiB,CAAC,CAAC,YAAY,IAAI,kBAAkB,CAAC,cAAc,KAAK,EACzE,gBAAgB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,eAAe,EAAE,EACvD,eAAe,CAAC,CAAC,IAAI,IAAI,iBAAiB,EAAE,EAC5C,uBAAuB,CAAC,CAAC,CAAC,qBAAqB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,EAAE,EAC/E,sBAAsB,CAAC,CAAC,WAAW,EAAE,EACrC,EAAE,CACH,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAI,CACR,WAAW,EACX,EAAE,EACF,+EAA+E,EAC/E,iEAAiE,EACjE,oEAAoE,EACpE,EAAE,EACF,6EAA6E,EAC7E,iHAAiH,EACjH,EAAE,EACF,kBAAkB,EAClB,SAAS,EACT,GAAG,EACH,2BAA2B,EAC3B,gIAAgI,EAChI,sIAAsI,EACtI,KAAK,EACL,GAAG,EACH,KAAK,CACN,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,QAAgB;IACrD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAC3F,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAExB,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAE9B,wCAAwC;IACxC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAEzE,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAExC,MAAM,OAAO,GAAuB,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ;gBAAE,SAAS;YAC7C,OAAO,CAAC,IAAI,CAAC;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,UAAU,EAAE,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE;gBACtE,YAAY,EAAE,OAAO,IAAI,CAAC,YAAY,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,kBAAkB,CAAC,cAAc;gBAC3G,WAAW,EAAE,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS;aACjF,CAAC,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,SAAc,EACd,QAA4B;IAE5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAA4B,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;QACvB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;QACpD,IAAI,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC;QAEtB,OAAO;YACL,GAAG,CAAC;YACJ,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,YAAY,EAAE,MAAM,CAAC,YAAY;SAClC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,SAAc,EACd,QAAiB;IAEjB,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACT,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,UAAU;KAC5E,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,MAAM,MAAM,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3E,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;AACrC,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,SAAc,EACd,eAAuB,kBAAkB,CAAC,cAAc;IAExD,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC;IACjF,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC;IAEpF,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,CAAC;IAElD,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC;IAEpD,uDAAuD;IACvD,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,IAAI,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,IAAI,kBAAkB,CAAC,cAAc,CAAC,CACxH,CAAC;IAEF,kFAAkF;IAClF,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;IAErD,OAAO,CAAC,GAAG,QAAQ,EAAE,GAAG,SAAS,CAAC,CAAC;AACrC,CAAC;AAED,8EAA8E;AAC9E,yBAAyB;AACzB,8EAA8E;AAE9E;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,CAAoB;IAC5D,MAAM,KAAK,GAAG;QACZ,CAAC,CAAC,WAAW;QACb,EAAE;QACF,wBAAwB;QACxB,GAAG,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,EAAE;QACF,YAAY;QACZ,aAAa,CAAC,CAAC,IAAI,EAAE;QACrB,mBAAmB,CAAC,CAAC,oBAAoB,EAAE;QAC3C,mBAAmB,CAAC,CAAC,UAAU,GAAG;QAClC,eAAe,CAAC,CAAC,YAAY,KAAK;QAClC,wBAAwB,CAAC,CAAC,sBAAsB,EAAE;QAClD,EAAE;QACF,aAAa;QACb,CAAC,CAAC,aAAa;KAChB,CAAC;IAEF,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;QAChB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,cAAc,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,WAAmB,EAAE,UAAkB;IACrE,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,UAAU,GAAG,EAAE,CAAC,CAAC;AACnD,CAAC"}

package/dist/repos/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Repository exports
+ *
+ * Repositories provide database operations using the DatabaseAdapter interface.
+ * They handle row mapping and business logic validation.
+ */
+export * as projects from './projects.js';
+export * as tickets from './tickets.js';
+export * as runs from './runs.js';
+export * as runSteps from './run_steps.js';
+export type { Project } from './projects.js';
+export type { Ticket, TicketStatus, TicketCategory } from './tickets.js';
+export type { Run, RunStatus, RunType, RunSummary } from './runs.js';
+export type { RunStep, StepStatus, StepKind, StepCounts, StepSummary, } from './run_steps.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/repos/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,OAAO,MAAM,cAAc,CAAC;AACxC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAG3C,YAAY,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAC7C,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACzE,YAAY,EAAE,GAAG,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACrE,YAAY,EACV,OAAO,EACP,UAAU,EACV,QAAQ,EACR,UAAU,EACV,WAAW,GACZ,MAAM,gBAAgB,CAAC"}

package/dist/repos/index.js

@@ -0,0 +1,11 @@
+/**
+ * Repository exports
+ *
+ * Repositories provide database operations using the DatabaseAdapter interface.
+ * They handle row mapping and business logic validation.
+ */
+export * as projects from './projects.js';
+export * as tickets from './tickets.js';
+export * as runs from './runs.js';
+export * as runSteps from './run_steps.js';
+//# sourceMappingURL=index.js.map

package/dist/repos/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/repos/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,OAAO,MAAM,cAAc,CAAC;AACxC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC"}

package/dist/repos/projects.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Project repository - Database operations for projects
+ */
+import type { DatabaseAdapter } from '../db/adapter.js';
+export interface Project {
+    id: string;
+    name: string;
+    repoUrl: string | null;
+    rootPath: string;
+    createdAt: Date;
+    updatedAt: Date;
+}
+/**
+ * Get project by ID
+ */
+export declare function getById(db: DatabaseAdapter, id: string): Promise<Project | null>;
+/**
+ * Get project by repository root path
+ */
+export declare function getByRepoRoot(db: DatabaseAdapter, rootPath: string): Promise<Project | null>;
+/**
+ * Ensure a project exists for a repository
+ * Returns existing project or creates new one
+ *
+ * This is idempotent - calling twice with same rootPath returns same project
+ */
+export declare function ensureForRepo(db: DatabaseAdapter, opts: {
+    name: string;
+    rootPath: string;
+    id?: string;
+    repoUrl?: string | null;
+}): Promise<Project>;
+/**
+ * List all projects
+ */
+export declare function list(db: DatabaseAdapter): Promise<Project[]>;
+/**
+ * Delete a project and all related data
+ */
+export declare function remove(db: DatabaseAdapter, id: string): Promise<void>;
+//# sourceMappingURL=projects.d.ts.map

package/dist/repos/projects.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"projects.d.ts","sourceRoot":"","sources":["../../src/repos/projects.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAGxD,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,IAAI,CAAC;IAChB,SAAS,EAAE,IAAI,CAAC;CACjB;AAsBD;;GAEG;AACH,wBAAsB,OAAO,CAC3B,EAAE,EAAE,eAAe,EACnB,EAAE,EAAE,MAAM,GACT,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAMzB;AAED;;GAEG;AACH,wBAAsB,aAAa,CACjC,EAAE,EAAE,eAAe,EACnB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAMzB;AAED;;;;;GAKG;AACH,wBAAsB,aAAa,CACjC,EAAE,EAAE,eAAe,EACnB,IAAI,EAAE;IACJ,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB,GACA,OAAO,CAAC,OAAO,CAAC,CAqBlB;AAED;;GAEG;AACH,wBAAsB,IAAI,CAAC,EAAE,EAAE,eAAe,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAKlE;AAED;;GAEG;AACH,wBAAsB,MAAM,CAAC,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAY3E"}

package/dist/repos/projects.js

@@ -0,0 +1,75 @@
+/**
+ * Project repository - Database operations for projects
+ */
+import { nanoid } from '../utils/id.js';
+function rowToProject(row) {
+    return {
+        id: row.id,
+        name: row.name,
+        repoUrl: row.repo_url,
+        rootPath: row.root_path,
+        createdAt: new Date(row.created_at),
+        updatedAt: new Date(row.updated_at),
+    };
+}
+/**
+ * Get project by ID
+ */
+export async function getById(db, id) {
+    const result = await db.query('SELECT * FROM projects WHERE id = $1', [id]);
+    return result.rows[0] ? rowToProject(result.rows[0]) : null;
+}
+/**
+ * Get project by repository root path
+ */
+export async function getByRepoRoot(db, rootPath) {
+    const result = await db.query('SELECT * FROM projects WHERE root_path = $1', [rootPath]);
+    return result.rows[0] ? rowToProject(result.rows[0]) : null;
+}
+/**
+ * Ensure a project exists for a repository
+ * Returns existing project or creates new one
+ *
+ * This is idempotent - calling twice with same rootPath returns same project
+ */
+export async function ensureForRepo(db, opts) {
+    // Check if already exists by rootPath
+    const existing = await getByRepoRoot(db, opts.rootPath);
+    if (existing) {
+        return existing;
+    }
+    // Create new project (use ON CONFLICT to handle race conditions / worktree paths)
+    const id = opts.id ?? `proj_${nanoid(6)}`;
+    await db.query(`INSERT INTO projects (id, name, repo_url, root_path)
+     VALUES ($1, $2, $3, $4)
+     ON CONFLICT (id) DO NOTHING`, [id, opts.name, opts.repoUrl ?? null, opts.rootPath]);
+    const created = await getById(db, id);
+    if (!created) {
+        throw new Error('Failed to create project');
+    }
+    return created;
+}
+/**
+ * List all projects
+ */
+export async function list(db) {
+    const result = await db.query('SELECT * FROM projects ORDER BY updated_at DESC');
+    return result.rows.map(rowToProject);
+}
+/**
+ * Delete a project and all related data
+ */
+export async function remove(db, id) {
+    await db.withTransaction(async (tx) => {
+        // Delete in order respecting foreign keys
+        // Use project_id directly on runs to catch scout runs with NULL ticket_id
+        await tx.query('DELETE FROM run_events WHERE run_id IN (SELECT id FROM runs WHERE project_id = $1)', [id]);
+        await tx.query('DELETE FROM artifacts WHERE run_id IN (SELECT id FROM runs WHERE project_id = $1)', [id]);
+        await tx.query('DELETE FROM leases WHERE ticket_id IN (SELECT id FROM tickets WHERE project_id = $1)', [id]);
+        await tx.query('DELETE FROM runs WHERE project_id = $1', [id]);
+        await tx.query('DELETE FROM learnings WHERE project_id = $1', [id]);
+        await tx.query('DELETE FROM tickets WHERE project_id = $1', [id]);
+        await tx.query('DELETE FROM projects WHERE id = $1', [id]);
+    });
+}
+//# sourceMappingURL=projects.js.map

package/dist/repos/projects.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"projects.js","sourceRoot":"","sources":["../../src/repos/projects.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAoBxC,SAAS,YAAY,CAAC,GAAe;IACnC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,OAAO,EAAE,GAAG,CAAC,QAAQ;QACrB,QAAQ,EAAE,GAAG,CAAC,SAAS;QACvB,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;QACnC,SAAS,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC;KACpC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAC3B,EAAmB,EACnB,EAAU;IAEV,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,KAAK,CAC3B,sCAAsC,EACtC,CAAC,EAAE,CAAC,CACL,CAAC;IACF,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,EAAmB,EACnB,QAAgB;IAEhB,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,KAAK,CAC3B,6CAA6C,EAC7C,CAAC,QAAQ,CAAC,CACX,CAAC;IACF,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9D,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,EAAmB,EACnB,IAKC;IAED,sCAAsC;IACtC,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxD,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,kFAAkF;IAClF,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,QAAQ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1C,MAAM,EAAE,CAAC,KAAK,CACZ;;iCAE6B,EAC7B,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CACrD,CAAC;IAEF,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACtC,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,IAAI,CAAC,EAAmB;IAC5C,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,KAAK,CAC3B,iDAAiD,CAClD,CAAC;IACF,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,EAAmB,EAAE,EAAU;IAC1D,MAAM,EAAE,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;QACpC,0CAA0C;QAC1C,0EAA0E;QAC1E,MAAM,EAAE,CAAC,KAAK,CAAC,oFAAoF,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3G,MAAM,EAAE,CAAC,KAAK,CAAC,mFAAmF,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1G,MAAM,EAAE,CAAC,KAAK,CAAC,sFAAsF,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7G,MAAM,EAAE,CAAC,KAAK,CAAC,wCAAwC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,MAAM,EAAE,CAAC,KAAK,CAAC,6CAA6C,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACpE,MAAM,EAAE,CAAC,KAAK,CAAC,2CAA2C,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,CAAC,KAAK,CAAC,oCAAoC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC"}