agent-bober 0.17.1 → 0.19.0

package/dist/calendar/slotter.js

@@ -0,0 +1,196 @@
+/**
+ * CalendarSlotter — deterministic LLM-free slot-fill (spec-20260628-calendar-planner Sprint 1).
+ *
+ * PURITY CONTRACT: pure synchronous only — no fs, no network, no LLM import, no subprocess, no dynamic eval.
+ * Identical input => identical output.
+ *
+ * Algorithm:
+ *   1. Derive free intervals from (window minus busy intervals), clamped to workingHours if set.
+ *   2. Iterate findings in INPUT ORDER (pre-ranked by the hub — the LLM NEVER packs slots).
+ *   3. Place each finding into the earliest free interval that fits estDurationMin before dueBy.
+ *   4. On placement, split the consumed free interval in-place.
+ *   5. If no interval fits, push to unscheduled with an exhaustive-switch reason.
+ *
+ * Time math uses Date.parse(iso) → epoch-ms arithmetic (pure — same ISO always yields same ms).
+ * new Date(ms).toISOString() converts back to ISO-8601 (also pure — deterministic).
+ */
+// ── Internal helpers ──────────────────────────────────────────────────
+/** Default duration when a finding lacks estDurationMin (minutes). */
+const DEFAULT_DURATION_MIN = 30;
+/** sentinel for "no deadline" (findings without dueBy). */
+const NO_DEADLINE = Infinity;
+/**
+ * Derive the free intervals in the window by subtracting busy intervals.
+ * Busy intervals are clipped to the window boundary before subtraction.
+ * If workingHours is provided, free intervals are further clamped per-day.
+ */
+function deriveFreeIntervals(constraints, busy) {
+    const windowStart = Date.parse(constraints.windowStartIso);
+    const windowEnd = Date.parse(constraints.windowEndIso);
+    // Clip and sort busy intervals to the window
+    const clippedBusy = busy
+        .map((b) => ({
+        start: Math.max(Date.parse(b.startIso), windowStart),
+        end: Math.min(Date.parse(b.endIso), windowEnd),
+    }))
+        .filter((b) => b.start < b.end) // discard intervals fully outside window
+        .sort((a, b) => a.start - b.start);
+    // Build free gaps by walking the sorted busy list
+    const free = [];
+    let cursor = windowStart;
+    for (const b of clippedBusy) {
+        if (b.start > cursor) {
+            free.push({
+                startIso: new Date(cursor).toISOString(),
+                endIso: new Date(b.start).toISOString(),
+            });
+        }
+        if (b.end > cursor) {
+            cursor = b.end;
+        }
+    }
+    if (cursor < windowEnd) {
+        free.push({
+            startIso: new Date(cursor).toISOString(),
+            endIso: new Date(windowEnd).toISOString(),
+        });
+    }
+    if (constraints.workingHours === undefined) {
+        return free;
+    }
+    return clampToWorkingHours(free, constraints.workingHours.startHour, constraints.workingHours.endHour);
+}
+/**
+ * Clamp each free interval to the daily working hours window (UTC hours).
+ * Intervals that span multiple days are clamped per-day.
+ * A clamp that yields start >= end is discarded.
+ *
+ * Note: bober: single-day clamping; a free interval spanning midnight is split only
+ * for that calendar day. Multi-day spanning is handled by iterating days.
+ * Upgrade path: replace with a per-day iterator if multi-day windows become common.
+ */
+function clampToWorkingHours(intervals, startHour, endHour) {
+    const result = [];
+    for (const interval of intervals) {
+        const iStart = Date.parse(interval.startIso);
+        const iEnd = Date.parse(interval.endIso);
+        // Iterate day by day for multi-day intervals
+        let dayBase = iStart - (iStart % 86_400_000); // truncate to midnight UTC
+        while (dayBase < iEnd) {
+            const dayWorkStart = dayBase + startHour * 3_600_000;
+            const dayWorkEnd = dayBase + endHour * 3_600_000;
+            const clampedStart = Math.max(iStart, dayWorkStart);
+            const clampedEnd = Math.min(iEnd, dayWorkEnd);
+            if (clampedStart < clampedEnd) {
+                result.push({
+                    startIso: new Date(clampedStart).toISOString(),
+                    endIso: new Date(clampedEnd).toISOString(),
+                });
+            }
+            dayBase += 86_400_000; // advance one day
+        }
+    }
+    return result;
+}
+/**
+ * Produce a human-readable label for an UnscheduledReason.
+ *
+ * The exhaustive switch + never guard ensures that adding a new UnscheduledReason
+ * variant without a case here causes a TypeScript compile error (ADR-3 code-review gate).
+ */
+function labelUnscheduledReason(reason) {
+    switch (reason) {
+        case "does-not-fit":
+            return "no free slot large enough for the required duration";
+        case "no-free-slot-before-dueBy":
+            return "all free slots start at or after the due-by deadline";
+        default: {
+            // Exhaustive never guard: TypeScript will raise a compile error if a new
+            // UnscheduledReason variant is added without a matching case (ADR-3).
+            const _exhaustive = reason;
+            throw new Error(`Unhandled UnscheduledReason: ${String(_exhaustive)}`);
+        }
+    }
+}
+// ── Public entry (pure, synchronous) ──────────────────────────────────
+/**
+ * Place ranked findings into free calendar slots deterministically.
+ *
+ * - findings are processed in INPUT ORDER (= priority order from the hub).
+ * - Each finding is placed into the earliest free interval that can accommodate
+ *   its estDurationMin (default: 30 min) entirely before its dueBy.
+ * - On placement the consumed portion is removed from the free-interval list.
+ * - Findings that cannot be placed are returned in unscheduled[] with a reason.
+ * - No LLM, no network, no fs, no clock — deterministic across identical inputs.
+ *
+ * @param findings  - Pre-ranked Finding array (index 0 = highest priority).
+ * @param busy      - Known busy intervals for the planning window.
+ * @param constraints - Window bounds (and optional working-hours clamp).
+ * @returns ProposedPlan with scheduled PlanItems and unscheduled entries.
+ */
+export function planSlots(findings, busy, constraints) {
+    const freeIntervals = deriveFreeIntervals(constraints, busy);
+    const scheduled = [];
+    const unscheduled = [];
+    // Mutable epoch-ms copy of free intervals for in-place splitting
+    const free = freeIntervals.map((f) => ({
+        start: Date.parse(f.startIso),
+        end: Date.parse(f.endIso),
+    }));
+    for (const finding of findings) {
+        const durationMs = (finding.estDurationMin ?? DEFAULT_DURATION_MIN) * 60_000;
+        const dueByMs = finding.dueBy !== undefined ? Date.parse(finding.dueBy) : NO_DEADLINE;
+        let placed = false;
+        for (let i = 0; i < free.length; i++) {
+            const slot = free[i];
+            // Free intervals are sorted; once we pass dueBy no later slot can help
+            if (slot.start >= dueByMs) {
+                break;
+            }
+            // Effective end: the slot end clamped to dueBy so the event finishes before deadline
+            const effectiveEnd = dueByMs === NO_DEADLINE ? slot.end : Math.min(slot.end, dueByMs);
+            const available = effectiveEnd - slot.start;
+            if (available >= durationMs) {
+                const itemStart = slot.start;
+                const itemEnd = itemStart + durationMs;
+                const planItem = {
+                    findingId: finding.id,
+                    title: finding.calendarSafeTitle ?? finding.title,
+                    startIso: new Date(itemStart).toISOString(),
+                    endIso: new Date(itemEnd).toISOString(),
+                    // calendarSafeTitle threaded for cloud connectors (Sprint 3); undefined when absent.
+                    calendarSafeTitle: finding.calendarSafeTitle,
+                };
+                scheduled.push(planItem);
+                // Split the consumed interval in-place
+                if (itemEnd < slot.end) {
+                    // Shrink: shift the slot start forward
+                    free[i] = { start: itemEnd, end: slot.end };
+                }
+                else {
+                    // Slot exactly consumed — remove it
+                    free.splice(i, 1);
+                }
+                placed = true;
+                break;
+            }
+        }
+        if (!placed) {
+            // Determine reason: all free slots before dueBy were too small vs no slot before dueBy
+            let reason;
+            if (dueByMs !== NO_DEADLINE && !free.some((s) => s.start < dueByMs)) {
+                // There are free slots but none start before the deadline
+                reason = "no-free-slot-before-dueBy";
+            }
+            else {
+                // Either no deadline, or slots exist before dueBy but none are large enough
+                reason = "does-not-fit";
+            }
+            // Validate via the exhaustive switch (also surfaces the human-readable label for tests)
+            labelUnscheduledReason(reason);
+            unscheduled.push({ findingId: finding.id, reason });
+        }
+    }
+    return { scheduled, unscheduled };
+}
+//# sourceMappingURL=slotter.js.map

package/dist/calendar/slotter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slotter.js","sourceRoot":"","sources":["../../src/calendar/slotter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAYH,yEAAyE;AAEzE,sEAAsE;AACtE,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAEhC,2DAA2D;AAC3D,MAAM,WAAW,GAAG,QAAQ,CAAC;AAE7B;;;;GAIG;AACH,SAAS,mBAAmB,CAC1B,WAA4B,EAC5B,IAAoB;IAEpB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;IAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;IAEvD,6CAA6C;IAC7C,MAAM,WAAW,GAAG,IAAI;SACrB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACX,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC;QACpD,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;KAC/C,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,yCAAyC;SACxE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,kDAAkD;IAClD,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,MAAM,GAAG,WAAW,CAAC;IAEzB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,GAAG,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC;gBACR,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE;gBACxC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE;aACxC,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,GAAG,MAAM,EAAE,CAAC;YACnB,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC;QACjB,CAAC;IACH,CAAC;IAED,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC;YACR,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE;YACxC,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE;SAC1C,CAAC,CAAC;IACL,CAAC;IAED,IAAI,WAAW,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,mBAAmB,CAAC,IAAI,EAAE,WAAW,CAAC,YAAY,CAAC,SAAS,EAAE,WAAW,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;AACzG,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,mBAAmB,CAC1B,SAAyB,EACzB,SAAiB,EACjB,OAAe;IAEf,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAEzC,6CAA6C;QAC7C,IAAI,OAAO,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,2BAA2B;QAEzE,OAAO,OAAO,GAAG,IAAI,EAAE,CAAC;YACtB,MAAM,YAAY,GAAG,OAAO,GAAG,SAAS,GAAG,SAAS,CAAC;YACrD,MAAM,UAAU,GAAG,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;YAEjD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACpD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAE9C,IAAI,YAAY,GAAG,UAAU,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC;oBACV,QAAQ,EAAE,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,WAAW,EAAE;oBAC9C,MAAM,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE;iBAC3C,CAAC,CAAC;YACL,CAAC;YAED,OAAO,IAAI,UAAU,CAAC,CAAC,kBAAkB;QAC3C,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAS,sBAAsB,CAAC,MAAyB;IACvD,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,cAAc;YACjB,OAAO,qDAAqD,CAAC;QAC/D,KAAK,2BAA2B;YAC9B,OAAO,sDAAsD,CAAC;QAChE,OAAO,CAAC,CAAC,CAAC;YACR,yEAAyE;YACzE,sEAAsE;YACtE,MAAM,WAAW,GAAU,MAAM,CAAC;YAClC,MAAM,IAAI,KAAK,CAAC,gCAAgC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;AACH,CAAC;AAED,yEAAyE;AAEzE;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,SAAS,CACvB,QAAmB,EACnB,IAAoB,EACpB,WAA4B;IAE5B,MAAM,aAAa,GAAG,mBAAmB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAE7D,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,MAAM,WAAW,GAA4D,EAAE,CAAC;IAEhF,iEAAiE;IACjE,MAAM,IAAI,GAA0C,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5E,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC7B,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;KAC1B,CAAC,CAAC,CAAC;IAEJ,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,OAAO,CAAC,cAAc,IAAI,oBAAoB,CAAC,GAAG,MAAM,CAAC;QAC7E,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAEtF,IAAI,MAAM,GAAG,KAAK,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAErB,uEAAuE;YACvE,IAAI,IAAI,CAAC,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC1B,MAAM;YACR,CAAC;YAED,qFAAqF;YACrF,MAAM,YAAY,GAAG,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACtF,MAAM,SAAS,GAAG,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC;YAE5C,IAAI,SAAS,IAAI,UAAU,EAAE,CAAC;gBAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;gBAC7B,MAAM,OAAO,GAAG,SAAS,GAAG,UAAU,CAAC;gBAEvC,MAAM,QAAQ,GAAa;oBACzB,SAAS,EAAE,OAAO,CAAC,EAAE;oBACrB,KAAK,EAAE,OAAO,CAAC,iBAAiB,IAAI,OAAO,CAAC,KAAK;oBACjD,QAAQ,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE;oBAC3C,MAAM,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE;oBACvC,qFAAqF;oBACrF,iBAAiB,EAAE,OAAO,CAAC,iBAAiB;iBAC7C,CAAC;gBACF,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAEzB,uCAAuC;gBACvC,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;oBACvB,uCAAuC;oBACvC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC9C,CAAC;qBAAM,CAAC;oBACN,oCAAoC;oBACpC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpB,CAAC;gBAED,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,uFAAuF;YACvF,IAAI,MAAyB,CAAC;YAE9B,IAAI,OAAO,KAAK,WAAW,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC;gBACpE,0DAA0D;gBAC1D,MAAM,GAAG,2BAA2B,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,4EAA4E;gBAC5E,MAAM,GAAG,cAAc,CAAC;YAC1B,CAAC;YAED,wFAAwF;YACxF,sBAAsB,CAAC,MAAM,CAAC,CAAC;YAE/B,WAAW,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AACpC,CAAC"}

package/dist/calendar/types.d.ts

@@ -0,0 +1,162 @@
+import { z } from "zod";
+/**
+ * Local calendar-module copy of the Finding type.
+ * Field names mirror src/hub/finding.ts:10-27 EXACTLY.
+ * Do NOT import from src/hub — this module is a forward dependency on the
+ * priority-hub spec. The hub is a sibling spec; importing it would create a
+ * compile-time coupling that the planner explicitly avoided.
+ */
+export declare const FindingSchema: z.ZodObject<{
+    id: z.ZodString;
+    domain: z.ZodString;
+    title: z.ZodString;
+    kind: z.ZodEnum<["action", "watch", "risk", "question"]>;
+    urgency: z.ZodNumber;
+    severity: z.ZodNumber;
+    evidence: z.ZodArray<z.ZodString, "many">;
+    surfacedAt: z.ZodString;
+    dueBy: z.ZodOptional<z.ZodString>;
+    tags: z.ZodArray<z.ZodString, "many">;
+    estDurationMin: z.ZodOptional<z.ZodNumber>;
+    calendarSafeTitle: z.ZodOptional<z.ZodString>;
+    status: z.ZodEnum<["open", "in-progress", "snoozed", "done", "dropped"]>;
+    promotesTo: z.ZodOptional<z.ZodString>;
+}, "strip", z.ZodTypeAny, {
+    status: "open" | "in-progress" | "snoozed" | "done" | "dropped";
+    kind: "action" | "watch" | "risk" | "question";
+    id: string;
+    domain: string;
+    title: string;
+    urgency: number;
+    severity: number;
+    evidence: string[];
+    surfacedAt: string;
+    tags: string[];
+    dueBy?: string | undefined;
+    estDurationMin?: number | undefined;
+    calendarSafeTitle?: string | undefined;
+    promotesTo?: string | undefined;
+}, {
+    status: "open" | "in-progress" | "snoozed" | "done" | "dropped";
+    kind: "action" | "watch" | "risk" | "question";
+    id: string;
+    domain: string;
+    title: string;
+    urgency: number;
+    severity: number;
+    evidence: string[];
+    surfacedAt: string;
+    tags: string[];
+    dueBy?: string | undefined;
+    estDurationMin?: number | undefined;
+    calendarSafeTitle?: string | undefined;
+    promotesTo?: string | undefined;
+}>;
+export type Finding = z.infer<typeof FindingSchema>;
+/** Zod schema for an ordered ranked-findings array (calendar input). */
+export declare const FindingArraySchema: z.ZodArray<z.ZodObject<{
+    id: z.ZodString;
+    domain: z.ZodString;
+    title: z.ZodString;
+    kind: z.ZodEnum<["action", "watch", "risk", "question"]>;
+    urgency: z.ZodNumber;
+    severity: z.ZodNumber;
+    evidence: z.ZodArray<z.ZodString, "many">;
+    surfacedAt: z.ZodString;
+    dueBy: z.ZodOptional<z.ZodString>;
+    tags: z.ZodArray<z.ZodString, "many">;
+    estDurationMin: z.ZodOptional<z.ZodNumber>;
+    calendarSafeTitle: z.ZodOptional<z.ZodString>;
+    status: z.ZodEnum<["open", "in-progress", "snoozed", "done", "dropped"]>;
+    promotesTo: z.ZodOptional<z.ZodString>;
+}, "strip", z.ZodTypeAny, {
+    status: "open" | "in-progress" | "snoozed" | "done" | "dropped";
+    kind: "action" | "watch" | "risk" | "question";
+    id: string;
+    domain: string;
+    title: string;
+    urgency: number;
+    severity: number;
+    evidence: string[];
+    surfacedAt: string;
+    tags: string[];
+    dueBy?: string | undefined;
+    estDurationMin?: number | undefined;
+    calendarSafeTitle?: string | undefined;
+    promotesTo?: string | undefined;
+}, {
+    status: "open" | "in-progress" | "snoozed" | "done" | "dropped";
+    kind: "action" | "watch" | "risk" | "question";
+    id: string;
+    domain: string;
+    title: string;
+    urgency: number;
+    severity: number;
+    evidence: string[];
+    surfacedAt: string;
+    tags: string[];
+    dueBy?: string | undefined;
+    estDurationMin?: number | undefined;
+    calendarSafeTitle?: string | undefined;
+    promotesTo?: string | undefined;
+}>, "many">;
+/** A busy (blocked) calendar interval. */
+export interface BusyInterval {
+    startIso: string;
+    endIso: string;
+}
+/** A free (available) calendar interval derived from the window minus busy intervals. */
+export interface FreeInterval {
+    startIso: string;
+    endIso: string;
+}
+/** Working-hours constraint applied when clamping free intervals per-day. */
+export interface WorkingHours {
+    /** Hour of day (0-23) when work begins, UTC. */
+    startHour: number;
+    /** Hour of day (0-23) when work ends, UTC. */
+    endHour: number;
+}
+/** Constraints that bound the planning window passed to planSlots. */
+export interface SlotConstraints {
+    /** ISO-8601 start of the planning window (inclusive). */
+    windowStartIso: string;
+    /** ISO-8601 end of the planning window (exclusive). */
+    windowEndIso: string;
+    /** Optional working-hours clamp (UTC hours). */
+    workingHours?: WorkingHours;
+    /** IANA timezone identifier (informational only; not used in epoch-ms math). */
+    timezone?: string;
+}
+/** A scheduled finding slot in the proposed plan. */
+export interface PlanItem {
+    findingId: string;
+    title: string;
+    startIso: string;
+    endIso: string;
+    /**
+     * Privacy-safe title for cloud connectors (Sprint 3).
+     * Set by the slotter from finding.calendarSafeTitle.
+     * When absent, the Google connector falls back to the generic placeholder
+     * "Focus block" — it NEVER uses the full `title` field for cloud egress.
+     */
+    calendarSafeTitle?: string;
+}
+/**
+ * Closed string-literal union of reasons a finding was not placed.
+ *
+ * "does-not-fit"              — No free slot large enough for estDurationMin exists.
+ * "no-free-slot-before-dueBy" — Free slots exist but all start at or after dueBy.
+ *
+ * Adding a new reason requires updating the exhaustive switch in slotter.ts (ADR-3 gate).
+ */
+export type UnscheduledReason = "does-not-fit" | "no-free-slot-before-dueBy";
+/** The output of planSlots: placed items + unplaced items with reasons. */
+export interface ProposedPlan {
+    scheduled: PlanItem[];
+    unscheduled: Array<{
+        findingId: string;
+        reason: UnscheduledReason;
+    }>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/calendar/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/calendar/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB;;;;;;GAMG;AACH,eAAO,MAAM,aAAa;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAexB,CAAC;AAEH,MAAM,MAAM,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,aAAa,CAAC,CAAC;AAEpD,wEAAwE;AACxE,eAAO,MAAM,kBAAkB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;WAAyB,CAAC;AAIzD,0CAA0C;AAC1C,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,yFAAyF;AACzF,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,6EAA6E;AAC7E,MAAM,WAAW,YAAY;IAC3B,gDAAgD;IAChD,SAAS,EAAE,MAAM,CAAC;IAClB,8CAA8C;IAC9C,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,sEAAsE;AACtE,MAAM,WAAW,eAAe;IAC9B,yDAAyD;IACzD,cAAc,EAAE,MAAM,CAAC;IACvB,uDAAuD;IACvD,YAAY,EAAE,MAAM,CAAC;IACrB,gDAAgD;IAChD,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,gFAAgF;IAChF,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,qDAAqD;AACrD,MAAM,WAAW,QAAQ;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,iBAAiB,GAAG,cAAc,GAAG,2BAA2B,CAAC;AAE7E,2EAA2E;AAC3E,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,WAAW,EAAE,KAAK,CAAC;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,iBAAiB,CAAA;KAAE,CAAC,CAAC;CACtE"}

package/dist/calendar/types.js

@@ -0,0 +1,28 @@
+import { z } from "zod";
+// ── Local Finding schema ──────────────────────────────────────────────
+/**
+ * Local calendar-module copy of the Finding type.
+ * Field names mirror src/hub/finding.ts:10-27 EXACTLY.
+ * Do NOT import from src/hub — this module is a forward dependency on the
+ * priority-hub spec. The hub is a sibling spec; importing it would create a
+ * compile-time coupling that the planner explicitly avoided.
+ */
+export const FindingSchema = z.object({
+    id: z.string().min(1),
+    domain: z.string().min(1),
+    title: z.string().min(1),
+    kind: z.enum(["action", "watch", "risk", "question"]),
+    urgency: z.number().int().min(1).max(5),
+    severity: z.number().int().min(1).max(5),
+    evidence: z.array(z.string()),
+    surfacedAt: z.string().datetime(),
+    dueBy: z.string().datetime().optional(),
+    tags: z.array(z.string()),
+    estDurationMin: z.number().int().optional(),
+    calendarSafeTitle: z.string().optional(),
+    status: z.enum(["open", "in-progress", "snoozed", "done", "dropped"]),
+    promotesTo: z.string().optional(),
+});
+/** Zod schema for an ordered ranked-findings array (calendar input). */
+export const FindingArraySchema = z.array(FindingSchema);
+//# sourceMappingURL=types.js.map

package/dist/calendar/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/calendar/types.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,yEAAyE;AAEzE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC;IACpC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACrB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACxB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IACrD,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IAC7B,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACjC,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,EAAE;IACvC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACzB,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;IAC3C,iBAAiB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;IACxC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACrE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CAClC,CAAC,CAAC;AAIH,wEAAwE;AACxE,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC"}

package/dist/chat/answerer.d.ts

@@ -0,0 +1,17 @@
+import type { LLMClient } from "../providers/types.js";
+import type { TurnRecord } from "./conversation-store.js";
+export declare class Answerer {
+    private readonly llm;
+    private readonly model;
+    constructor(llm: LLMClient, model: string);
+    /**
+     * Produce an answer to the user's input, given context.
+     *
+     * @param input - The current user message.
+     * @param rosterSummary - Compact string summary of active runs.
+     * @param memoryDistill - Compact string of lessons from .bober/memory/.
+     * @param recentHistory - Recent prior turns for conversation context.
+     */
+    answer(input: string, rosterSummary: string, memoryDistill: string, recentHistory: TurnRecord[]): Promise<string>;
+}
+//# sourceMappingURL=answerer.d.ts.map

package/dist/chat/answerer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"answerer.d.ts","sourceRoot":"","sources":["../../src/chat/answerer.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,SAAS,EAAe,MAAM,uBAAuB,CAAC;AACpE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAI1D,qBAAa,QAAQ;IACnB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAChC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;gBAEnB,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM;IAKzC;;;;;;;OAOG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,MAAM,EACrB,aAAa,EAAE,MAAM,EACrB,aAAa,EAAE,UAAU,EAAE,GAC1B,OAAO,CAAC,MAAM,CAAC;CAiCnB"}

package/dist/chat/answerer.js

@@ -0,0 +1,52 @@
+// ── answerer.ts ──────────────────────────────────────────────────────
+//
+// Composes roster summary + memory distill + recent history into one
+// LLMClient.chat call (no jsonObjectMode) and returns the text response.
+// ── Answerer ──────────────────────────────────────────────────────────
+export class Answerer {
+    llm;
+    model;
+    constructor(llm, model) {
+        this.llm = llm;
+        this.model = model;
+    }
+    /**
+     * Produce an answer to the user's input, given context.
+     *
+     * @param input - The current user message.
+     * @param rosterSummary - Compact string summary of active runs.
+     * @param memoryDistill - Compact string of lessons from .bober/memory/.
+     * @param recentHistory - Recent prior turns for conversation context.
+     */
+    async answer(input, rosterSummary, memoryDistill, recentHistory) {
+        const systemParts = [
+            "You are bober, an AI assistant integrated with the agent-bober engineering workflow.",
+            "",
+            "You have access to the following context:",
+            "",
+            "## Active Runs",
+            rosterSummary || "No runs found.",
+            "",
+            "## Project Memory (Lessons Learned)",
+            memoryDistill || "No lessons recorded yet.",
+            "",
+            "Answer the user's question concisely and helpfully.",
+            "If the user asks about runs or agents, use the Active Runs context above.",
+            "If the user asks about past mistakes or learnings, use the Project Memory context.",
+        ];
+        const system = systemParts.join("\n");
+        // Build message history from stored turns + current input
+        const messages = [];
+        for (const turn of recentHistory) {
+            messages.push({ role: turn.role, content: turn.content });
+        }
+        messages.push({ role: "user", content: input });
+        const response = await this.llm.chat({
+            model: this.model,
+            system,
+            messages,
+        });
+        return response.text;
+    }
+}
+//# sourceMappingURL=answerer.js.map

package/dist/chat/answerer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"answerer.js","sourceRoot":"","sources":["../../src/chat/answerer.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,EAAE;AACF,qEAAqE;AACrE,yEAAyE;AAKzE,yEAAyE;AAEzE,MAAM,OAAO,QAAQ;IACF,GAAG,CAAY;IACf,KAAK,CAAS;IAE/B,YAAY,GAAc,EAAE,KAAa;QACvC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,aAAqB,EACrB,aAAqB,EACrB,aAA2B;QAE3B,MAAM,WAAW,GAAa;YAC5B,sFAAsF;YACtF,EAAE;YACF,2CAA2C;YAC3C,EAAE;YACF,gBAAgB;YAChB,aAAa,IAAI,gBAAgB;YACjC,EAAE;YACF,qCAAqC;YACrC,aAAa,IAAI,0BAA0B;YAC3C,EAAE;YACF,qDAAqD;YACrD,2EAA2E;YAC3E,oFAAoF;SACrF,CAAC;QACF,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEtC,0DAA0D;QAC1D,MAAM,QAAQ,GAAkB,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAEhD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YACnC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM;YACN,QAAQ;SACT,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC,IAAI,CAAC;IACvB,CAAC;CACF"}

package/dist/chat/approval-cursor.d.ts

@@ -0,0 +1,25 @@
+import type { PendingMarker } from "../state/approval-state.js";
+/**
+ * Stable identity key for a pending marker.
+ * Changes when a gate is re-requested in a later round (different requestedAt),
+ * but is stable while the gate remains at the same requestedAt.
+ */
+export declare function markerKey(m: PendingMarker): string;
+export declare class ApprovalCursor {
+    private readonly projectRoot;
+    private readonly sessionId;
+    constructor(projectRoot: string, sessionId: string);
+    private path;
+    /**
+     * Read the set of already-announced marker keys.
+     * Returns empty set on missing file or malformed JSON — never throws.
+     */
+    private readFile;
+    /**
+     * Return the subset of markers not yet announced, and atomically record
+     * them as announced for this session. Idempotent: calling again with
+     * the same markers returns [].
+     */
+    filterNew(markers: PendingMarker[]): Promise<PendingMarker[]>;
+}
+//# sourceMappingURL=approval-cursor.d.ts.map

package/dist/chat/approval-cursor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"approval-cursor.d.ts","sourceRoot":"","sources":["../../src/chat/approval-cursor.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAYhE;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAElD;AAID,qBAAa,cAAc;IAEvB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,SAAS;gBADT,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM;IAGpC,OAAO,CAAC,IAAI;IASZ;;;OAGG;YACW,QAAQ;IAQtB;;;;OAIG;IACG,SAAS,CAAC,OAAO,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;CAmBpE"}

package/dist/chat/approval-cursor.js

@@ -0,0 +1,61 @@
+// ── approval-cursor.ts ────────────────────────────────────────────────
+//
+// Tracks which pending markers have already been announced in chat, by
+// key `${checkpointId}@${requestedAt}`. Persists at
+// .bober/chat/<sessionId>.approvals-cursor.json. Mirrors cursor-store.ts.
+import { readFile, writeFile } from "node:fs/promises";
+import { join } from "node:path";
+import { ensureDir } from "../utils/fs.js";
+const EMPTY = { announced: [] };
+// ── Helpers ───────────────────────────────────────────────────────────
+/**
+ * Stable identity key for a pending marker.
+ * Changes when a gate is re-requested in a later round (different requestedAt),
+ * but is stable while the gate remains at the same requestedAt.
+ */
+export function markerKey(m) {
+    return `${m.checkpointId}@${m.requestedAt}`;
+}
+// ── ApprovalCursor ────────────────────────────────────────────────────
+export class ApprovalCursor {
+    projectRoot;
+    sessionId;
+    constructor(projectRoot, sessionId) {
+        this.projectRoot = projectRoot;
+        this.sessionId = sessionId;
+    }
+    path() {
+        return join(this.projectRoot, ".bober", "chat", `${this.sessionId}.approvals-cursor.json`);
+    }
+    /**
+     * Read the set of already-announced marker keys.
+     * Returns empty set on missing file or malformed JSON — never throws.
+     */
+    async readFile() {
+        try {
+            return JSON.parse(await readFile(this.path(), "utf-8"));
+        }
+        catch {
+            return { ...EMPTY };
+        }
+    }
+    /**
+     * Return the subset of markers not yet announced, and atomically record
+     * them as announced for this session. Idempotent: calling again with
+     * the same markers returns [].
+     */
+    async filterNew(markers) {
+        const file = await this.readFile();
+        const seen = new Set(file.announced);
+        const fresh = markers.filter((m) => !seen.has(markerKey(m)));
+        if (fresh.length > 0) {
+            for (const m of fresh) {
+                seen.add(markerKey(m));
+            }
+            await ensureDir(join(this.projectRoot, ".bober", "chat"));
+            await writeFile(this.path(), JSON.stringify({ announced: [...seen] }, null, 2) + "\n", { encoding: "utf-8", mode: 0o600 });
+        }
+        return fresh;
+    }
+}
+//# sourceMappingURL=approval-cursor.js.map

package/dist/chat/approval-cursor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"approval-cursor.js","sourceRoot":"","sources":["../../src/chat/approval-cursor.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,EAAE;AACF,uEAAuE;AACvE,oDAAoD;AACpD,0EAA0E;AAE1E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAS3C,MAAM,KAAK,GAAkB,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;AAE/C,yEAAyE;AAEzE;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,CAAgB;IACxC,OAAO,GAAG,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;AAC9C,CAAC;AAED,yEAAyE;AAEzE,MAAM,OAAO,cAAc;IAEN;IACA;IAFnB,YACmB,WAAmB,EACnB,SAAiB;QADjB,gBAAW,GAAX,WAAW,CAAQ;QACnB,cAAS,GAAT,SAAS,CAAQ;IACjC,CAAC;IAEI,IAAI;QACV,OAAO,IAAI,CACT,IAAI,CAAC,WAAW,EAChB,QAAQ,EACR,MAAM,EACN,GAAG,IAAI,CAAC,SAAS,wBAAwB,CAC1C,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,QAAQ;QACpB,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,OAAO,CAAC,CAAkB,CAAC;QAC3E,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAS,CAAC,OAAwB;QACtC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7D,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;YAC1D,MAAM,SAAS,CACb,IAAI,CAAC,IAAI,EAAE,EACX,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,EACxD,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CACnC,CAAC;QACJ,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/chat/approval-reader.d.ts

@@ -0,0 +1,11 @@
+import type { PendingMarker } from "../state/approval-state.js";
+export declare class ApprovalReader {
+    private readonly projectRoot;
+    constructor(projectRoot: string);
+    /**
+     * Read all pending markers from .bober/approvals/*.pending.json.
+     * Missing dir => []; corrupt files skipped silently (delegated to listPending).
+     */
+    read(): Promise<PendingMarker[]>;
+}
+//# sourceMappingURL=approval-reader.d.ts.map

package/dist/chat/approval-reader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"approval-reader.d.ts","sourceRoot":"","sources":["../../src/chat/approval-reader.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAIhE,qBAAa,cAAc;IACb,OAAO,CAAC,QAAQ,CAAC,WAAW;gBAAX,WAAW,EAAE,MAAM;IAEhD;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;CAGvC"}

package/dist/chat/approval-reader.js

@@ -0,0 +1,20 @@
+// ── approval-reader.ts ────────────────────────────────────────────────
+//
+// Read-only wrapper over listPending for chat context.
+// NEVER writes approval markers (Sprint 3 owns the write path).
+import { listPending } from "../state/approval-state.js";
+// ── ApprovalReader ────────────────────────────────────────────────────
+export class ApprovalReader {
+    projectRoot;
+    constructor(projectRoot) {
+        this.projectRoot = projectRoot;
+    }
+    /**
+     * Read all pending markers from .bober/approvals/*.pending.json.
+     * Missing dir => []; corrupt files skipped silently (delegated to listPending).
+     */
+    async read() {
+        return listPending(this.projectRoot);
+    }
+}
+//# sourceMappingURL=approval-reader.js.map

package/dist/chat/approval-reader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"approval-reader.js","sourceRoot":"","sources":["../../src/chat/approval-reader.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,EAAE;AACF,uDAAuD;AACvD,gEAAgE;AAEhE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAGzD,yEAAyE;AAEzE,MAAM,OAAO,cAAc;IACI;IAA7B,YAA6B,WAAmB;QAAnB,gBAAW,GAAX,WAAW,CAAQ;IAAG,CAAC;IAEpD;;;OAGG;IACH,KAAK,CAAC,IAAI;QACR,OAAO,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC;CACF"}

package/dist/chat/careful-sidecar.d.ts

@@ -0,0 +1,15 @@
+export declare class CarefulSidecar {
+    private readonly projectRoot;
+    private readonly sessionId;
+    constructor(projectRoot: string, sessionId: string);
+    private path;
+    /**
+     * Read the careful flag. Missing/malformed file => false (autopilot). Never throws.
+     */
+    isCareful(): Promise<boolean>;
+    /**
+     * Persist the careful flag atomically.
+     */
+    setCareful(on: boolean): Promise<void>;
+}
+//# sourceMappingURL=careful-sidecar.d.ts.map

package/dist/chat/careful-sidecar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"careful-sidecar.d.ts","sourceRoot":"","sources":["../../src/chat/careful-sidecar.ts"],"names":[],"mappings":"AAYA,qBAAa,cAAc;IAEvB,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,SAAS;gBADT,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM;IAGpC,OAAO,CAAC,IAAI;IAIZ;;OAEG;IACG,SAAS,IAAI,OAAO,CAAC,OAAO,CAAC;IASnC;;OAEG;IACG,UAAU,CAAC,EAAE,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;CAQ7C"}