@askdkc/dsh-cli 0.11.3

package/lib/types/dsh-adapter/sessions/list.js

@@ -0,0 +1,331 @@
+/**
+ * Building the session list.
+ *
+ * One resolution path produces one usable, honestly-classified record per
+ * stored session — every kind, empties included — and callers decide what to
+ * show. That split is deliberate: the old picker filtered while it resolved,
+ * so "hide sub-agent runs" and "resolve a title" were the same pass and
+ * neither could change without disturbing the other. Here the browser can
+ * toggle sub-agent runs into view, or offer to clean up boot artifacts,
+ * without re-deriving anything.
+ *
+ * Cost: backend enumeration plus a revision comparison per session. Only a
+ * changed revision needs artifact I/O, and append-only changes read the new
+ * suffix. Incomplete titles are recovered after the list is returned. The path
+ * this replaces decompressed every frame of the twenty most recent logs on
+ * every open — 3.9 s over a 31 MB history.
+ *
+ * @module dsh-cli/sessions/list
+ */
+import { basename } from 'node:path';
+import { digestAppendedSuffix, digestSession, sessionTitleAnchor, } from './digest.js';
+import { fileFacts } from './frames.js';
+import { scheduleTitleRecovery, titleRecoveryNeedsWork } from './recovery.js';
+import { classify, readHeader } from './header.js';
+import { findSessionLogFile, resolveLocatedPath } from '../compat/sessionLog.js';
+import { indexFileStamp, readIndex, writeIndex } from './store.js';
+import { readLastUsed } from '../../sessionHistory.js';
+/** A late overlapping listing must not write an older index over a newer one. */
+const listingVersions = new WeakMap();
+/** Large append batches use bounded windows, then background title recovery. */
+const FOREGROUND_SUFFIX_BYTES = 2 * 1024 * 1024;
+/** Pull `{ header, revision }` out of one `listSnapshots()` element. */
+function readSnapshot(value) {
+    if (value === null || typeof value !== 'object')
+        return undefined;
+    const record = value;
+    const raw = record['header'];
+    const header = readHeader(raw);
+    if (header === undefined)
+        return undefined;
+    const revision = record['revision'];
+    return { header, raw, revision: typeof revision === 'string' ? revision : undefined };
+}
+/**
+ * Enumerate stored sessions.
+ *
+ * Prefers `listSnapshots()` because its revision is the backend's own answer
+ * to "has this log changed", and falls back to `list()` when the resolved
+ * service predates it — in which case the change token is derived from the
+ * file's own size and mtime further down. Both are honest change tokens for an
+ * append-only log; only the authority differs.
+ *
+ * `list()` itself is read dual-shape: 0.1.5 folded snapshots INTO it (each
+ * element is `{ header, revision, sizeBytes }`), while every older backend
+ * returns bare headers — so each element is tried as a snapshot first and
+ * then as a bare header.
+ */
+export async function enumerateSessions(source, signal) {
+    if (typeof source.listSnapshots === 'function') {
+        const snapshots = await source.listSnapshots(signal);
+        return snapshots.map(readSnapshot).filter((entry) => entry !== undefined);
+    }
+    if (typeof source.list === 'function') {
+        const headers = await source.list(signal);
+        return headers
+            .map((raw) => readSnapshot(raw) ?? bareListed(raw))
+            .filter((entry) => entry !== undefined);
+    }
+    return [];
+}
+/** Pull a bare header out of one pre-0.1.5 `list()` element. */
+function bareListed(raw) {
+    const header = readHeader(raw);
+    return header === undefined ? undefined : { header, raw, revision: undefined };
+}
+/**
+ * Absolute artifact path for one session.
+ *
+ * The backend's own `locate()` is authoritative and is asked first — but
+ * since 0.1.5 it answers the CURRENT generation's path without touching the
+ * filesystem, which does not exist for a session still stored as an older
+ * generation; resolve older generations inside that same directory. Only
+ * backends without a location fall back to scanning session roots, as the
+ * compat layer has always done (generation-aware there) and is deliberately
+ * independent of the backend's workspace-key scheme — so a runtime whose
+ * persistence service predates `locate`, whose key sanitization changes, or
+ * whose current-generation path has not materialized yet still resolves.
+ *
+ * A backend that stores no per-session artifact (SQLite) answers neither, and
+ * its sessions are summarized from their headers alone.
+ */
+function locate(source, raw, sessionId) {
+    if (typeof source.locate === 'function') {
+        let location;
+        try {
+            location = source.locate(raw);
+        }
+        catch {
+            location = undefined;
+        }
+        if (location !== null && typeof location === 'object') {
+            const path = location['path'];
+            if (typeof path === 'string' && path.length > 0)
+                return resolveLocatedPath(path)?.path;
+        }
+    }
+    return findSessionLogFile(sessionId);
+}
+/**
+ * Read every stored session into a complete summary.
+ *
+ * @param source - The persistence service.
+ * @param signal - Optional cancellation for the backend's own listing work.
+ * @returns One summary per stored session, most recently active first. No
+ *   filtering of any kind is applied — sub-agent runs and sessions with no
+ *   conversation are present and labelled as such.
+ */
+export async function listSummaries(source, signal, onEnriched) {
+    const version = (listingVersions.get(source) ?? 0) + 1;
+    listingVersions.set(source, version);
+    let listed;
+    try {
+        listed = await enumerateSessions(source, signal);
+    }
+    catch {
+        return [];
+    }
+    // Children are counted from the same listing rather than by walking logs:
+    // lineage lives in the header, so a parent's sub-agent count is free.
+    const children = new Map();
+    for (const entry of listed) {
+        if (entry.header.origin !== 'subagent')
+            continue;
+        const parent = entry.header.parentSession;
+        if (parent === undefined)
+            continue;
+        children.set(parent, (children.get(parent) ?? 0) + 1);
+    }
+    const indexStamp = indexFileStamp();
+    const index = readIndex();
+    const next = new Map();
+    const lastUsed = readLastUsed();
+    let changed = false;
+    const records = [];
+    const recordsById = new Map();
+    const earlyEnrichments = new Map();
+    let summariesReady = false;
+    const notifyEnriched = (id, enriched) => {
+        if (!summariesReady) {
+            earlyEnrichments.set(id, enriched);
+            return;
+        }
+        const record = recordsById.get(id);
+        if (record === undefined || record.derived?.revision !== enriched.revision)
+            return;
+        record.derived = enriched;
+        onEnriched?.(summaryOf(record));
+    };
+    const scanWork = [];
+    for (const { header, raw, revision } of listed) {
+        const cached = index.get(header.id);
+        let facts;
+        let derived = cached?.derived;
+        let path;
+        if (revision !== undefined && derived?.revision === revision && derived.modifiedAt === undefined) {
+            // Schema v3 held the same derived facts but not mtime. Upgrade that
+            // record with one metadata read rather than re-decoding its log.
+            path = locate(source, raw, header.id);
+            facts = path === undefined ? undefined : fileFacts(path);
+            derived = { ...derived, modifiedAt: facts?.modifiedAt ?? 0 };
+            changed = true;
+        }
+        // The backend's opaque revision is authoritative. A hit does not even
+        // resolve a path; incomplete titles are handled by the recovery queue.
+        if (revision === undefined || derived === undefined || derived.revision !== revision) {
+            path = locate(source, raw, header.id);
+            facts = path === undefined ? undefined : fileFacts(path);
+            // Older persistence implementations provide no revision. Their one
+            // metadata read per entry remains necessary to detect changes.
+            const token = revision ?? (facts === undefined ? undefined : `${facts.bytes}:${facts.modifiedAt}`);
+            if (token === undefined || derived?.revision !== token) {
+                derived = undefined;
+                if (cached?.derived !== undefined)
+                    changed = true;
+                if (path !== undefined && token !== undefined) {
+                    const previous = cached?.derived;
+                    const appendGrowth = (facts !== undefined && previous?.identity !== undefined &&
+                        previous.identity === facts.identity && previous.anchor !== undefined &&
+                        facts.bytes > previous.bytes &&
+                        await sessionTitleAnchor(path, previous.bytes, signal) === previous.anchor);
+                    if (appendGrowth && facts !== undefined && previous !== undefined && facts.bytes - previous.bytes <= FOREGROUND_SUFFIX_BYTES) {
+                        const suffix = await digestAppendedSuffix(path, previous.bytes, facts.bytes, signal);
+                        if (suffix.complete) {
+                            derived = {
+                                revision: token,
+                                bytes: facts.bytes,
+                                modifiedAt: facts.modifiedAt,
+                                identity: facts.identity,
+                                anchor: await sessionTitleAnchor(path, facts.bytes, signal),
+                                title: suffix.title?.text ?? previous.title,
+                                titleSource: suffix.title?.source ?? previous.titleSource,
+                                titleComplete: suffix.title !== undefined || previous.titleComplete,
+                                hasPrompt: previous.hasPrompt || suffix.hasHumanPrompt,
+                                model: suffix.model ?? previous.model,
+                                label: suffix.label ?? previous.label,
+                            };
+                        }
+                    }
+                    if (derived === undefined) {
+                        const digest = digestSession(path, header.cwd ?? '');
+                        const carried = appendGrowth && digest.titleComplete !== true ? previous : undefined;
+                        derived = {
+                            revision: token,
+                            bytes: facts?.bytes ?? 0,
+                            modifiedAt: facts?.modifiedAt,
+                            identity: facts?.identity,
+                            anchor: facts === undefined ? undefined : await sessionTitleAnchor(path, facts.bytes, signal),
+                            title: carried?.title ?? digest.title?.text ?? '',
+                            titleSource: carried?.titleSource ?? digest.title?.source ?? 'fallback',
+                            titleComplete: digest.titleComplete === true,
+                            hasPrompt: digest.hasPrompt,
+                            model: digest.model ?? carried?.model,
+                            label: digest.label ?? carried?.label,
+                        };
+                    }
+                    changed = true;
+                }
+            }
+        }
+        if (derived !== undefined && !derived.titleComplete && signal?.aborted !== true &&
+            titleRecoveryNeedsWork(header.id, derived.revision, enriched => notifyEnriched(header.id, enriched))) {
+            // A revision hit still may need enrichment, but locating that rare log
+            // stays off the ordinary warm path once recovery has been scheduled.
+            if (path === undefined)
+                path = locate(source, raw, header.id);
+            if (facts === undefined && path !== undefined)
+                facts = fileFacts(path);
+            if (path !== undefined && facts !== undefined && derived.bytes === facts.bytes) {
+                scanWork.push({
+                    id: header.id,
+                    revision: derived.revision,
+                    path,
+                    bytes: facts.bytes,
+                    modifiedAt: facts.modifiedAt,
+                    identity: facts.identity,
+                    priority: Math.max(facts.modifiedAt, lastUsed[header.id] ?? 0, header.createdAt ?? 0),
+                });
+            }
+        }
+        // Carry every entry that holds anything worth keeping — including a pure
+        // cache hit, which must survive into the next index or the following
+        // listing would re-derive everything it just reused.
+        if (derived !== undefined || cached?.branch !== undefined) {
+            next.set(header.id, { derived, branch: cached?.branch });
+        }
+        const record = { header, facts, cached, derived };
+        records.push(record);
+        recordsById.set(header.id, record);
+    }
+    // Entries for sessions the backend no longer lists are dropped here; that is
+    // the whole of the cache's garbage collection, and it runs on every listing.
+    const newest = listingVersions.get(source) === version;
+    if (newest && (changed || next.size !== index.size) && indexFileStamp() === indexStamp)
+        writeIndex(next);
+    const summaryOf = ({ header, facts, cached, derived }) => ({
+        id: header.id,
+        kind: classify(header),
+        title: {
+            text: derived?.title !== undefined && derived.title.length > 0
+                ? derived.title
+                : basename(header.cwd ?? '') || header.id.slice(0, 8),
+            source: derived?.titleSource ?? 'fallback',
+        },
+        cwd: header.cwd ?? '',
+        createdAt: header.createdAt ?? derived?.modifiedAt ?? facts?.modifiedAt ?? 0,
+        updatedAt: Math.max(derived?.modifiedAt ?? facts?.modifiedAt ?? 0, lastUsed[header.id] ?? 0, header.createdAt ?? 0),
+        bytes: derived?.bytes ?? facts?.bytes,
+        // Without a readable artifact nothing can be proven empty, and hiding a
+        // real session is the worse error — so an unreadable log is listed.
+        hasPrompt: derived?.hasPrompt ?? true,
+        agentPreset: header.agentPreset,
+        model: derived?.model,
+        label: derived?.label,
+        branch: cached?.branch,
+        childCount: children.get(header.id) ?? 0,
+    });
+    for (const [id, enriched] of earlyEnrichments) {
+        const record = recordsById.get(id);
+        if (record?.derived?.revision === enriched.revision)
+            record.derived = enriched;
+    }
+    const summaries = records.map(summaryOf);
+    summariesReady = true;
+    if (newest) {
+        for (const work of scanWork) {
+            scheduleTitleRecovery(work, derived => notifyEnriched(work.id, derived));
+        }
+    }
+    // A total order, not just a sort key. `updatedAt` is dominated by the log's
+    // mtime, and sessions written inside the same millisecond tie on it — which
+    // would leave their relative order down to whatever the backend happened to
+    // enumerate first, so the same history could list differently twice in a
+    // row. Creation time breaks the tie, and the id breaks that.
+    return summaries.sort((left, right) => right.updatedAt - left.updatedAt ||
+        right.createdAt - left.createdAt ||
+        (left.id < right.id ? -1 : left.id > right.id ? 1 : 0));
+}
+/**
+ * Resolve one session's artifact path.
+ *
+ * Listing headers is a first-line-only read per log — about 2 ms across a
+ * fifty-session history — so the preview pane resolves its target this way
+ * rather than making every summary carry a filesystem path it has no business
+ * knowing about.
+ *
+ * @param source - The persistence service.
+ * @param sessionId - Session to locate.
+ * @returns The absolute artifact path, or undefined when the backend owns no
+ *   per-session file or the session is gone.
+ */
+export async function locateSession(source, sessionId, signal) {
+    let listed;
+    try {
+        listed = await enumerateSessions(source, signal);
+    }
+    catch {
+        return undefined;
+    }
+    const match = listed.find(entry => entry.header.id === sessionId);
+    return match === undefined ? undefined : locate(source, match.raw, sessionId);
+}

package/lib/types/dsh-adapter/sessions/recovery.d.ts

@@ -0,0 +1,17 @@
+import { type DerivedEntry } from './store.js';
+interface RecoveryWork {
+    readonly id: string;
+    readonly revision: string;
+    readonly path: string;
+    readonly bytes: number;
+    readonly modifiedAt: number;
+    readonly identity: string;
+    readonly priority: number;
+    readonly listeners: Set<(derived: DerivedEntry) => void>;
+}
+/** Deduplicate recovery per session/revision and retry damaged logs with backoff. */
+export declare function scheduleTitleRecovery(work: Omit<RecoveryWork, 'listeners'>, onComplete?: (derived: DerivedEntry) => void): void;
+/** A queued or backed-off revision needs no path lookup on another open. */
+export declare function titleRecoveryNeedsWork(id: string, revision: string, onComplete?: (derived: DerivedEntry) => void): boolean;
+export {};
+//# sourceMappingURL=recovery.d.ts.map

package/lib/types/dsh-adapter/sessions/recovery.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recovery.d.ts","sourceRoot":"","sources":["../../../../src/dsh-adapter/sessions/recovery.ts"],"names":[],"mappings":"AAGA,OAAO,EAAyC,KAAK,YAAY,EAAE,MAAM,YAAY,CAAA;AAErF,UAAU,YAAY;IACpB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,YAAY,KAAK,IAAI,CAAC,CAAA;CACzD;AAwED,qFAAqF;AACrF,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,YAAY,KAAK,IAAI,GAAG,IAAI,CAa/H;AAED,4EAA4E;AAC5E,wBAAgB,sBAAsB,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,YAAY,KAAK,IAAI,GAAG,OAAO,CAS1H"}

package/lib/types/dsh-adapter/sessions/recovery.js

@@ -0,0 +1,109 @@
+/** Best-effort, process-local deep title recovery outside the listing path. */
+import { fileFacts } from './frames.js';
+import { recoverSessionTitle } from './digest.js';
+import { indexFileStamp, readIndex, writeIndex } from './store.js';
+const pending = new Map();
+const retries = new Map();
+const RETRY_DELAYS = [1000, 5000, 30_000, 300_000];
+let running;
+let scheduled = false;
+function deferRetry(work) {
+    const old = retries.get(work.id);
+    const attempts = old?.revision === work.revision ? old.attempts + 1 : 1;
+    retries.set(work.id, {
+        revision: work.revision,
+        attempts,
+        retryAfter: Date.now() + RETRY_DELAYS[Math.min(attempts - 1, RETRY_DELAYS.length - 1)],
+    });
+}
+function kick() {
+    if (scheduled || running !== undefined || pending.size === 0)
+        return;
+    scheduled = true;
+    setImmediate(() => {
+        scheduled = false;
+        if (running !== undefined)
+            return;
+        const work = [...pending.values()].sort((a, b) => b.priority - a.priority)[0];
+        if (work === undefined)
+            return;
+        pending.delete(work.id);
+        running = work;
+        void recover(work).finally(() => {
+            running = undefined;
+            kick();
+        });
+    });
+}
+async function recover(work) {
+    try {
+        const recovered = await recoverSessionTitle(work.path, work.bytes);
+        const facts = fileFacts(work.path);
+        if (facts === undefined || facts.bytes !== work.bytes ||
+            facts.modifiedAt !== work.modifiedAt || facts.identity !== work.identity)
+            return;
+        if (!recovered.complete) {
+            deferRetry(work);
+            return;
+        }
+        const stamp = indexFileStamp();
+        const index = readIndex();
+        const entry = index.get(work.id);
+        if (entry?.derived?.revision !== work.revision || entry.derived.titleComplete)
+            return;
+        const derived = {
+            ...entry.derived,
+            title: recovered.title?.text ?? '',
+            titleSource: recovered.title?.source ?? 'fallback',
+            titleComplete: true,
+            hasPrompt: recovered.hasPrompt ?? entry.derived.hasPrompt,
+        };
+        index.set(work.id, { ...entry, derived });
+        if (indexFileStamp() !== stamp)
+            return;
+        writeIndex(index);
+        retries.delete(work.id);
+        for (const listener of work.listeners) {
+            try {
+                listener(derived);
+            }
+            catch { /* UI observers cannot fail recovery. */ }
+        }
+    }
+    catch {
+        // An unreadable or changing artifact remains visible with conservative
+        // metadata. Reopen retries under backoff, or immediately on revision change.
+        deferRetry(work);
+    }
+}
+/** Deduplicate recovery per session/revision and retry damaged logs with backoff. */
+export function scheduleTitleRecovery(work, onComplete) {
+    const retry = retries.get(work.id);
+    if (retry?.revision !== work.revision)
+        retries.delete(work.id);
+    else if (Date.now() < retry.retryAfter)
+        return;
+    const existing = pending.get(work.id) ?? (running?.id === work.id ? running : undefined);
+    if (existing?.revision === work.revision) {
+        if (onComplete !== undefined)
+            existing.listeners.add(onComplete);
+        return;
+    }
+    const listeners = new Set();
+    if (onComplete !== undefined)
+        listeners.add(onComplete);
+    pending.set(work.id, { ...work, listeners });
+    kick();
+}
+/** A queued or backed-off revision needs no path lookup on another open. */
+export function titleRecoveryNeedsWork(id, revision, onComplete) {
+    const existing = [pending.get(id), running?.id === id ? running : undefined]
+        .find(item => item?.revision === revision);
+    if (existing?.revision === revision) {
+        if (onComplete !== undefined)
+            existing.listeners.add(onComplete);
+        return false;
+    }
+    const retry = retries.get(id);
+    return retry?.revision !== revision || Date.now() >= retry.retryAfter;
+}

package/lib/types/dsh-adapter/sessions/store.d.ts

@@ -0,0 +1,60 @@
+import type { TitleSource } from './types.js';
+/** Cheap file generation check for asynchronous listing writes. */
+export declare function indexFileStamp(): string | undefined;
+/** Facts derived from a log at one revision. */
+export interface DerivedEntry {
+    readonly revision: string;
+    /** Artifact size at this observation; append growth can retain older title evidence. */
+    readonly bytes: number;
+    /** Last-write time observed with this revision, for the revision-only path. */
+    readonly modifiedAt: number | undefined;
+    /** Physical file identity; a replacement invalidates append-only evidence. */
+    readonly identity: string | undefined;
+    /** Old EOF neighborhood hash, paired with the backend's append-only contract. */
+    readonly anchor: string | undefined;
+    readonly title: string;
+    readonly titleSource: TitleSource;
+    /** False keeps the same revision eligible for another progressive attempt. */
+    readonly titleComplete: boolean;
+    readonly hasPrompt: boolean;
+    readonly model: string | undefined;
+    readonly label: string | undefined;
+}
+/** One session's cached record: derived facts plus this install's own notes. */
+export interface IndexEntry {
+    readonly derived: DerivedEntry | undefined;
+    /** Git branch this install was on when it last used the session. */
+    readonly branch: string | undefined;
+}
+/** The whole cache, session id → entry. */
+export type SessionIndex = Map<string, IndexEntry>;
+/**
+ * Load the cache.
+ * @returns The parsed index; version 3 derivations are upgraded lazily and
+ *   version 2 retains branch notes only.
+ */
+export declare function readIndex(): SessionIndex;
+/**
+ * Persist the cache, atomically.
+ *
+ * The write goes to a per-process temporary name and is renamed into place, so
+ * a reader never observes a half-written file and a crash never leaves one.
+ * A concurrent writer may win the rename; the loser's derivations are simply
+ * recomputed next time.
+ *
+ * @param index - The index to store. Entries are written in insertion order.
+ */
+export declare function writeIndex(index: SessionIndex): void;
+/**
+ * Record the git branch this install is on for a session.
+ *
+ * Kept here rather than in the log because it is not a fact about the session,
+ * it is a fact about how this machine used it — the same reason it is reported
+ * as "branch when last used" and omitted entirely for sessions that predate
+ * the note. Inventing a branch for them would be worse than showing none.
+ *
+ * @param sessionId - Session being used.
+ * @param branch - Current branch, or undefined to leave any note untouched.
+ */
+export declare function noteBranch(sessionId: string, branch: string | undefined): void;
+//# sourceMappingURL=store.d.ts.map

package/lib/types/dsh-adapter/sessions/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../../../src/dsh-adapter/sessions/store.ts"],"names":[],"mappings":"AAgCA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA;AAsB7C,mEAAmE;AACnE,wBAAgB,cAAc,IAAI,MAAM,GAAG,SAAS,CAEnD;AAED,gDAAgD;AAChD,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,wFAAwF;IACxF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,+EAA+E;IAC/E,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,SAAS,CAAA;IACvC,8EAA8E;IAC9E,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAA;IACrC,iFAAiF;IACjF,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAA;IACjC,8EAA8E;IAC9E,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAAA;CACnC;AAED,gFAAgF;AAChF,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,OAAO,EAAE,YAAY,GAAG,SAAS,CAAA;IAC1C,oEAAoE;IACpE,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAA;CACpC;AAED,2CAA2C;AAC3C,MAAM,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;AA0DlD;;;;GAIG;AACH,wBAAgB,SAAS,IAAI,YAAY,CAoCxC;AAED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CA0BpD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAO9E"}