@ai-setting/roy-plugin-task-show 2.0.0 → 2.0.2

package/dist/file-tree.d.ts

@@ -0,0 +1,184 @@
+/**
+ * @fileoverview File tree data layer (v2.0.0).
+ *
+ * Pure functions that turn a flat list of git-tracked paths into a
+ * hierarchical tree suitable for the per-task detail page sidebar.
+ *
+ * Design context: see the Feishu design doc (`roy-plugin-task-show
+ * v2.0.0 设计方案`) §2.3 文件树组件 and §5.1 关键组件拆分. We keep
+ * the data layer framework-free so the SSR side can serialize it as
+ * a `data-files` JSON attribute on the sidebar container and the
+ * client (`public/file-tree.js`) can hydrate the rendered DOM.
+ *
+ * Conventions:
+ *   - Paths use forward slashes (POSIX). Git always emits `/`.
+ *   - Paths are relative to the repo root (the worktree). No leading
+ *     `/`. The frontend never sees the absolute filesystem path.
+ *   - Tree nodes carry enough metadata for the renderer to decide
+ *     highlight / collapse / scroll behaviour without a second pass.
+ *
+ * The renderer side (vanilla JS in `public/file-tree.js`) handles:
+ *   - chevron toggle (▶ / ▼),
+ *   - default expansion depth = 2,
+ *   - keyboard navigation (↑ / ↓ / Enter),
+ *   - scroll-into-view when a mermaid node is clicked.
+ *
+ * The data side (this file) handles:
+ *   - nesting,
+ *   - sorting (directories first, then alphabetical),
+ *   - dedup,
+ *   - lookup helpers (find by path, collect all paths).
+ */
+/**
+ * A single node in the file tree.
+ *
+ * `type` distinguishes leaves (files) from interior nodes (directories)
+ * so the renderer can pick the right glyph + click handler without
+ * inspecting `children`.
+ *
+ * `depth` is the 0-indexed level relative to the tree root. Roots are
+ * always depth 0, even if the input path is `"a/b/c.ts"` (the `a`
+ * directory becomes a depth-0 root).
+ */
+export interface TreeNode {
+    /** Basename (last path segment). */
+    name: string;
+    /** Full path with `/` separators, identical to the input. */
+    path: string;
+    /** `"file"` for leaves, `"directory"` for interior nodes. */
+    type: "file" | "directory";
+    /** 0-indexed depth from the tree root. */
+    depth: number;
+    /** Empty for leaves. Always defined (possibly empty) for directories. */
+    children: TreeNode[];
+    /**
+     * v2.0.0 highlight flag, set by the caller (the per-task renderer)
+     * to indicate the file is touched by the currently-selected tool
+     * call. The data layer never sets it.
+     */
+    highlighted?: boolean;
+}
+/**
+ * Threshold above which the renderer switches to windowed virtualization.
+ *
+ * 500 was chosen because it's the inflection point where most browsers
+ * start to lag on `scrollIntoView` + addEventListener for the whole
+ * tree. We surface the constant so tests can lock it down and the
+ * renderer side can import the same value without duplication.
+ */
+export declare const MAX_NODES_BEFORE_VIRTUAL = 500;
+/**
+ * Build a nested tree from a flat list of paths.
+ *
+ * Behaviour:
+ *   - Empty input → `[]`.
+ *   - Duplicate paths → silently deduped.
+ *   - Sorting at every level: directories first, then alphabetical
+ *     by basename (case-sensitive, identical to git's default sort).
+ *   - The `path` field on each node is the full slash-joined path.
+ *
+ * Complexity: O(N * D) where N is the number of paths and D is the
+ * average depth. We use a `Map` keyed by path to avoid O(N²) lookups
+ * during tree assembly.
+ */
+export declare function buildFileTree(paths: readonly string[]): TreeNode[];
+/**
+ * Extract the set of files referenced by an array of tool-call records.
+ *
+ * Mirrors `extractArgPath()` but returns ALL paths (not just the first
+ * match), deduped. Used by the renderer to compute the "highlight"
+ * set for the file-tree sidebar.
+ *
+ * Inputs are typed loosely so the function is callable from both the
+ * SSR side (where we have `ToolCallRecord[]`) and tests (where we
+ * usually pass `{ args: { file_path: "..." } }` shims).
+ */
+export declare function extractAffectedPaths(toolCalls: ReadonlyArray<{
+    args?: Record<string, unknown>;
+}>): string[];
+/**
+ * Find a node by its full path. Returns null when the path doesn't
+ * appear in the tree. Performs a depth-first walk — acceptable because
+ * the renderer only calls this when a mermaid node is clicked (one
+ * lookup per click), and the tree depth is bounded by typical repo
+ * depth (≤ 10 levels).
+ */
+export declare function findNodeByPath(roots: readonly TreeNode[], target: string): TreeNode | null;
+/**
+ * Collect every leaf (file) path from the tree, in DFS pre-order.
+ * Used by the keyboard-search index — the renderer keeps a flat array
+ * so search-by-prefix is O(N) over a reasonable file count.
+ */
+export declare function collectAllPaths(roots: readonly TreeNode[]): string[];
+/**
+ * Subset of `child_process` we use. Inlined here so tests can pass a
+ * fake `runner` without importing `node:child_process`.
+ */
+export interface GitRunner {
+    (args: readonly string[], opts?: {
+        cwd?: string;
+    }): {
+        stdout: string;
+        stderr: string;
+        status: number;
+    };
+}
+/**
+ * Default runner: shells out to `git ls-files` via the system PATH.
+ * Uses `-z` to NUL-separate paths so filenames with embedded newlines
+ * survive the round-trip, AND `--full-name` so paths are emitted
+ * relative to the worktree / repo root (NOT the current working
+ * directory). This keeps the file-tree stable when the plugin is
+ * started from a subdirectory — important because `args.file_path`
+ * from the host typically uses worktree-root-relative paths.
+ *
+ * On non-zero exit (e.g. cwd is not a git repo) returns `stdout: ""`
+ * so callers can degrade gracefully — the file-tree panel renders
+ * empty rather than blowing up the page.
+ */
+export declare const defaultGitLsFilesRunner: GitRunner;
+/**
+ * Run `git ls-files` and return the parsed file list.
+ *
+ * Behaviour:
+ *   - Splits on NUL (the `-z` separator).
+ *   - Filters out empty segments.
+ *   - On non-zero exit (not a git repo, git missing) returns `[]`
+ *     instead of throwing — the renderer should still render an
+ *     empty (but valid) tree.
+ *   - Honors a 30-second in-memory cache keyed by cwd. This keeps
+ *     SSR renders cheap — without it every page refresh would
+ *     spawn `git` synchronously. The cache is bounded to 8 entries
+ *     (FIFO drop). Exported as a separate `fileTreeCacheTestOnly`
+ *     getter for test injection; production callers should never
+ *     touch the cache directly.
+ *
+ * The runner is injected so tests can swap it for a fake; production
+ * callers pass `defaultGitLsFilesRunner`.
+ */
+export declare function gitLsFiles(runner?: GitRunner, opts?: {
+    cwd?: string;
+}): string[];
+/**
+ * In-memory TTL cache used by `gitLsFiles()`. Exported as a const so
+ * tests can clear it between cases; production callers should never
+ * touch it directly.
+ */
+export declare const fileTreeCache: Map<string, {
+    files: string[];
+    at: number;
+}>;
+/** v2.0.0 TTL: 30s — same window as the SSE stale cache. */
+export declare const FILE_TREE_CACHE_TTL_MS = 30000;
+/** v2.0.0 max cached cwds (worktree + main + a few tests). */
+export declare const FILE_TREE_CACHE_MAX = 8;
+/**
+ * Parse the raw output of `git ls-files -z`. Public so the server-side
+ * cache layer (and tests) can re-parse a captured snapshot without
+ * re-spawning git.
+ *
+ * `git ls-files -z` emits paths separated by NUL bytes; the very last
+ * segment has no trailing NUL. We split on NUL and drop empties.
+ */
+export declare function parseLsFiles(raw: string): string[];
+//# sourceMappingURL=file-tree.d.ts.map

package/dist/file-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-tree.d.ts","sourceRoot":"","sources":["../src/file-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH;;;;;;;;;;GAUG;AACH,MAAM,WAAW,QAAQ;IACvB,oCAAoC;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,6DAA6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb,6DAA6D;IAC7D,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC;IAC3B,0CAA0C;IAC1C,KAAK,EAAE,MAAM,CAAC;IACd,yEAAyE;IACzE,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,wBAAwB,MAAM,CAAC;AAkB5C;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,EAAE,CAmElE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAClC,SAAS,EAAE,aAAa,CAAC;IAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,CAAC,GAC3D,MAAM,EAAE,CAcV;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,QAAQ,EAAE,EAC1B,MAAM,EAAE,MAAM,GACb,QAAQ,GAAG,IAAI,CAOjB;AAWD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,GAAG,MAAM,EAAE,CAIpE;AAQD;;;GAGG;AACH,MAAM,WAAW,SAAS;IACxB,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG;QAClD,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC;CACH;AAED;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,uBAAuB,EAAE,SAiBrC,CAAC;AAEF;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,UAAU,CACxB,MAAM,GAAE,SAAmC,EAC3C,IAAI,CAAC,EAAE;IAAE,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,GACtB,MAAM,EAAE,CAgCV;AAED;;;;GAIG;AACH,eAAO,MAAM,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAC5D,CAAC;AAEZ,4DAA4D;AAC5D,eAAO,MAAM,sBAAsB,QAAS,CAAC;AAE7C,8DAA8D;AAC9D,eAAO,MAAM,mBAAmB,IAAI,CAAC;AAErC;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CASlD"}

package/dist/file-tree.js

@@ -0,0 +1,377 @@
+/**
+ * @fileoverview File tree data layer (v2.0.0).
+ *
+ * Pure functions that turn a flat list of git-tracked paths into a
+ * hierarchical tree suitable for the per-task detail page sidebar.
+ *
+ * Design context: see the Feishu design doc (`roy-plugin-task-show
+ * v2.0.0 设计方案`) §2.3 文件树组件 and §5.1 关键组件拆分. We keep
+ * the data layer framework-free so the SSR side can serialize it as
+ * a `data-files` JSON attribute on the sidebar container and the
+ * client (`public/file-tree.js`) can hydrate the rendered DOM.
+ *
+ * Conventions:
+ *   - Paths use forward slashes (POSIX). Git always emits `/`.
+ *   - Paths are relative to the repo root (the worktree). No leading
+ *     `/`. The frontend never sees the absolute filesystem path.
+ *   - Tree nodes carry enough metadata for the renderer to decide
+ *     highlight / collapse / scroll behaviour without a second pass.
+ *
+ * The renderer side (vanilla JS in `public/file-tree.js`) handles:
+ *   - chevron toggle (▶ / ▼),
+ *   - default expansion depth = 2,
+ *   - keyboard navigation (↑ / ↓ / Enter),
+ *   - scroll-into-view when a mermaid node is clicked.
+ *
+ * The data side (this file) handles:
+ *   - nesting,
+ *   - sorting (directories first, then alphabetical),
+ *   - dedup,
+ *   - lookup helpers (find by path, collect all paths).
+ */
+/**
+ * Threshold above which the renderer switches to windowed virtualization.
+ *
+ * 500 was chosen because it's the inflection point where most browsers
+ * start to lag on `scrollIntoView` + addEventListener for the whole
+ * tree. We surface the constant so tests can lock it down and the
+ * renderer side can import the same value without duplication.
+ */
+export const MAX_NODES_BEFORE_VIRTUAL = 500;
+/**
+ * Canonical alias list for "the path-like field in a tool call args".
+ *
+ * Matches `extractArgPath()` in `src/server.ts:1095` — keep them in sync.
+ * If you add a new alias, add it here AND in the server-side helper AND
+ * update `test/server-extract-arg-path.test.ts` if we add one.
+ */
+const PATH_KEY_ALIASES = [
+    "file_path",
+    "filepath",
+    "path",
+    "target_file",
+    "uri",
+    "filename",
+];
+/**
+ * Build a nested tree from a flat list of paths.
+ *
+ * Behaviour:
+ *   - Empty input → `[]`.
+ *   - Duplicate paths → silently deduped.
+ *   - Sorting at every level: directories first, then alphabetical
+ *     by basename (case-sensitive, identical to git's default sort).
+ *   - The `path` field on each node is the full slash-joined path.
+ *
+ * Complexity: O(N * D) where N is the number of paths and D is the
+ * average depth. We use a `Map` keyed by path to avoid O(N²) lookups
+ * during tree assembly.
+ */
+export function buildFileTree(paths) {
+    if (paths.length === 0)
+        return [];
+    // Dedupe (preserve first occurrence's order).
+    const seen = new Set();
+    const unique = [];
+    for (const p of paths) {
+        if (typeof p !== "string" || p.length === 0)
+            continue;
+        if (seen.has(p))
+            continue;
+        seen.add(p);
+        unique.push(p);
+    }
+    if (unique.length === 0)
+        return [];
+    // Mutable root map keyed by full path. Each entry is the in-progress
+    // TreeNode; we'll freeze the structure at the end.
+    const nodeMap = new Map();
+    for (const fullPath of unique) {
+        const segments = fullPath.split("/");
+        let acc = "";
+        for (let i = 0; i < segments.length; i++) {
+            const seg = segments[i];
+            acc = acc.length === 0 ? seg : `${acc}/${seg}`;
+            const isLeaf = i === segments.length - 1;
+            let existing = nodeMap.get(acc);
+            if (!existing) {
+                existing = {
+                    name: seg,
+                    path: acc,
+                    type: isLeaf ? "file" : "directory",
+                    depth: 0, // fixed up below
+                    children: [],
+                };
+                nodeMap.set(acc, existing);
+                // Attach to parent (unless we're at the root level).
+                if (i > 0) {
+                    const parentPath = segments.slice(0, i).join("/");
+                    const parent = nodeMap.get(parentPath);
+                    if (parent)
+                        parent.children.push(existing);
+                }
+            }
+            else if (isLeaf && existing.type === "directory") {
+                // A previous iteration registered this node as a directory
+                // (because we saw a child first). Promote it to file? No —
+                // git can't track both a file and a directory at the same
+                // path. Keep the directory shape and treat the leaf as a
+                // no-op duplicate. This matches `git ls-tree` semantics.
+            }
+        }
+    }
+    // Roots are every node whose path has no parent in the map.
+    const roots = [];
+    for (const node of nodeMap.values()) {
+        const parentPath = parentPathOf(node.path);
+        if (parentPath === null || !nodeMap.has(parentPath)) {
+            roots.push(node);
+        }
+    }
+    // Recursively set depth + sort children.
+    for (const root of roots)
+        fixDepthAndSort(root, 0);
+    // Final pass: sort the root array too (mirrors inner-level rules).
+    sortNodes(roots);
+    return roots;
+}
+/**
+ * Extract the set of files referenced by an array of tool-call records.
+ *
+ * Mirrors `extractArgPath()` but returns ALL paths (not just the first
+ * match), deduped. Used by the renderer to compute the "highlight"
+ * set for the file-tree sidebar.
+ *
+ * Inputs are typed loosely so the function is callable from both the
+ * SSR side (where we have `ToolCallRecord[]`) and tests (where we
+ * usually pass `{ args: { file_path: "..." } }` shims).
+ */
+export function extractAffectedPaths(toolCalls) {
+    const out = [];
+    const seen = new Set();
+    for (const tc of toolCalls) {
+        const args = tc?.args ?? {};
+        for (const key of PATH_KEY_ALIASES) {
+            const v = args[key];
+            if (typeof v === "string" && v.length > 0 && !seen.has(v)) {
+                seen.add(v);
+                out.push(v);
+            }
+        }
+    }
+    return out;
+}
+/**
+ * Find a node by its full path. Returns null when the path doesn't
+ * appear in the tree. Performs a depth-first walk — acceptable because
+ * the renderer only calls this when a mermaid node is clicked (one
+ * lookup per click), and the tree depth is bounded by typical repo
+ * depth (≤ 10 levels).
+ */
+export function findNodeByPath(roots, target) {
+    if (!target)
+        return null;
+    for (const root of roots) {
+        const hit = findNodeByPathInSubtree(root, target);
+        if (hit)
+            return hit;
+    }
+    return null;
+}
+function findNodeByPathInSubtree(node, target) {
+    if (node.path === target)
+        return node;
+    for (const child of node.children) {
+        const hit = findNodeByPathInSubtree(child, target);
+        if (hit)
+            return hit;
+    }
+    return null;
+}
+/**
+ * Collect every leaf (file) path from the tree, in DFS pre-order.
+ * Used by the keyboard-search index — the renderer keeps a flat array
+ * so search-by-prefix is O(N) over a reasonable file count.
+ */
+export function collectAllPaths(roots) {
+    const out = [];
+    for (const root of roots)
+        collectAllPathsInner(root, out);
+    return out;
+}
+// ---------------------------------------------------------------------------
+// Git integration
+// ---------------------------------------------------------------------------
+import { spawnSync } from "node:child_process";
+/**
+ * Default runner: shells out to `git ls-files` via the system PATH.
+ * Uses `-z` to NUL-separate paths so filenames with embedded newlines
+ * survive the round-trip, AND `--full-name` so paths are emitted
+ * relative to the worktree / repo root (NOT the current working
+ * directory). This keeps the file-tree stable when the plugin is
+ * started from a subdirectory — important because `args.file_path`
+ * from the host typically uses worktree-root-relative paths.
+ *
+ * On non-zero exit (e.g. cwd is not a git repo) returns `stdout: ""`
+ * so callers can degrade gracefully — the file-tree panel renders
+ * empty rather than blowing up the page.
+ */
+export const defaultGitLsFilesRunner = (args, opts) => {
+    // v2.0.2 fix: replaced lazy require() with top-level import.
+    // The previous `require("node:child_process")` invocation failed
+    // in Node.js ESM scope (`ReferenceError: require is not defined`).
+    // The throw was swallowed by `gitLsFiles()`'s try/catch, so the
+    // file-tree panel silently rendered "No git-tracked files" forever.
+    // See Task #2682 Bug 1.
+    const result = spawnSync("git", ["ls-files", "-z", "--full-name", ...args], {
+        cwd: opts?.cwd ?? process.cwd(),
+        encoding: "utf8",
+        maxBuffer: 32 * 1024 * 1024,
+    });
+    return {
+        stdout: typeof result.stdout === "string" ? result.stdout : "",
+        stderr: typeof result.stderr === "string" ? result.stderr : "",
+        status: result.status ?? 0,
+    };
+};
+/**
+ * Run `git ls-files` and return the parsed file list.
+ *
+ * Behaviour:
+ *   - Splits on NUL (the `-z` separator).
+ *   - Filters out empty segments.
+ *   - On non-zero exit (not a git repo, git missing) returns `[]`
+ *     instead of throwing — the renderer should still render an
+ *     empty (but valid) tree.
+ *   - Honors a 30-second in-memory cache keyed by cwd. This keeps
+ *     SSR renders cheap — without it every page refresh would
+ *     spawn `git` synchronously. The cache is bounded to 8 entries
+ *     (FIFO drop). Exported as a separate `fileTreeCacheTestOnly`
+ *     getter for test injection; production callers should never
+ *     touch the cache directly.
+ *
+ * The runner is injected so tests can swap it for a fake; production
+ * callers pass `defaultGitLsFilesRunner`.
+ */
+export function gitLsFiles(runner = defaultGitLsFilesRunner, opts) {
+    const cwd = opts?.cwd ?? (typeof process !== "undefined" ? process.cwd() : "");
+    const cacheKey = cwd ? `filetree:${cwd}` : "filetree:";
+    const now = Date.now();
+    const cached = fileTreeCache.get(cacheKey);
+    if (cached && now - cached.at < FILE_TREE_CACHE_TTL_MS) {
+        return cached.files;
+    }
+    let stdout;
+    let status;
+    try {
+        const result = runner([], opts);
+        stdout = result.stdout;
+        status = result.status;
+    }
+    catch {
+        return cached ? cached.files : [];
+    }
+    // Only cache successful results — failures (status != 0) are
+    // transient and we want the next caller to be able to retry. This
+    // also prevents the cache from being poisoned by a test that
+    // intentionally returns a fake failure.
+    if (status !== 0)
+        return cached ? cached.files : [];
+    const files = parseLsFiles(stdout);
+    // FIFO bound — drop oldest entry if we'd exceed the cap.
+    if (fileTreeCache.size >= FILE_TREE_CACHE_MAX) {
+        const firstKey = fileTreeCache.keys().next().value;
+        if (firstKey !== undefined && firstKey !== cacheKey) {
+            fileTreeCache.delete(firstKey);
+        }
+    }
+    fileTreeCache.set(cacheKey, { files, at: now });
+    return files;
+}
+/**
+ * In-memory TTL cache used by `gitLsFiles()`. Exported as a const so
+ * tests can clear it between cases; production callers should never
+ * touch it directly.
+ */
+export const fileTreeCache = new Map();
+/** v2.0.0 TTL: 30s — same window as the SSE stale cache. */
+export const FILE_TREE_CACHE_TTL_MS = 30_000;
+/** v2.0.0 max cached cwds (worktree + main + a few tests). */
+export const FILE_TREE_CACHE_MAX = 8;
+/**
+ * Parse the raw output of `git ls-files -z`. Public so the server-side
+ * cache layer (and tests) can re-parse a captured snapshot without
+ * re-spawning git.
+ *
+ * `git ls-files -z` emits paths separated by NUL bytes; the very last
+ * segment has no trailing NUL. We split on NUL and drop empties.
+ */
+export function parseLsFiles(raw) {
+    if (!raw)
+        return [];
+    const parts = raw.split("\0");
+    const out = [];
+    for (const p of parts) {
+        if (p.length === 0)
+            continue;
+        out.push(p);
+    }
+    return out;
+}
+function collectAllPathsInner(node, out) {
+    if (node.type === "file")
+        out.push(node.path);
+    for (const child of node.children)
+        collectAllPathsInner(child, out);
+}
+// ---------------------------------------------------------------------------
+// Internal helpers
+// ---------------------------------------------------------------------------
+/**
+ * Return the parent path, or `null` if `p` is a top-level segment.
+ *
+ *   parentPathOf("a")          → null
+ *   parentPathOf("a/b")        → "a"
+ *   parentPathOf("a/b/c.ts")   → "a/b"
+ */
+function parentPathOf(p) {
+    const idx = p.lastIndexOf("/");
+    if (idx < 0)
+        return null;
+    return p.slice(0, idx);
+}
+/**
+ * Recursively assign `depth` and sort children.
+ *
+ * Sorting rule (per design doc §5.1): directories first, then files,
+ * alphabetical by basename within each group. Case-sensitive — git
+ * doesn't case-fold paths either.
+ */
+function fixDepthAndSort(node, depth) {
+    node.depth = depth;
+    sortNodes(node.children);
+    for (const child of node.children) {
+        if (child.type === "directory") {
+            fixDepthAndSort(child, depth + 1);
+        }
+        else {
+            // Leaves: depth = parent.depth + 1.
+            child.depth = depth + 1;
+        }
+    }
+}
+function sortNodes(nodes) {
+    nodes.sort((a, b) => {
+        // Directories first.
+        if (a.type !== b.type) {
+            return a.type === "directory" ? -1 : 1;
+        }
+        // Then alphabetical by name (locale-independent — matches git).
+        if (a.name < b.name)
+            return -1;
+        if (a.name > b.name)
+            return 1;
+        return 0;
+    });
+}
+//# sourceMappingURL=file-tree.js.map

package/dist/file-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-tree.js","sourceRoot":"","sources":["../src/file-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAgCH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAE5C;;;;;;GAMG;AACH,MAAM,gBAAgB,GAAsB;IAC1C,WAAW;IACX,UAAU;IACV,MAAM;IACN,aAAa;IACb,KAAK;IACL,UAAU;CACX,CAAC;AAEF;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,aAAa,CAAC,KAAwB;IACpD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,8CAA8C;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACtD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,qEAAqE;IACrE,mDAAmD;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE5C,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;YACzB,GAAG,GAAG,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;YAC/C,MAAM,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,IAAI,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,QAAQ,GAAG;oBACT,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW;oBACnC,KAAK,EAAE,CAAC,EAAE,iBAAiB;oBAC3B,QAAQ,EAAE,EAAE;iBACb,CAAC;gBACF,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC3B,qDAAqD;gBACrD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;oBACV,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAClD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACvC,IAAI,MAAM;wBAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC7C,CAAC;YACH,CAAC;iBAAM,IAAI,MAAM,IAAI,QAAQ,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBACnD,2DAA2D;gBAC3D,2DAA2D;gBAC3D,0DAA0D;gBAC1D,yDAAyD;gBACzD,yDAAyD;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,UAAU,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACpD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEnD,mEAAmE;IACnE,SAAS,CAAC,KAAK,CAAC,CAAC;IAEjB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAClC,SAA4D;IAE5D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACnC,MAAM,CAAC,GAAI,IAAgC,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,KAA0B,EAC1B,MAAc;IAEd,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAClD,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,uBAAuB,CAAC,IAAc,EAAE,MAAc;IAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACnD,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAA0B;IACxD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,oBAAoB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAc/C;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAc,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;IAC/D,6DAA6D;IAC7D,iEAAiE;IACjE,mEAAmE;IACnE,gEAAgE;IAChE,oEAAoE;IACpE,wBAAwB;IACxB,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,UAAU,EAAE,IAAI,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC,EAAE;QAC1E,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE;QAC/B,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;KAC5B,CAAC,CAAC;IACH,OAAO;QACL,MAAM,EAAE,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAC9D,MAAM,EAAE,OAAO,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAC9D,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,CAAC;KAC3B,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,UAAU,CACxB,SAAoB,uBAAuB,EAC3C,IAAuB;IAEvB,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,OAAO,OAAO,KAAK,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/E,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;IACvD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,MAAM,IAAI,GAAG,GAAG,MAAM,CAAC,EAAE,GAAG,sBAAsB,EAAE,CAAC;QACvD,OAAO,MAAM,CAAC,KAAK,CAAC;IACtB,CAAC;IACD,IAAI,MAAc,CAAC;IACnB,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QACvB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IACzB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACpC,CAAC;IACD,6DAA6D;IAC7D,kEAAkE;IAClE,6DAA6D;IAC7D,wCAAwC;IACxC,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACnC,yDAAyD;IACzD,IAAI,aAAa,CAAC,IAAI,IAAI,mBAAmB,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;QACnD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YACpD,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;IAChD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GACxB,IAAI,GAAG,EAAE,CAAC;AAEZ,4DAA4D;AAC5D,MAAM,CAAC,MAAM,sBAAsB,GAAG,MAAM,CAAC;AAE7C,8DAA8D;AAC9D,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAErC;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IACpB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC7B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAc,EAAE,GAAa;IACzD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;QAAE,oBAAoB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACtE,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,CAAS;IAC7B,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACzB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,IAAc,EAAE,KAAa;IACpD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACnB,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC/B,eAAe,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC;aAAM,CAAC;YACN,oCAAoC;YACpC,KAAK,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,KAAiB;IAClC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAClB,qBAAqB;QACrB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,gEAAgE;QAChE,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC;QAC9B,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/server.d.ts

@@ -164,6 +164,19 @@ export declare class TaskShowServer {
      *    `ts.config.fileSandboxPaths`).
      */
     private handleFileContent;
+    /**
+     * v2.0.0: GET /api/task/:id/file-tree — returns the git-tracked
+     * file list for the project root as `{ files: string[] }`.
+     *
+     * The task id in the URL is ignored (the file tree is project-wide,
+     * not per-task). We still include the segment so the route reads
+     * naturally: "give me the file tree for the task's project".
+     *
+     * Caching: a 30-second in-memory cache keyed by cwd. Beyond that we
+     * re-spawn `git ls-files -z`. The cache key is the resolved cwd so a
+     * worktree-mode runner gets its own bucket.
+     */
+    private handleFileTree;
     private handleSSE;
     /**
      * Render the index page. v0.9.0+ selects the session-scoped forest when

package/dist/server.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAGlC,OAAO,KAAK,EACV,WAAW,EACX,cAAc,EACf,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE/C,OAAO,EACL,eAAe,EAChB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,cAAc,EACf,MAAM,uBAAuB,CAAC;AAW/B,OAAO,EACL,gBAAgB,EAEjB,MAAM,yBAAyB,CAAC;AAMjC,sEAAsE;AACtE,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;IACpB,wEAAwE;IACxE,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,6EAA6E;AAC7E,eAAO,MAAM,YAAY,QAAQ,CAAC;AAElC,0EAA0E;AAC1E,eAAO,MAAM,YAAY,OAAO,CAAC;AAIjC,4DAA4D;AAC5D,MAAM,MAAM,iBAAiB,GAAG;IAC9B,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC1B,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC1B,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;CAC5B,CAAC;AAEF,sCAAsC;AACtC,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,uEAAuE;IACvE,aAAa,EAAE,OAAO,CAAC;CACxB;AAMD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE;IACtC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,iBAAiB,CAAC;CAC5B,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAkI7B;AAYD,qBAAa,cAAc;IACzB,OAAO,CAAC,MAAM,CAA4B;IAC1C,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAiB;IACrC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoB;IAC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAW;IACpC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuF;IAC9G;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAmB;IACjD,8EAA8E;IAC9E,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAyB;IACzD,oEAAoE;IACpE,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAwB;IACvD;6EACyE;IACzE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA0B;gBAE3C,IAAI,EAAE;QAChB,GAAG,EAAE,cAAc,CAAC;QACpB,SAAS,EAAE,iBAAiB,CAAC;QAC7B,0EAA0E;QAC1E,QAAQ,CAAC,EAAE,QAAQ,CAAC;QACpB,yEAAyE;QACzE,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,MAAM,CAAC,EAAE;YAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;YAAC,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;YAAC,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAA;SAAE,CAAC;QAC9F,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,6FAA6F;QAC7F,eAAe,CAAC,EAAE,eAAe,CAAC;QAClC,kFAAkF;QAClF,cAAc,CAAC,EAAE,cAAc,CAAC;QAChC,gFAAgF;QAChF,YAAY,CAAC,EAAE,gBAAgB,CAAC;QAChC,uEAAuE;QACvE,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB;IAYD;;OAEG;IACH,WAAW,IAAI,QAAQ;IAIvB;;;;;;;;;OASG;IACH,KAAK,IAAI,OAAO,CAAC,UAAU,CAAC;IA8D5B;;;OAGG;IACH,OAAO,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAW7D;;OAEG;IACH,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;YA4BP,MAAM;IAwGpB;;;;;OAKG;IACH;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,iBAAiB;IAkDzB,OAAO,CAAC,SAAS;IA4BjB;;;;OAIG;YAEW,SAAS;IAYvB;;;;OAIG;YACW,gBAAgB;IAqE9B;;;;;;;;;;;;OAYG;YACW,eAAe;IAoE7B;;OAEG;IACH,OAAO,CAAC,YAAY;IAWpB,OAAO,CAAC,WAAW;IAuBnB,OAAO,CAAC,IAAI;IAQZ,OAAO,CAAC,IAAI;IAMZ,OAAO,CAAC,QAAQ;CAMjB;AA2CD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,WAAW,GAAG,MAAM,CAsH3D"}
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAGlC,OAAO,KAAK,EACV,WAAW,EACX,cAAc,EACf,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE/C,OAAO,EACL,eAAe,EAChB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EACL,cAAc,EACf,MAAM,uBAAuB,CAAC;AAoB/B,OAAO,EACL,gBAAgB,EAEjB,MAAM,yBAAyB,CAAC;AAWjC,sEAAsE;AACtE,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;IACpB,wEAAwE;IACxE,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,6EAA6E;AAC7E,eAAO,MAAM,YAAY,QAAQ,CAAC;AAElC,0EAA0E;AAC1E,eAAO,MAAM,YAAY,OAAO,CAAC;AAIjC,4DAA4D;AAC5D,MAAM,MAAM,iBAAiB,GAAG;IAC9B,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC1B,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAC1B,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;CAC5B,CAAC;AAEF,sCAAsC;AACtC,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,IAAI,EAAE,MAAM,CAAC;IACb,uEAAuE;IACvE,aAAa,EAAE,OAAO,CAAC;CACxB;AAMD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE;IACtC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,iBAAiB,CAAC;CAC5B,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAkI7B;AAYD,qBAAa,cAAc;IACzB,OAAO,CAAC,MAAM,CAA4B;IAC1C,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAiB;IACrC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoB;IAC9C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAW;IACpC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAuF;IAC9G;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAmB;IACjD,8EAA8E;IAC9E,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAyB;IACzD,oEAAoE;IACpE,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAwB;IACvD;6EACyE;IACzE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA0B;gBAE3C,IAAI,EAAE;QAChB,GAAG,EAAE,cAAc,CAAC;QACpB,SAAS,EAAE,iBAAiB,CAAC;QAC7B,0EAA0E;QAC1E,QAAQ,CAAC,EAAE,QAAQ,CAAC;QACpB,yEAAyE;QACzE,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,MAAM,CAAC,EAAE;YAAE,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;YAAC,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;YAAC,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,IAAI,CAAA;SAAE,CAAC;QAC9F,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,6FAA6F;QAC7F,eAAe,CAAC,EAAE,eAAe,CAAC;QAClC,kFAAkF;QAClF,cAAc,CAAC,EAAE,cAAc,CAAC;QAChC,gFAAgF;QAChF,YAAY,CAAC,EAAE,gBAAgB,CAAC;QAChC,uEAAuE;QACvE,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB;IAYD;;OAEG;IACH,WAAW,IAAI,QAAQ;IAIvB;;;;;;;;;OASG;IACH,KAAK,IAAI,OAAO,CAAC,UAAU,CAAC;IA8D5B;;;OAGG;IACH,OAAO,IAAI;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,GAAG,IAAI;IAW7D;;OAEG;IACH,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;YA4BP,MAAM;IAmHpB;;;;;OAKG;IACH;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,iBAAiB;IAkDzB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,cAAc;IAOtB,OAAO,CAAC,SAAS;IA4BjB;;;;OAIG;YAEW,SAAS;IAYvB;;;;OAIG;YACW,gBAAgB;IAqE9B;;;;;;;;;;;;OAYG;YACW,eAAe;IAoE7B;;OAEG;IACH,OAAO,CAAC,YAAY;IAWpB,OAAO,CAAC,WAAW;IAuBnB,OAAO,CAAC,IAAI;IAQZ,OAAO,CAAC,IAAI;IAMZ,OAAO,CAAC,QAAQ;CAMjB;AA2CD;;;GAGG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,WAAW,GAAG,MAAM,CAiK3D"}