@n-dx/web 0.1.0

package/dist/viewer/components/prd-tree/tree-event-delegate.js

@@ -0,0 +1,176 @@
+/**
+ * Event delegation hook for the PRD tree container.
+ *
+ * Replaces per-node click and keydown listeners with a single set of
+ * delegated handlers on the `[role="tree"]` container. Each event
+ * bubbles up and is routed to the correct callback by inspecting the target
+ * and its closest `[data-node-id]` ancestor.
+ *
+ * Click delegation routes to the correct handler based on the target's
+ * CSS class: `.prd-inline-add-btn` → add, `.prd-node-action-edit` → edit
+ * (select), `.prd-node-action-status` → status picker,
+ * `.prd-node-action-delete` → delete, `.prd-chevron` → toggle.
+ *
+ * Row clicks with keyboard modifiers drive multi-select: Ctrl/Cmd+click
+ * toggles individual items, Shift+click extends a range selection, and
+ * plain click selects a single item (deselecting all others).
+ *
+ * Net effect: from O(N * handlers-per-node) down to O(1) for click and
+ * keydown — a dramatic reduction in total listener count for large trees.
+ *
+ * Individual NodeRow components only need `data-node-id` and
+ * `data-has-children` attributes; no event handler props.
+ *
+ * @see ./prd-tree.ts — PRDTree component that consumes this hook
+ */
+import { useCallback, useRef } from "preact/hooks";
+// ── Internal helpers ────────────────────────────────────────────────
+/**
+ * Walk up from the event target to the nearest `[data-node-id]` element.
+ * Returns the element + extracted ID, or null if the target is outside any node.
+ */
+function findNodeRow(target) {
+    const el = target?.closest?.("[data-node-id]");
+    if (!el)
+        return null;
+    const id = el.getAttribute("data-node-id");
+    if (!id)
+        return null;
+    return { el, id };
+}
+// ── Hook ────────────────────────────────────────────────────────────
+/**
+ * Returns stable delegated event handlers for the tree container.
+ *
+ * Uses a ref to always read the *latest* callbacks without recreating the
+ * handler closures — so the returned handler objects are referentially
+ * stable across renders.
+ */
+export function useTreeEventDelegation(cb) {
+    // Store latest callbacks in a ref so the memoized handlers never go stale.
+    const cbRef = useRef(cb);
+    cbRef.current = cb;
+    // ── Click delegation ──────────────────────────────────────────────
+    const onClick = useCallback((e) => {
+        const target = e.target;
+        const node = findNodeRow(target);
+        if (!node)
+            return;
+        const c = cbRef.current;
+        const item = c.getItem(node.id);
+        if (!item)
+            return;
+        const hasChildren = node.el.hasAttribute("data-has-children");
+        // Inline add button
+        if (target.closest(".prd-inline-add-btn")) {
+            if (c.onInlineAdd)
+                c.onInlineAdd(item);
+            return;
+        }
+        // Edit action button — select item for detail panel
+        if (target.closest(".prd-node-action-edit")) {
+            if (c.onSelectItem)
+                c.onSelectItem(item);
+            return;
+        }
+        // Status action button — open inline status picker
+        if (target.closest(".prd-node-action-status")) {
+            if (c.onStatusClick) {
+                const btn = target.closest(".prd-node-action-status");
+                const rect = btn.getBoundingClientRect();
+                c.onStatusClick(item, { left: rect.left, top: rect.top, bottom: rect.bottom });
+            }
+            return;
+        }
+        // Delete action button
+        if (target.closest(".prd-node-action-delete")) {
+            if (c.onRemoveItem)
+                c.onRemoveItem(item);
+            return;
+        }
+        // Chevron toggle
+        if (target.classList.contains("prd-chevron")) {
+            if (hasChildren)
+                c.onToggle(node.id);
+            return;
+        }
+        // Default: multi-select with modifier support, falling back to
+        // detail-panel selection or expand/collapse toggle.
+        if (c.onBulkSelect) {
+            const modifiers = {
+                ctrlKey: e.ctrlKey || e.metaKey,
+                shiftKey: e.shiftKey,
+            };
+            c.onBulkSelect(item, modifiers);
+        }
+        else if (c.onSelectItem) {
+            c.onSelectItem(item);
+        }
+        else if (hasChildren) {
+            c.onToggle(node.id);
+        }
+    }, []);
+    // ── Keydown delegation ────────────────────────────────────────────
+    const onKeyDown = useCallback((e) => {
+        const node = findNodeRow(e.target);
+        if (!node)
+            return;
+        const c = cbRef.current;
+        const item = c.getItem(node.id);
+        if (!item)
+            return;
+        const hasChildren = node.el.hasAttribute("data-has-children");
+        const isExpanded = c.expanded.has(node.id);
+        // Enter / Space → toggle selection (like ctrl+click) or select item
+        if (e.key === "Enter" || e.key === " ") {
+            e.preventDefault();
+            if (c.onBulkSelect) {
+                // Space/Enter toggles selection like ctrl+click
+                c.onBulkSelect(item, { ctrlKey: true, shiftKey: false });
+            }
+            else if (c.onSelectItem) {
+                c.onSelectItem(item);
+            }
+            else if (hasChildren) {
+                c.onToggle(node.id);
+            }
+        }
+        // Arrow right → expand collapsed node
+        if (hasChildren && e.key === "ArrowRight" && !isExpanded) {
+            e.preventDefault();
+            c.onToggle(node.id);
+        }
+        // Arrow left → collapse expanded node
+        if (hasChildren && e.key === "ArrowLeft" && isExpanded) {
+            e.preventDefault();
+            c.onToggle(node.id);
+        }
+        // Arrow up/down → navigate between visible tree items.
+        // Shift+Arrow extends range selection to the newly focused item.
+        if (e.key === "ArrowDown" || e.key === "ArrowUp") {
+            e.preventDefault();
+            // e.currentTarget is the tree container where the handler is attached.
+            const container = e.currentTarget;
+            const items = Array.from(container.querySelectorAll('[role="treeitem"]'));
+            const idx = items.indexOf(node.el);
+            if (idx < 0)
+                return;
+            const next = e.key === "ArrowDown" ? idx + 1 : idx - 1;
+            if (next >= 0 && next < items.length) {
+                items[next].focus();
+                // Shift+Arrow → extend range selection to the next item
+                if (e.shiftKey && c.onBulkSelect) {
+                    const nextId = items[next].getAttribute("data-node-id");
+                    if (nextId) {
+                        const nextItem = c.getItem(nextId);
+                        if (nextItem) {
+                            c.onBulkSelect(nextItem, { ctrlKey: false, shiftKey: true });
+                        }
+                    }
+                }
+            }
+        }
+    }, []);
+    return { onClick, onKeyDown };
+}
+//# sourceMappingURL=tree-event-delegate.js.map

package/dist/viewer/components/prd-tree/tree-event-delegate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-event-delegate.js","sourceRoot":"","sources":["../../../../src/viewer/components/prd-tree/tree-event-delegate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAwCnD,uEAAuE;AAEvE;;;GAGG;AACH,SAAS,WAAW,CAAC,MAA0B;IAC7C,MAAM,EAAE,GAAI,MAAsB,EAAE,OAAO,EAAE,CAAC,gBAAgB,CAAuB,CAAC;IACtF,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,MAAM,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;IAC3C,IAAI,CAAC,EAAE;QAAE,OAAO,IAAI,CAAC;IACrB,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;AACpB,CAAC;AAED,uEAAuE;AAEvE;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAA2B;IAChE,2EAA2E;IAC3E,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;IACzB,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC;IAEnB,qEAAqE;IACrE,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAa,EAAE,EAAE;QAC5C,MAAM,MAAM,GAAG,CAAC,CAAC,MAAqB,CAAC;QACvC,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,mBAAmB,CAAC,CAAC;QAE9D,oBAAoB;QACpB,IAAI,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,CAAC,WAAW;gBAAE,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvC,OAAO;QACT,CAAC;QAED,oDAAoD;QACpD,IAAI,MAAM,CAAC,OAAO,CAAC,uBAAuB,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,CAAC,YAAY;gBAAE,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACzC,OAAO;QACT,CAAC;QAED,mDAAmD;QACnD,IAAI,MAAM,CAAC,OAAO,CAAC,yBAAyB,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;gBACpB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,yBAAyB,CAAgB,CAAC;gBACrE,MAAM,IAAI,GAAG,GAAG,CAAC,qBAAqB,EAAE,CAAC;gBACzC,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;YACjF,CAAC;YACD,OAAO;QACT,CAAC;QAED,uBAAuB;QACvB,IAAI,MAAM,CAAC,OAAO,CAAC,yBAAyB,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,CAAC,YAAY;gBAAE,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACzC,OAAO;QACT,CAAC;QAED,iBAAiB;QACjB,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YAC7C,IAAI,WAAW;gBAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO;QACT,CAAC;QAED,+DAA+D;QAC/D,oDAAoD;QACpD,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;YACnB,MAAM,SAAS,GAAuB;gBACpC,OAAO,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO;gBAC/B,QAAQ,EAAE,CAAC,CAAC,QAAQ;aACrB,CAAC;YACF,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClC,CAAC;aAAM,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;YAC1B,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;aAAM,IAAI,WAAW,EAAE,CAAC;YACvB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC,EAAE,EAAE,CAAC,CAAC;IAEP,qEAAqE;IACrE,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,CAAgB,EAAE,EAAE;QACjD,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,mBAAmB,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE3C,oEAAoE;QACpE,IAAI,CAAC,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACvC,CAAC,CAAC,cAAc,EAAE,CAAC;YACnB,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBACnB,gDAAgD;gBAChD,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,CAAC;iBAAM,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;gBAC1B,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;iBAAM,IAAI,WAAW,EAAE,CAAC;gBACvB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,WAAW,IAAI,CAAC,CAAC,GAAG,KAAK,YAAY,IAAI,CAAC,UAAU,EAAE,CAAC;YACzD,CAAC,CAAC,cAAc,EAAE,CAAC;YACnB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,sCAAsC;QACtC,IAAI,WAAW,IAAI,CAAC,CAAC,GAAG,KAAK,WAAW,IAAI,UAAU,EAAE,CAAC;YACvD,CAAC,CAAC,cAAc,EAAE,CAAC;YACnB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,uDAAuD;QACvD,iEAAiE;QACjE,IAAI,CAAC,CAAC,GAAG,KAAK,WAAW,IAAI,CAAC,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YACjD,CAAC,CAAC,cAAc,EAAE,CAAC;YACnB,uEAAuE;YACvE,MAAM,SAAS,GAAG,CAAC,CAAC,aAA4B,CAAC;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAc,mBAAmB,CAAC,CAAC,CAAC;YACvF,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,GAAG,GAAG,CAAC;gBAAE,OAAO;YACpB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACvD,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBACrC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACpB,wDAAwD;gBACxD,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,YAAY,EAAE,CAAC;oBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;oBACxD,IAAI,MAAM,EAAE,CAAC;wBACX,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;wBACnC,IAAI,QAAQ,EAAE,CAAC;4BACb,CAAC,CAAC,YAAY,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;wBAC/D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,EAAE,EAAE,CAAC,CAAC;IAEP,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC"}

package/dist/viewer/components/prd-tree/tree-search.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Pure search/filter functions for the PRD tree.
+ *
+ * Provides case-insensitive substring matching against item titles and
+ * descriptions, with optional tag and status facet filters that narrow
+ * results further. Returns both the set of matching item IDs and their
+ * ancestor IDs (to preserve tree context in filtered views).
+ *
+ * @see ./prd-tree.ts — integrating component
+ * @see ./virtual-scroll.ts — flattenVisibleTree respects search results
+ */
+import type { PRDItemData, ItemStatus } from "./types.js";
+import type { ComponentChild } from "preact";
+export interface TreeSearchResult {
+    /** IDs of items whose title or description matched the query. */
+    matchIds: Set<string>;
+    /** IDs of ancestor nodes that should remain visible for tree context. */
+    ancestorIds: Set<string>;
+    /** Combined set: matchIds ∪ ancestorIds — all nodes to show. */
+    visibleIds: Set<string>;
+    /** IDs of all ancestors that should be auto-expanded to reveal matches. */
+    expandIds: Set<string>;
+    /** Total number of direct matches. */
+    matchCount: number;
+}
+export interface SearchFacets {
+    /** Active tag facets — item must have ALL of these tags (AND logic). */
+    tags?: Set<string>;
+    /** Active status facets — item must match ONE of these statuses (OR within group). */
+    statuses?: Set<ItemStatus>;
+}
+/**
+ * Search the PRD tree for items matching a query string and/or facet filters.
+ *
+ * Matching rules:
+ * - Case-insensitive substring match against title and description
+ * - Tag facets narrow results to items having ALL selected tags (AND)
+ * - Status facets narrow results to items matching ANY selected status (OR)
+ * - Text query and facets combine with AND logic
+ * - Empty query with no facets returns an empty result (caller shows full tree)
+ * - Ancestor nodes of matches are included in visibleIds/expandIds
+ *
+ * Complexity: O(N) where N = total tree nodes.
+ */
+export declare function searchTree(items: PRDItemData[], query: string, facets?: SearchFacets): TreeSearchResult;
+/**
+ * Collect all unique tags from the PRD tree, sorted alphabetically.
+ * Used to populate tag facet chips dynamically.
+ */
+export declare function collectAllTags(items: PRDItemData[]): string[];
+/**
+ * Check if an item (or any descendant) is in the visible set.
+ * Used by flattenVisibleTree when a search is active.
+ */
+export declare function itemMatchesSearch(item: PRDItemData, visibleIds: Set<string>): boolean;
+/**
+ * Highlight all occurrences of `query` within `text`, returning an array
+ * of string and VNode fragments suitable for Preact rendering.
+ *
+ * Uses case-insensitive matching. Non-matching segments are plain strings;
+ * matching segments are wrapped in `<mark class="prd-search-highlight">`.
+ *
+ * Returns `[text]` unchanged when query is empty.
+ */
+export declare function highlightSearchText(text: string, query: string): ComponentChild[];

package/dist/viewer/components/prd-tree/tree-search.js

@@ -0,0 +1,178 @@
+/**
+ * Pure search/filter functions for the PRD tree.
+ *
+ * Provides case-insensitive substring matching against item titles and
+ * descriptions, with optional tag and status facet filters that narrow
+ * results further. Returns both the set of matching item IDs and their
+ * ancestor IDs (to preserve tree context in filtered views).
+ *
+ * @see ./prd-tree.ts — integrating component
+ * @see ./virtual-scroll.ts — flattenVisibleTree respects search results
+ */
+import { h } from "preact";
+// ── Core search ──────────────────────────────────────────────────────────────
+/**
+ * Check if a single item passes the facet filters (ignoring text query).
+ * Tag facets use AND logic: item must have every selected tag.
+ * Status facets use OR logic: item status must be one of the selected statuses.
+ */
+function itemPassesFacets(item, facets) {
+    // Status facet: OR logic — item's status must be in the set
+    if (facets.statuses && facets.statuses.size > 0) {
+        if (!facets.statuses.has(item.status))
+            return false;
+    }
+    // Tag facet: AND logic — item must have ALL selected tags
+    if (facets.tags && facets.tags.size > 0) {
+        const itemTags = item.tags ?? [];
+        for (const tag of facets.tags) {
+            if (!itemTags.includes(tag))
+                return false;
+        }
+    }
+    return true;
+}
+/**
+ * Search the PRD tree for items matching a query string and/or facet filters.
+ *
+ * Matching rules:
+ * - Case-insensitive substring match against title and description
+ * - Tag facets narrow results to items having ALL selected tags (AND)
+ * - Status facets narrow results to items matching ANY selected status (OR)
+ * - Text query and facets combine with AND logic
+ * - Empty query with no facets returns an empty result (caller shows full tree)
+ * - Ancestor nodes of matches are included in visibleIds/expandIds
+ *
+ * Complexity: O(N) where N = total tree nodes.
+ */
+export function searchTree(items, query, facets) {
+    const trimmed = query.trim().toLowerCase();
+    const hasTextQuery = trimmed.length > 0;
+    const hasFacets = facets != null && ((facets.tags != null && facets.tags.size > 0) ||
+        (facets.statuses != null && facets.statuses.size > 0));
+    if (!hasTextQuery && !hasFacets) {
+        return {
+            matchIds: new Set(),
+            ancestorIds: new Set(),
+            visibleIds: new Set(),
+            expandIds: new Set(),
+            matchCount: 0,
+        };
+    }
+    const matchIds = new Set();
+    const ancestorIds = new Set();
+    // Walk the tree, collecting matches and propagating ancestor info upward.
+    function walk(nodes, ancestors) {
+        let anyMatch = false;
+        for (const item of nodes) {
+            // Text matching (skip if no text query — facets-only mode)
+            let textMatch = true;
+            if (hasTextQuery) {
+                const titleMatch = item.title.toLowerCase().includes(trimmed);
+                const descMatch = item.description
+                    ? item.description.toLowerCase().includes(trimmed)
+                    : false;
+                textMatch = titleMatch || descMatch;
+            }
+            // Facet matching
+            const facetMatch = hasFacets ? itemPassesFacets(item, facets) : true;
+            const selfMatch = textMatch && facetMatch;
+            // Recurse into children first to detect descendant matches.
+            const childAncestors = [...ancestors, item.id];
+            const childMatch = item.children
+                ? walk(item.children, childAncestors)
+                : false;
+            if (selfMatch) {
+                matchIds.add(item.id);
+                // Mark all ancestors as visible
+                for (const aid of ancestors) {
+                    ancestorIds.add(aid);
+                }
+                anyMatch = true;
+            }
+            if (childMatch) {
+                // Item is an ancestor of a match — already added by the child walk
+                anyMatch = true;
+            }
+        }
+        return anyMatch;
+    }
+    walk(items, []);
+    const visibleIds = new Set([...matchIds, ...ancestorIds]);
+    // Expand all ancestors so matches are visible
+    const expandIds = new Set(ancestorIds);
+    return {
+        matchIds,
+        ancestorIds,
+        visibleIds,
+        expandIds,
+        matchCount: matchIds.size,
+    };
+}
+// ── Tag collection ──────────────────────────────────────────────────────────
+/**
+ * Collect all unique tags from the PRD tree, sorted alphabetically.
+ * Used to populate tag facet chips dynamically.
+ */
+export function collectAllTags(items) {
+    const tags = new Set();
+    function walk(nodes) {
+        for (const item of nodes) {
+            if (item.tags) {
+                for (const tag of item.tags) {
+                    tags.add(tag);
+                }
+            }
+            if (item.children)
+                walk(item.children);
+        }
+    }
+    walk(items);
+    return [...tags].sort();
+}
+/**
+ * Check if an item (or any descendant) is in the visible set.
+ * Used by flattenVisibleTree when a search is active.
+ */
+export function itemMatchesSearch(item, visibleIds) {
+    if (visibleIds.has(item.id))
+        return true;
+    if (item.children) {
+        return item.children.some((child) => itemMatchesSearch(child, visibleIds));
+    }
+    return false;
+}
+// ── Text highlighting ────────────────────────────────────────────────────────
+/**
+ * Highlight all occurrences of `query` within `text`, returning an array
+ * of string and VNode fragments suitable for Preact rendering.
+ *
+ * Uses case-insensitive matching. Non-matching segments are plain strings;
+ * matching segments are wrapped in `<mark class="prd-search-highlight">`.
+ *
+ * Returns `[text]` unchanged when query is empty.
+ */
+export function highlightSearchText(text, query) {
+    const trimmed = query.trim().toLowerCase();
+    if (!trimmed || !text)
+        return [text];
+    const lower = text.toLowerCase();
+    const fragments = [];
+    let cursor = 0;
+    while (cursor < text.length) {
+        const idx = lower.indexOf(trimmed, cursor);
+        if (idx === -1) {
+            fragments.push(text.slice(cursor));
+            break;
+        }
+        // Text before match
+        if (idx > cursor) {
+            fragments.push(text.slice(cursor, idx));
+        }
+        // Matched text
+        fragments.push(h("mark", { class: "prd-search-highlight" }, text.slice(idx, idx + trimmed.length)));
+        cursor = idx + trimmed.length;
+    }
+    return fragments;
+}
+//# sourceMappingURL=tree-search.js.map

package/dist/viewer/components/prd-tree/tree-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-search.js","sourceRoot":"","sources":["../../../../src/viewer/components/prd-tree/tree-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,EAAE,CAAC,EAAE,MAAM,QAAQ,CAAC;AA0B3B,gFAAgF;AAEhF;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAiB,EAAE,MAAoB;IAC/D,4DAA4D;IAC5D,IAAI,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;IACtD,CAAC;IAED,0DAA0D;IAC1D,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QACjC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,UAAU,CACxB,KAAoB,EACpB,KAAa,EACb,MAAqB;IAErB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,MAAM,IAAI,IAAI,IAAI,CAClC,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QAC7C,CAAC,MAAM,CAAC,QAAQ,IAAI,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CACtD,CAAC;IAEF,IAAI,CAAC,YAAY,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,OAAO;YACL,QAAQ,EAAE,IAAI,GAAG,EAAE;YACnB,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,UAAU,EAAE,IAAI,GAAG,EAAE;YACrB,SAAS,EAAE,IAAI,GAAG,EAAE;YACpB,UAAU,EAAE,CAAC;SACd,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,0EAA0E;IAC1E,SAAS,IAAI,CAAC,KAAoB,EAAE,SAAmB;QACrD,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,2DAA2D;YAC3D,IAAI,SAAS,GAAG,IAAI,CAAC;YACrB,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW;oBAChC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAClD,CAAC,CAAC,KAAK,CAAC;gBACV,SAAS,GAAG,UAAU,IAAI,SAAS,CAAC;YACtC,CAAC;YAED,iBAAiB;YACjB,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAEtE,MAAM,SAAS,GAAG,SAAS,IAAI,UAAU,CAAC;YAE1C,4DAA4D;YAC5D,MAAM,cAAc,GAAG,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ;gBAC9B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC;gBACrC,CAAC,CAAC,KAAK,CAAC;YAEV,IAAI,SAAS,EAAE,CAAC;gBACd,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtB,gCAAgC;gBAChC,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;oBAC5B,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;gBACD,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YAED,IAAI,UAAU,EAAE,CAAC;gBACf,mEAAmE;gBACnE,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAEhB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,QAAQ,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC;IAClE,8CAA8C;IAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,WAAW,CAAC,CAAC;IAE/C,OAAO;QACL,QAAQ;QACR,WAAW;QACX,UAAU;QACV,SAAS;QACT,UAAU,EAAE,QAAQ,CAAC,IAAI;KAC1B,CAAC;AACJ,CAAC;AAED,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,SAAS,IAAI,CAAC,KAAoB;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACd,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;YACD,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,CAAC;IACZ,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAiB,EACjB,UAAuB;IAEvB,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAY,EACZ,KAAa;IAEb,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAC3C,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAErC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,MAAM,SAAS,GAAqB,EAAE,CAAC;IACvC,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YACnC,MAAM;QACR,CAAC;QAED,oBAAoB;QACpB,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;QAED,eAAe;QACf,SAAS,CAAC,IAAI,CACZ,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,sBAAsB,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CACpF,CAAC;QAEF,MAAM,GAAG,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/viewer/components/prd-tree/tree-utils.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Shared tree traversal utilities for browser-side PRD code.
+ *
+ * These operate on the viewer's PRDItemData type (which mirrors the
+ * canonical Rex types but is duplicated intentionally for browser bundling).
+ * Previously, each viewer file that needed tree search had its own copy.
+ *
+ * @see ./types.ts — PRDItemData definition
+ * @see packages/rex/src/tree.ts — canonical server-side equivalents
+ */
+import type { PRDItemData } from "./types.js";
+/**
+ * Walk the tree to find an item by ID.
+ * Returns the item or null if not found.
+ */
+export declare function findItemById(items: PRDItemData[], id: string): PRDItemData | null;
+/**
+ * Count total descendants (children, grandchildren, etc.) of an item.
+ * Returns 0 if the item has no children.
+ */
+export declare function countDescendants(item: PRDItemData): number;
+/**
+ * Collect the IDs of all ancestors of the target item (excluding the target itself).
+ * Returns an empty array if the target is not found or is a root item.
+ */
+export declare function getAncestorIds(items: PRDItemData[], targetId: string): string[];
+/**
+ * Collect the IDs of an item and all its descendants (children, grandchildren, etc.).
+ * Returns a Set containing the item's own ID plus every descendant ID.
+ */
+export declare function collectSubtreeIds(item: PRDItemData): Set<string>;
+/**
+ * Immutably remove an item by ID from a tree, returning a new array.
+ * If the item is found, it and all its descendants are excluded.
+ * Returns the original `items` reference when nothing changed (structural sharing).
+ * Parent objects are shallow-copied only along the path to the removed item.
+ */
+export declare function removeItemById(items: PRDItemData[], id: string): PRDItemData[];

package/dist/viewer/components/prd-tree/tree-utils.js

@@ -0,0 +1,107 @@
+/**
+ * Shared tree traversal utilities for browser-side PRD code.
+ *
+ * These operate on the viewer's PRDItemData type (which mirrors the
+ * canonical Rex types but is duplicated intentionally for browser bundling).
+ * Previously, each viewer file that needed tree search had its own copy.
+ *
+ * @see ./types.ts — PRDItemData definition
+ * @see packages/rex/src/tree.ts — canonical server-side equivalents
+ */
+/**
+ * Walk the tree to find an item by ID.
+ * Returns the item or null if not found.
+ */
+export function findItemById(items, id) {
+    for (const item of items) {
+        if (item.id === id)
+            return item;
+        if (item.children) {
+            const found = findItemById(item.children, id);
+            if (found)
+                return found;
+        }
+    }
+    return null;
+}
+/**
+ * Count total descendants (children, grandchildren, etc.) of an item.
+ * Returns 0 if the item has no children.
+ */
+export function countDescendants(item) {
+    if (!item.children || item.children.length === 0)
+        return 0;
+    let count = 0;
+    for (const child of item.children) {
+        count += 1 + countDescendants(child);
+    }
+    return count;
+}
+/**
+ * Collect the IDs of all ancestors of the target item (excluding the target itself).
+ * Returns an empty array if the target is not found or is a root item.
+ */
+export function getAncestorIds(items, targetId) {
+    const path = [];
+    function walk(nodes) {
+        for (const node of nodes) {
+            if (node.id === targetId)
+                return true;
+            if (node.children) {
+                path.push(node.id);
+                if (walk(node.children))
+                    return true;
+                path.pop();
+            }
+        }
+        return false;
+    }
+    walk(items);
+    return path;
+}
+/**
+ * Collect the IDs of an item and all its descendants (children, grandchildren, etc.).
+ * Returns a Set containing the item's own ID plus every descendant ID.
+ */
+export function collectSubtreeIds(item) {
+    const ids = new Set([item.id]);
+    if (item.children) {
+        for (const child of item.children) {
+            for (const id of collectSubtreeIds(child)) {
+                ids.add(id);
+            }
+        }
+    }
+    return ids;
+}
+/**
+ * Immutably remove an item by ID from a tree, returning a new array.
+ * If the item is found, it and all its descendants are excluded.
+ * Returns the original `items` reference when nothing changed (structural sharing).
+ * Parent objects are shallow-copied only along the path to the removed item.
+ */
+export function removeItemById(items, id) {
+    let changed = false;
+    const result = [];
+    for (const item of items) {
+        // Skip the target item entirely (removes it and all descendants)
+        if (item.id === id) {
+            changed = true;
+            continue;
+        }
+        // Recurse into children to look for the target deeper in the tree
+        if (item.children && item.children.length > 0) {
+            const newChildren = removeItemById(item.children, id);
+            if (newChildren !== item.children) {
+                // A descendant was removed — shallow-copy this node with updated children
+                result.push({ ...item, children: newChildren });
+                changed = true;
+                continue;
+            }
+        }
+        result.push(item);
+    }
+    // Return the original reference when nothing changed (enables === checks)
+    return changed ? result : items;
+}
+//# sourceMappingURL=tree-utils.js.map

package/dist/viewer/components/prd-tree/tree-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-utils.js","sourceRoot":"","sources":["../../../../src/viewer/components/prd-tree/tree-utils.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAoB,EAAE,EAAU;IAC3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAC9C,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAiB;IAChD,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB,EAAE,QAAgB;IACnE,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,SAAS,IAAI,CAAC,KAAoB;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC;YACtC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACnB,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACrC,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,CAAC;IACZ,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAiB;IACjD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,KAAK,MAAM,EAAE,IAAI,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,KAAoB,EAAE,EAAU;IAC7D,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,iEAAiE;QACjE,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACnB,OAAO,GAAG,IAAI,CAAC;YACf,SAAS;QACX,CAAC;QAED,kEAAkE;QAClE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YACtD,IAAI,WAAW,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,0EAA0E;gBAC1E,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC;gBAChD,OAAO,GAAG,IAAI,CAAC;gBACf,SAAS;YACX,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,0EAA0E;IAC1E,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;AAClC,CAAC"}