@aiwayds/dsh-tui-pi 0.11.2 → 0.13.0

package/lib/usage.d.ts

@@ -0,0 +1,117 @@
+/**
+ * Slash-command / skill usage memory for frequency-sorted completions.
+ *
+ * Every successful command execution and every `/name` skill gesture bumps a
+ * per-name counter; the generic `/` completion dropdown orders candidates by
+ * that count (most used first) instead of plain name order, and the ordering
+ * survives the query filter (whatever remains after prefix filtering is still
+ * frequency-first).
+ *
+ * Persistence: `$DSH_HOME/tui-command-usage.json` — a small JSON document the
+ * TUI owns outright (it never touches settings.yaml or any other live dsh
+ * file). The disk copy is authoritative across restarts AND across /reload:
+ * the reload swaps the plugin fiber, a fresh tracker is constructed by the new
+ * fiber and simply re-reads the file. Reads never throw (a missing or corrupt
+ * file degrades to an empty table); writes are atomic (tmp sibling + rename)
+ * and best-effort silent — a failed write must never take the UI down.
+ *
+ * Write policy: synchronous save on every record, no timer/flush queue.
+ * Usage events are inherently low-frequency (one human-invoked command or
+ * skill at a time) and the file stays tiny (bounded by MAX_ENTRIES), so the
+ * simplicity of write-through beats batching — and avoids teardown hazards
+ * for timers across hot-reload. Concurrent dsh processes share one store:
+ * each write merges only its own unsaved delta onto a fresh read of the
+ * file (baseline+delta, see CommandUsageTracker.persist) instead of
+ * clobbering the whole table with this fiber's in-memory view.
+ */
+/** On-disk schema version; bump only for breaking changes. */
+export declare const USAGE_FILE_VERSION = 1;
+/** One name's usage record: how often + how recently it was invoked. */
+export interface UsageEntry {
+    /** Successful invocation count (>= 1 for every stored entry). */
+    count: number;
+    /** Epoch ms of the most recent invocation. */
+    lastUsed: number;
+}
+/** Name → count view handed to the completion sort (no recency exposed). */
+export type UsageSnapshot = ReadonlyMap<string, number>;
+/**
+ * Structural consumer contract so CommandService stays stub-friendly in
+ * tests (and decoupled from the concrete tracker's file concerns).
+ */
+export interface UsageRecorder {
+    /** Count one invocation of `name` (leading slash tolerated, stripped). */
+    record(name: string): void;
+    /** Current name → count table (may be empty). */
+    snapshot(): UsageSnapshot;
+}
+/** Storage cap: above this many names, lowest-count entries are evicted. */
+export declare const MAX_USAGE_ENTRIES = 500;
+/** `$DSH_HOME/tui-command-usage.json` (or an explicit home override). */
+export declare function commandUsagePath(home?: string): string;
+/**
+ * Read + validate a usage file into entries. Never throws: a missing,
+ * corrupt, wrong-version or malformed document yields an empty table.
+ * Individual bad entries are skipped, good siblings kept.
+ */
+export declare function loadUsageEntries(path: string): Map<string, UsageEntry>;
+/**
+ * Atomically persist entries as `{ version, counts }`. Creates the target
+ * directory when missing (a fresh DSH_HOME must not silently drop the first
+ * record), writes a tmp sibling then renames over the target so a crash
+ * never leaves half a file; on any failure the tmp sibling is cleaned up and
+ * the error swallowed (the caller treats persistence as best-effort — the
+ * in-memory table keeps working). Returns whether the write landed.
+ */
+export declare function saveUsageEntries(path: string, entries: ReadonlyMap<string, UsageEntry>): boolean;
+/**
+ * Evict entries beyond `maxEntries`, lowest count first, oldest use first
+ * among equal counts. A freshly recorded entry always survives within its
+ * count tier (its lastUsed is the newest of that tier).
+ */
+export declare function pruneUsageEntries(entries: Map<string, UsageEntry>, maxEntries?: number): void;
+/**
+ * In-memory usage table persisted through `path`. Constructed once per
+ * plugin fiber (so a /reload re-reads the authoritative disk state) and
+ * shared by the CommandService for both recording and completion sorting.
+ *
+ * Several dsh processes can run concurrently against the same $DSH_HOME, so
+ * persistence is baseline+delta instead of whole-table clobber: the tracker
+ * remembers what the file looked like at its last synchronization and each
+ * write folds only its own unsaved increments on top of a fresh read of the
+ * file (see `persist`).
+ */
+export declare class CommandUsageTracker implements UsageRecorder {
+    private readonly path;
+    private readonly maxEntries;
+    private readonly now;
+    /** Working table, including this fiber's not-yet-flushed increments. */
+    private entries;
+    /** Per-name counts the file had at the last successful sync — the delta zero-point. */
+    private baseline;
+    constructor(path: string, options?: {
+        maxEntries?: number;
+        now?: () => number;
+    });
+    /** Count one invocation of `name` and persist synchronously (best-effort). */
+    record(name: string): void;
+    /** Current name → count table for the completion sort. */
+    snapshot(): UsageSnapshot;
+    /**
+     * Fold this fiber's unsaved delta onto a fresh read of the file and write
+     * the union back atomically.
+     *
+     * Per-name arithmetic is `file_count + (memory_count - baseline_count)`
+     * clamped at zero: plain max() would drop this fiber's unsaved increments,
+     * blind summing would double-count what this fiber already flushed. An
+     * entry this fiber pruned away contributes a zero delta, so peer-process
+     * counts survive untouched.
+     *
+     * Loss model: the read-modify-write below is deliberately not locked —
+     * another process writing between our read and our rename loses exactly
+     * that one concurrent record (bounded, single-record granularity; accepted
+     * for a UX-ordering hint). If the file is unreadable/corrupt at read time,
+     * the merge degrades to this fiber's own table for that pass.
+     */
+    private persist;
+}

package/lib/usage.js

@@ -0,0 +1,220 @@
+/**
+ * Slash-command / skill usage memory for frequency-sorted completions.
+ *
+ * Every successful command execution and every `/name` skill gesture bumps a
+ * per-name counter; the generic `/` completion dropdown orders candidates by
+ * that count (most used first) instead of plain name order, and the ordering
+ * survives the query filter (whatever remains after prefix filtering is still
+ * frequency-first).
+ *
+ * Persistence: `$DSH_HOME/tui-command-usage.json` — a small JSON document the
+ * TUI owns outright (it never touches settings.yaml or any other live dsh
+ * file). The disk copy is authoritative across restarts AND across /reload:
+ * the reload swaps the plugin fiber, a fresh tracker is constructed by the new
+ * fiber and simply re-reads the file. Reads never throw (a missing or corrupt
+ * file degrades to an empty table); writes are atomic (tmp sibling + rename)
+ * and best-effort silent — a failed write must never take the UI down.
+ *
+ * Write policy: synchronous save on every record, no timer/flush queue.
+ * Usage events are inherently low-frequency (one human-invoked command or
+ * skill at a time) and the file stays tiny (bounded by MAX_ENTRIES), so the
+ * simplicity of write-through beats batching — and avoids teardown hazards
+ * for timers across hot-reload. Concurrent dsh processes share one store:
+ * each write merges only its own unsaved delta onto a fresh read of the
+ * file (baseline+delta, see CommandUsageTracker.persist) instead of
+ * clobbering the whole table with this fiber's in-memory view.
+ */
+import { mkdirSync, readFileSync, renameSync, rmSync, writeFileSync } from 'node:fs';
+import { dirname, join } from 'node:path';
+import { dshHome } from "./append-system.js";
+/** On-disk schema version; bump only for breaking changes. */
+export const USAGE_FILE_VERSION = 1;
+/** Storage cap: above this many names, lowest-count entries are evicted. */
+export const MAX_USAGE_ENTRIES = 500;
+/** `$DSH_HOME/tui-command-usage.json` (or an explicit home override). */
+export function commandUsagePath(home = dshHome()) {
+    return join(home, 'tui-command-usage.json');
+}
+/** Normalize one usage key: completion-name form (no leading slashes), non-empty. */
+function normalizeUsageName(name) {
+    const key = name.replace(/^\/+/, '');
+    return key === '' ? undefined : key;
+}
+/**
+ * Read + validate a usage file into entries. Never throws: a missing,
+ * corrupt, wrong-version or malformed document yields an empty table.
+ * Individual bad entries are skipped, good siblings kept.
+ */
+export function loadUsageEntries(path) {
+    const empty = new Map();
+    let text;
+    try {
+        text = readFileSync(path, 'utf8');
+    }
+    catch {
+        return empty;
+    }
+    let raw;
+    try {
+        raw = JSON.parse(text);
+    }
+    catch {
+        return empty;
+    }
+    if (raw === null || typeof raw !== 'object' || Array.isArray(raw))
+        return empty;
+    const doc = raw;
+    if (doc.version !== USAGE_FILE_VERSION)
+        return empty;
+    const counts = doc.counts;
+    if (counts === null || typeof counts !== 'object' || Array.isArray(counts))
+        return empty;
+    const entries = new Map();
+    for (const [name, value] of Object.entries(counts)) {
+        const key = normalizeUsageName(name);
+        if (key === undefined || value === null || typeof value !== 'object')
+            continue;
+        const { count, lastUsed } = value;
+        if (typeof count !== 'number' || !Number.isInteger(count) || count <= 0)
+            continue;
+        entries.set(key, {
+            count,
+            lastUsed: typeof lastUsed === 'number' && Number.isFinite(lastUsed) && lastUsed >= 0 ? lastUsed : 0,
+        });
+    }
+    return entries;
+}
+/**
+ * Atomically persist entries as `{ version, counts }`. Creates the target
+ * directory when missing (a fresh DSH_HOME must not silently drop the first
+ * record), writes a tmp sibling then renames over the target so a crash
+ * never leaves half a file; on any failure the tmp sibling is cleaned up and
+ * the error swallowed (the caller treats persistence as best-effort — the
+ * in-memory table keeps working). Returns whether the write landed.
+ */
+export function saveUsageEntries(path, entries) {
+    const doc = {
+        version: USAGE_FILE_VERSION,
+        counts: Object.fromEntries(entries),
+    };
+    const dir = dirname(path);
+    const pathBase = path.split('/').pop() ?? 'tui-command-usage.json';
+    const tmp = join(dir, `.${pathBase}.tmp-${process.pid}`);
+    try {
+        mkdirSync(dir, { recursive: true });
+        writeFileSync(tmp, JSON.stringify(doc));
+        renameSync(tmp, path);
+        return true;
+    }
+    catch {
+        // A failed write/rename can leave the `.…tmp-<pid>` sibling behind; clean
+        // up so no stray dotfile accumulates next to the store.
+        try {
+            rmSync(tmp, { force: true });
+        }
+        catch {
+            // Best-effort — persistence failures stay silent by design.
+        }
+        return false;
+    }
+}
+/**
+ * Evict entries beyond `maxEntries`, lowest count first, oldest use first
+ * among equal counts. A freshly recorded entry always survives within its
+ * count tier (its lastUsed is the newest of that tier).
+ */
+export function pruneUsageEntries(entries, maxEntries = MAX_USAGE_ENTRIES) {
+    if (entries.size <= maxEntries)
+        return;
+    const ordered = [...entries.entries()].sort((a, b) => a[1].count - b[1].count || a[1].lastUsed - b[1].lastUsed);
+    for (let i = 0; i < ordered.length - maxEntries; i++)
+        entries.delete(ordered[i][0]);
+}
+/**
+ * In-memory usage table persisted through `path`. Constructed once per
+ * plugin fiber (so a /reload re-reads the authoritative disk state) and
+ * shared by the CommandService for both recording and completion sorting.
+ *
+ * Several dsh processes can run concurrently against the same $DSH_HOME, so
+ * persistence is baseline+delta instead of whole-table clobber: the tracker
+ * remembers what the file looked like at its last synchronization and each
+ * write folds only its own unsaved increments on top of a fresh read of the
+ * file (see `persist`).
+ */
+export class CommandUsageTracker {
+    path;
+    maxEntries;
+    now;
+    /** Working table, including this fiber's not-yet-flushed increments. */
+    entries;
+    /** Per-name counts the file had at the last successful sync — the delta zero-point. */
+    baseline;
+    constructor(path, options) {
+        this.path = path;
+        this.maxEntries = Math.max(1, options?.maxEntries ?? MAX_USAGE_ENTRIES);
+        this.now = options?.now ?? Date.now;
+        const loaded = loadUsageEntries(path);
+        // Deep-copy into `entries`: record() mutates entry objects in place and
+        // must never disturb the frozen baseline. A hand-edited or pre-cap file
+        // may exceed the cap — normalize the working set on load.
+        this.entries = new Map([...loaded].map(([key, entry]) => [key, { ...entry }]));
+        this.baseline = loaded;
+        pruneUsageEntries(this.entries, this.maxEntries);
+    }
+    /** Count one invocation of `name` and persist synchronously (best-effort). */
+    record(name) {
+        const key = normalizeUsageName(name);
+        if (key === undefined)
+            return;
+        const entry = this.entries.get(key) ?? { count: 0, lastUsed: 0 };
+        entry.count += 1;
+        entry.lastUsed = this.now();
+        this.entries.set(key, entry);
+        this.persist();
+    }
+    /** Current name → count table for the completion sort. */
+    snapshot() {
+        return new Map([...this.entries].map(([name, entry]) => [name, entry.count]));
+    }
+    /**
+     * Fold this fiber's unsaved delta onto a fresh read of the file and write
+     * the union back atomically.
+     *
+     * Per-name arithmetic is `file_count + (memory_count - baseline_count)`
+     * clamped at zero: plain max() would drop this fiber's unsaved increments,
+     * blind summing would double-count what this fiber already flushed. An
+     * entry this fiber pruned away contributes a zero delta, so peer-process
+     * counts survive untouched.
+     *
+     * Loss model: the read-modify-write below is deliberately not locked —
+     * another process writing between our read and our rename loses exactly
+     * that one concurrent record (bounded, single-record granularity; accepted
+     * for a UX-ordering hint). If the file is unreadable/corrupt at read time,
+     * the merge degrades to this fiber's own table for that pass.
+     */
+    persist() {
+        const disk = loadUsageEntries(this.path);
+        const merged = new Map();
+        for (const key of new Set([...disk.keys(), ...this.entries.keys()])) {
+            const mine = this.entries.get(key);
+            const baseCount = this.baseline.get(key)?.count ?? 0;
+            const delta = Math.max(0, (mine?.count ?? 0) - baseCount);
+            const theirs = disk.get(key);
+            if (theirs === undefined && delta === 0)
+                continue;
+            merged.set(key, {
+                count: (theirs?.count ?? 0) + delta,
+                lastUsed: Math.max(theirs?.lastUsed ?? 0, mine?.lastUsed ?? 0),
+            });
+        }
+        pruneUsageEntries(merged, this.maxEntries);
+        if (!saveUsageEntries(this.path, merged))
+            return;
+        // Success: the written table becomes both the working set and the new
+        // delta zero-point. `entries` gets its own copies so later in-place
+        // record mutations leave the frozen baseline intact.
+        this.baseline = merged;
+        this.entries = new Map([...merged].map(([key, entry]) => [key, { ...entry }]));
+    }
+}
+//# sourceMappingURL=usage.js.map

package/lib/usage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"usage.js","sourceRoot":"","sources":["../src/usage.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AACpF,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACzC,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAE5C,8DAA8D;AAC9D,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAA;AAwBnC,4EAA4E;AAC5E,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAEpC,yEAAyE;AACzE,MAAM,UAAU,gBAAgB,CAAC,OAAe,OAAO,EAAE;IACvD,OAAO,IAAI,CAAC,IAAI,EAAE,wBAAwB,CAAC,CAAA;AAC7C,CAAC;AAED,qFAAqF;AACrF,SAAS,kBAAkB,CAAC,IAAY;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;IACpC,OAAO,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAA;AACrC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAA;IAC3C,IAAI,IAAY,CAAA;IAChB,IAAI,CAAC;QACH,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACnC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,GAAY,CAAA;IAChB,IAAI,CAAC;QACH,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IAC/E,MAAM,GAAG,GAAG,GAA8C,CAAA;IAC1D,IAAI,GAAG,CAAC,OAAO,KAAK,kBAAkB;QAAE,OAAO,KAAK,CAAA;IACpD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAA;IACzB,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,OAAO,KAAK,CAAA;IACxF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAA;IAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAiC,CAAC,EAAE,CAAC;QAC9E,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,GAAG,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;YAAE,SAAQ;QAC9E,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,KAAgD,CAAA;QAC5E,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC;YAAE,SAAQ;QACjF,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE;YACf,KAAK;YACL,QAAQ,EAAE,OAAO,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACpG,CAAC,CAAA;IACJ,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY,EAAE,OAAwC;IACrF,MAAM,GAAG,GAAG;QACV,OAAO,EAAE,kBAAkB;QAC3B,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC;KACpC,CAAA;IACD,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,wBAAwB,CAAA;IAClE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,IAAI,QAAQ,QAAQ,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;IACxD,IAAI,CAAC;QACH,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;QACnC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAA;QACvC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QACrB,OAAO,IAAI,CAAA;IACb,CAAC;IAAC,MAAM,CAAC;QACP,0EAA0E;QAC1E,wDAAwD;QACxD,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;QAC9B,CAAC;QAAC,MAAM,CAAC;YACP,4DAA4D;QAC9D,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAAgC,EAChC,aAAqB,iBAAiB;IAEtC,IAAI,OAAO,CAAC,IAAI,IAAI,UAAU;QAAE,OAAM;IACtC,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CACzC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CACnE,CAAA;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrF,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,mBAAmB;IACb,IAAI,CAAQ;IACZ,UAAU,CAAQ;IAClB,GAAG,CAAc;IAClC,wEAAwE;IAChE,OAAO,CAAyB;IACxC,uFAAuF;IAC/E,QAAQ,CAAyB;IAEzC,YAAY,IAAY,EAAE,OAAqD;QAC7E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,IAAI,iBAAiB,CAAC,CAAA;QACvE,IAAI,CAAC,GAAG,GAAG,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAA;QACnC,MAAM,MAAM,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAA;QACrC,wEAAwE;QACxE,wEAAwE;QACxE,0DAA0D;QAC1D,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;QAC9E,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAA;QACtB,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;IAClD,CAAC;IAED,8EAA8E;IAC9E,MAAM,CAAC,IAAY;QACjB,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAM;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;QAChE,KAAK,CAAC,KAAK,IAAI,CAAC,CAAA;QAChB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAA;IAChB,CAAC;IAED,0DAA0D;IAC1D,QAAQ;QACN,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAC/E,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACK,OAAO;QACb,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAA;QAC5C,KAAK,MAAM,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACpE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAClC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;YACpD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAA;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAC5B,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,KAAK,CAAC;gBAAE,SAAQ;YACjD,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;gBACd,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK;gBACnC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,IAAI,CAAC,CAAC;aAC/D,CAAC,CAAA;QACJ,CAAC;QACD,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QAC1C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;YAAE,OAAM;QAChD,sEAAsE;QACtE,oEAAoE;QACpE,qDAAqD;QACrD,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAA;QACtB,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;IAChF,CAAC;CACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@aiwayds/dsh-tui-pi",
-  "version": "0.11.2",
+  "version": "0.13.0",
   "description": "pi-style terminal UI for DeepSeek Harness (dsh) — pi-tui look & feel, dsh slash commands, GitHub light/dark themes, powerline footer",
   "repository": {
     "type": "git",
@@ -46,7 +46,7 @@
   },
   "dependencies": {
     "@aiwayds/dsh-dcp": "0.5.1",
-    "@aiwayds/dsh-subagent-registry": "0.2.0",
+    "@aiwayds/dsh-subagent-registry": "0.3.0",
     "@earendil-works/pi-tui": "0.84.2"
   },
   "devDependencies": {