opensquid 0.5.395

package/dist/runtime/rate_limit.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Pack-declared rate limits — token-bucket with libsql persistence (AUTO.2).
+ *
+ * Authoritative source: `docs/tasks/automation.md` AUTO.2.
+ *
+ * Token-bucket over fixed-window because the trigger sources AUTO.2 feeds
+ * (SCHED.1, AUTO.5, AUTO.6, SCHED.2) are bursty — a save firing 50
+ * file_changed events in 1s then nothing for an hour should be allowed up
+ * to `max` then metered, not denied "for the rest of the window".
+ *
+ * Math: continuous refill, clamped both sides.
+ *   tokens = clamp(tokens + (now - last_refill_ms) * (max / per_ms), 0, max)
+ * High clamp prevents float-creep above `max` over many partial refills;
+ * low clamp guards against any future clock-skew drift below 0.
+ *
+ * Atomicity: explicit `BEGIN IMMEDIATE ... COMMIT` on the primary client
+ * (not `client.transaction()`, which spins a separate logical connection
+ * and starts from an empty `:memory:` db). SQLite's IMMEDIATE lock
+ * serialises concurrent `check()`s at the storage layer — works the same
+ * across daemon restarts (the survival requirement in the spec).
+ *
+ * Fail-closed (constraint C10): any libsql error returns `{allowed: false,
+ * reason: 'rate_limit_storage_error'}` and invokes the caller's `onError`
+ * sink. The limiter never silently allows traffic when storage is broken;
+ * the caller routes the error to the user's notification channel.
+ *
+ * Time-source injection: `now: () => number = Date.now` on the
+ * constructor; every test passes a fake clock.
+ *
+ * Imports from: @libsql/client.
+ * Imported by: src/runtime/bootstrap.ts (wired by SCHED.1 + AUTO.6 later).
+ */
+import type { Client } from '@libsql/client';
+import type { TriggerKind } from '../packs/schemas/skill.js';
+/**
+ * Per-trigger config; matches the `rate_limits:` manifest shape. `max` +
+ * `per` required; `concurrent` defaults to no cap.
+ */
+export interface RateLimitConfig {
+    max: number;
+    per: 'minute' | 'hour' | 'day';
+    concurrent?: number;
+}
+/**
+ * Per-pack config: trigger kind → limit config. Absent key → unlimited
+ * (spec: "Unconfigured packs are unlimited").
+ */
+export type PackRateLimits = Partial<Record<TriggerKind, RateLimitConfig>>;
+export interface RateLimitDecision {
+    allowed: boolean;
+    /** Hint to callers — milliseconds until at least one token will be available. */
+    retryAfterMs?: number;
+    /**
+     * Machine-readable cause when `allowed=false`. One of:
+     *   - 'rate_exceeded'         — token bucket empty
+     *   - 'concurrent_exceeded'   — concurrent counter at cap
+     *   - 'rate_limit_storage_error' — libsql read/write failed (fail-closed)
+     */
+    reason?: 'rate_exceeded' | 'concurrent_exceeded' | 'rate_limit_storage_error';
+}
+export interface RateLimiterOpts {
+    /** Per-pack limits; lookup miss → no limiter applied for that key. */
+    limits: Map<string, PackRateLimits>;
+    /** Injected clock — every test passes a fake `now`. */
+    now?: () => number;
+    /**
+     * Optional storage-error sink. Caller routes to NotificationRouter; the
+     * limiter never imports the channel stack directly (engine-vocabulary
+     * discipline — speaks in pack/trigger/key only).
+     */
+    onError?: (err: unknown, ctx: {
+        packId: string;
+        triggerKind: TriggerKind;
+        key: string;
+    }) => void;
+}
+export declare class RateLimiter {
+    private readonly db;
+    private readonly limits;
+    private readonly nowFn;
+    private readonly onError?;
+    private initialized;
+    constructor(db: Client, opts: RateLimiterOpts);
+    /**
+     * Idempotent schema setup — `CREATE TABLE IF NOT EXISTS at first-use`,
+     * matching the RAG backends. No versioned migration framework in
+     * opensquid yet; idempotent DDL is the locked posture for AUTO.2.
+     */
+    init(): Promise<void>;
+    /**
+     * Request one slot. Allowed → decrement tokens, increment concurrent,
+     * persist atomically. Denied (either cap or libsql error / fail-closed)
+     * → `{allowed: false}` with a machine-readable `reason`.
+     *
+     * Unconfigured (pack, triggerKind) → `{allowed: true}` immediately, no
+     * libsql touch (unlimited default per spec).
+     */
+    check(packId: string, triggerKind: TriggerKind, key: string): Promise<RateLimitDecision>;
+    /**
+     * Free the concurrent slot taken by a prior allowed `check()`. Floors at
+     * 0 — over-releasing never drives the counter negative. Unconfigured
+     * (pack, triggerKind) → no-op. libsql error → invoke `onError` (surface
+     * to operator); fail-closed posture lives on `check()`, not `release()`.
+     */
+    release(packId: string, triggerKind: TriggerKind, key: string): Promise<void>;
+    private readBucket;
+    private writeBucket;
+}
+//# sourceMappingURL=rate_limit.d.ts.map

package/dist/runtime/rate_limit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rate_limit.d.ts","sourceRoot":"","sources":["../../src/runtime/rate_limit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAE7C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAE7D;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,QAAQ,GAAG,MAAM,GAAG,KAAK,CAAC;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC;AAE3E,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,iFAAiF;IACjF,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,eAAe,GAAG,qBAAqB,GAAG,0BAA0B,CAAC;CAC/E;AAcD,MAAM,WAAW,eAAe;IAC9B,sEAAsE;IACtE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACpC,uDAAuD;IACvD,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;IACnB;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,WAAW,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,KAAK,IAAI,CAAC;CAClG;AAcD,qBAAa,WAAW;IAOpB,OAAO,CAAC,QAAQ,CAAC,EAAE;IANrB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA8B;IACrD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAe;IACrC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAA6B;IACtD,OAAO,CAAC,WAAW,CAAS;gBAGT,EAAE,EAAE,MAAM,EAC3B,IAAI,EAAE,eAAe;IAOvB;;;;OAIG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAM3B;;;;;;;OAOG;IACG,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAkE9F;;;;;OAKG;IACG,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;YA4CrE,UAAU;YAoBV,WAAW;CAmB1B"}

package/dist/runtime/rate_limit.js

@@ -0,0 +1,222 @@
+/**
+ * Pack-declared rate limits — token-bucket with libsql persistence (AUTO.2).
+ *
+ * Authoritative source: `docs/tasks/automation.md` AUTO.2.
+ *
+ * Token-bucket over fixed-window because the trigger sources AUTO.2 feeds
+ * (SCHED.1, AUTO.5, AUTO.6, SCHED.2) are bursty — a save firing 50
+ * file_changed events in 1s then nothing for an hour should be allowed up
+ * to `max` then metered, not denied "for the rest of the window".
+ *
+ * Math: continuous refill, clamped both sides.
+ *   tokens = clamp(tokens + (now - last_refill_ms) * (max / per_ms), 0, max)
+ * High clamp prevents float-creep above `max` over many partial refills;
+ * low clamp guards against any future clock-skew drift below 0.
+ *
+ * Atomicity: explicit `BEGIN IMMEDIATE ... COMMIT` on the primary client
+ * (not `client.transaction()`, which spins a separate logical connection
+ * and starts from an empty `:memory:` db). SQLite's IMMEDIATE lock
+ * serialises concurrent `check()`s at the storage layer — works the same
+ * across daemon restarts (the survival requirement in the spec).
+ *
+ * Fail-closed (constraint C10): any libsql error returns `{allowed: false,
+ * reason: 'rate_limit_storage_error'}` and invokes the caller's `onError`
+ * sink. The limiter never silently allows traffic when storage is broken;
+ * the caller routes the error to the user's notification channel.
+ *
+ * Time-source injection: `now: () => number = Date.now` on the
+ * constructor; every test passes a fake clock.
+ *
+ * Imports from: @libsql/client.
+ * Imported by: src/runtime/bootstrap.ts (wired by SCHED.1 + AUTO.6 later).
+ */
+const PER_TO_MS = {
+    minute: 60_000,
+    hour: 3_600_000,
+    day: 86_400_000,
+};
+const CREATE_TABLE_SQL = `
+  CREATE TABLE IF NOT EXISTS rate_limit_buckets (
+    pack_id TEXT NOT NULL,
+    trigger_kind TEXT NOT NULL,
+    key TEXT NOT NULL,
+    tokens REAL NOT NULL,
+    last_refill_ms INTEGER NOT NULL,
+    concurrent_count INTEGER NOT NULL DEFAULT 0,
+    PRIMARY KEY (pack_id, trigger_kind, key)
+  );
+`;
+export class RateLimiter {
+    db;
+    limits;
+    nowFn;
+    onError;
+    initialized = false;
+    constructor(db, opts) {
+        this.db = db;
+        this.limits = opts.limits;
+        this.nowFn = opts.now ?? Date.now;
+        this.onError = opts.onError;
+    }
+    /**
+     * Idempotent schema setup — `CREATE TABLE IF NOT EXISTS at first-use`,
+     * matching the RAG backends. No versioned migration framework in
+     * opensquid yet; idempotent DDL is the locked posture for AUTO.2.
+     */
+    async init() {
+        if (this.initialized)
+            return;
+        await this.db.execute(CREATE_TABLE_SQL);
+        this.initialized = true;
+    }
+    /**
+     * Request one slot. Allowed → decrement tokens, increment concurrent,
+     * persist atomically. Denied (either cap or libsql error / fail-closed)
+     * → `{allowed: false}` with a machine-readable `reason`.
+     *
+     * Unconfigured (pack, triggerKind) → `{allowed: true}` immediately, no
+     * libsql touch (unlimited default per spec).
+     */
+    async check(packId, triggerKind, key) {
+        const config = this.limits.get(packId)?.[triggerKind];
+        if (!config)
+            return { allowed: true };
+        await this.init();
+        const now = this.nowFn();
+        const perMs = PER_TO_MS[config.per];
+        const refillPerMs = config.max / perMs;
+        const concurrentCap = config.concurrent ?? Number.POSITIVE_INFINITY;
+        let inTx = false;
+        try {
+            await this.db.execute('BEGIN IMMEDIATE');
+            inTx = true;
+            const row = await this.readBucket(packId, triggerKind, key);
+            // Refill: continuous, clamped to [0, max].
+            const baseTokens = row?.tokens ?? config.max;
+            const baseLastRefillMs = row?.last_refill_ms ?? now;
+            const elapsed = Math.max(0, now - baseLastRefillMs);
+            const refilled = clamp(baseTokens + elapsed * refillPerMs, 0, config.max);
+            const concurrent = row?.concurrent_count ?? 0;
+            if (concurrent >= concurrentCap) {
+                // Persist refill so a later check() after release() sees fresh
+                // tokens, but do NOT decrement / increment.
+                await this.writeBucket(packId, triggerKind, key, refilled, now, concurrent);
+                await this.db.execute('COMMIT');
+                inTx = false;
+                return {
+                    allowed: false,
+                    retryAfterMs: 0, // freed by release(), not by clock
+                    reason: 'concurrent_exceeded',
+                };
+            }
+            if (refilled < 1) {
+                const tokensShort = 1 - refilled;
+                const retryAfterMs = Math.ceil(tokensShort / refillPerMs);
+                await this.writeBucket(packId, triggerKind, key, refilled, now, concurrent);
+                await this.db.execute('COMMIT');
+                inTx = false;
+                return {
+                    allowed: false,
+                    retryAfterMs,
+                    reason: 'rate_exceeded',
+                };
+            }
+            await this.writeBucket(packId, triggerKind, key, refilled - 1, now, concurrent + 1);
+            await this.db.execute('COMMIT');
+            inTx = false;
+            return { allowed: true };
+        }
+        catch (err) {
+            if (inTx) {
+                try {
+                    await this.db.execute('ROLLBACK');
+                }
+                catch {
+                    /* ignore */
+                }
+            }
+            this.onError?.(err, { packId, triggerKind, key });
+            return { allowed: false, reason: 'rate_limit_storage_error' };
+        }
+    }
+    /**
+     * Free the concurrent slot taken by a prior allowed `check()`. Floors at
+     * 0 — over-releasing never drives the counter negative. Unconfigured
+     * (pack, triggerKind) → no-op. libsql error → invoke `onError` (surface
+     * to operator); fail-closed posture lives on `check()`, not `release()`.
+     */
+    async release(packId, triggerKind, key) {
+        const config = this.limits.get(packId)?.[triggerKind];
+        if (!config)
+            return;
+        await this.init();
+        let inTx = false;
+        try {
+            await this.db.execute('BEGIN IMMEDIATE');
+            inTx = true;
+            const row = await this.readBucket(packId, triggerKind, key);
+            if (!row) {
+                // No bucket row → nothing to release. Don't manufacture one.
+                await this.db.execute('COMMIT');
+                inTx = false;
+                return;
+            }
+            const nextConcurrent = Math.max(0, row.concurrent_count - 1);
+            // last_refill_ms intentionally NOT advanced — release() is a
+            // counter-only operation; advancing would shift the refill window.
+            await this.writeBucket(packId, triggerKind, key, row.tokens, row.last_refill_ms, nextConcurrent);
+            await this.db.execute('COMMIT');
+            inTx = false;
+        }
+        catch (err) {
+            if (inTx) {
+                try {
+                    await this.db.execute('ROLLBACK');
+                }
+                catch {
+                    /* ignore */
+                }
+            }
+            this.onError?.(err, { packId, triggerKind, key });
+        }
+    }
+    // Storage helpers — private so the only contract is check / release.
+    async readBucket(packId, triggerKind, key) {
+        const rs = await this.db.execute({
+            sql: `SELECT tokens, last_refill_ms, concurrent_count
+            FROM rate_limit_buckets
+            WHERE pack_id = ? AND trigger_kind = ? AND key = ?`,
+            args: [packId, triggerKind, key],
+        });
+        const row = rs.rows[0];
+        if (!row)
+            return null;
+        return {
+            tokens: Number(row.tokens),
+            last_refill_ms: Number(row.last_refill_ms),
+            concurrent_count: Number(row.concurrent_count),
+        };
+    }
+    async writeBucket(packId, triggerKind, key, tokens, lastRefillMs, concurrent) {
+        await this.db.execute({
+            sql: `INSERT INTO rate_limit_buckets
+              (pack_id, trigger_kind, key, tokens, last_refill_ms, concurrent_count)
+            VALUES (?, ?, ?, ?, ?, ?)
+            ON CONFLICT (pack_id, trigger_kind, key) DO UPDATE SET
+              tokens = excluded.tokens,
+              last_refill_ms = excluded.last_refill_ms,
+              concurrent_count = excluded.concurrent_count`,
+            args: [packId, triggerKind, key, tokens, lastRefillMs, concurrent],
+        });
+    }
+}
+function clamp(value, lo, hi) {
+    if (Number.isNaN(value))
+        return lo;
+    if (value < lo)
+        return lo;
+    if (value > hi)
+        return hi;
+    return value;
+}
+//# sourceMappingURL=rate_limit.js.map

package/dist/runtime/rate_limit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rate_limit.js","sourceRoot":"","sources":["../../src/runtime/rate_limit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAmCH,MAAM,SAAS,GAA2C;IACxD,MAAM,EAAE,MAAM;IACd,IAAI,EAAE,SAAS;IACf,GAAG,EAAE,UAAU;CAChB,CAAC;AAqBF,MAAM,gBAAgB,GAAG;;;;;;;;;;CAUxB,CAAC;AAEF,MAAM,OAAO,WAAW;IAOH;IANF,MAAM,CAA8B;IACpC,KAAK,CAAe;IACpB,OAAO,CAA8B;IAC9C,WAAW,GAAG,KAAK,CAAC;IAE5B,YACmB,EAAU,EAC3B,IAAqB;QADJ,OAAE,GAAF,EAAE,CAAQ;QAG3B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAC7B,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QACxC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,KAAK,CAAC,MAAc,EAAE,WAAwB,EAAE,GAAW;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAEtC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC;QACvC,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,iBAAiB,CAAC;QAEpE,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;YACzC,IAAI,GAAG,IAAI,CAAC;YACZ,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;YAE5D,2CAA2C;YAC3C,MAAM,UAAU,GAAG,GAAG,EAAE,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC;YAC7C,MAAM,gBAAgB,GAAG,GAAG,EAAE,cAAc,IAAI,GAAG,CAAC;YACpD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,gBAAgB,CAAC,CAAC;YACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,UAAU,GAAG,OAAO,GAAG,WAAW,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YAC1E,MAAM,UAAU,GAAG,GAAG,EAAE,gBAAgB,IAAI,CAAC,CAAC;YAE9C,IAAI,UAAU,IAAI,aAAa,EAAE,CAAC;gBAChC,+DAA+D;gBAC/D,4CAA4C;gBAC5C,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;gBAC5E,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAChC,IAAI,GAAG,KAAK,CAAC;gBACb,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,YAAY,EAAE,CAAC,EAAE,mCAAmC;oBACpD,MAAM,EAAE,qBAAqB;iBAC9B,CAAC;YACJ,CAAC;YAED,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,CAAC;gBACjC,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;gBAC1D,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;gBAC5E,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAChC,IAAI,GAAG,KAAK,CAAC;gBACb,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,YAAY;oBACZ,MAAM,EAAE,eAAe;iBACxB,CAAC;YACJ,CAAC;YAED,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;YACpF,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,GAAG,KAAK,CAAC;YACb,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC3B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACpC,CAAC;gBAAC,MAAM,CAAC;oBACP,YAAY;gBACd,CAAC;YACH,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;YAClD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,0BAA0B,EAAE,CAAC;QAChE,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO,CAAC,MAAc,EAAE,WAAwB,EAAE,GAAW;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM;YAAE,OAAO;QAEpB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;YACzC,IAAI,GAAG,IAAI,CAAC;YACZ,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;YAC5D,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,6DAA6D;gBAC7D,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAChC,IAAI,GAAG,KAAK,CAAC;gBACb,OAAO;YACT,CAAC;YACD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC;YAC7D,6DAA6D;YAC7D,mEAAmE;YACnE,MAAM,IAAI,CAAC,WAAW,CACpB,MAAM,EACN,WAAW,EACX,GAAG,EACH,GAAG,CAAC,MAAM,EACV,GAAG,CAAC,cAAc,EAClB,cAAc,CACf,CAAC;YACF,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,GAAG,KAAK,CAAC;QACf,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACpC,CAAC;gBAAC,MAAM,CAAC;oBACP,YAAY;gBACd,CAAC;YACH,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,qEAAqE;IAE7D,KAAK,CAAC,UAAU,CACtB,MAAc,EACd,WAAwB,EACxB,GAAW;QAEX,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;YAC/B,GAAG,EAAE;;+DAEoD;YACzD,IAAI,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,CAAC;SACjC,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QACtB,OAAO;YACL,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;YAC1B,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC;YAC1C,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC;SAC/C,CAAC;IACJ,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,MAAc,EACd,WAAwB,EACxB,GAAW,EACX,MAAc,EACd,YAAoB,EACpB,UAAkB;QAElB,MAAM,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;YACpB,GAAG,EAAE;;;;;;2DAMgD;YACrD,IAAI,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,CAAC;SACnE,CAAC,CAAC;IACL,CAAC;CACF;AAED,SAAS,KAAK,CAAC,KAAa,EAAE,EAAU,EAAE,EAAU;IAClD,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACnC,IAAI,KAAK,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAC1B,IAAI,KAAK,GAAG,EAAE;QAAE,OAAO,EAAE,CAAC;IAC1B,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/runtime/result.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Result<T, E> utility type — pre-throw-free error pattern.
+ *
+ * The function library returns `Result<T, FunctionError>` so the evaluator
+ * (Task 1.3) can short-circuit cleanly on `ok: false` without try/catch
+ * sprinkled through the interpreter loop. Throws are reserved for programmer
+ * errors at startup (e.g. duplicate registration); recoverable runtime
+ * failures travel as `Err` values through the same return channel.
+ *
+ * Convention: a primitive that doesn't bind a value returns `ok(undefined)`.
+ * The discriminant `ok: true | false` lets callers narrow without casts.
+ *
+ * Imported by: src/functions/registry.ts and every downstream primitive.
+ */
+export interface Ok<T> {
+    ok: true;
+    value: T;
+}
+export interface Err<E> {
+    ok: false;
+    error: E;
+}
+export type Result<T, E = Error> = Ok<T> | Err<E>;
+export declare const ok: <T>(value: T) => Ok<T>;
+export declare const err: <E>(error: E) => Err<E>;
+//# sourceMappingURL=result.d.ts.map

package/dist/runtime/result.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.d.ts","sourceRoot":"","sources":["../../src/runtime/result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,MAAM,WAAW,EAAE,CAAC,CAAC;IACnB,EAAE,EAAE,IAAI,CAAC;IACT,KAAK,EAAE,CAAC,CAAC;CACV;AACD,MAAM,WAAW,GAAG,CAAC,CAAC;IACpB,EAAE,EAAE,KAAK,CAAC;IACV,KAAK,EAAE,CAAC,CAAC;CACV;AACD,MAAM,MAAM,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAElD,eAAO,MAAM,EAAE,GAAI,CAAC,EAAE,OAAO,CAAC,KAAG,EAAE,CAAC,CAAC,CAA0B,CAAC;AAChE,eAAO,MAAM,GAAG,GAAI,CAAC,EAAE,OAAO,CAAC,KAAG,GAAG,CAAC,CAAC,CAA2B,CAAC"}

package/dist/runtime/result.js

@@ -0,0 +1,17 @@
+/**
+ * Result<T, E> utility type — pre-throw-free error pattern.
+ *
+ * The function library returns `Result<T, FunctionError>` so the evaluator
+ * (Task 1.3) can short-circuit cleanly on `ok: false` without try/catch
+ * sprinkled through the interpreter loop. Throws are reserved for programmer
+ * errors at startup (e.g. duplicate registration); recoverable runtime
+ * failures travel as `Err` values through the same return channel.
+ *
+ * Convention: a primitive that doesn't bind a value returns `ok(undefined)`.
+ * The discriminant `ok: true | false` lets callers narrow without casts.
+ *
+ * Imported by: src/functions/registry.ts and every downstream primitive.
+ */
+export const ok = (value) => ({ ok: true, value });
+export const err = (error) => ({ ok: false, error });
+//# sourceMappingURL=result.js.map

package/dist/runtime/result.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.js","sourceRoot":"","sources":["../../src/runtime/result.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAYH,MAAM,CAAC,MAAM,EAAE,GAAG,CAAI,KAAQ,EAAS,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;AAChE,MAAM,CAAC,MAAM,GAAG,GAAG,CAAI,KAAQ,EAAU,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC"}

package/dist/runtime/satisfaction_probe.d.ts

@@ -0,0 +1,80 @@
+/**
+ * CMP.2 — satisfaction probe (async, task-group-gated).
+ *
+ * Authoritative spec: `docs/tasks/T-compression.md` CMP.2 + the
+ * pre-research D1 (`docs/research/T-compression-pre-research-2026-05-27.md`).
+ *
+ * The locked design ([[project_memory_architecture_dual_surface_sync]]):
+ * long-term memory compression is GATED by a user-satisfaction probe.
+ * After a GROUP OF TASKS completes (a track/feature group), we want to
+ * ask the user "satisfied with <group>?" — and their answer gates
+ * whether the compression orchestrator (CMP.4) is allowed to consolidate
+ * + delete that group's predecessor memories.
+ *
+ * D1 — LOCKED: the probe is ASYNC. It is NEVER a synchronous, blocking
+ * user prompt mid-flow (that would be the d9-guard false-stop class +
+ * would interrupt automation). Instead we APPEND a probe row to a
+ * per-session JSONL buffer; the user answers at a natural boundary, and
+ * `recordAnswer` writes the answer back. `readSatisfaction` exposes the
+ * ANSWERED probes to the orchestrator. Same automation-buffer pattern as
+ * `store_lesson.ts` / the wedge capture buffer.
+ *
+ * Dedup: at most ONE open (unanswered) probe per group at a time — a
+ * second `emitProbe` for a group that already has an open probe is a
+ * no-op, so a re-firing trigger doesn't pile up duplicate questions.
+ *
+ * Null-safety: an absent or malformed buffer yields `[]` (never throws)
+ * — the orchestrator treats "no answered probe" as "not satisfied →
+ * compress nothing", which is the fail-closed default.
+ *
+ * Storage: `~/.opensquid/sessions/<sessionId>/satisfaction-probe.jsonl`
+ * (OPENSQUID_HOME-overridable so tests isolate to a mkdtemp).
+ *
+ * Imports from: node:fs/promises, node:path, ./paths.js.
+ * Imported by: src/runtime/hooks/session-end.ts (emit trigger);
+ *   src/runtime/compression_orchestrator.ts (read path, CMP.4).
+ */
+/**
+ * One probe row. `emitted_at` set on emit; the answer fields
+ * (`satisfied` + optional `confidence` + `answered_at`) are absent until
+ * the user responds. The buffer is append-only — an answer is a NEW row
+ * for the same group (the latest answered row wins per group), so we
+ * never rewrite history (the locked anti-drift discipline).
+ */
+export interface SatisfactionProbe {
+    group: string;
+    emitted_at: string;
+    satisfied?: boolean;
+    confidence?: number;
+    answered_at?: string;
+}
+/** Buffer path. OPENSQUID_HOME-aware so tests isolate to mkdtemp. */
+export declare function probeBufferPath(sessionId: string): string;
+/**
+ * Derive the feature "group" key from an active task. A track-style
+ * task id (`"CMP.4"`) groups by its track prefix (`"CMP"`) so all tasks
+ * in a track share ONE probe — the locked design's "after a group of
+ * features completes". Falls back to the bare task id, then the subject.
+ * Returns `null` when nothing usable is present.
+ */
+export declare function groupFromTask(task: {
+    taskId?: string;
+    id?: string;
+    subject?: string;
+} | null | undefined): string | null;
+/**
+ * Emit a probe for `group` — appends an unanswered row UNLESS one is
+ * already open for the group (dedup). Async + append-only; never blocks.
+ */
+export declare function emitProbe(sessionId: string, group: string, nowIso?: () => string): Promise<void>;
+/**
+ * Record the user's answer for `group` — appends an answered row.
+ * No-op if there is no open probe for the group (nothing to answer).
+ */
+export declare function recordAnswer(sessionId: string, group: string, satisfied: boolean, confidence?: number, nowIso?: () => string): Promise<void>;
+/**
+ * Answered probes only, latest answer per group — what the orchestrator
+ * (CMP.4) reads. `[]` on absent/malformed buffer (fail-closed).
+ */
+export declare function readSatisfaction(sessionId: string): Promise<SatisfactionProbe[]>;
+//# sourceMappingURL=satisfaction_probe.d.ts.map

package/dist/runtime/satisfaction_probe.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"satisfaction_probe.d.ts","sourceRoot":"","sources":["../../src/runtime/satisfaction_probe.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAOH;;;;;;GAMG;AACH,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,qEAAqE;AACrE,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEzD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,GAC1E,MAAM,GAAG,IAAI,CAYf;AAwDD;;;GAGG;AACH,wBAAsB,SAAS,CAC7B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,MAAM,GAAE,MAAM,MAAuC,GACpD,OAAO,CAAC,IAAI,CAAC,CAKf;AAED;;;GAGG;AACH,wBAAsB,YAAY,CAChC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO,EAClB,UAAU,CAAC,EAAE,MAAM,EACnB,MAAM,GAAE,MAAM,MAAuC,GACpD,OAAO,CAAC,IAAI,CAAC,CAWf;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAQtF"}

package/dist/runtime/satisfaction_probe.js

@@ -0,0 +1,165 @@
+/**
+ * CMP.2 — satisfaction probe (async, task-group-gated).
+ *
+ * Authoritative spec: `docs/tasks/T-compression.md` CMP.2 + the
+ * pre-research D1 (`docs/research/T-compression-pre-research-2026-05-27.md`).
+ *
+ * The locked design ([[project_memory_architecture_dual_surface_sync]]):
+ * long-term memory compression is GATED by a user-satisfaction probe.
+ * After a GROUP OF TASKS completes (a track/feature group), we want to
+ * ask the user "satisfied with <group>?" — and their answer gates
+ * whether the compression orchestrator (CMP.4) is allowed to consolidate
+ * + delete that group's predecessor memories.
+ *
+ * D1 — LOCKED: the probe is ASYNC. It is NEVER a synchronous, blocking
+ * user prompt mid-flow (that would be the d9-guard false-stop class +
+ * would interrupt automation). Instead we APPEND a probe row to a
+ * per-session JSONL buffer; the user answers at a natural boundary, and
+ * `recordAnswer` writes the answer back. `readSatisfaction` exposes the
+ * ANSWERED probes to the orchestrator. Same automation-buffer pattern as
+ * `store_lesson.ts` / the wedge capture buffer.
+ *
+ * Dedup: at most ONE open (unanswered) probe per group at a time — a
+ * second `emitProbe` for a group that already has an open probe is a
+ * no-op, so a re-firing trigger doesn't pile up duplicate questions.
+ *
+ * Null-safety: an absent or malformed buffer yields `[]` (never throws)
+ * — the orchestrator treats "no answered probe" as "not satisfied →
+ * compress nothing", which is the fail-closed default.
+ *
+ * Storage: `~/.opensquid/sessions/<sessionId>/satisfaction-probe.jsonl`
+ * (OPENSQUID_HOME-overridable so tests isolate to a mkdtemp).
+ *
+ * Imports from: node:fs/promises, node:path, ./paths.js.
+ * Imported by: src/runtime/hooks/session-end.ts (emit trigger);
+ *   src/runtime/compression_orchestrator.ts (read path, CMP.4).
+ */
+import { appendFile, mkdir, readFile } from 'node:fs/promises';
+import { dirname, join } from 'node:path';
+import { OPENSQUID_HOME } from './paths.js';
+/** Buffer path. OPENSQUID_HOME-aware so tests isolate to mkdtemp. */
+export function probeBufferPath(sessionId) {
+    return join(OPENSQUID_HOME(), 'sessions', sessionId, 'satisfaction-probe.jsonl');
+}
+/**
+ * Derive the feature "group" key from an active task. A track-style
+ * task id (`"CMP.4"`) groups by its track prefix (`"CMP"`) so all tasks
+ * in a track share ONE probe — the locked design's "after a group of
+ * features completes". Falls back to the bare task id, then the subject.
+ * Returns `null` when nothing usable is present.
+ */
+export function groupFromTask(task) {
+    if (!task)
+        return null;
+    const tid = task.taskId?.trim();
+    if (tid) {
+        const dot = tid.indexOf('.');
+        return dot > 0 ? tid.slice(0, dot) : tid;
+    }
+    const subject = task.subject?.trim();
+    if (subject)
+        return subject;
+    const id = task.id?.trim();
+    if (id)
+        return id;
+    return null;
+}
+/** Parse the buffer into rows; `[]` on absent/malformed (no throw). */
+async function readRows(sessionId) {
+    let raw;
+    try {
+        raw = await readFile(probeBufferPath(sessionId), 'utf8');
+    }
+    catch {
+        return [];
+    }
+    const rows = [];
+    for (const line of raw.split('\n')) {
+        const trimmed = line.trim();
+        if (!trimmed)
+            continue;
+        try {
+            const parsed = JSON.parse(trimmed);
+            if (typeof parsed === 'object' &&
+                parsed !== null &&
+                typeof parsed.group === 'string' &&
+                typeof parsed.emitted_at === 'string') {
+                const o = parsed;
+                rows.push({
+                    group: o.group,
+                    emitted_at: o.emitted_at,
+                    ...(typeof o.satisfied === 'boolean' ? { satisfied: o.satisfied } : {}),
+                    ...(typeof o.confidence === 'number' ? { confidence: o.confidence } : {}),
+                    ...(typeof o.answered_at === 'string' ? { answered_at: o.answered_at } : {}),
+                });
+            }
+        }
+        catch {
+            // Skip a single malformed line rather than failing the whole read.
+        }
+    }
+    return rows;
+}
+async function appendRow(sessionId, row) {
+    const path = probeBufferPath(sessionId);
+    await mkdir(dirname(path), { recursive: true });
+    await appendFile(path, JSON.stringify(row) + '\n', 'utf8');
+}
+/** A probe for `group` is "open" if it was emitted and not yet answered. */
+function hasOpenProbe(rows, group) {
+    // An answer for a group closes it; track the latest state per group.
+    let open = false;
+    for (const r of rows) {
+        if (r.group !== group)
+            continue;
+        if (r.answered_at !== undefined)
+            open = false;
+        else
+            open = true;
+    }
+    return open;
+}
+/**
+ * Emit a probe for `group` — appends an unanswered row UNLESS one is
+ * already open for the group (dedup). Async + append-only; never blocks.
+ */
+export async function emitProbe(sessionId, group, nowIso = () => new Date().toISOString()) {
+    if (!group.trim())
+        return;
+    const rows = await readRows(sessionId);
+    if (hasOpenProbe(rows, group))
+        return; // dedup: one open probe per group
+    await appendRow(sessionId, { group, emitted_at: nowIso() });
+}
+/**
+ * Record the user's answer for `group` — appends an answered row.
+ * No-op if there is no open probe for the group (nothing to answer).
+ */
+export async function recordAnswer(sessionId, group, satisfied, confidence, nowIso = () => new Date().toISOString()) {
+    const rows = await readRows(sessionId);
+    const open = rows.find((r) => r.group === group && r.answered_at === undefined);
+    if (!open)
+        return;
+    await appendRow(sessionId, {
+        group,
+        emitted_at: open.emitted_at,
+        satisfied,
+        ...(confidence !== undefined ? { confidence } : {}),
+        answered_at: nowIso(),
+    });
+}
+/**
+ * Answered probes only, latest answer per group — what the orchestrator
+ * (CMP.4) reads. `[]` on absent/malformed buffer (fail-closed).
+ */
+export async function readSatisfaction(sessionId) {
+    const rows = await readRows(sessionId);
+    const latest = new Map();
+    for (const r of rows) {
+        if (r.answered_at === undefined)
+            continue;
+        latest.set(r.group, r); // later rows overwrite → latest answer wins
+    }
+    return [...latest.values()];
+}
+//# sourceMappingURL=satisfaction_probe.js.map

package/dist/runtime/satisfaction_probe.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"satisfaction_probe.js","sourceRoot":"","sources":["../../src/runtime/satisfaction_probe.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAE1C,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAiB5C,qEAAqE;AACrE,MAAM,UAAU,eAAe,CAAC,SAAiB;IAC/C,OAAO,IAAI,CAAC,cAAc,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,0BAA0B,CAAC,CAAC;AACnF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,IAA2E;IAE3E,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC;IAChC,IAAI,GAAG,EAAE,CAAC;QACR,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC3C,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC;IACrC,IAAI,OAAO;QAAE,OAAO,OAAO,CAAC;IAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;IAC3B,IAAI,EAAE;QAAE,OAAO,EAAE,CAAC;IAClB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uEAAuE;AACvE,KAAK,UAAU,QAAQ,CAAC,SAAiB;IACvC,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,QAAQ,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,IAAI,GAAwB,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO;YAAE,SAAS;QACvB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAY,CAAC;YAC9C,IACE,OAAO,MAAM,KAAK,QAAQ;gBAC1B,MAAM,KAAK,IAAI;gBACf,OAAQ,MAA6B,CAAC,KAAK,KAAK,QAAQ;gBACxD,OAAQ,MAAkC,CAAC,UAAU,KAAK,QAAQ,EAClE,CAAC;gBACD,MAAM,CAAC,GAAG,MAAiC,CAAC;gBAC5C,IAAI,CAAC,IAAI,CAAC;oBACR,KAAK,EAAE,CAAC,CAAC,KAAe;oBACxB,UAAU,EAAE,CAAC,CAAC,UAAoB;oBAClC,GAAG,CAAC,OAAO,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvE,GAAG,CAAC,OAAO,CAAC,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzE,GAAG,CAAC,OAAO,CAAC,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;iBAC7E,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,mEAAmE;QACrE,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,KAAK,UAAU,SAAS,CAAC,SAAiB,EAAE,GAAsB;IAChE,MAAM,IAAI,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;IACxC,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAChD,MAAM,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC;AAC7D,CAAC;AAED,4EAA4E;AAC5E,SAAS,YAAY,CAAC,IAAyB,EAAE,KAAa;IAC5D,qEAAqE;IACrE,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK;YAAE,SAAS;QAChC,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS;YAAE,IAAI,GAAG,KAAK,CAAC;;YACzC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,SAAiB,EACjB,KAAa,EACb,SAAuB,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAErD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;QAAE,OAAO;IAC1B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,kCAAkC;IACzE,MAAM,SAAS,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;AAC9D,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,SAAiB,EACjB,KAAa,EACb,SAAkB,EAClB,UAAmB,EACnB,SAAuB,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;IAErD,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;IAChF,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,MAAM,SAAS,CAAC,SAAS,EAAE;QACzB,KAAK;QACL,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,SAAS;QACT,GAAG,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnD,WAAW,EAAE,MAAM,EAAE;KACtB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,SAAiB;IACtD,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,WAAW,KAAK,SAAS;YAAE,SAAS;QAC1C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,4CAA4C;IACtE,CAAC;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;AAC9B,CAAC"}