@gaunt-sloth/core 2.0.0-beta.4 → 2.0.0-beta.6

package/dist/history/checkpointRetention.js

@@ -0,0 +1,567 @@
+/**
+ * @packageDocumentation
+ * GS2-107 — **the retention policy for the checkpoint tables, and the readout that makes their
+ * size visible.**
+ *
+ * A checkpoint is not a history row. A `sessions` row is a prompt and a response; a checkpoint is
+ * the state the agent was working with — tool results verbatim, file contents that were read,
+ * command output, whatever an MCP server returned. `history.enabled` is on by default, so every
+ * interactive session writes full graph state per super-step, and until this module nothing ever
+ * reclaimed a byte.
+ *
+ * ## The policy, and why it is split in two
+ *
+ * **Automatic reclamation removes only what can never be resumed. Anything that would cost a user a
+ * resume is available only as an explicit command they type.** That follows the ruling GS2-20 was
+ * built to: resume sheds nothing, and shedding is the user's own act. An age-based sweep that
+ * silently made an old conversation unresumable would remove, without being asked, the one
+ * capability the durable checkpointer exists to provide.
+ *
+ * So:
+ *
+ * - {@link reclaimUnresumableThreads} is automatic and cannot cost a resume, because it only
+ *   deletes threads **no conversation row names** — see the predicate below.
+ * - {@link selectPrunableConversations} + {@link deleteThreads} is `gth history prune`: it removes
+ *   state a user *could* still have resumed, so it is never automatic, never has a silent default
+ *   bound, and says what it will remove before it removes it.
+ *
+ * ## The predicate: one class, not two
+ *
+ * A resume travels exactly one link — `gth history list` prints a conversation id,
+ * `conversations.thread_id` turns that id into a thread, and the thread is what
+ * `resolveResumeTarget` looks up. So a thread that **no conversation row names** cannot be reached
+ * by any id a person could type: it is unaddressable, and deleting it removes no capability anyone
+ * had.
+ *
+ * That single predicate covers both classes retention has to reclaim, because the second collapses
+ * into the first at the row level:
+ *
+ * - a thread with **no conversation row at all** — a `/clear` mints a fresh thread that nothing ever
+ *   names ([[EXT-109]]), and an abandoned boot or a test can leave one too;
+ * - a conversation whose **`thread_id` is NULL** — written by `clearConversationThread` when a
+ *   checkpoint write fails. NULLing the column *destroys the link*, so the thread it used to name is
+ *   thereafter an orphan by exactly the definition above. There is no second query to write.
+ *
+ * ## Whole threads, never a prefix
+ *
+ * Pruning the middle of a thread is forbidden here even though it was **measured not to break this
+ * graph**: `channelsFromCheckpoint` walks ancestors only for a `DeltaChannel` absent from
+ * `channel_values`, and this state schema has none (`messages` is a `BinaryOperatorAggregate` and
+ * every checkpoint carries the whole array), so `getDeltaChannelHistory` is never called on a
+ * resume. A prefix policy is nevertheless a wider decision than retention makes, and it would become
+ * wrong the moment a channel moves behind a reducer. Whole threads only.
+ *
+ * ## Two guards, and which one covers which case
+ *
+ * `/clear` rotates a **live** session onto a thread no conversation row names, and it stays there
+ * for the rest of the session. So "unaddressable" does not imply "finished": a thread being written
+ * right now can satisfy the predicate, and deleting it is silent amnesia rather than a lost resume,
+ * because both interactive surfaces send only the new message and let checkpoint state carry the
+ * conversation.
+ *
+ * - **In this process, the write set.** `GthSqliteSaver` remembers every `thread_id` it has written
+ *   and excludes that set from every pass it runs. It is the only place that knows: the runner
+ *   rotates threads without notifying the checkpointer, so an exclusion assembled by a caller from
+ *   the id a session started with names the wrong thread after the first `/clear` or `/resume`.
+ * - **Across processes, {@link RECLAIM_GRACE_MS}.** Another process cannot be asked whether it is
+ *   still there, so nothing is reclaimed until its newest checkpoint is older than the window. A
+ *   thread whose age cannot be established is left alone.
+ *
+ * The residual is a session in another process that has been idle longer than the window — the
+ * write set does not reach it and the age gate no longer holds it. Closing that needs shared
+ * cross-process session state, which retention does not add.
+ */
+import { DatabaseSync } from 'node:sqlite';
+import { existsSync, statSync } from 'node:fs';
+/**
+ * How stale a thread's newest checkpoint must be before automatic reclamation will touch it.
+ *
+ * Not a tidy-up margin: after a `/clear` a live session writes every remaining checkpoint under a
+ * thread no conversation row names, and another process cannot be asked whether it is still there.
+ * A day is far longer than the gap between two super-steps of a session anyone is still using,
+ * while still reclaiming the rows within a day of the session ending.
+ */
+export const RECLAIM_GRACE_MS = 24 * 60 * 60 * 1000;
+/** How many threads the readout names individually. */
+export const DEFAULT_TOP_THREADS = 5;
+const EMPTY_RECLAIM = {
+    threadCount: 0,
+    checkpointCount: 0,
+    writeCount: 0,
+    bytes: 0,
+};
+/** Whether a table exists in the open database. */
+function hasTable(db, name) {
+    try {
+        const row = db
+            .prepare(`SELECT name FROM sqlite_master WHERE type = 'table' AND name = ?`)
+            .get(name);
+        return row !== undefined;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * True when both halves of the link this module reasons over are present. Without `conversations`
+ * every thread would look unaddressable and a reclamation pass would delete the whole store — so a
+ * database missing that table is left entirely alone rather than swept.
+ */
+export function retentionTablesReady(db) {
+    return hasTable(db, 'checkpoints') && hasTable(db, 'conversations');
+}
+/**
+ * The `ts` a checkpoint recorded for itself, or `undefined` when it cannot be read.
+ *
+ * The saver stores the serializer's own bytes; the shipped `JsonPlusSerializer` writes plain JSON
+ * with a top-level ISO `ts`, which every checkpoint LangGraph builds carries. Anything else — a row
+ * from another serializer, a truncated blob — yields `undefined`, and the callers treat that as
+ * "age unknown", which is the safe direction: an unknown age is never old enough to reclaim.
+ */
+function checkpointTs(blob) {
+    if (!(blob instanceof Uint8Array))
+        return undefined;
+    try {
+        const parsed = JSON.parse(new TextDecoder().decode(blob));
+        return typeof parsed.ts === 'string' ? parsed.ts : undefined;
+    }
+    catch {
+        return undefined;
+    }
+}
+/**
+ * How many thread ids go into one `IN (…)` list. SQLite caps the number of bound parameters in a
+ * statement (999 on a default build), and a store with more unaddressable threads than that is
+ * exactly the store this feature exists for — so the query is chunked rather than assumed small.
+ */
+const ID_CHUNK = 200;
+/**
+ * The predicate itself, as one constant.
+ *
+ * It asks `conversations` a question once per distinct thread in the store, so it is only cheap
+ * while `conversations.thread_id` is indexed — `conversations.id` is a rowid alias and indexes
+ * nothing else, which left this scanning the whole table per thread (measured: 3.18s at 6,000
+ * threads, 13ms with `idx_conversations_thread_id`, created in `historyStore.migrate`). Named here
+ * rather than inlined so the spec that asks SQLite for the query plan is looking at the same text
+ * this runs, and cannot go on passing after the query is edited.
+ */
+export const UNADDRESSABLE_THREADS_SQL = `SELECT DISTINCT c.thread_id AS thread_id
+     FROM checkpoints c
+    WHERE NOT EXISTS (
+            SELECT 1 FROM conversations v WHERE v.thread_id = c.thread_id
+          )`;
+/** Bytes stored under each of `threadIds`, as one grouped query per chunk. */
+function bytesByThread(db, threadIds) {
+    const out = new Map();
+    if (threadIds.length === 0)
+        return out;
+    for (const id of threadIds)
+        out.set(id, { ...EMPTY_RECLAIM, threadCount: 1 });
+    for (let start = 0; start < threadIds.length; start += ID_CHUNK) {
+        const chunk = threadIds.slice(start, start + ID_CHUNK);
+        const holes = chunk.map(() => '?').join(', ');
+        const checkpointRows = db
+            .prepare(`SELECT thread_id,
+                COUNT(*) AS n,
+                COALESCE(SUM(LENGTH(checkpoint) + LENGTH(metadata)), 0) AS bytes
+           FROM checkpoints
+          WHERE thread_id IN (${holes})
+          GROUP BY thread_id`)
+            .all(...chunk);
+        const writeRows = db
+            .prepare(`SELECT thread_id, COUNT(*) AS n, COALESCE(SUM(LENGTH(value)), 0) AS bytes
+           FROM checkpoint_writes
+          WHERE thread_id IN (${holes})
+          GROUP BY thread_id`)
+            .all(...chunk);
+        for (const r of checkpointRows) {
+            const entry = out.get(String(r.thread_id));
+            if (!entry)
+                continue;
+            entry.checkpointCount = Number(r.n ?? 0);
+            entry.bytes += Number(r.bytes ?? 0);
+        }
+        for (const r of writeRows) {
+            const entry = out.get(String(r.thread_id));
+            if (!entry)
+                continue;
+            entry.writeCount = Number(r.n ?? 0);
+            entry.bytes += Number(r.bytes ?? 0);
+        }
+    }
+    return out;
+}
+/**
+ * Every thread in the checkpoint tables that **no conversation row names** — see the module note for
+ * why that one predicate covers both unresumable classes.
+ *
+ * `includeWithinGrace: true` answers "what is unaddressable", which is what the readout reports;
+ * the default answers "what may be deleted now", which additionally requires the thread's newest
+ * checkpoint to be older than {@link RECLAIM_GRACE_MS}. Never throws.
+ */
+export function findUnaddressableThreads(db, options = {}) {
+    if (!retentionTablesReady(db))
+        return [];
+    const graceMs = options.graceMs ?? RECLAIM_GRACE_MS;
+    const now = options.now ?? Date.now();
+    const excluded = new Set(options.excludeThreadIds ?? []);
+    try {
+        // The predicate itself, with no blobs in it: the readout asks this question over the whole
+        // store, and dragging a checkpoint payload back for every thread would make a report cost what
+        // a delete costs.
+        const rows = db.prepare(UNADDRESSABLE_THREADS_SQL).all();
+        const candidates = rows
+            .map((row) => String(row.thread_id))
+            .filter((threadId) => !excluded.has(threadId));
+        if (options.includeWithinGrace)
+            return candidates;
+        // The age gate. Only the NEWEST checkpoint of each candidate is read — one row per thread, not
+        // a scan of its history — because a thread is live if anything in it is recent. Checkpoint ids
+        // are uuid6 and sort lexicographically in creation order, the same ordering `getTuple` uses for
+        // "the latest checkpoint on this thread".
+        const newest = db.prepare(`SELECT checkpoint FROM checkpoints
+        WHERE thread_id = ?
+        ORDER BY checkpoint_id DESC
+        LIMIT 1`);
+        const threads = [];
+        for (const threadId of candidates) {
+            const row = newest.get(threadId);
+            const ts = checkpointTs(row?.checkpoint);
+            if (ts === undefined)
+                continue; // age unknown ⇒ never old enough
+            const age = now - Date.parse(ts);
+            if (!Number.isFinite(age) || age < graceMs)
+                continue;
+            threads.push(threadId);
+        }
+        return threads;
+    }
+    catch {
+        return [];
+    }
+}
+/**
+ * Delete every checkpoint and pending write of the named threads, and report what went.
+ *
+ * The single-thread spelling on the saver (`GthSqliteSaver.deleteThread`) routes through here, so
+ * there is one implementation of the delete rather than two that can drift.
+ *
+ * **Both tables go in one transaction.** A thread's rows live in `checkpoints` and in
+ * `checkpoint_writes`, and only the first of those is what anything looks for: every candidate query
+ * in this module reads `FROM checkpoints`. So a failure between the two statements would leave
+ * `checkpoint_writes` rows belonging to a thread that no longer appears in `checkpoints` — bytes the
+ * readout still counts as stored, that no later pass can find, and that no reader can reach. Not a
+ * self-healing leak; a permanent one. Either both deletes land or neither does.
+ *
+ * The caller must not already be inside a transaction: the rollback here would discard theirs. No
+ * caller is — the two entry points are the close hook and `gth history prune`.
+ */
+export function deleteThreads(db, threadIds) {
+    const ids = [...new Set(threadIds)].filter((id) => id.length > 0);
+    if (ids.length === 0)
+        return { ...EMPTY_RECLAIM };
+    try {
+        const perThread = bytesByThread(db, ids);
+        const summary = { ...EMPTY_RECLAIM };
+        const deleteCheckpoints = db.prepare(`DELETE FROM checkpoints WHERE thread_id = ?`);
+        const deleteWrites = db.prepare(`DELETE FROM checkpoint_writes WHERE thread_id = ?`);
+        db.exec('BEGIN');
+        try {
+            for (const id of ids) {
+                deleteCheckpoints.run(id);
+                deleteWrites.run(id);
+                const counted = perThread.get(id);
+                if (!counted)
+                    continue;
+                summary.threadCount += 1;
+                summary.checkpointCount += counted.checkpointCount;
+                summary.writeCount += counted.writeCount;
+                summary.bytes += counted.bytes;
+            }
+            db.exec('COMMIT');
+        }
+        catch (error) {
+            try {
+                db.exec('ROLLBACK');
+            }
+            catch {
+                /* the connection may already have unwound the transaction; nothing left to undo */
+            }
+            throw error;
+        }
+        return summary;
+    }
+    catch {
+        // Nothing was deleted, so nothing is reported as deleted — the summary the partial loop had
+        // accumulated describes rows the rollback put back.
+        return { ...EMPTY_RECLAIM };
+    }
+}
+/**
+ * The automatic half of the policy: delete every thread no conversation row names and whose newest
+ * checkpoint is past the grace window. Never throws, and never touches a thread a resume could
+ * reach.
+ */
+export function reclaimUnresumableThreads(db, options = {}) {
+    const threads = findUnaddressableThreads(db, options);
+    if (threads.length === 0)
+        return { ...EMPTY_RECLAIM };
+    return deleteThreads(db, threads);
+}
+/**
+ * The conversations `gth history prune` would remove the stored state of, newest activity first.
+ *
+ * A conversation qualifies when it still names a thread that has checkpoints (there is something to
+ * remove) and it satisfies **every** bound given. `olderThanDays` and `keepLast` therefore compose
+ * as a conjunction: with both, a conversation is pruned only when it is older than the age AND
+ * outside the newest N. Passing neither selects nothing — the command requires an explicit bound,
+ * so that there is no silent default for an operation that can cost a resume.
+ *
+ * **Neither of the automatic pass's two guards applies here, and that is the design.** The bounds
+ * the person typed are the whole selection: a grace window layered on top would quietly shrink the
+ * set they asked for, and the in-process write set is empty in a `gth history prune` process, which
+ * shares no state with the session in the window next door. What this does instead is *say so* —
+ * {@link PrunableConversation.recentlyActive} marks every candidate whose last turn is inside
+ * {@link RECLAIM_GRACE_MS}, the plan prints that marker, and the command asks before removing
+ * anything.
+ */
+export function selectPrunableConversations(db, bounds) {
+    if (!retentionTablesReady(db))
+        return [];
+    if (bounds.olderThanDays === undefined && bounds.keepLast === undefined)
+        return [];
+    try {
+        const rows = db
+            .prepare(`SELECT c.id AS id, c.thread_id AS thread_id, c.command AS command,
+                c.started_ts AS started_ts,
+                COUNT(s.id) AS turn_count,
+                MAX(s.ts) AS last_ts
+           FROM conversations c
+           LEFT JOIN sessions s ON s.conversation_id = c.id
+          WHERE c.thread_id IS NOT NULL AND c.thread_id <> ''
+          GROUP BY c.id`)
+            .all();
+        const candidates = rows.map((r) => ({
+            conversationId: Number(r.id),
+            threadId: String(r.thread_id),
+            command: r.command != null ? String(r.command) : undefined,
+            lastActivityTs: r.last_ts != null ? String(r.last_ts) : String(r.started_ts),
+            turnCount: Number(r.turn_count ?? 0),
+        }));
+        // Newest activity first, so `keepLast` counts from the most recent conversation.
+        candidates.sort((a, b) => b.lastActivityTs.localeCompare(a.lastActivityTs));
+        const now = bounds.now ?? Date.now();
+        const cutoff = bounds.olderThanDays === undefined
+            ? undefined
+            : now - bounds.olderThanDays * 24 * 60 * 60 * 1000;
+        const selected = candidates.filter((candidate, index) => {
+            if (bounds.keepLast !== undefined && index < bounds.keepLast)
+                return false;
+            if (cutoff !== undefined) {
+                const at = Date.parse(candidate.lastActivityTs);
+                // An unparseable timestamp is an unknown age, and an unknown age never satisfies an age
+                // bound — the same safe direction the grace window takes.
+                if (!Number.isFinite(at) || at >= cutoff)
+                    return false;
+            }
+            return true;
+        });
+        if (selected.length === 0)
+            return [];
+        const perThread = bytesByThread(db, selected.map((c) => c.threadId));
+        // Only a conversation with something actually stored is offered: naming one whose thread holds
+        // no rows would report a removal that reclaims nothing.
+        return selected
+            .map((c) => {
+            const counted = perThread.get(c.threadId) ?? EMPTY_RECLAIM;
+            const at = Date.parse(c.lastActivityTs);
+            return {
+                ...c,
+                checkpointCount: counted.checkpointCount,
+                bytes: counted.bytes,
+                // Same window the automatic pass uses, read off the turn row rather than the checkpoint
+                // blob: the turn is written after the checkpoints of that turn, so it is the later of the
+                // two and a conservative answer to "was something happening here recently".
+                recentlyActive: Number.isFinite(at) && now - at < RECLAIM_GRACE_MS,
+            };
+        })
+            .filter((c) => c.checkpointCount > 0);
+    }
+    catch {
+        return [];
+    }
+}
+/**
+ * `VACUUM` — the part that actually gives the disk space back. Deleting rows in SQLite moves pages
+ * onto the free list and leaves the file exactly as large as it was, so a prune that skipped this
+ * would report bytes removed while the file a user can see never moved.
+ *
+ * Returns whether it ran. It cannot run inside a transaction, and it needs the file to itself; a
+ * failure is reported rather than thrown, because the rows are already gone and the run should say
+ * so.
+ */
+export function vacuumStore(db) {
+    try {
+        db.exec('VACUUM');
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * The readout: what the checkpoint tables hold, and what of it is unaddressable.
+ *
+ * `fileBytes` and `checkpointBytes` are reported separately on purpose — the same file also holds
+ * the session transcripts and the FTS index, so one number labelled "checkpoints" that is really the
+ * whole file would be a false statement on the very screen this exists to make honest.
+ */
+export function collectCheckpointStoreStats(db, dbPath, topN = DEFAULT_TOP_THREADS) {
+    const empty = {
+        dbPath,
+        fileBytes: 0,
+        checkpointBytes: 0,
+        checkpointCount: 0,
+        writeCount: 0,
+        threadCount: 0,
+        largestThreads: [],
+        unresumableThreadCount: 0,
+        unresumableBytes: 0,
+    };
+    let fileBytes = 0;
+    try {
+        if (existsSync(dbPath))
+            fileBytes = statSync(dbPath).size;
+    }
+    catch {
+        /* an unreadable file is reported as zero bytes rather than failing the readout */
+    }
+    if (!hasTable(db, 'checkpoints'))
+        return { ...empty, fileBytes };
+    try {
+        const totals = db
+            .prepare(`SELECT COUNT(*) AS n,
+                COUNT(DISTINCT thread_id) AS threads,
+                COALESCE(SUM(LENGTH(checkpoint) + LENGTH(metadata)), 0) AS bytes
+           FROM checkpoints`)
+            .get();
+        const writes = db
+            .prepare(`SELECT COUNT(*) AS n, COALESCE(SUM(LENGTH(value)), 0) AS bytes FROM checkpoint_writes`)
+            .get();
+        // The per-thread roll-up carries the conversation that names each thread, so the readout can
+        // say which of the biggest threads is a conversation someone could resume and which is dead
+        // weight. A LEFT JOIN, because the unaddressable ones are exactly those with no match.
+        const conversationsPresent = hasTable(db, 'conversations');
+        const threadRows = db
+            .prepare(conversationsPresent
+            ? `SELECT t.thread_id AS thread_id, t.n AS n, t.bytes AS bytes,
+                    v.id AS conversation_id, v.command AS command
+               FROM (SELECT thread_id, COUNT(*) AS n,
+                            COALESCE(SUM(LENGTH(checkpoint) + LENGTH(metadata)), 0) AS bytes
+                       FROM checkpoints GROUP BY thread_id) t
+               LEFT JOIN conversations v ON v.thread_id = t.thread_id
+              ORDER BY t.bytes DESC, t.thread_id ASC
+              LIMIT ?`
+            : `SELECT thread_id, COUNT(*) AS n,
+                    COALESCE(SUM(LENGTH(checkpoint) + LENGTH(metadata)), 0) AS bytes,
+                    NULL AS conversation_id, NULL AS command
+               FROM checkpoints
+              GROUP BY thread_id
+              ORDER BY bytes DESC, thread_id ASC
+              LIMIT ?`)
+            .all(Math.max(0, topN));
+        const unaddressable = findUnaddressableThreads(db, { includeWithinGrace: true });
+        const unaddressableBytes = [...bytesByThread(db, unaddressable).values()].reduce((sum, entry) => sum + entry.bytes, 0);
+        return {
+            dbPath,
+            fileBytes,
+            checkpointBytes: Number(totals.bytes ?? 0) + Number(writes.bytes ?? 0),
+            checkpointCount: Number(totals.n ?? 0),
+            writeCount: Number(writes.n ?? 0),
+            threadCount: Number(totals.threads ?? 0),
+            largestThreads: threadRows.map((r) => ({
+                threadId: String(r.thread_id),
+                conversationId: r.conversation_id != null ? Number(r.conversation_id) : undefined,
+                command: r.command != null ? String(r.command) : undefined,
+                checkpointCount: Number(r.n ?? 0),
+                bytes: Number(r.bytes ?? 0),
+            })),
+            unresumableThreadCount: unaddressable.length,
+            unresumableBytes: unaddressableBytes,
+        };
+    }
+    catch {
+        return { ...empty, fileBytes };
+    }
+}
+/**
+ * A read/write connection to the history file for the maintenance commands, or `null` when there is
+ * nothing there. Fail-soft in the same shape as `openHistoryStore` / `openCheckpointSaver`, and it
+ * never CREATES the file: `gth history prune` on a machine with no history should say there is none,
+ * not leave an empty database behind.
+ */
+export class CheckpointMaintenance {
+    db;
+    constructor(db) {
+        this.db = db;
+    }
+    static open(dbPath) {
+        if (dbPath !== ':memory:' && !existsSync(dbPath))
+            return null;
+        let db;
+        try {
+            db = new DatabaseSync(dbPath);
+            db.exec('PRAGMA busy_timeout = 5000');
+            // A garbage file opens cleanly and only fails on the first statement, so the probe is what
+            // decides whether this handle is usable at all.
+            db.prepare(`SELECT name FROM sqlite_master LIMIT 1`).all();
+            return new CheckpointMaintenance(db);
+        }
+        catch {
+            try {
+                db?.close();
+            }
+            catch {
+                /* ignore: the connection may already be broken */
+            }
+            return null;
+        }
+    }
+    stats(dbPath, topN = DEFAULT_TOP_THREADS) {
+        return collectCheckpointStoreStats(this.db, dbPath, topN);
+    }
+    prunable(bounds) {
+        return selectPrunableConversations(this.db, bounds);
+    }
+    unaddressable(options = {}) {
+        return findUnaddressableThreads(this.db, options);
+    }
+    remove(threadIds) {
+        return deleteThreads(this.db, threadIds);
+    }
+    /** Bytes stored under exactly these threads — what removing them would reclaim. */
+    bytesOf(threadIds) {
+        try {
+            return [...bytesByThread(this.db, [...new Set(threadIds)]).values()].reduce((sum, entry) => sum + entry.bytes, 0);
+        }
+        catch {
+            return 0;
+        }
+    }
+    vacuum() {
+        return vacuumStore(this.db);
+    }
+    close() {
+        try {
+            this.db.close();
+        }
+        catch {
+            /* ignore */
+        }
+    }
+}
+/** Fail-soft opener for {@link CheckpointMaintenance}; `null` when there is no store to maintain. */
+export function openCheckpointMaintenance(dbPath) {
+    return CheckpointMaintenance.open(dbPath);
+}
+//# sourceMappingURL=checkpointRetention.js.map

package/dist/history/checkpointRetention.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpointRetention.js","sourceRoot":"","sources":["../../src/history/checkpointRetention.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwEG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE/C;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAEpD,uDAAuD;AACvD,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAmFrC,MAAM,aAAa,GAAmB;IACpC,WAAW,EAAE,CAAC;IACd,eAAe,EAAE,CAAC;IAClB,UAAU,EAAE,CAAC;IACb,KAAK,EAAE,CAAC;CACT,CAAC;AAEF,mDAAmD;AACnD,SAAS,QAAQ,CAAC,EAAgB,EAAE,IAAY;IAC9C,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE;aACX,OAAO,CAAC,kEAAkE,CAAC;aAC3E,GAAG,CAAC,IAAI,CAAwC,CAAC;QACpD,OAAO,GAAG,KAAK,SAAS,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,EAAgB;IACnD,OAAO,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,IAAI,QAAQ,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC;AACtE,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,IAAa;IACjC,IAAI,CAAC,CAAC,IAAI,YAAY,UAAU,CAAC;QAAE,OAAO,SAAS,CAAC;IACpD,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAA4B,CAAC;QACrF,OAAO,OAAO,MAAM,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,QAAQ,GAAG,GAAG,CAAC;AAErB;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG;;;;YAI7B,CAAC;AAEb,8EAA8E;AAC9E,SAAS,aAAa,CAAC,EAAgB,EAAE,SAAmB;IAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC9C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACvC,KAAK,MAAM,EAAE,IAAI,SAAS;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,aAAa,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,IAAI,QAAQ,EAAE,CAAC;QAChE,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,cAAc,GAAG,EAAE;aACtB,OAAO,CACN;;;;gCAIwB,KAAK;6BACR,CACtB;aACA,GAAG,CAAC,GAAG,KAAK,CAA8B,CAAC;QAC9C,MAAM,SAAS,GAAG,EAAE;aACjB,OAAO,CACN;;gCAEwB,KAAK;6BACR,CACtB;aACA,GAAG,CAAC,GAAG,KAAK,CAA8B,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,KAAK,CAAC,eAAe,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACpC,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,wBAAwB,CACtC,EAAgB,EAChB,OAAO,GAKH,EAAE;IAEN,IAAI,CAAC,oBAAoB,CAAC,EAAE,CAAC;QAAE,OAAO,EAAE,CAAC;IACzC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,gBAAgB,CAAC;IACpD,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC;IACzD,IAAI,CAAC;QACH,2FAA2F;QAC3F,+FAA+F;QAC/F,kBAAkB;QAClB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,GAAG,EAA+B,CAAC;QACtF,MAAM,UAAU,GAAG,IAAI;aACpB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;aACnC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjD,IAAI,OAAO,CAAC,kBAAkB;YAAE,OAAO,UAAU,CAAC;QAElD,+FAA+F;QAC/F,+FAA+F;QAC/F,gGAAgG;QAChG,0CAA0C;QAC1C,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CACvB;;;gBAGU,CACX,CAAC;QACF,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAwC,CAAC;YACxE,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;YACzC,IAAI,EAAE,KAAK,SAAS;gBAAE,SAAS,CAAC,iCAAiC;YACjE,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,OAAO;gBAAE,SAAS;YACrD,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,aAAa,CAAC,EAAgB,EAAE,SAA4B;IAC1E,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClE,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;IAClD,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,aAAa,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACzC,MAAM,OAAO,GAAmB,EAAE,GAAG,aAAa,EAAE,CAAC;QACrD,MAAM,iBAAiB,GAAG,EAAE,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;QACpF,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QACrF,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjB,IAAI,CAAC;YACH,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC1B,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClC,IAAI,CAAC,OAAO;oBAAE,SAAS;gBACvB,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC;gBACzB,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC,eAAe,CAAC;gBACnD,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC;gBACzC,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;YACjC,CAAC;YACD,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC;gBACH,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtB,CAAC;YAAC,MAAM,CAAC;gBACP,mFAAmF;YACrF,CAAC;YACD,MAAM,KAAK,CAAC;QACd,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAAC,MAAM,CAAC;QACP,4FAA4F;QAC5F,oDAAoD;QACpD,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;IAC9B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CACvC,EAAgB,EAChB,OAAO,GAA6E,EAAE;IAEtF,MAAM,OAAO,GAAG,wBAAwB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACtD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,GAAG,aAAa,EAAE,CAAC;IACtD,OAAO,aAAa,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,2BAA2B,CACzC,EAAgB,EAChB,MAAmB;IAEnB,IAAI,CAAC,oBAAoB,CAAC,EAAE,CAAC;QAAE,OAAO,EAAE,CAAC;IACzC,IAAI,MAAM,CAAC,aAAa,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,EAAE,CAAC;IACnF,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE;aACZ,OAAO,CACN;;;;;;;wBAOgB,CACjB;aACA,GAAG,EAA+B,CAAC;QACtC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAClC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7B,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;YAC1D,cAAc,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC;YAC5E,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC;SACrC,CAAC,CAAC,CAAC;QACJ,iFAAiF;QACjF,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;QAE5E,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QACrC,MAAM,MAAM,GACV,MAAM,CAAC,aAAa,KAAK,SAAS;YAChC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,GAAG,GAAG,MAAM,CAAC,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;QACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;YACtD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,MAAM,CAAC,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAC3E,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;gBAChD,wFAAwF;gBACxF,0DAA0D;gBAC1D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM;oBAAE,OAAO,KAAK,CAAC;YACzD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,SAAS,GAAG,aAAa,CAC7B,EAAE,EACF,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAChC,CAAC;QACF,+FAA+F;QAC/F,wDAAwD;QACxD,OAAO,QAAQ;aACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC;YAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;YACxC,OAAO;gBACL,GAAG,CAAC;gBACJ,eAAe,EAAE,OAAO,CAAC,eAAe;gBACxC,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,wFAAwF;gBACxF,0FAA0F;gBAC1F,4EAA4E;gBAC5E,cAAc,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,GAAG,GAAG,EAAE,GAAG,gBAAgB;aACnE,CAAC;QACJ,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,EAAgB;IAC1C,IAAI,CAAC;QACH,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CACzC,EAAgB,EAChB,MAAc,EACd,IAAI,GAAG,mBAAmB;IAE1B,MAAM,KAAK,GAAyB;QAClC,MAAM;QACN,SAAS,EAAE,CAAC;QACZ,eAAe,EAAE,CAAC;QAClB,eAAe,EAAE,CAAC;QAClB,UAAU,EAAE,CAAC;QACb,WAAW,EAAE,CAAC;QACd,cAAc,EAAE,EAAE;QAClB,sBAAsB,EAAE,CAAC;QACzB,gBAAgB,EAAE,CAAC;KACpB,CAAC;IACF,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,CAAC;QACH,IAAI,UAAU,CAAC,MAAM,CAAC;YAAE,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;IAC5D,CAAC;IAAC,MAAM,CAAC;QACP,kFAAkF;IACpF,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC;QAAE,OAAO,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,CAAC;IACjE,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,EAAE;aACd,OAAO,CACN;;;4BAGoB,CACrB;aACA,GAAG,EAA6B,CAAC;QACpC,MAAM,MAAM,GAAG,EAAE;aACd,OAAO,CACN,uFAAuF,CACxF;aACA,GAAG,EAA6B,CAAC;QAEpC,6FAA6F;QAC7F,4FAA4F;QAC5F,uFAAuF;QACvF,MAAM,oBAAoB,GAAG,QAAQ,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,EAAE;aAClB,OAAO,CACN,oBAAoB;YAClB,CAAC,CAAC;;;;;;;sBAOU;YACZ,CAAC,CAAC;;;;;;sBAMU,CACf;aACA,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAA8B,CAAC;QAEvD,MAAM,aAAa,GAAG,wBAAwB,CAAC,EAAE,EAAE,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;QACjF,MAAM,kBAAkB,GAAG,CAAC,GAAG,aAAa,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAC9E,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EACjC,CAAC,CACF,CAAC;QAEF,OAAO;YACL,MAAM;YACN,SAAS;YACT,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;YACtE,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;YACtC,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;YACjC,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;YACxC,cAAc,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACrC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC7B,cAAc,EAAE,CAAC,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,SAAS;gBACjF,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC1D,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACjC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;aAC5B,CAAC,CAAC;YACH,sBAAsB,EAAE,aAAa,CAAC,MAAM;YAC5C,gBAAgB,EAAE,kBAAkB;SACrC,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,GAAG,KAAK,EAAE,SAAS,EAAE,CAAC;IACjC,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,qBAAqB;IACK,EAAE;IAAvC,YAAqC,EAAgB;kBAAhB,EAAE;IAAiB,CAAC;IAEzD,MAAM,CAAC,IAAI,CAAC,MAAc;QACxB,IAAI,MAAM,KAAK,UAAU,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9D,IAAI,EAA4B,CAAC;QACjC,IAAI,CAAC;YACH,EAAE,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;YAC9B,EAAE,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;YACtC,2FAA2F;YAC3F,gDAAgD;YAChD,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC3D,OAAO,IAAI,qBAAqB,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC;gBACH,EAAE,EAAE,KAAK,EAAE,CAAC;YACd,CAAC;YAAC,MAAM,CAAC;gBACP,kDAAkD;YACpD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,KAAK,CAAC,MAAc,EAAE,IAAI,GAAG,mBAAmB;QAC9C,OAAO,2BAA2B,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAC5D,CAAC;IAED,QAAQ,CAAC,MAAmB;QAC1B,OAAO,2BAA2B,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACtD,CAAC;IAED,aAAa,CAAC,OAAO,GAAuC,EAAE;QAC5D,OAAO,wBAAwB,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,CAAC,SAA4B;QACjC,OAAO,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED,mFAAmF;IACnF,OAAO,CAAC,SAA4B;QAClC,IAAI,CAAC;YACH,OAAO,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CACzE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EACjC,CAAC,CACF,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK;QACH,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QAAC,MAAM,CAAC;YACP,YAAY;QACd,CAAC;IACH,CAAC;CACF;AAED,qGAAqG;AACrG,MAAM,UAAU,yBAAyB,CAAC,MAAc;IACtD,OAAO,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC5C,CAAC"}