agent-bober 0.18.0 → 0.19.0

package/dist/calendar/ics-connector.js

@@ -0,0 +1,48 @@
+/** Local-first RFC 5545 (.ics) connector — materializes a plan to disk with ZERO network egress. */
+import { writeFile } from "node:fs/promises";
+import { readBusyIntervalsFromFile } from "./finding-source.js";
+// ── ISO → RFC 5545 UTC basic-format ───────────────────────────────────
+/** "2026-06-29T08:30:00.000Z" → "20260629T083000Z" (deterministic, no locale). */
+function toIcsUtc(iso) {
+    return new Date(iso).toISOString().replace(/[-:]/g, "").replace(/\.\d{3}Z$/, "Z");
+}
+// ── RFC 5545 TEXT escaping (3.3.11) ───────────────────────────────────
+/** Escape backslash FIRST, then newline, comma, semicolon. */
+function escapeText(s) {
+    return s
+        .replace(/\\/g, "\\\\")
+        .replace(/\n/g, "\\n")
+        .replace(/,/g, "\\,")
+        .replace(/;/g, "\\;");
+}
+// ── VEVENT / VCALENDAR serialization ──────────────────────────────────
+const CRLF = "\r\n";
+function serializePlan(items, dtstampIso) {
+    const lines = [
+        "BEGIN:VCALENDAR",
+        "VERSION:2.0",
+        "PRODID:-//agent-bober//calendar-planner//EN",
+    ];
+    const dtstamp = toIcsUtc(dtstampIso);
+    for (const item of items) {
+        lines.push("BEGIN:VEVENT", `UID:${item.findingId}@agent-bober`, `DTSTAMP:${dtstamp}`, `DTSTART:${toIcsUtc(item.startIso)}`, `DTEND:${toIcsUtc(item.endIso)}`, `SUMMARY:${escapeText(item.title)}`, "END:VEVENT");
+    }
+    lines.push("END:VCALENDAR");
+    return lines.join(CRLF) + CRLF; // trailing CRLF per spec
+}
+export function createIcsConnector(opts) {
+    return {
+        name: "ics",
+        async readFreeBusy(_window) {
+            if (opts.freeBusyPath === undefined)
+                return [];
+            return readBusyIntervalsFromFile(opts.freeBusyPath); // node:fs/promises only
+        },
+        async writeEvents(items) {
+            const ics = serializePlan(items, opts.nowIso ?? new Date().toISOString());
+            await writeFile(opts.outPath, ics, "utf-8");
+            return { writtenCount: items.length, target: opts.outPath };
+        },
+    };
+}
+//# sourceMappingURL=ics-connector.js.map

package/dist/calendar/ics-connector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ics-connector.js","sourceRoot":"","sources":["../../src/calendar/ics-connector.ts"],"names":[],"mappings":"AAAA,oGAAoG;AAEpG,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EAAE,yBAAyB,EAAE,MAAM,qBAAqB,CAAC;AAIhE,yEAAyE;AAEzE,kFAAkF;AAClF,SAAS,QAAQ,CAAC,GAAW;IAC3B,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;AACpF,CAAC;AAED,yEAAyE;AAEzE,8DAA8D;AAC9D,SAAS,UAAU,CAAC,CAAS;IAC3B,OAAO,CAAC;SACL,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC;SACtB,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;SACrB,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC;SACpB,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED,yEAAyE;AAEzE,MAAM,IAAI,GAAG,MAAM,CAAC;AAEpB,SAAS,aAAa,CAAC,KAAiB,EAAE,UAAkB;IAC1D,MAAM,KAAK,GAAa;QACtB,iBAAiB;QACjB,aAAa;QACb,6CAA6C;KAC9C,CAAC;IACF,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CACR,cAAc,EACd,OAAO,IAAI,CAAC,SAAS,cAAc,EACnC,WAAW,OAAO,EAAE,EACpB,WAAW,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EACpC,SAAS,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAChC,WAAW,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EACnC,YAAY,CACb,CAAC;IACJ,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,yBAAyB;AAC3D,CAAC;AAaD,MAAM,UAAU,kBAAkB,CAAC,IAAyB;IAC1D,OAAO;QACL,IAAI,EAAE,KAAK;QACX,KAAK,CAAC,YAAY,CAAC,OAAuB;YACxC,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS;gBAAE,OAAO,EAAE,CAAC;YAC/C,OAAO,yBAAyB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,wBAAwB;QAC/E,CAAC;QACD,KAAK,CAAC,WAAW,CAAC,KAAiB;YACjC,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;YAC1E,MAAM,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAC5C,OAAO,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;QAC9D,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/calendar/proposal-gate.d.ts

@@ -0,0 +1,84 @@
+/**
+ * Calendar approval gate — propose (write pending marker, ZERO events) →
+ * approve out-of-band → apply (writeEvents exactly once) → adjust (pure re-slot).
+ *
+ * Reuses src/state/approval-state.ts for marker storage — no new approval mechanism.
+ * checkpointId convention: `calendar-${planId}` mirrors do-bridge's `promote-${findingId}`
+ * so the existing `bober approve calendar-<id>` / `/approve calendar-<id>` flows work
+ * with zero new wiring.
+ *
+ * ALL filesystem writes (pending marker, plan sidecar) live in this module.
+ * src/cli/commands/calendar.ts MUST NOT import writeFile — the Sprint-1 source-scan
+ * test (calendar.test.ts:129-141) enforces this.
+ */
+import type { CalendarConnector } from "./connector.js";
+import type { Finding, BusyInterval, SlotConstraints, ProposedPlan } from "./types.js";
+/** Arguments for proposePlan — all I/O dependencies are injected for testability. */
+export interface ProposeArgs {
+    /** Absolute project root (used for .bober/approvals and .bober/calendar paths). */
+    projectRoot: string;
+    /** Plan id — checkpointId = `calendar-${planId}`. */
+    planId: string;
+    /** The proposed plan from planSlots. */
+    plan: ProposedPlan;
+    /** Name of the chosen connector (informational; stored in sidecar). */
+    connectorName: string;
+    /** Clock injection — returns an ISO string. */
+    now: () => string;
+    /** Timeout in ms before the pending marker expires. Default 24 hours. */
+    timeoutMs?: number;
+}
+export type ApplyOutcome = {
+    status: "applied";
+    writtenCount: number;
+} | {
+    status: "rejected";
+    feedback?: string;
+} | {
+    status: "pending";
+};
+/**
+ * A constraint delta for adjustPlan — models a /tell-style user correction.
+ * Note: SlotConstraints has no `excludeInterval` field; model exclusions by appending
+ * a BusyInterval to the busy[] array (do NOT add new fields to SlotConstraints).
+ */
+export interface ConstraintDelta {
+    /** Appended to busy[] to model an excluded interval. */
+    excludeInterval?: BusyInterval;
+    /** Shift the planning window start. */
+    windowStartIso?: string;
+    /** Shift the planning window end. */
+    windowEndIso?: string;
+}
+/**
+ * Write a pending approval marker + plan sidecar for the proposed schedule.
+ * Calls ZERO connector.writeEvents — approval is strictly out-of-band.
+ *
+ * All filesystem writes live here:
+ *   1. Plan sidecar (.bober/calendar/<id>.plan.json) — holds ProposedPlan + connectorName.
+ *   2. Pending marker (.bober/approvals/<id>.pending.json) — artifact.path → sidecar.
+ */
+export declare function proposePlan(args: ProposeArgs): Promise<{
+    checkpointId: string;
+}>;
+/**
+ * Gate on the approval marker; on approval reload the plan sidecar and call
+ * connector.writeEvents exactly once; on rejection skip the write entirely.
+ *
+ * There is no readApproved/readRejected export from approval-state.ts.
+ * We detect the marker by building the path inline — mirrors the approach in
+ * src/cli/commands/approve.ts:41 and src/do-bridge/promote.ts:140-146.
+ *
+ * Note: deletePending is best-effort (never throws); gate control is based on
+ * the presence of the approved/rejected marker, not on the pending marker.
+ */
+export declare function applyPlan(projectRoot: string, checkpointId: string, connector: CalendarConnector): Promise<ApplyOutcome>;
+/**
+ * PURE re-slot under a constraint delta — models a /tell-style user correction.
+ * Re-runs the Sprint-1 planSlots with a modified busy[] or window; writes NOTHING.
+ *
+ * Model an "exclude interval" by appending a BusyInterval (SlotConstraints has
+ * no excludeInterval field — do NOT add one).
+ */
+export declare function adjustPlan(findings: Finding[], busy: BusyInterval[], constraints: SlotConstraints, delta: ConstraintDelta): ProposedPlan;
+//# sourceMappingURL=proposal-gate.d.ts.map

package/dist/calendar/proposal-gate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"proposal-gate.d.ts","sourceRoot":"","sources":["../../src/calendar/proposal-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAQH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAiBvF,qFAAqF;AACrF,MAAM,WAAW,WAAW;IAC1B,mFAAmF;IACnF,WAAW,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,wCAAwC;IACxC,IAAI,EAAE,YAAY,CAAC;IACnB,uEAAuE;IACvE,aAAa,EAAE,MAAM,CAAC;IACtB,+CAA+C;IAC/C,GAAG,EAAE,MAAM,MAAM,CAAC;IAClB,yEAAyE;IACzE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAID,MAAM,MAAM,YAAY,GACpB;IAAE,MAAM,EAAE,SAAS,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,GAC3C;IAAE,MAAM,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GACzC;IAAE,MAAM,EAAE,SAAS,CAAA;CAAE,CAAC;AAI1B;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,wDAAwD;IACxD,eAAe,CAAC,EAAE,YAAY,CAAC;IAC/B,uCAAuC;IACvC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,qCAAqC;IACrC,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAcD;;;;;;;GAOG;AACH,wBAAsB,WAAW,CAAC,IAAI,EAAE,WAAW,GAAG,OAAO,CAAC;IAAE,YAAY,EAAE,MAAM,CAAA;CAAE,CAAC,CAsCtF;AAID;;;;;;;;;;GAUG;AACH,wBAAsB,SAAS,CAC7B,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,iBAAiB,GAC3B,OAAO,CAAC,YAAY,CAAC,CA8CvB;AAID;;;;;;GAMG;AACH,wBAAgB,UAAU,CACxB,QAAQ,EAAE,OAAO,EAAE,EACnB,IAAI,EAAE,YAAY,EAAE,EACpB,WAAW,EAAE,eAAe,EAC5B,KAAK,EAAE,eAAe,GACrB,YAAY,CAWd"}

package/dist/calendar/proposal-gate.js

@@ -0,0 +1,126 @@
+/**
+ * Calendar approval gate — propose (write pending marker, ZERO events) →
+ * approve out-of-band → apply (writeEvents exactly once) → adjust (pure re-slot).
+ *
+ * Reuses src/state/approval-state.ts for marker storage — no new approval mechanism.
+ * checkpointId convention: `calendar-${planId}` mirrors do-bridge's `promote-${findingId}`
+ * so the existing `bober approve calendar-<id>` / `/approve calendar-<id>` flows work
+ * with zero new wiring.
+ *
+ * ALL filesystem writes (pending marker, plan sidecar) live in this module.
+ * src/cli/commands/calendar.ts MUST NOT import writeFile — the Sprint-1 source-scan
+ * test (calendar.test.ts:129-141) enforces this.
+ */
+import { readFile, writeFile, readdir } from "node:fs/promises";
+import { join } from "node:path";
+import { savePending, deletePending } from "../state/approval-state.js";
+import { ensureDir } from "../state/helpers.js";
+import { planSlots } from "./slotter.js";
+// ── Internal path helpers ─────────────────────────────────────────────
+function planSidecarPath(projectRoot, checkpointId) {
+    return join(projectRoot, ".bober", "calendar", `${checkpointId}.plan.json`);
+}
+function approvalsDirPath(projectRoot) {
+    return join(projectRoot, ".bober", "approvals");
+}
+// ── proposePlan ───────────────────────────────────────────────────────
+/**
+ * Write a pending approval marker + plan sidecar for the proposed schedule.
+ * Calls ZERO connector.writeEvents — approval is strictly out-of-band.
+ *
+ * All filesystem writes live here:
+ *   1. Plan sidecar (.bober/calendar/<id>.plan.json) — holds ProposedPlan + connectorName.
+ *   2. Pending marker (.bober/approvals/<id>.pending.json) — artifact.path → sidecar.
+ */
+export async function proposePlan(args) {
+    const { projectRoot, planId, plan, connectorName, now, timeoutMs = 24 * 60 * 60 * 1_000, } = args;
+    const checkpointId = `calendar-${planId}`;
+    const requestedAt = now();
+    const timeoutAt = new Date(Date.parse(requestedAt) + timeoutMs).toISOString();
+    // ── 1. Write plan sidecar (proposal-gate owns ALL fs writes) ─────────
+    const calendarDir = join(projectRoot, ".bober", "calendar");
+    await ensureDir(calendarDir);
+    const sidecarPath = planSidecarPath(projectRoot, checkpointId);
+    const sidecar = { plan, connectorName };
+    await writeFile(sidecarPath, JSON.stringify(sidecar, null, 2) + "\n", "utf-8");
+    // ── 2. Write the pending marker ───────────────────────────────────────
+    const scheduledCount = plan.scheduled.length;
+    const unscheduledCount = plan.unscheduled.length;
+    await savePending(projectRoot, {
+        checkpointId,
+        artifact: {
+            type: "calendar-plan",
+            path: sidecarPath,
+            summary: `${scheduledCount} event(s) scheduled via ${connectorName}; ${unscheduledCount} unscheduled`,
+            lines: scheduledCount,
+        },
+        prompt: `Calendar plan ready: ${scheduledCount} finding(s) scheduled. Run: bober calendar apply ${checkpointId}`,
+        requestedAt,
+        timeoutAt,
+    });
+    return { checkpointId };
+}
+// ── applyPlan ─────────────────────────────────────────────────────────
+/**
+ * Gate on the approval marker; on approval reload the plan sidecar and call
+ * connector.writeEvents exactly once; on rejection skip the write entirely.
+ *
+ * There is no readApproved/readRejected export from approval-state.ts.
+ * We detect the marker by building the path inline — mirrors the approach in
+ * src/cli/commands/approve.ts:41 and src/do-bridge/promote.ts:140-146.
+ *
+ * Note: deletePending is best-effort (never throws); gate control is based on
+ * the presence of the approved/rejected marker, not on the pending marker.
+ */
+export async function applyPlan(projectRoot, checkpointId, connector) {
+    const approvalsDir = approvalsDirPath(projectRoot);
+    const entries = new Set(await readdir(approvalsDir).catch(() => []));
+    // ── Approved branch: writeEvents exactly once ─────────────────────
+    if (entries.has(`${checkpointId}.approved.json`)) {
+        // Reload the plan sidecar to recover the scheduled PlanItems
+        let sidecar;
+        try {
+            const raw = await readFile(planSidecarPath(projectRoot, checkpointId), "utf-8");
+            sidecar = JSON.parse(raw);
+        }
+        catch (err) {
+            throw new Error(`Failed to reload plan sidecar for ${checkpointId}: ${err instanceof Error ? err.message : String(err)}`, { cause: err });
+        }
+        // Write events EXACTLY once
+        const result = await connector.writeEvents(sidecar.plan.scheduled);
+        // Clean up the pending marker (mirrors promote.ts:141)
+        await deletePending(projectRoot, checkpointId);
+        return { status: "applied", writtenCount: result.writtenCount };
+    }
+    // ── Rejected branch: no write ─────────────────────────────────────
+    if (entries.has(`${checkpointId}.rejected.json`)) {
+        try {
+            const raw = await readFile(join(approvalsDir, `${checkpointId}.rejected.json`), "utf-8");
+            const marker = JSON.parse(raw);
+            return { status: "rejected", feedback: marker.feedback };
+        }
+        catch {
+            return { status: "rejected" };
+        }
+    }
+    // ── Neither: still pending ────────────────────────────────────────
+    return { status: "pending" };
+}
+// ── adjustPlan ────────────────────────────────────────────────────────
+/**
+ * PURE re-slot under a constraint delta — models a /tell-style user correction.
+ * Re-runs the Sprint-1 planSlots with a modified busy[] or window; writes NOTHING.
+ *
+ * Model an "exclude interval" by appending a BusyInterval (SlotConstraints has
+ * no excludeInterval field — do NOT add one).
+ */
+export function adjustPlan(findings, busy, constraints, delta) {
+    const newBusy = delta.excludeInterval !== undefined ? [...busy, delta.excludeInterval] : busy;
+    const newConstraints = {
+        ...constraints,
+        ...(delta.windowStartIso !== undefined ? { windowStartIso: delta.windowStartIso } : {}),
+        ...(delta.windowEndIso !== undefined ? { windowEndIso: delta.windowEndIso } : {}),
+    };
+    return planSlots(findings, newBusy, newConstraints);
+}
+//# sourceMappingURL=proposal-gate.js.map

package/dist/calendar/proposal-gate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"proposal-gate.js","sourceRoot":"","sources":["../../src/calendar/proposal-gate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAChE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AACxE,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AA0DzC,yEAAyE;AAEzE,SAAS,eAAe,CAAC,WAAmB,EAAE,YAAoB;IAChE,OAAO,IAAI,CAAC,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,YAAY,YAAY,CAAC,CAAC;AAC9E,CAAC;AAED,SAAS,gBAAgB,CAAC,WAAmB;IAC3C,OAAO,IAAI,CAAC,WAAW,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;AAClD,CAAC;AAED,yEAAyE;AAEzE;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,IAAiB;IACjD,MAAM,EACJ,WAAW,EACX,MAAM,EACN,IAAI,EACJ,aAAa,EACb,GAAG,EACH,SAAS,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,GACjC,GAAG,IAAI,CAAC;IAET,MAAM,YAAY,GAAG,YAAY,MAAM,EAAE,CAAC;IAC1C,MAAM,WAAW,GAAG,GAAG,EAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;IAE9E,wEAAwE;IACxE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC5D,MAAM,SAAS,CAAC,WAAW,CAAC,CAAC;IAC7B,MAAM,WAAW,GAAG,eAAe,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC/D,MAAM,OAAO,GAAgB,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC;IACrD,MAAM,SAAS,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;IAE/E,yEAAyE;IACzE,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IAC7C,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IACjD,MAAM,WAAW,CAAC,WAAW,EAAE;QAC7B,YAAY;QACZ,QAAQ,EAAE;YACR,IAAI,EAAE,eAAe;YACrB,IAAI,EAAE,WAAW;YACjB,OAAO,EAAE,GAAG,cAAc,2BAA2B,aAAa,KAAK,gBAAgB,cAAc;YACrG,KAAK,EAAE,cAAc;SACtB;QACD,MAAM,EAAE,wBAAwB,cAAc,oDAAoD,YAAY,EAAE;QAChH,WAAW;QACX,SAAS;KACV,CAAC,CAAC;IAEH,OAAO,EAAE,YAAY,EAAE,CAAC;AAC1B,CAAC;AAED,yEAAyE;AAEzE;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,WAAmB,EACnB,YAAoB,EACpB,SAA4B;IAE5B,MAAM,YAAY,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAEnD,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAc,CAAC,CACxD,CAAC;IAEF,qEAAqE;IACrE,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,YAAY,gBAAgB,CAAC,EAAE,CAAC;QACjD,6DAA6D;QAC7D,IAAI,OAAoB,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,WAAW,EAAE,YAAY,CAAC,EAAE,OAAO,CAAC,CAAC;YAChF,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAgB,CAAC;QAC3C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CACb,qCAAqC,YAAY,KAAK,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EACxG,EAAE,KAAK,EAAE,GAAG,EAAE,CACf,CAAC;QACJ,CAAC;QAED,4BAA4B;QAC5B,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAEnE,uDAAuD;QACvD,MAAM,aAAa,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAE/C,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC;IAClE,CAAC;IAED,qEAAqE;IACrE,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,YAAY,gBAAgB,CAAC,EAAE,CAAC;QACjD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CACxB,IAAI,CAAC,YAAY,EAAE,GAAG,YAAY,gBAAgB,CAAC,EACnD,OAAO,CACR,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;YACjD,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;QAChC,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAC/B,CAAC;AAED,yEAAyE;AAEzE;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACxB,QAAmB,EACnB,IAAoB,EACpB,WAA4B,EAC5B,KAAsB;IAEtB,MAAM,OAAO,GACX,KAAK,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAEhF,MAAM,cAAc,GAAoB;QACtC,GAAG,WAAW;QACd,GAAG,CAAC,KAAK,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvF,GAAG,CAAC,KAAK,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAClF,CAAC;IAEF,OAAO,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;AACtD,CAAC"}

package/dist/calendar/slotter.d.ts

@@ -0,0 +1,34 @@
+/**
+ * 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).
+ */
+import type { Finding, BusyInterval, SlotConstraints, ProposedPlan } from "./types.js";
+/**
+ * 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 declare function planSlots(findings: Finding[], busy: BusyInterval[], constraints: SlotConstraints): ProposedPlan;
+//# sourceMappingURL=slotter.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"slotter.d.ts","sourceRoot":"","sources":["../../src/calendar/slotter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EACV,OAAO,EACP,YAAY,EAEZ,eAAe,EACf,YAAY,EAGb,MAAM,YAAY,CAAC;AAgIpB;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CACvB,QAAQ,EAAE,OAAO,EAAE,EACnB,IAAI,EAAE,YAAY,EAAE,EACpB,WAAW,EAAE,eAAe,GAC3B,YAAY,CA8Ed"}

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"}