@flanksource/clicky-ui 0.3.18 → 0.3.20

package/dist/data/TreeNode.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNode.cjs","sources":["../../src/data/TreeNode.tsx"],"sourcesContent":["import { useEffect, useRef, useState, type ReactNode } from \"react\";\nimport { cn } from \"../lib/utils\";\nimport { Icon } from \"./Icon\";\nimport { UiChevronDown, UiChevronRight } from \"../icons\";\n\nexport type TreeRowContext<T> = {\n  node: T;\n  depth: number;\n  open: boolean;\n  selected: boolean;\n  hasChildren: boolean;\n  toggle: () => void;\n  /** True while this node's lazy children are being fetched via loadChildren. */\n  loading: boolean;\n  /** The rejection value from loadChildren, or null when there was no error. */\n  error: unknown;\n};\n\nexport type TreeNodeProps<T> = {\n  node: T;\n  depth?: number;\n  expandAll?: boolean | null;\n  forcedOpenKeys?: Set<string | number> | null;\n  selected?: T | null;\n  defaultOpen?: (node: T, depth: number) => boolean;\n  getChildren: (node: T) => T[] | undefined;\n  getKey: (node: T) => string | number;\n  getAriaLabel?: (node: T) => string;\n  onSelect?: (node: T) => void;\n  renderRow: (ctx: TreeRowContext<T>) => ReactNode;\n  rowClass?: (node: T, selected: boolean) => string;\n  indentPx?: number;\n  basePaddingPx?: number;\n  /**\n   * Reports that a node has children that are not yet loaded — it renders an\n   * expand chevron even when `getChildren` returns nothing. On the first open\n   * the node fetches them via `loadChildren`. Without this (the default), a\n   * node is expandable only when `getChildren` already returns children.\n   */\n  hasMoreChildren?: (node: T) => boolean;\n  /**\n   * Lazily fetch a node's children the first time it is opened. Resolves to the\n   * child nodes (which may themselves be lazy). A rejection is surfaced to\n   * `renderRow` via `ctx.error` and is not retried until the node is collapsed\n   * and reopened. Required for any node `hasMoreChildren` returns true for.\n   */\n  loadChildren?: (node: T) => Promise<T[]>;\n  /**\n   * Marks a node as a **secondary child** of its parent. Secondary\n   * children keep the full tree structure (they render, they can be\n   * opened manually) but opt out of the bulk behaviours a caller\n   * typically wants when they click the toolbar:\n   *\n   *  - Tree-wide filter: their text is skipped during match detection\n   *    so typing in the search box never surfaces a row because one\n   *    of its secondary children happened to match.\n   *  - Expand all: secondary nodes stay at their default-open state\n   *    instead of being forced open, preventing 28k field rows from\n   *    flooding the viewport when an operator hits the button on a\n   *    schema with hundreds of tables.\n   *\n   * Default: every node is primary (returns false).\n   */\n  isSecondary?: (node: T) => boolean;\n};\n\nexport function TreeNode<T>({\n  node,\n  depth = 0,\n  expandAll = null,\n  forcedOpenKeys = null,\n  selected = null,\n  defaultOpen,\n  getChildren,\n  getKey,\n  getAriaLabel,\n  onSelect,\n  renderRow,\n  rowClass,\n  indentPx = 16,\n  basePaddingPx = 8,\n  isSecondary,\n  hasMoreChildren,\n  loadChildren,\n}: TreeNodeProps<T>) {\n  // Lazily-fetched children take precedence over the synchronous ones once a\n  // load has resolved; until then `loadedChildren` is null and we fall back to\n  // getChildren. A node can be \"lazy\" (hasMoreChildren) with no sync children.\n  const [loadedChildren, setLoadedChildren] = useState<T[] | null>(null);\n  const [loading, setLoading] = useState(false);\n  const [error, setError] = useState<unknown>(null);\n  const syncChildren = getChildren(node);\n  const children = loadedChildren ?? syncChildren;\n  const hasChildren = (children?.length ?? 0) > 0;\n  const lazyUnloaded = (hasMoreChildren?.(node) ?? false) && loadedChildren === null;\n  // The chevron shows when there is something to reveal: either real children\n  // are present, or the node is lazy and has not been loaded yet.\n  const expandable = hasChildren || lazyUnloaded;\n  // A node opts out of bulk expand-all in two distinct cases:\n  //\n  //  1. The node itself is secondary (its edge from the parent is\n  //     secondary) — rare at the root, but the rule is symmetric.\n  //  2. All of the node's children are secondary — the common case.\n  //     This is what keeps an \"Expand all\" on a schema tree from\n  //     flooding the viewport with every table's field rows: the\n  //     table opens to nothing structural worth seeing in bulk, so\n  //     we leave it closed until the operator clicks it manually.\n  //\n  // In both cases the manual toggle still works, and filter matches\n  // still force the row open via forcedOpenKeys, so users never\n  // lose access — they just don't get auto-flooded.\n  const secondaryNode = isSecondary?.(node) ?? false;\n  const childrenAllSecondary =\n    hasChildren && isSecondary != null && children!.every((c) => isSecondary(c));\n  const skipExpandAll = secondaryNode || childrenAllSecondary;\n  // A non-null `expandAll` is a live bulk state, not just a one-off change\n  // signal: a node mounted *while* expand-all is active (because an ancestor\n  // just opened) inherits it as its initial open state, so opening a parent\n  // cascades all the way down — expand/collapse-all are recursive. The\n  // skipExpandAll guard keeps secondary subtrees from auto-flooding. When\n  // expandAll is null (before any toolbar click) we fall back to defaultOpen.\n  const initialOpen =\n    expandAll !== null && !skipExpandAll\n      ? expandAll\n      : defaultOpen\n        ? defaultOpen(node, depth)\n        : depth < 1;\n  const [open, setOpen] = useState(initialOpen);\n  const prevExpandAll = useRef(expandAll);\n  const isSelected = selected === node;\n  const key = getKey(node);\n  const isForcedOpen = forcedOpenKeys?.has(key) ?? false;\n  const isOpen = isForcedOpen || open;\n\n  useEffect(() => {\n    if (expandAll !== null && expandAll !== prevExpandAll.current && !skipExpandAll) {\n      setOpen(expandAll);\n    }\n    prevExpandAll.current = expandAll;\n  }, [expandAll, skipExpandAll]);\n\n  // Guards a lazy fetch so a node loads its children at most once per mount and\n  // a resolution arriving after the node was reused (key changed) is ignored.\n  const loadRequested = useRef(false);\n  const nodeKey = getKey(node);\n  const loadKeyRef = useRef(nodeKey);\n\n  function loadLazyChildren() {\n    if (!loadChildren || loadRequested.current) return;\n    loadRequested.current = true;\n    loadKeyRef.current = nodeKey;\n    setLoading(true);\n    setError(null);\n    loadChildren(node)\n      .then((kids) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        setLoadedChildren(kids);\n        setLoading(false);\n      })\n      .catch((err) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        // Surfaced to renderRow via ctx.error; allow a retry on re-toggle.\n        loadRequested.current = false;\n        setError(err);\n        setLoading(false);\n      });\n  }\n\n  function toggle() {\n    if (!expandable) return;\n    setOpen((o) => {\n      const next = !o;\n      // Only fetch when transitioning into the open state, so collapsing a\n      // not-yet-loaded (e.g. previously-failed) lazy node never triggers a load.\n      if (next && lazyUnloaded) loadLazyChildren();\n      return next;\n    });\n  }\n\n  const defaultRowBg = isSelected ? \"bg-primary/10 border-l-2 border-primary\" : \"hover:bg-accent\";\n  const rowClassName = rowClass ? rowClass(node, isSelected) : defaultRowBg;\n\n  return (\n    <div\n      role=\"treeitem\"\n      aria-label={getAriaLabel?.(node)}\n      aria-expanded={expandable ? isOpen : undefined}\n      aria-selected={isSelected}\n    >\n      <div\n        className={cn(\"flex items-center gap-1.5 py-1 px-2 cursor-pointer text-sm\", rowClassName)}\n        style={{ paddingLeft: `${depth * indentPx + basePaddingPx}px` }}\n        onClick={(e) => {\n          e.stopPropagation();\n          onSelect?.(node);\n          toggle();\n        }}\n      >\n        {expandable ? (\n          <button\n            type=\"button\"\n            aria-label={isOpen ? \"Collapse\" : \"Expand\"}\n            // The caret only toggles expansion — stopPropagation keeps the row's\n            // onClick (which selects) from firing, so expanding a node never\n            // selects it.\n            onClick={(e) => {\n              e.stopPropagation();\n              toggle();\n            }}\n            className=\"flex shrink-0 items-center text-muted-foreground\"\n          >\n            <Icon icon={isOpen ? UiChevronDown : UiChevronRight} className=\"text-xs w-3\" />\n          </button>\n        ) : (\n          <span className=\"w-3 shrink-0\" aria-hidden />\n        )}\n        {renderRow({\n          node,\n          depth,\n          open: isOpen,\n          selected: isSelected,\n          hasChildren,\n          toggle,\n          loading,\n          error,\n        })}\n      </div>\n      {isOpen && hasChildren && (\n        <div role=\"group\">\n          {children!.map((child) => (\n            <TreeNode\n              key={getKey(child)}\n              node={child}\n              depth={depth + 1}\n              expandAll={expandAll}\n              forcedOpenKeys={forcedOpenKeys}\n              selected={selected}\n              getChildren={getChildren}\n              getKey={getKey}\n              renderRow={renderRow}\n              indentPx={indentPx}\n              basePaddingPx={basePaddingPx}\n              {...(defaultOpen ? { defaultOpen } : {})}\n              {...(getAriaLabel ? { getAriaLabel } : {})}\n              {...(onSelect ? { onSelect } : {})}\n              {...(rowClass ? { rowClass } : {})}\n              {...(isSecondary ? { isSecondary } : {})}\n              {...(hasMoreChildren ? { hasMoreChildren } : {})}\n              {...(loadChildren ? { loadChildren } : {})}\n            />\n          ))}\n        </div>\n      )}\n    </div>\n  );\n}\n"],"names":["useState","useRef","useEffect","jsxs","cn","jsx","Icon","UiChevronDown","UiChevronRight"],"mappings":";;;;;;;;AAkEO,SAAS,SAAY;AAAA,EAC1B;AAAA,EACA,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,gBAAgB;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AACF,GAAqB;AAInB,QAAM,CAAC,gBAAgB,iBAAiB,IAAIA,MAAAA,SAAqB,IAAI;AACrE,QAAM,CAAC,SAAS,UAAU,IAAIA,MAAAA,SAAS,KAAK;AAC5C,QAAM,CAAC,OAAO,QAAQ,IAAIA,MAAAA,SAAkB,IAAI;AAChD,QAAM,eAAe,YAAY,IAAI;AACrC,QAAM,WAAW,kBAAkB;AACnC,QAAM,gBAAe,qCAAU,WAAU,KAAK;AAC9C,QAAM,iBAAgB,mDAAkB,UAAS,UAAU,mBAAmB;AAG9E,QAAM,aAAa,eAAe;AAclC,QAAM,iBAAgB,2CAAc,UAAS;AAC7C,QAAM,uBACJ,eAAe,eAAe,QAAQ,SAAU,MAAM,CAAC,MAAM,YAAY,CAAC,CAAC;AAC7E,QAAM,gBAAgB,iBAAiB;AAOvC,QAAM,cACJ,cAAc,QAAQ,CAAC,gBACnB,YACA,cACE,YAAY,MAAM,KAAK,IACvB,QAAQ;AAChB,QAAM,CAAC,MAAM,OAAO,IAAIA,MAAAA,SAAS,WAAW;AAC5C,QAAM,gBAAgBC,MAAAA,OAAO,SAAS;AACtC,QAAM,aAAa,aAAa;AAChC,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,gBAAe,iDAAgB,IAAI,SAAQ;AACjD,QAAM,SAAS,gBAAgB;AAE/BC,QAAAA,UAAU,MAAM;AACd,QAAI,cAAc,QAAQ,cAAc,cAAc,WAAW,CAAC,eAAe;AAC/E,cAAQ,SAAS;AAAA,IACnB;AACA,kBAAc,UAAU;AAAA,EAC1B,GAAG,CAAC,WAAW,aAAa,CAAC;AAI7B,QAAM,gBAAgBD,MAAAA,OAAO,KAAK;AAClC,QAAM,UAAU,OAAO,IAAI;AAC3B,QAAM,aAAaA,MAAAA,OAAO,OAAO;AAEjC,WAAS,mBAAmB;AAC1B,QAAI,CAAC,gBAAgB,cAAc,QAAS;AAC5C,kBAAc,UAAU;AACxB,eAAW,UAAU;AACrB,eAAW,IAAI;AACf,aAAS,IAAI;AACb,iBAAa,IAAI,EACd,KAAK,CAAC,SAAS;AACd,UAAI,WAAW,YAAY,QAAS;AACpC,wBAAkB,IAAI;AACtB,iBAAW,KAAK;AAAA,IAClB,CAAC,EACA,MAAM,CAAC,QAAQ;AACd,UAAI,WAAW,YAAY,QAAS;AAEpC,oBAAc,UAAU;AACxB,eAAS,GAAG;AACZ,iBAAW,KAAK;AAAA,IAClB,CAAC;AAAA,EACL;AAEA,WAAS,SAAS;AAChB,QAAI,CAAC,WAAY;AACjB,YAAQ,CAAC,MAAM;AACb,YAAM,OAAO,CAAC;AAGd,UAAI,QAAQ,aAAc,kBAAA;AAC1B,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,QAAM,eAAe,aAAa,4CAA4C;AAC9E,QAAM,eAAe,WAAW,SAAS,MAAM,UAAU,IAAI;AAE7D,SACEE,2BAAAA;AAAAA,IAAC;AAAA,IAAA;AAAA,MACC,MAAK;AAAA,MACL,cAAY,6CAAe;AAAA,MAC3B,iBAAe,aAAa,SAAS;AAAA,MACrC,iBAAe;AAAA,MAEf,UAAA;AAAA,QAAAA,2BAAAA;AAAAA,UAAC;AAAA,UAAA;AAAA,YACC,WAAWC,MAAAA,GAAG,8DAA8D,YAAY;AAAA,YACxF,OAAO,EAAE,aAAa,GAAG,QAAQ,WAAW,aAAa,KAAA;AAAA,YACzD,SAAS,CAAC,MAAM;AACd,gBAAE,gBAAA;AACF,mDAAW;AACX,qBAAA;AAAA,YACF;AAAA,YAEC,UAAA;AAAA,cAAA,aACCC,2BAAAA;AAAAA,gBAAC;AAAA,gBAAA;AAAA,kBACC,MAAK;AAAA,kBACL,cAAY,SAAS,aAAa;AAAA,kBAIlC,SAAS,CAAC,MAAM;AACd,sBAAE,gBAAA;AACF,2BAAA;AAAA,kBACF;AAAA,kBACA,WAAU;AAAA,kBAEV,yCAACC,KAAAA,MAAA,EAAK,MAAM,SAASC,8BAAgBC,eAAAA,gBAAgB,WAAU,cAAA,CAAc;AAAA,gBAAA;AAAA,cAAA,IAG/EH,2BAAAA,IAAC,QAAA,EAAK,WAAU,gBAAe,eAAW,MAAC;AAAA,cAE5C,UAAU;AAAA,gBACT;AAAA,gBACA;AAAA,gBACA,MAAM;AAAA,gBACN,UAAU;AAAA,gBACV;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,cAAA,CACD;AAAA,YAAA;AAAA,UAAA;AAAA,QAAA;AAAA,QAEF,UAAU,eACTA,+BAAC,OAAA,EAAI,MAAK,SACP,UAAA,SAAU,IAAI,CAAC,UACdA,2BAAAA;AAAAA,UAAC;AAAA,UAAA;AAAA,YAEC,MAAM;AAAA,YACN,OAAO,QAAQ;AAAA,YACf;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACC,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,eAAe,EAAE,aAAA,IAAiB,CAAA;AAAA,YACtC,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,kBAAkB,EAAE,gBAAA,IAAoB,CAAA;AAAA,YAC5C,GAAI,eAAe,EAAE,iBAAiB,CAAA;AAAA,UAAC;AAAA,UAjBnC,OAAO,KAAK;AAAA,QAAA,CAmBpB,EAAA,CACH;AAAA,MAAA;AAAA,IAAA;AAAA,EAAA;AAIR;;"}
+{"version":3,"file":"TreeNode.cjs","sources":["../../src/data/TreeNode.tsx"],"sourcesContent":["import { useEffect, useRef, useState, type ReactNode } from \"react\";\nimport { cn } from \"../lib/utils\";\nimport { Icon } from \"./Icon\";\nimport { UiChevronDown, UiChevronRight } from \"../icons\";\n\nexport type TreeRowContext<T> = {\n  node: T;\n  depth: number;\n  open: boolean;\n  selected: boolean;\n  hasChildren: boolean;\n  toggle: () => void;\n  /** True while this node's lazy children are being fetched via loadChildren. */\n  loading: boolean;\n  /** The rejection value from loadChildren, or null when there was no error. */\n  error: unknown;\n};\n\nexport type TreeNodeProps<T> = {\n  node: T;\n  depth?: number;\n  expandAll?: boolean | null;\n  forcedOpenKeys?: Set<string | number> | null;\n  selected?: T | null;\n  defaultOpen?: (node: T, depth: number) => boolean;\n  getChildren: (node: T) => T[] | undefined;\n  getKey: (node: T) => string | number;\n  getAriaLabel?: (node: T) => string;\n  onSelect?: (node: T) => void;\n  renderRow: (ctx: TreeRowContext<T>) => ReactNode;\n  rowClass?: (node: T, selected: boolean) => string;\n  indentPx?: number;\n  basePaddingPx?: number;\n  /**\n   * Reports that a node has children that are not yet loaded — it renders an\n   * expand chevron even when `getChildren` returns nothing. On the first open\n   * the node fetches them via `loadChildren`. Without this (the default), a\n   * node is expandable only when `getChildren` already returns children.\n   */\n  hasMoreChildren?: (node: T) => boolean;\n  /**\n   * Lazily fetch a node's children the first time it is opened. Resolves to the\n   * child nodes (which may themselves be lazy). A rejection is surfaced to\n   * `renderRow` via `ctx.error` and is not retried until the node is collapsed\n   * and reopened. Required for any node `hasMoreChildren` returns true for.\n   */\n  loadChildren?: (node: T) => Promise<T[]>;\n  /**\n   * Marks a node as a **secondary child** of its parent. Secondary\n   * children keep the full tree structure (they render, they can be\n   * opened manually) but opt out of the bulk behaviours a caller\n   * typically wants when they click the toolbar:\n   *\n   *  - Tree-wide filter: their text is skipped during match detection\n   *    so typing in the search box never surfaces a row because one\n   *    of its secondary children happened to match.\n   *  - Expand all: secondary nodes stay at their default-open state\n   *    instead of being forced open, preventing 28k field rows from\n   *    flooding the viewport when an operator hits the button on a\n   *    schema with hundreds of tables.\n   *\n   * Default: every node is primary (returns false).\n   */\n  isSecondary?: (node: T) => boolean;\n};\n\nexport function TreeNode<T>({\n  node,\n  depth = 0,\n  expandAll = null,\n  forcedOpenKeys = null,\n  selected = null,\n  defaultOpen,\n  getChildren,\n  getKey,\n  getAriaLabel,\n  onSelect,\n  renderRow,\n  rowClass,\n  indentPx = 16,\n  basePaddingPx = 8,\n  isSecondary,\n  hasMoreChildren,\n  loadChildren,\n}: TreeNodeProps<T>) {\n  // Lazily-fetched children take precedence over the synchronous ones once a\n  // load has resolved; until then `loadedChildren` is null and we fall back to\n  // getChildren. A node can be \"lazy\" (hasMoreChildren) with no sync children.\n  const [loadedChildren, setLoadedChildren] = useState<T[] | null>(null);\n  const [loading, setLoading] = useState(false);\n  const [error, setError] = useState<unknown>(null);\n  const syncChildren = getChildren(node);\n  const children = loadedChildren ?? syncChildren;\n  const hasChildren = (children?.length ?? 0) > 0;\n  const lazyUnloaded = (hasMoreChildren?.(node) ?? false) && loadedChildren === null;\n  // The chevron shows when there is something to reveal: either real children\n  // are present, or the node is lazy and has not been loaded yet.\n  const expandable = hasChildren || lazyUnloaded;\n  // A node opts out of bulk expand-all in two distinct cases:\n  //\n  //  1. The node itself is secondary (its edge from the parent is\n  //     secondary) — rare at the root, but the rule is symmetric.\n  //  2. All of the node's children are secondary — the common case.\n  //     This is what keeps an \"Expand all\" on a schema tree from\n  //     flooding the viewport with every table's field rows: the\n  //     table opens to nothing structural worth seeing in bulk, so\n  //     we leave it closed until the operator clicks it manually.\n  //\n  // In both cases the manual toggle still works, and filter matches\n  // still force the row open via forcedOpenKeys, so users never\n  // lose access — they just don't get auto-flooded.\n  const secondaryNode = isSecondary?.(node) ?? false;\n  const childrenAllSecondary =\n    hasChildren && isSecondary != null && children!.every((c) => isSecondary(c));\n  const skipExpandAll = secondaryNode || childrenAllSecondary;\n  // A non-null `expandAll` is a live bulk state, not just a one-off change\n  // signal: a node mounted *while* expand-all is active (because an ancestor\n  // just opened) inherits it as its initial open state, so opening a parent\n  // cascades all the way down — expand/collapse-all are recursive. The\n  // skipExpandAll guard keeps secondary subtrees from auto-flooding. When\n  // expandAll is null (before any toolbar click) we fall back to defaultOpen.\n  const initialOpen =\n    expandAll !== null && !skipExpandAll\n      ? expandAll\n      : defaultOpen\n        ? defaultOpen(node, depth)\n        : depth < 1;\n  const [open, setOpen] = useState(initialOpen);\n  const prevExpandAll = useRef(expandAll);\n  const isSelected = selected === node;\n  const key = getKey(node);\n  const isForcedOpen = forcedOpenKeys?.has(key) ?? false;\n  const isOpen = isForcedOpen || open;\n\n  useEffect(() => {\n    if (expandAll !== null && expandAll !== prevExpandAll.current && !skipExpandAll) {\n      setOpen(expandAll);\n    }\n    prevExpandAll.current = expandAll;\n  }, [expandAll, skipExpandAll]);\n\n  // Guards a lazy fetch so a node loads its children at most once per mount and\n  // a resolution arriving after the node was reused (key changed) is ignored.\n  const loadRequested = useRef(false);\n  const nodeKey = getKey(node);\n  const loadKeyRef = useRef(nodeKey);\n\n  function loadLazyChildren() {\n    if (!loadChildren || loadRequested.current) return;\n    loadRequested.current = true;\n    loadKeyRef.current = nodeKey;\n    setLoading(true);\n    setError(null);\n    loadChildren(node)\n      .then((kids) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        setLoadedChildren(kids);\n        setLoading(false);\n      })\n      .catch((err) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        // Surfaced to renderRow via ctx.error; allow a retry on re-toggle.\n        loadRequested.current = false;\n        setError(err);\n        setLoading(false);\n      });\n  }\n\n  // A lazy node can be open without ever having been clicked — defaultOpen said\n  // so, expand-all did, or the filter forced it open to reveal a match. Loading\n  // only on the open transition would leave every one of those showing a caret\n  // over nothing.\n  //\n  // A node that already failed is skipped: loadLazyChildren clears its own retry\n  // guard on failure so a re-toggle can try again, and re-running here would\n  // turn that into an unbounded retry loop instead.\n  useEffect(() => {\n    if (isOpen && lazyUnloaded && error === null) loadLazyChildren();\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n  }, [isOpen, lazyUnloaded, error]);\n\n  function toggle() {\n    if (!expandable) return;\n    setOpen((o) => {\n      const next = !o;\n      // Only fetch when transitioning into the open state, so collapsing a\n      // not-yet-loaded (e.g. previously-failed) lazy node never triggers a load.\n      if (next && lazyUnloaded) loadLazyChildren();\n      return next;\n    });\n  }\n\n  const defaultRowBg = isSelected ? \"bg-primary/10 border-l-2 border-primary\" : \"hover:bg-accent\";\n  const rowClassName = rowClass ? rowClass(node, isSelected) : defaultRowBg;\n\n  return (\n    <div\n      role=\"treeitem\"\n      aria-label={getAriaLabel?.(node)}\n      aria-expanded={expandable ? isOpen : undefined}\n      aria-selected={isSelected}\n    >\n      <div\n        className={cn(\"flex items-center gap-1.5 py-1 px-2 cursor-pointer text-sm\", rowClassName)}\n        style={{ paddingLeft: `${depth * indentPx + basePaddingPx}px` }}\n        onClick={(e) => {\n          e.stopPropagation();\n          onSelect?.(node);\n          toggle();\n        }}\n      >\n        {expandable ? (\n          <button\n            type=\"button\"\n            aria-label={isOpen ? \"Collapse\" : \"Expand\"}\n            // The caret only toggles expansion — stopPropagation keeps the row's\n            // onClick (which selects) from firing, so expanding a node never\n            // selects it.\n            onClick={(e) => {\n              e.stopPropagation();\n              toggle();\n            }}\n            className=\"flex shrink-0 items-center text-muted-foreground\"\n          >\n            <Icon icon={isOpen ? UiChevronDown : UiChevronRight} className=\"text-xs w-3\" />\n          </button>\n        ) : (\n          <span className=\"w-3 shrink-0\" aria-hidden />\n        )}\n        {renderRow({\n          node,\n          depth,\n          open: isOpen,\n          selected: isSelected,\n          hasChildren,\n          toggle,\n          loading,\n          error,\n        })}\n      </div>\n      {isOpen && hasChildren && (\n        <div role=\"group\">\n          {children!.map((child) => (\n            <TreeNode\n              key={getKey(child)}\n              node={child}\n              depth={depth + 1}\n              expandAll={expandAll}\n              forcedOpenKeys={forcedOpenKeys}\n              selected={selected}\n              getChildren={getChildren}\n              getKey={getKey}\n              renderRow={renderRow}\n              indentPx={indentPx}\n              basePaddingPx={basePaddingPx}\n              {...(defaultOpen ? { defaultOpen } : {})}\n              {...(getAriaLabel ? { getAriaLabel } : {})}\n              {...(onSelect ? { onSelect } : {})}\n              {...(rowClass ? { rowClass } : {})}\n              {...(isSecondary ? { isSecondary } : {})}\n              {...(hasMoreChildren ? { hasMoreChildren } : {})}\n              {...(loadChildren ? { loadChildren } : {})}\n            />\n          ))}\n        </div>\n      )}\n    </div>\n  );\n}\n"],"names":["useState","useRef","useEffect","jsxs","cn","jsx","Icon","UiChevronDown","UiChevronRight"],"mappings":";;;;;;;;AAkEO,SAAS,SAAY;AAAA,EAC1B;AAAA,EACA,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,gBAAgB;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AACF,GAAqB;AAInB,QAAM,CAAC,gBAAgB,iBAAiB,IAAIA,MAAAA,SAAqB,IAAI;AACrE,QAAM,CAAC,SAAS,UAAU,IAAIA,MAAAA,SAAS,KAAK;AAC5C,QAAM,CAAC,OAAO,QAAQ,IAAIA,MAAAA,SAAkB,IAAI;AAChD,QAAM,eAAe,YAAY,IAAI;AACrC,QAAM,WAAW,kBAAkB;AACnC,QAAM,gBAAe,qCAAU,WAAU,KAAK;AAC9C,QAAM,iBAAgB,mDAAkB,UAAS,UAAU,mBAAmB;AAG9E,QAAM,aAAa,eAAe;AAclC,QAAM,iBAAgB,2CAAc,UAAS;AAC7C,QAAM,uBACJ,eAAe,eAAe,QAAQ,SAAU,MAAM,CAAC,MAAM,YAAY,CAAC,CAAC;AAC7E,QAAM,gBAAgB,iBAAiB;AAOvC,QAAM,cACJ,cAAc,QAAQ,CAAC,gBACnB,YACA,cACE,YAAY,MAAM,KAAK,IACvB,QAAQ;AAChB,QAAM,CAAC,MAAM,OAAO,IAAIA,MAAAA,SAAS,WAAW;AAC5C,QAAM,gBAAgBC,MAAAA,OAAO,SAAS;AACtC,QAAM,aAAa,aAAa;AAChC,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,gBAAe,iDAAgB,IAAI,SAAQ;AACjD,QAAM,SAAS,gBAAgB;AAE/BC,QAAAA,UAAU,MAAM;AACd,QAAI,cAAc,QAAQ,cAAc,cAAc,WAAW,CAAC,eAAe;AAC/E,cAAQ,SAAS;AAAA,IACnB;AACA,kBAAc,UAAU;AAAA,EAC1B,GAAG,CAAC,WAAW,aAAa,CAAC;AAI7B,QAAM,gBAAgBD,MAAAA,OAAO,KAAK;AAClC,QAAM,UAAU,OAAO,IAAI;AAC3B,QAAM,aAAaA,MAAAA,OAAO,OAAO;AAEjC,WAAS,mBAAmB;AAC1B,QAAI,CAAC,gBAAgB,cAAc,QAAS;AAC5C,kBAAc,UAAU;AACxB,eAAW,UAAU;AACrB,eAAW,IAAI;AACf,aAAS,IAAI;AACb,iBAAa,IAAI,EACd,KAAK,CAAC,SAAS;AACd,UAAI,WAAW,YAAY,QAAS;AACpC,wBAAkB,IAAI;AACtB,iBAAW,KAAK;AAAA,IAClB,CAAC,EACA,MAAM,CAAC,QAAQ;AACd,UAAI,WAAW,YAAY,QAAS;AAEpC,oBAAc,UAAU;AACxB,eAAS,GAAG;AACZ,iBAAW,KAAK;AAAA,IAClB,CAAC;AAAA,EACL;AAUAC,QAAAA,UAAU,MAAM;AACd,QAAI,UAAU,gBAAgB,UAAU,KAAM,kBAAA;AAAA,EAEhD,GAAG,CAAC,QAAQ,cAAc,KAAK,CAAC;AAEhC,WAAS,SAAS;AAChB,QAAI,CAAC,WAAY;AACjB,YAAQ,CAAC,MAAM;AACb,YAAM,OAAO,CAAC;AAGd,UAAI,QAAQ,aAAc,kBAAA;AAC1B,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,QAAM,eAAe,aAAa,4CAA4C;AAC9E,QAAM,eAAe,WAAW,SAAS,MAAM,UAAU,IAAI;AAE7D,SACEC,2BAAAA;AAAAA,IAAC;AAAA,IAAA;AAAA,MACC,MAAK;AAAA,MACL,cAAY,6CAAe;AAAA,MAC3B,iBAAe,aAAa,SAAS;AAAA,MACrC,iBAAe;AAAA,MAEf,UAAA;AAAA,QAAAA,2BAAAA;AAAAA,UAAC;AAAA,UAAA;AAAA,YACC,WAAWC,MAAAA,GAAG,8DAA8D,YAAY;AAAA,YACxF,OAAO,EAAE,aAAa,GAAG,QAAQ,WAAW,aAAa,KAAA;AAAA,YACzD,SAAS,CAAC,MAAM;AACd,gBAAE,gBAAA;AACF,mDAAW;AACX,qBAAA;AAAA,YACF;AAAA,YAEC,UAAA;AAAA,cAAA,aACCC,2BAAAA;AAAAA,gBAAC;AAAA,gBAAA;AAAA,kBACC,MAAK;AAAA,kBACL,cAAY,SAAS,aAAa;AAAA,kBAIlC,SAAS,CAAC,MAAM;AACd,sBAAE,gBAAA;AACF,2BAAA;AAAA,kBACF;AAAA,kBACA,WAAU;AAAA,kBAEV,yCAACC,KAAAA,MAAA,EAAK,MAAM,SAASC,8BAAgBC,eAAAA,gBAAgB,WAAU,cAAA,CAAc;AAAA,gBAAA;AAAA,cAAA,IAG/EH,2BAAAA,IAAC,QAAA,EAAK,WAAU,gBAAe,eAAW,MAAC;AAAA,cAE5C,UAAU;AAAA,gBACT;AAAA,gBACA;AAAA,gBACA,MAAM;AAAA,gBACN,UAAU;AAAA,gBACV;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,cAAA,CACD;AAAA,YAAA;AAAA,UAAA;AAAA,QAAA;AAAA,QAEF,UAAU,eACTA,+BAAC,OAAA,EAAI,MAAK,SACP,UAAA,SAAU,IAAI,CAAC,UACdA,2BAAAA;AAAAA,UAAC;AAAA,UAAA;AAAA,YAEC,MAAM;AAAA,YACN,OAAO,QAAQ;AAAA,YACf;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACC,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,eAAe,EAAE,aAAA,IAAiB,CAAA;AAAA,YACtC,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,kBAAkB,EAAE,gBAAA,IAAoB,CAAA;AAAA,YAC5C,GAAI,eAAe,EAAE,iBAAiB,CAAA;AAAA,UAAC;AAAA,UAjBnC,OAAO,KAAK;AAAA,QAAA,CAmBpB,EAAA,CACH;AAAA,MAAA;AAAA,IAAA;AAAA,EAAA;AAIR;;"}

package/dist/data/TreeNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNode.d.ts","sourceRoot":"","sources":["../../src/data/TreeNode.tsx"],"names":[],"mappings":"AAAA,OAAO,EAA+B,KAAK,SAAS,EAAE,MAAM,OAAO,CAAC;AAKpE,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI;IAC9B,IAAI,EAAE,CAAC,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;IACd,QAAQ,EAAE,OAAO,CAAC;IAClB,WAAW,EAAE,OAAO,CAAC;IACrB,MAAM,EAAE,MAAM,IAAI,CAAC;IACnB,+EAA+E;IAC/E,OAAO,EAAE,OAAO,CAAC;IACjB,8EAA8E;IAC9E,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI;IAC7B,IAAI,EAAE,CAAC,CAAC;IACR,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;IAC3B,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC;IAC7C,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IACpB,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IAClD,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC;IAC1C,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAC;IACrC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;IACnC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC;IAC7B,SAAS,EAAE,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;IACjD,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,KAAK,MAAM,CAAC;IAClD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;IACvC;;;;;OAKG;IACH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACzC;;;;;;;;;;;;;;;OAeG;IACH,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;CACpC,CAAC;AAEF,wBAAgB,QAAQ,CAAC,CAAC,EAAE,EAC1B,IAAI,EACJ,KAAS,EACT,SAAgB,EAChB,cAAqB,EACrB,QAAe,EACf,WAAW,EACX,WAAW,EACX,MAAM,EACN,YAAY,EACZ,QAAQ,EACR,SAAS,EACT,QAAQ,EACR,QAAa,EACb,aAAiB,EACjB,WAAW,EACX,eAAe,EACf,YAAY,GACb,EAAE,aAAa,CAAC,CAAC,CAAC,2CA2KlB"}
+{"version":3,"file":"TreeNode.d.ts","sourceRoot":"","sources":["../../src/data/TreeNode.tsx"],"names":[],"mappings":"AAAA,OAAO,EAA+B,KAAK,SAAS,EAAE,MAAM,OAAO,CAAC;AAKpE,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI;IAC9B,IAAI,EAAE,CAAC,CAAC;IACR,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,OAAO,CAAC;IACd,QAAQ,EAAE,OAAO,CAAC;IAClB,WAAW,EAAE,OAAO,CAAC;IACrB,MAAM,EAAE,MAAM,IAAI,CAAC;IACnB,+EAA+E;IAC/E,OAAO,EAAE,OAAO,CAAC;IACjB,8EAA8E;IAC9E,KAAK,EAAE,OAAO,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI;IAC7B,IAAI,EAAE,CAAC,CAAC;IACR,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;IAC3B,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,IAAI,CAAC;IAC7C,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IACpB,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IAClD,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,SAAS,CAAC;IAC1C,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAAG,MAAM,CAAC;IACrC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;IACnC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC;IAC7B,SAAS,EAAE,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;IACjD,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,OAAO,KAAK,MAAM,CAAC;IAClD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;IACvC;;;;;OAKG;IACH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACzC;;;;;;;;;;;;;;;OAeG;IACH,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;CACpC,CAAC;AAEF,wBAAgB,QAAQ,CAAC,CAAC,EAAE,EAC1B,IAAI,EACJ,KAAS,EACT,SAAgB,EAChB,cAAqB,EACrB,QAAe,EACf,WAAW,EACX,WAAW,EACX,MAAM,EACN,YAAY,EACZ,QAAQ,EACR,SAAS,EACT,QAAQ,EACR,QAAa,EACb,aAAiB,EACjB,WAAW,EACX,eAAe,EACf,YAAY,GACb,EAAE,aAAa,CAAC,CAAC,CAAC,2CAwLlB"}

package/dist/data/TreeNode.js

@@ -67,6 +67,9 @@ function TreeNode({
       setLoading(false);
     });
   }
+  useEffect(() => {
+    if (isOpen && lazyUnloaded && error === null) loadLazyChildren();
+  }, [isOpen, lazyUnloaded, error]);
   function toggle() {
     if (!expandable) return;
     setOpen((o) => {

package/dist/data/TreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeNode.js","sources":["../../src/data/TreeNode.tsx"],"sourcesContent":["import { useEffect, useRef, useState, type ReactNode } from \"react\";\nimport { cn } from \"../lib/utils\";\nimport { Icon } from \"./Icon\";\nimport { UiChevronDown, UiChevronRight } from \"../icons\";\n\nexport type TreeRowContext<T> = {\n  node: T;\n  depth: number;\n  open: boolean;\n  selected: boolean;\n  hasChildren: boolean;\n  toggle: () => void;\n  /** True while this node's lazy children are being fetched via loadChildren. */\n  loading: boolean;\n  /** The rejection value from loadChildren, or null when there was no error. */\n  error: unknown;\n};\n\nexport type TreeNodeProps<T> = {\n  node: T;\n  depth?: number;\n  expandAll?: boolean | null;\n  forcedOpenKeys?: Set<string | number> | null;\n  selected?: T | null;\n  defaultOpen?: (node: T, depth: number) => boolean;\n  getChildren: (node: T) => T[] | undefined;\n  getKey: (node: T) => string | number;\n  getAriaLabel?: (node: T) => string;\n  onSelect?: (node: T) => void;\n  renderRow: (ctx: TreeRowContext<T>) => ReactNode;\n  rowClass?: (node: T, selected: boolean) => string;\n  indentPx?: number;\n  basePaddingPx?: number;\n  /**\n   * Reports that a node has children that are not yet loaded — it renders an\n   * expand chevron even when `getChildren` returns nothing. On the first open\n   * the node fetches them via `loadChildren`. Without this (the default), a\n   * node is expandable only when `getChildren` already returns children.\n   */\n  hasMoreChildren?: (node: T) => boolean;\n  /**\n   * Lazily fetch a node's children the first time it is opened. Resolves to the\n   * child nodes (which may themselves be lazy). A rejection is surfaced to\n   * `renderRow` via `ctx.error` and is not retried until the node is collapsed\n   * and reopened. Required for any node `hasMoreChildren` returns true for.\n   */\n  loadChildren?: (node: T) => Promise<T[]>;\n  /**\n   * Marks a node as a **secondary child** of its parent. Secondary\n   * children keep the full tree structure (they render, they can be\n   * opened manually) but opt out of the bulk behaviours a caller\n   * typically wants when they click the toolbar:\n   *\n   *  - Tree-wide filter: their text is skipped during match detection\n   *    so typing in the search box never surfaces a row because one\n   *    of its secondary children happened to match.\n   *  - Expand all: secondary nodes stay at their default-open state\n   *    instead of being forced open, preventing 28k field rows from\n   *    flooding the viewport when an operator hits the button on a\n   *    schema with hundreds of tables.\n   *\n   * Default: every node is primary (returns false).\n   */\n  isSecondary?: (node: T) => boolean;\n};\n\nexport function TreeNode<T>({\n  node,\n  depth = 0,\n  expandAll = null,\n  forcedOpenKeys = null,\n  selected = null,\n  defaultOpen,\n  getChildren,\n  getKey,\n  getAriaLabel,\n  onSelect,\n  renderRow,\n  rowClass,\n  indentPx = 16,\n  basePaddingPx = 8,\n  isSecondary,\n  hasMoreChildren,\n  loadChildren,\n}: TreeNodeProps<T>) {\n  // Lazily-fetched children take precedence over the synchronous ones once a\n  // load has resolved; until then `loadedChildren` is null and we fall back to\n  // getChildren. A node can be \"lazy\" (hasMoreChildren) with no sync children.\n  const [loadedChildren, setLoadedChildren] = useState<T[] | null>(null);\n  const [loading, setLoading] = useState(false);\n  const [error, setError] = useState<unknown>(null);\n  const syncChildren = getChildren(node);\n  const children = loadedChildren ?? syncChildren;\n  const hasChildren = (children?.length ?? 0) > 0;\n  const lazyUnloaded = (hasMoreChildren?.(node) ?? false) && loadedChildren === null;\n  // The chevron shows when there is something to reveal: either real children\n  // are present, or the node is lazy and has not been loaded yet.\n  const expandable = hasChildren || lazyUnloaded;\n  // A node opts out of bulk expand-all in two distinct cases:\n  //\n  //  1. The node itself is secondary (its edge from the parent is\n  //     secondary) — rare at the root, but the rule is symmetric.\n  //  2. All of the node's children are secondary — the common case.\n  //     This is what keeps an \"Expand all\" on a schema tree from\n  //     flooding the viewport with every table's field rows: the\n  //     table opens to nothing structural worth seeing in bulk, so\n  //     we leave it closed until the operator clicks it manually.\n  //\n  // In both cases the manual toggle still works, and filter matches\n  // still force the row open via forcedOpenKeys, so users never\n  // lose access — they just don't get auto-flooded.\n  const secondaryNode = isSecondary?.(node) ?? false;\n  const childrenAllSecondary =\n    hasChildren && isSecondary != null && children!.every((c) => isSecondary(c));\n  const skipExpandAll = secondaryNode || childrenAllSecondary;\n  // A non-null `expandAll` is a live bulk state, not just a one-off change\n  // signal: a node mounted *while* expand-all is active (because an ancestor\n  // just opened) inherits it as its initial open state, so opening a parent\n  // cascades all the way down — expand/collapse-all are recursive. The\n  // skipExpandAll guard keeps secondary subtrees from auto-flooding. When\n  // expandAll is null (before any toolbar click) we fall back to defaultOpen.\n  const initialOpen =\n    expandAll !== null && !skipExpandAll\n      ? expandAll\n      : defaultOpen\n        ? defaultOpen(node, depth)\n        : depth < 1;\n  const [open, setOpen] = useState(initialOpen);\n  const prevExpandAll = useRef(expandAll);\n  const isSelected = selected === node;\n  const key = getKey(node);\n  const isForcedOpen = forcedOpenKeys?.has(key) ?? false;\n  const isOpen = isForcedOpen || open;\n\n  useEffect(() => {\n    if (expandAll !== null && expandAll !== prevExpandAll.current && !skipExpandAll) {\n      setOpen(expandAll);\n    }\n    prevExpandAll.current = expandAll;\n  }, [expandAll, skipExpandAll]);\n\n  // Guards a lazy fetch so a node loads its children at most once per mount and\n  // a resolution arriving after the node was reused (key changed) is ignored.\n  const loadRequested = useRef(false);\n  const nodeKey = getKey(node);\n  const loadKeyRef = useRef(nodeKey);\n\n  function loadLazyChildren() {\n    if (!loadChildren || loadRequested.current) return;\n    loadRequested.current = true;\n    loadKeyRef.current = nodeKey;\n    setLoading(true);\n    setError(null);\n    loadChildren(node)\n      .then((kids) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        setLoadedChildren(kids);\n        setLoading(false);\n      })\n      .catch((err) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        // Surfaced to renderRow via ctx.error; allow a retry on re-toggle.\n        loadRequested.current = false;\n        setError(err);\n        setLoading(false);\n      });\n  }\n\n  function toggle() {\n    if (!expandable) return;\n    setOpen((o) => {\n      const next = !o;\n      // Only fetch when transitioning into the open state, so collapsing a\n      // not-yet-loaded (e.g. previously-failed) lazy node never triggers a load.\n      if (next && lazyUnloaded) loadLazyChildren();\n      return next;\n    });\n  }\n\n  const defaultRowBg = isSelected ? \"bg-primary/10 border-l-2 border-primary\" : \"hover:bg-accent\";\n  const rowClassName = rowClass ? rowClass(node, isSelected) : defaultRowBg;\n\n  return (\n    <div\n      role=\"treeitem\"\n      aria-label={getAriaLabel?.(node)}\n      aria-expanded={expandable ? isOpen : undefined}\n      aria-selected={isSelected}\n    >\n      <div\n        className={cn(\"flex items-center gap-1.5 py-1 px-2 cursor-pointer text-sm\", rowClassName)}\n        style={{ paddingLeft: `${depth * indentPx + basePaddingPx}px` }}\n        onClick={(e) => {\n          e.stopPropagation();\n          onSelect?.(node);\n          toggle();\n        }}\n      >\n        {expandable ? (\n          <button\n            type=\"button\"\n            aria-label={isOpen ? \"Collapse\" : \"Expand\"}\n            // The caret only toggles expansion — stopPropagation keeps the row's\n            // onClick (which selects) from firing, so expanding a node never\n            // selects it.\n            onClick={(e) => {\n              e.stopPropagation();\n              toggle();\n            }}\n            className=\"flex shrink-0 items-center text-muted-foreground\"\n          >\n            <Icon icon={isOpen ? UiChevronDown : UiChevronRight} className=\"text-xs w-3\" />\n          </button>\n        ) : (\n          <span className=\"w-3 shrink-0\" aria-hidden />\n        )}\n        {renderRow({\n          node,\n          depth,\n          open: isOpen,\n          selected: isSelected,\n          hasChildren,\n          toggle,\n          loading,\n          error,\n        })}\n      </div>\n      {isOpen && hasChildren && (\n        <div role=\"group\">\n          {children!.map((child) => (\n            <TreeNode\n              key={getKey(child)}\n              node={child}\n              depth={depth + 1}\n              expandAll={expandAll}\n              forcedOpenKeys={forcedOpenKeys}\n              selected={selected}\n              getChildren={getChildren}\n              getKey={getKey}\n              renderRow={renderRow}\n              indentPx={indentPx}\n              basePaddingPx={basePaddingPx}\n              {...(defaultOpen ? { defaultOpen } : {})}\n              {...(getAriaLabel ? { getAriaLabel } : {})}\n              {...(onSelect ? { onSelect } : {})}\n              {...(rowClass ? { rowClass } : {})}\n              {...(isSecondary ? { isSecondary } : {})}\n              {...(hasMoreChildren ? { hasMoreChildren } : {})}\n              {...(loadChildren ? { loadChildren } : {})}\n            />\n          ))}\n        </div>\n      )}\n    </div>\n  );\n}\n"],"names":[],"mappings":";;;;;;AAkEO,SAAS,SAAY;AAAA,EAC1B;AAAA,EACA,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,gBAAgB;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AACF,GAAqB;AAInB,QAAM,CAAC,gBAAgB,iBAAiB,IAAI,SAAqB,IAAI;AACrE,QAAM,CAAC,SAAS,UAAU,IAAI,SAAS,KAAK;AAC5C,QAAM,CAAC,OAAO,QAAQ,IAAI,SAAkB,IAAI;AAChD,QAAM,eAAe,YAAY,IAAI;AACrC,QAAM,WAAW,kBAAkB;AACnC,QAAM,gBAAe,qCAAU,WAAU,KAAK;AAC9C,QAAM,iBAAgB,mDAAkB,UAAS,UAAU,mBAAmB;AAG9E,QAAM,aAAa,eAAe;AAclC,QAAM,iBAAgB,2CAAc,UAAS;AAC7C,QAAM,uBACJ,eAAe,eAAe,QAAQ,SAAU,MAAM,CAAC,MAAM,YAAY,CAAC,CAAC;AAC7E,QAAM,gBAAgB,iBAAiB;AAOvC,QAAM,cACJ,cAAc,QAAQ,CAAC,gBACnB,YACA,cACE,YAAY,MAAM,KAAK,IACvB,QAAQ;AAChB,QAAM,CAAC,MAAM,OAAO,IAAI,SAAS,WAAW;AAC5C,QAAM,gBAAgB,OAAO,SAAS;AACtC,QAAM,aAAa,aAAa;AAChC,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,gBAAe,iDAAgB,IAAI,SAAQ;AACjD,QAAM,SAAS,gBAAgB;AAE/B,YAAU,MAAM;AACd,QAAI,cAAc,QAAQ,cAAc,cAAc,WAAW,CAAC,eAAe;AAC/E,cAAQ,SAAS;AAAA,IACnB;AACA,kBAAc,UAAU;AAAA,EAC1B,GAAG,CAAC,WAAW,aAAa,CAAC;AAI7B,QAAM,gBAAgB,OAAO,KAAK;AAClC,QAAM,UAAU,OAAO,IAAI;AAC3B,QAAM,aAAa,OAAO,OAAO;AAEjC,WAAS,mBAAmB;AAC1B,QAAI,CAAC,gBAAgB,cAAc,QAAS;AAC5C,kBAAc,UAAU;AACxB,eAAW,UAAU;AACrB,eAAW,IAAI;AACf,aAAS,IAAI;AACb,iBAAa,IAAI,EACd,KAAK,CAAC,SAAS;AACd,UAAI,WAAW,YAAY,QAAS;AACpC,wBAAkB,IAAI;AACtB,iBAAW,KAAK;AAAA,IAClB,CAAC,EACA,MAAM,CAAC,QAAQ;AACd,UAAI,WAAW,YAAY,QAAS;AAEpC,oBAAc,UAAU;AACxB,eAAS,GAAG;AACZ,iBAAW,KAAK;AAAA,IAClB,CAAC;AAAA,EACL;AAEA,WAAS,SAAS;AAChB,QAAI,CAAC,WAAY;AACjB,YAAQ,CAAC,MAAM;AACb,YAAM,OAAO,CAAC;AAGd,UAAI,QAAQ,aAAc,kBAAA;AAC1B,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,QAAM,eAAe,aAAa,4CAA4C;AAC9E,QAAM,eAAe,WAAW,SAAS,MAAM,UAAU,IAAI;AAE7D,SACE;AAAA,IAAC;AAAA,IAAA;AAAA,MACC,MAAK;AAAA,MACL,cAAY,6CAAe;AAAA,MAC3B,iBAAe,aAAa,SAAS;AAAA,MACrC,iBAAe;AAAA,MAEf,UAAA;AAAA,QAAA;AAAA,UAAC;AAAA,UAAA;AAAA,YACC,WAAW,GAAG,8DAA8D,YAAY;AAAA,YACxF,OAAO,EAAE,aAAa,GAAG,QAAQ,WAAW,aAAa,KAAA;AAAA,YACzD,SAAS,CAAC,MAAM;AACd,gBAAE,gBAAA;AACF,mDAAW;AACX,qBAAA;AAAA,YACF;AAAA,YAEC,UAAA;AAAA,cAAA,aACC;AAAA,gBAAC;AAAA,gBAAA;AAAA,kBACC,MAAK;AAAA,kBACL,cAAY,SAAS,aAAa;AAAA,kBAIlC,SAAS,CAAC,MAAM;AACd,sBAAE,gBAAA;AACF,2BAAA;AAAA,kBACF;AAAA,kBACA,WAAU;AAAA,kBAEV,8BAAC,MAAA,EAAK,MAAM,SAAS,gBAAgB,gBAAgB,WAAU,cAAA,CAAc;AAAA,gBAAA;AAAA,cAAA,IAG/E,oBAAC,QAAA,EAAK,WAAU,gBAAe,eAAW,MAAC;AAAA,cAE5C,UAAU;AAAA,gBACT;AAAA,gBACA;AAAA,gBACA,MAAM;AAAA,gBACN,UAAU;AAAA,gBACV;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,cAAA,CACD;AAAA,YAAA;AAAA,UAAA;AAAA,QAAA;AAAA,QAEF,UAAU,eACT,oBAAC,OAAA,EAAI,MAAK,SACP,UAAA,SAAU,IAAI,CAAC,UACd;AAAA,UAAC;AAAA,UAAA;AAAA,YAEC,MAAM;AAAA,YACN,OAAO,QAAQ;AAAA,YACf;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACC,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,eAAe,EAAE,aAAA,IAAiB,CAAA;AAAA,YACtC,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,kBAAkB,EAAE,gBAAA,IAAoB,CAAA;AAAA,YAC5C,GAAI,eAAe,EAAE,iBAAiB,CAAA;AAAA,UAAC;AAAA,UAjBnC,OAAO,KAAK;AAAA,QAAA,CAmBpB,EAAA,CACH;AAAA,MAAA;AAAA,IAAA;AAAA,EAAA;AAIR;"}
+{"version":3,"file":"TreeNode.js","sources":["../../src/data/TreeNode.tsx"],"sourcesContent":["import { useEffect, useRef, useState, type ReactNode } from \"react\";\nimport { cn } from \"../lib/utils\";\nimport { Icon } from \"./Icon\";\nimport { UiChevronDown, UiChevronRight } from \"../icons\";\n\nexport type TreeRowContext<T> = {\n  node: T;\n  depth: number;\n  open: boolean;\n  selected: boolean;\n  hasChildren: boolean;\n  toggle: () => void;\n  /** True while this node's lazy children are being fetched via loadChildren. */\n  loading: boolean;\n  /** The rejection value from loadChildren, or null when there was no error. */\n  error: unknown;\n};\n\nexport type TreeNodeProps<T> = {\n  node: T;\n  depth?: number;\n  expandAll?: boolean | null;\n  forcedOpenKeys?: Set<string | number> | null;\n  selected?: T | null;\n  defaultOpen?: (node: T, depth: number) => boolean;\n  getChildren: (node: T) => T[] | undefined;\n  getKey: (node: T) => string | number;\n  getAriaLabel?: (node: T) => string;\n  onSelect?: (node: T) => void;\n  renderRow: (ctx: TreeRowContext<T>) => ReactNode;\n  rowClass?: (node: T, selected: boolean) => string;\n  indentPx?: number;\n  basePaddingPx?: number;\n  /**\n   * Reports that a node has children that are not yet loaded — it renders an\n   * expand chevron even when `getChildren` returns nothing. On the first open\n   * the node fetches them via `loadChildren`. Without this (the default), a\n   * node is expandable only when `getChildren` already returns children.\n   */\n  hasMoreChildren?: (node: T) => boolean;\n  /**\n   * Lazily fetch a node's children the first time it is opened. Resolves to the\n   * child nodes (which may themselves be lazy). A rejection is surfaced to\n   * `renderRow` via `ctx.error` and is not retried until the node is collapsed\n   * and reopened. Required for any node `hasMoreChildren` returns true for.\n   */\n  loadChildren?: (node: T) => Promise<T[]>;\n  /**\n   * Marks a node as a **secondary child** of its parent. Secondary\n   * children keep the full tree structure (they render, they can be\n   * opened manually) but opt out of the bulk behaviours a caller\n   * typically wants when they click the toolbar:\n   *\n   *  - Tree-wide filter: their text is skipped during match detection\n   *    so typing in the search box never surfaces a row because one\n   *    of its secondary children happened to match.\n   *  - Expand all: secondary nodes stay at their default-open state\n   *    instead of being forced open, preventing 28k field rows from\n   *    flooding the viewport when an operator hits the button on a\n   *    schema with hundreds of tables.\n   *\n   * Default: every node is primary (returns false).\n   */\n  isSecondary?: (node: T) => boolean;\n};\n\nexport function TreeNode<T>({\n  node,\n  depth = 0,\n  expandAll = null,\n  forcedOpenKeys = null,\n  selected = null,\n  defaultOpen,\n  getChildren,\n  getKey,\n  getAriaLabel,\n  onSelect,\n  renderRow,\n  rowClass,\n  indentPx = 16,\n  basePaddingPx = 8,\n  isSecondary,\n  hasMoreChildren,\n  loadChildren,\n}: TreeNodeProps<T>) {\n  // Lazily-fetched children take precedence over the synchronous ones once a\n  // load has resolved; until then `loadedChildren` is null and we fall back to\n  // getChildren. A node can be \"lazy\" (hasMoreChildren) with no sync children.\n  const [loadedChildren, setLoadedChildren] = useState<T[] | null>(null);\n  const [loading, setLoading] = useState(false);\n  const [error, setError] = useState<unknown>(null);\n  const syncChildren = getChildren(node);\n  const children = loadedChildren ?? syncChildren;\n  const hasChildren = (children?.length ?? 0) > 0;\n  const lazyUnloaded = (hasMoreChildren?.(node) ?? false) && loadedChildren === null;\n  // The chevron shows when there is something to reveal: either real children\n  // are present, or the node is lazy and has not been loaded yet.\n  const expandable = hasChildren || lazyUnloaded;\n  // A node opts out of bulk expand-all in two distinct cases:\n  //\n  //  1. The node itself is secondary (its edge from the parent is\n  //     secondary) — rare at the root, but the rule is symmetric.\n  //  2. All of the node's children are secondary — the common case.\n  //     This is what keeps an \"Expand all\" on a schema tree from\n  //     flooding the viewport with every table's field rows: the\n  //     table opens to nothing structural worth seeing in bulk, so\n  //     we leave it closed until the operator clicks it manually.\n  //\n  // In both cases the manual toggle still works, and filter matches\n  // still force the row open via forcedOpenKeys, so users never\n  // lose access — they just don't get auto-flooded.\n  const secondaryNode = isSecondary?.(node) ?? false;\n  const childrenAllSecondary =\n    hasChildren && isSecondary != null && children!.every((c) => isSecondary(c));\n  const skipExpandAll = secondaryNode || childrenAllSecondary;\n  // A non-null `expandAll` is a live bulk state, not just a one-off change\n  // signal: a node mounted *while* expand-all is active (because an ancestor\n  // just opened) inherits it as its initial open state, so opening a parent\n  // cascades all the way down — expand/collapse-all are recursive. The\n  // skipExpandAll guard keeps secondary subtrees from auto-flooding. When\n  // expandAll is null (before any toolbar click) we fall back to defaultOpen.\n  const initialOpen =\n    expandAll !== null && !skipExpandAll\n      ? expandAll\n      : defaultOpen\n        ? defaultOpen(node, depth)\n        : depth < 1;\n  const [open, setOpen] = useState(initialOpen);\n  const prevExpandAll = useRef(expandAll);\n  const isSelected = selected === node;\n  const key = getKey(node);\n  const isForcedOpen = forcedOpenKeys?.has(key) ?? false;\n  const isOpen = isForcedOpen || open;\n\n  useEffect(() => {\n    if (expandAll !== null && expandAll !== prevExpandAll.current && !skipExpandAll) {\n      setOpen(expandAll);\n    }\n    prevExpandAll.current = expandAll;\n  }, [expandAll, skipExpandAll]);\n\n  // Guards a lazy fetch so a node loads its children at most once per mount and\n  // a resolution arriving after the node was reused (key changed) is ignored.\n  const loadRequested = useRef(false);\n  const nodeKey = getKey(node);\n  const loadKeyRef = useRef(nodeKey);\n\n  function loadLazyChildren() {\n    if (!loadChildren || loadRequested.current) return;\n    loadRequested.current = true;\n    loadKeyRef.current = nodeKey;\n    setLoading(true);\n    setError(null);\n    loadChildren(node)\n      .then((kids) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        setLoadedChildren(kids);\n        setLoading(false);\n      })\n      .catch((err) => {\n        if (loadKeyRef.current !== nodeKey) return;\n        // Surfaced to renderRow via ctx.error; allow a retry on re-toggle.\n        loadRequested.current = false;\n        setError(err);\n        setLoading(false);\n      });\n  }\n\n  // A lazy node can be open without ever having been clicked — defaultOpen said\n  // so, expand-all did, or the filter forced it open to reveal a match. Loading\n  // only on the open transition would leave every one of those showing a caret\n  // over nothing.\n  //\n  // A node that already failed is skipped: loadLazyChildren clears its own retry\n  // guard on failure so a re-toggle can try again, and re-running here would\n  // turn that into an unbounded retry loop instead.\n  useEffect(() => {\n    if (isOpen && lazyUnloaded && error === null) loadLazyChildren();\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n  }, [isOpen, lazyUnloaded, error]);\n\n  function toggle() {\n    if (!expandable) return;\n    setOpen((o) => {\n      const next = !o;\n      // Only fetch when transitioning into the open state, so collapsing a\n      // not-yet-loaded (e.g. previously-failed) lazy node never triggers a load.\n      if (next && lazyUnloaded) loadLazyChildren();\n      return next;\n    });\n  }\n\n  const defaultRowBg = isSelected ? \"bg-primary/10 border-l-2 border-primary\" : \"hover:bg-accent\";\n  const rowClassName = rowClass ? rowClass(node, isSelected) : defaultRowBg;\n\n  return (\n    <div\n      role=\"treeitem\"\n      aria-label={getAriaLabel?.(node)}\n      aria-expanded={expandable ? isOpen : undefined}\n      aria-selected={isSelected}\n    >\n      <div\n        className={cn(\"flex items-center gap-1.5 py-1 px-2 cursor-pointer text-sm\", rowClassName)}\n        style={{ paddingLeft: `${depth * indentPx + basePaddingPx}px` }}\n        onClick={(e) => {\n          e.stopPropagation();\n          onSelect?.(node);\n          toggle();\n        }}\n      >\n        {expandable ? (\n          <button\n            type=\"button\"\n            aria-label={isOpen ? \"Collapse\" : \"Expand\"}\n            // The caret only toggles expansion — stopPropagation keeps the row's\n            // onClick (which selects) from firing, so expanding a node never\n            // selects it.\n            onClick={(e) => {\n              e.stopPropagation();\n              toggle();\n            }}\n            className=\"flex shrink-0 items-center text-muted-foreground\"\n          >\n            <Icon icon={isOpen ? UiChevronDown : UiChevronRight} className=\"text-xs w-3\" />\n          </button>\n        ) : (\n          <span className=\"w-3 shrink-0\" aria-hidden />\n        )}\n        {renderRow({\n          node,\n          depth,\n          open: isOpen,\n          selected: isSelected,\n          hasChildren,\n          toggle,\n          loading,\n          error,\n        })}\n      </div>\n      {isOpen && hasChildren && (\n        <div role=\"group\">\n          {children!.map((child) => (\n            <TreeNode\n              key={getKey(child)}\n              node={child}\n              depth={depth + 1}\n              expandAll={expandAll}\n              forcedOpenKeys={forcedOpenKeys}\n              selected={selected}\n              getChildren={getChildren}\n              getKey={getKey}\n              renderRow={renderRow}\n              indentPx={indentPx}\n              basePaddingPx={basePaddingPx}\n              {...(defaultOpen ? { defaultOpen } : {})}\n              {...(getAriaLabel ? { getAriaLabel } : {})}\n              {...(onSelect ? { onSelect } : {})}\n              {...(rowClass ? { rowClass } : {})}\n              {...(isSecondary ? { isSecondary } : {})}\n              {...(hasMoreChildren ? { hasMoreChildren } : {})}\n              {...(loadChildren ? { loadChildren } : {})}\n            />\n          ))}\n        </div>\n      )}\n    </div>\n  );\n}\n"],"names":[],"mappings":";;;;;;AAkEO,SAAS,SAAY;AAAA,EAC1B;AAAA,EACA,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,iBAAiB;AAAA,EACjB,WAAW;AAAA,EACX;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,gBAAgB;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AACF,GAAqB;AAInB,QAAM,CAAC,gBAAgB,iBAAiB,IAAI,SAAqB,IAAI;AACrE,QAAM,CAAC,SAAS,UAAU,IAAI,SAAS,KAAK;AAC5C,QAAM,CAAC,OAAO,QAAQ,IAAI,SAAkB,IAAI;AAChD,QAAM,eAAe,YAAY,IAAI;AACrC,QAAM,WAAW,kBAAkB;AACnC,QAAM,gBAAe,qCAAU,WAAU,KAAK;AAC9C,QAAM,iBAAgB,mDAAkB,UAAS,UAAU,mBAAmB;AAG9E,QAAM,aAAa,eAAe;AAclC,QAAM,iBAAgB,2CAAc,UAAS;AAC7C,QAAM,uBACJ,eAAe,eAAe,QAAQ,SAAU,MAAM,CAAC,MAAM,YAAY,CAAC,CAAC;AAC7E,QAAM,gBAAgB,iBAAiB;AAOvC,QAAM,cACJ,cAAc,QAAQ,CAAC,gBACnB,YACA,cACE,YAAY,MAAM,KAAK,IACvB,QAAQ;AAChB,QAAM,CAAC,MAAM,OAAO,IAAI,SAAS,WAAW;AAC5C,QAAM,gBAAgB,OAAO,SAAS;AACtC,QAAM,aAAa,aAAa;AAChC,QAAM,MAAM,OAAO,IAAI;AACvB,QAAM,gBAAe,iDAAgB,IAAI,SAAQ;AACjD,QAAM,SAAS,gBAAgB;AAE/B,YAAU,MAAM;AACd,QAAI,cAAc,QAAQ,cAAc,cAAc,WAAW,CAAC,eAAe;AAC/E,cAAQ,SAAS;AAAA,IACnB;AACA,kBAAc,UAAU;AAAA,EAC1B,GAAG,CAAC,WAAW,aAAa,CAAC;AAI7B,QAAM,gBAAgB,OAAO,KAAK;AAClC,QAAM,UAAU,OAAO,IAAI;AAC3B,QAAM,aAAa,OAAO,OAAO;AAEjC,WAAS,mBAAmB;AAC1B,QAAI,CAAC,gBAAgB,cAAc,QAAS;AAC5C,kBAAc,UAAU;AACxB,eAAW,UAAU;AACrB,eAAW,IAAI;AACf,aAAS,IAAI;AACb,iBAAa,IAAI,EACd,KAAK,CAAC,SAAS;AACd,UAAI,WAAW,YAAY,QAAS;AACpC,wBAAkB,IAAI;AACtB,iBAAW,KAAK;AAAA,IAClB,CAAC,EACA,MAAM,CAAC,QAAQ;AACd,UAAI,WAAW,YAAY,QAAS;AAEpC,oBAAc,UAAU;AACxB,eAAS,GAAG;AACZ,iBAAW,KAAK;AAAA,IAClB,CAAC;AAAA,EACL;AAUA,YAAU,MAAM;AACd,QAAI,UAAU,gBAAgB,UAAU,KAAM,kBAAA;AAAA,EAEhD,GAAG,CAAC,QAAQ,cAAc,KAAK,CAAC;AAEhC,WAAS,SAAS;AAChB,QAAI,CAAC,WAAY;AACjB,YAAQ,CAAC,MAAM;AACb,YAAM,OAAO,CAAC;AAGd,UAAI,QAAQ,aAAc,kBAAA;AAC1B,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAEA,QAAM,eAAe,aAAa,4CAA4C;AAC9E,QAAM,eAAe,WAAW,SAAS,MAAM,UAAU,IAAI;AAE7D,SACE;AAAA,IAAC;AAAA,IAAA;AAAA,MACC,MAAK;AAAA,MACL,cAAY,6CAAe;AAAA,MAC3B,iBAAe,aAAa,SAAS;AAAA,MACrC,iBAAe;AAAA,MAEf,UAAA;AAAA,QAAA;AAAA,UAAC;AAAA,UAAA;AAAA,YACC,WAAW,GAAG,8DAA8D,YAAY;AAAA,YACxF,OAAO,EAAE,aAAa,GAAG,QAAQ,WAAW,aAAa,KAAA;AAAA,YACzD,SAAS,CAAC,MAAM;AACd,gBAAE,gBAAA;AACF,mDAAW;AACX,qBAAA;AAAA,YACF;AAAA,YAEC,UAAA;AAAA,cAAA,aACC;AAAA,gBAAC;AAAA,gBAAA;AAAA,kBACC,MAAK;AAAA,kBACL,cAAY,SAAS,aAAa;AAAA,kBAIlC,SAAS,CAAC,MAAM;AACd,sBAAE,gBAAA;AACF,2BAAA;AAAA,kBACF;AAAA,kBACA,WAAU;AAAA,kBAEV,8BAAC,MAAA,EAAK,MAAM,SAAS,gBAAgB,gBAAgB,WAAU,cAAA,CAAc;AAAA,gBAAA;AAAA,cAAA,IAG/E,oBAAC,QAAA,EAAK,WAAU,gBAAe,eAAW,MAAC;AAAA,cAE5C,UAAU;AAAA,gBACT;AAAA,gBACA;AAAA,gBACA,MAAM;AAAA,gBACN,UAAU;AAAA,gBACV;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,cAAA,CACD;AAAA,YAAA;AAAA,UAAA;AAAA,QAAA;AAAA,QAEF,UAAU,eACT,oBAAC,OAAA,EAAI,MAAK,SACP,UAAA,SAAU,IAAI,CAAC,UACd;AAAA,UAAC;AAAA,UAAA;AAAA,YAEC,MAAM;AAAA,YACN,OAAO,QAAQ;AAAA,YACf;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACC,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,eAAe,EAAE,aAAA,IAAiB,CAAA;AAAA,YACtC,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,YAC9B,GAAI,cAAc,EAAE,YAAA,IAAgB,CAAA;AAAA,YACpC,GAAI,kBAAkB,EAAE,gBAAA,IAAoB,CAAA;AAAA,YAC5C,GAAI,eAAe,EAAE,iBAAiB,CAAA;AAAA,UAAC;AAAA,UAjBnC,OAAO,KAAK;AAAA,QAAA,CAmBpB,EAAA,CACH;AAAA,MAAA;AAAA,IAAA;AAAA,EAAA;AAIR;"}

package/dist/data/data-table-filter-values.cjs

@@ -67,6 +67,24 @@ function serializeMultiFilterValue(value) {
 function splitCommaValues(value) {
   return value.split(",").map((item) => item.trim()).filter(Boolean);
 }
+function parseBoundsValue(raw) {
+  const bounds = {};
+  for (const token of raw.split(",")) {
+    const trimmed = token.trim();
+    if (trimmed.startsWith(">")) {
+      bounds.min = trimmed.replace(/^>=?/, "");
+    } else if (trimmed.startsWith("<")) {
+      bounds.max = trimmed.replace(/^<=?/, "");
+    }
+  }
+  return bounds;
+}
+function serializeBoundsValue(value) {
+  const tokens = [];
+  if (value.min) tokens.push(`>=${value.min}`);
+  if (value.max) tokens.push(`<=${value.max}`);
+  return tokens.join(",");
+}
 function updateFilterSelection(selection, key, serialized) {
   const next = { ...selection };
   if (serialized) {
@@ -76,7 +94,9 @@ function updateFilterSelection(selection, key, serialized) {
   }
   return next;
 }
+exports.parseBoundsValue = parseBoundsValue;
 exports.parseMultiFilterValue = parseMultiFilterValue;
+exports.serializeBoundsValue = serializeBoundsValue;
 exports.serializeMultiFilterValue = serializeMultiFilterValue;
 exports.splitCommaValues = splitCommaValues;
 exports.updateFilterSelection = updateFilterSelection;

package/dist/data/data-table-filter-values.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"data-table-filter-values.cjs","sources":["../../src/data/data-table-filter-values.ts"],"sourcesContent":["import type { FilterBarMultiFilterMode } from \"../components/filter-bar-field-utils\";\n\n/**\n * A filter selection as one flat, URL-safe record: filter key → comma-joined\n * values, each optionally `!`-prefixed to exclude. It is the one encoding the\n * profile catalog (which syncs it to the URL) and the ad-hoc query browser both\n * speak, so a selection means the same thing wherever it is read.\n */\nexport type DataTableFilterSelection = Record<string, string>;\n\n// The serialized multi-filter value is a wire contract, not internal state: it\n// is packed into a query parameter and parsed server-side by clicky's\n// `entity.MultiFilter` (collections.MatchItems semantics — `,` separates\n// patterns, a leading `!` negates). That grammar has no escape sequence, so a\n// value that itself starts with `!` or contains `,` cannot be expressed on the\n// wire at all. Backslash escapes below therefore only ever apply to values the\n// server could never represent, leaving every representable value byte\n// identical, while making the local parse/serialize pair lossless so an\n// *included* \"!failed\" is not read back as an *exclusion* of \"failed\" on the\n// next render.\n//\n// WORKAROUND(no-server-escape-syntax): the escapes are understood by this\n// module only; a backslash sent to the server is matched literally.\n// Correct fix: teach entity.MultiFilter / collections.MatchItems an escape\n// sequence, then drop this note.\n// Ref: PR review, discussed with user 2026-08-05\n//\n// Grammar: `\\\\`, `\\!`, `\\,` and `\\<whitespace>` decode to the bare character; a\n// backslash before anything else is literal. Unescaped whitespace around an\n// item is trimmed (hand-edited URLs), unescaped `,` separates items, and an\n// unescaped leading `!` marks an exclusion. Empty keys are not representable\n// and are dropped.\ntype MultiFilterChar = { char: string; escaped: boolean };\n\nfunction isMultiFilterEscapable(char: string) {\n  return char === \"\\\\\" || char === \"!\" || char === \",\" || /\\s/.test(char);\n}\n\nfunction isUnescapedSpace(entry: MultiFilterChar) {\n  return !entry.escaped && /\\s/.test(entry.char);\n}\n\nfunction splitMultiFilterItems(value: string): MultiFilterChar[][] {\n  const items: MultiFilterChar[][] = [[]];\n  for (let index = 0; index < value.length; index++) {\n    const char = value[index]!;\n    const next = value[index + 1];\n    if (char === \"\\\\\" && next !== undefined && isMultiFilterEscapable(next)) {\n      items[items.length - 1]!.push({ char: next, escaped: true });\n      index++;\n    } else if (char === \",\") {\n      items.push([]);\n    } else {\n      items[items.length - 1]!.push({ char, escaped: false });\n    }\n  }\n  return items.map((item) => {\n    let start = 0;\n    let end = item.length;\n    while (start < end && isUnescapedSpace(item[start]!)) start++;\n    while (end > start && isUnescapedSpace(item[end - 1]!)) end--;\n    return item.slice(start, end);\n  });\n}\n\nexport function parseMultiFilterValue(value: string): Record<string, FilterBarMultiFilterMode> {\n  const parsed: Record<string, FilterBarMultiFilterMode> = {};\n  for (const item of splitMultiFilterItems(value)) {\n    if (item.length === 0) continue;\n    const excluded = item.length > 1 && item[0]!.char === \"!\" && !item[0]!.escaped;\n    const key = (excluded ? item.slice(1) : item).map((entry) => entry.char).join(\"\");\n    if (key) parsed[key] = excluded ? \"exclude\" : \"include\";\n  }\n  return parsed;\n}\n\nfunction escapeMultiFilterKey(key: string): string {\n  let escaped = \"\";\n  for (let index = 0; index < key.length; index++) {\n    const char = key[index]!;\n    const isBoundary = index === 0 || index === key.length - 1;\n    if (char === \",\") {\n      escaped += \"\\\\,\";\n    } else if (char === \"\\\\\" && isMultiFilterEscapable(key[index + 1] ?? \"\")) {\n      escaped += \"\\\\\\\\\";\n    } else if (isBoundary && /\\s/.test(char)) {\n      escaped += `\\\\${char}`;\n    } else {\n      escaped += char;\n    }\n  }\n  return escaped;\n}\n\nexport function serializeMultiFilterValue(value: Record<string, FilterBarMultiFilterMode>): string {\n  return Object.entries(value)\n    .flatMap(([key, mode]) => {\n      if (!key) return [];\n      const escaped = escapeMultiFilterKey(key);\n      if (mode === \"include\") return [key.startsWith(\"!\") ? `\\\\${escaped}` : escaped];\n      if (mode === \"exclude\") return [`!${escaped}`];\n      return [];\n    })\n    .join(\",\");\n}\n\nexport function splitCommaValues(value: string): string[] {\n  return value\n    .split(\",\")\n    .map((item) => item.trim())\n    .filter(Boolean);\n}\n\n/**\n * Writes a serialized value into a selection, dropping the key when it is\n * empty. An absent key and a key holding \"\" would send different query strings\n * for the same \"nothing selected\", so only one of them is ever built.\n */\nexport function updateFilterSelection(\n  selection: DataTableFilterSelection,\n  key: string,\n  serialized: string,\n): DataTableFilterSelection {\n  const next = { ...selection };\n  if (serialized) {\n    next[key] = serialized;\n  } else {\n    delete next[key];\n  }\n  return next;\n}\n"],"names":[],"mappings":";;AAkCA,SAAS,uBAAuB,MAAc;AAC5C,SAAO,SAAS,QAAQ,SAAS,OAAO,SAAS,OAAO,KAAK,KAAK,IAAI;AACxE;AAEA,SAAS,iBAAiB,OAAwB;AAChD,SAAO,CAAC,MAAM,WAAW,KAAK,KAAK,MAAM,IAAI;AAC/C;AAEA,SAAS,sBAAsB,OAAoC;AACjE,QAAM,QAA6B,CAAC,EAAE;AACtC,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,OAAO,MAAM,KAAK;AACxB,UAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,QAAI,SAAS,QAAQ,SAAS,UAAa,uBAAuB,IAAI,GAAG;AACvE,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,MAAM,SAAS,MAAM;AAC3D;AAAA,IACF,WAAW,SAAS,KAAK;AACvB,YAAM,KAAK,EAAE;AAAA,IACf,OAAO;AACL,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,SAAS,OAAO;AAAA,IACxD;AAAA,EACF;AACA,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,QAAI,QAAQ;AACZ,QAAI,MAAM,KAAK;AACf,WAAO,QAAQ,OAAO,iBAAiB,KAAK,KAAK,CAAE,EAAG;AACtD,WAAO,MAAM,SAAS,iBAAiB,KAAK,MAAM,CAAC,CAAE,EAAG;AACxD,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B,CAAC;AACH;AAEO,SAAS,sBAAsB,OAAyD;AAC7F,QAAM,SAAmD,CAAA;AACzD,aAAW,QAAQ,sBAAsB,KAAK,GAAG;AAC/C,QAAI,KAAK,WAAW,EAAG;AACvB,UAAM,WAAW,KAAK,SAAS,KAAK,KAAK,CAAC,EAAG,SAAS,OAAO,CAAC,KAAK,CAAC,EAAG;AACvE,UAAM,OAAO,WAAW,KAAK,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,EAAE;AAChF,QAAI,IAAK,QAAO,GAAG,IAAI,WAAW,YAAY;AAAA,EAChD;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,KAAqB;AACjD,MAAI,UAAU;AACd,WAAS,QAAQ,GAAG,QAAQ,IAAI,QAAQ,SAAS;AAC/C,UAAM,OAAO,IAAI,KAAK;AACtB,UAAM,aAAa,UAAU,KAAK,UAAU,IAAI,SAAS;AACzD,QAAI,SAAS,KAAK;AAChB,iBAAW;AAAA,IACb,WAAW,SAAS,QAAQ,uBAAuB,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG;AACxE,iBAAW;AAAA,IACb,WAAW,cAAc,KAAK,KAAK,IAAI,GAAG;AACxC,iBAAW,KAAK,IAAI;AAAA,IACtB,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,0BAA0B,OAAyD;AACjG,SAAO,OAAO,QAAQ,KAAK,EACxB,QAAQ,CAAC,CAAC,KAAK,IAAI,MAAM;AACxB,QAAI,CAAC,IAAK,QAAO,CAAA;AACjB,UAAM,UAAU,qBAAqB,GAAG;AACxC,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,WAAW,GAAG,IAAI,KAAK,OAAO,KAAK,OAAO;AAC9E,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,OAAO,EAAE;AAC7C,WAAO,CAAA;AAAA,EACT,CAAC,EACA,KAAK,GAAG;AACb;AAEO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,KAAK,KAAA,CAAM,EACzB,OAAO,OAAO;AACnB;AAOO,SAAS,sBACd,WACA,KACA,YAC0B;AAC1B,QAAM,OAAO,EAAE,GAAG,UAAA;AAClB,MAAI,YAAY;AACd,SAAK,GAAG,IAAI;AAAA,EACd,OAAO;AACL,WAAO,KAAK,GAAG;AAAA,EACjB;AACA,SAAO;AACT;;;;;"}
+{"version":3,"file":"data-table-filter-values.cjs","sources":["../../src/data/data-table-filter-values.ts"],"sourcesContent":["import type { FilterBarMultiFilterMode } from \"../components/filter-bar-field-utils\";\n\n/**\n * A filter selection as one flat, URL-safe record: filter key → comma-joined\n * values, each optionally `!`-prefixed to exclude. It is the one encoding the\n * profile catalog (which syncs it to the URL) and the ad-hoc query browser both\n * speak, so a selection means the same thing wherever it is read.\n */\nexport type DataTableFilterSelection = Record<string, string>;\n\n// The serialized multi-filter value is a wire contract, not internal state: it\n// is packed into a query parameter and parsed server-side by clicky's\n// `entity.MultiFilter` (collections.MatchItems semantics — `,` separates\n// patterns, a leading `!` negates). That grammar has no escape sequence, so a\n// value that itself starts with `!` or contains `,` cannot be expressed on the\n// wire at all. Backslash escapes below therefore only ever apply to values the\n// server could never represent, leaving every representable value byte\n// identical, while making the local parse/serialize pair lossless so an\n// *included* \"!failed\" is not read back as an *exclusion* of \"failed\" on the\n// next render.\n//\n// WORKAROUND(no-server-escape-syntax): the escapes are understood by this\n// module only; a backslash sent to the server is matched literally.\n// Correct fix: teach entity.MultiFilter / collections.MatchItems an escape\n// sequence, then drop this note.\n// Ref: PR review, discussed with user 2026-08-05\n//\n// Grammar: `\\\\`, `\\!`, `\\,` and `\\<whitespace>` decode to the bare character; a\n// backslash before anything else is literal. Unescaped whitespace around an\n// item is trimmed (hand-edited URLs), unescaped `,` separates items, and an\n// unescaped leading `!` marks an exclusion. Empty keys are not representable\n// and are dropped.\ntype MultiFilterChar = { char: string; escaped: boolean };\n\nfunction isMultiFilterEscapable(char: string) {\n  return char === \"\\\\\" || char === \"!\" || char === \",\" || /\\s/.test(char);\n}\n\nfunction isUnescapedSpace(entry: MultiFilterChar) {\n  return !entry.escaped && /\\s/.test(entry.char);\n}\n\nfunction splitMultiFilterItems(value: string): MultiFilterChar[][] {\n  const items: MultiFilterChar[][] = [[]];\n  for (let index = 0; index < value.length; index++) {\n    const char = value[index]!;\n    const next = value[index + 1];\n    if (char === \"\\\\\" && next !== undefined && isMultiFilterEscapable(next)) {\n      items[items.length - 1]!.push({ char: next, escaped: true });\n      index++;\n    } else if (char === \",\") {\n      items.push([]);\n    } else {\n      items[items.length - 1]!.push({ char, escaped: false });\n    }\n  }\n  return items.map((item) => {\n    let start = 0;\n    let end = item.length;\n    while (start < end && isUnescapedSpace(item[start]!)) start++;\n    while (end > start && isUnescapedSpace(item[end - 1]!)) end--;\n    return item.slice(start, end);\n  });\n}\n\nexport function parseMultiFilterValue(value: string): Record<string, FilterBarMultiFilterMode> {\n  const parsed: Record<string, FilterBarMultiFilterMode> = {};\n  for (const item of splitMultiFilterItems(value)) {\n    if (item.length === 0) continue;\n    const excluded = item.length > 1 && item[0]!.char === \"!\" && !item[0]!.escaped;\n    const key = (excluded ? item.slice(1) : item).map((entry) => entry.char).join(\"\");\n    if (key) parsed[key] = excluded ? \"exclude\" : \"include\";\n  }\n  return parsed;\n}\n\nfunction escapeMultiFilterKey(key: string): string {\n  let escaped = \"\";\n  for (let index = 0; index < key.length; index++) {\n    const char = key[index]!;\n    const isBoundary = index === 0 || index === key.length - 1;\n    if (char === \",\") {\n      escaped += \"\\\\,\";\n    } else if (char === \"\\\\\" && isMultiFilterEscapable(key[index + 1] ?? \"\")) {\n      escaped += \"\\\\\\\\\";\n    } else if (isBoundary && /\\s/.test(char)) {\n      escaped += `\\\\${char}`;\n    } else {\n      escaped += char;\n    }\n  }\n  return escaped;\n}\n\nexport function serializeMultiFilterValue(value: Record<string, FilterBarMultiFilterMode>): string {\n  return Object.entries(value)\n    .flatMap(([key, mode]) => {\n      if (!key) return [];\n      const escaped = escapeMultiFilterKey(key);\n      if (mode === \"include\") return [key.startsWith(\"!\") ? `\\\\${escaped}` : escaped];\n      if (mode === \"exclude\") return [`!${escaped}`];\n      return [];\n    })\n    .join(\",\");\n}\n\nexport function splitCommaValues(value: string): string[] {\n  return value\n    .split(\",\")\n    .map((item) => item.trim())\n    .filter(Boolean);\n}\n\n/**\n * A bounded selection: both edges under one key, each token carrying its own\n * comparison operator. It is the other half of the selection grammar, and the\n * one a range and a time bound share.\n */\nexport type FilterBoundsValue = {\n  min?: string;\n  max?: string;\n};\n\n/**\n * Reads a bounded selection. The bar's controls are inclusive on both edges, so\n * that is what they write back — but a bound typed by hand or arriving in a URL\n * keeps whatever operator it came with.\n */\nexport function parseBoundsValue(raw: string): FilterBoundsValue {\n  const bounds: FilterBoundsValue = {};\n  for (const token of raw.split(\",\")) {\n    const trimmed = token.trim();\n    if (trimmed.startsWith(\">\")) {\n      bounds.min = trimmed.replace(/^>=?/, \"\");\n    } else if (trimmed.startsWith(\"<\")) {\n      bounds.max = trimmed.replace(/^<=?/, \"\");\n    }\n  }\n  return bounds;\n}\n\nexport function serializeBoundsValue(value: FilterBoundsValue): string {\n  const tokens: string[] = [];\n  if (value.min) tokens.push(`>=${value.min}`);\n  if (value.max) tokens.push(`<=${value.max}`);\n  return tokens.join(\",\");\n}\n\n/**\n * Writes a serialized value into a selection, dropping the key when it is\n * empty. An absent key and a key holding \"\" would send different query strings\n * for the same \"nothing selected\", so only one of them is ever built.\n */\nexport function updateFilterSelection(\n  selection: DataTableFilterSelection,\n  key: string,\n  serialized: string,\n): DataTableFilterSelection {\n  const next = { ...selection };\n  if (serialized) {\n    next[key] = serialized;\n  } else {\n    delete next[key];\n  }\n  return next;\n}\n"],"names":[],"mappings":";;AAkCA,SAAS,uBAAuB,MAAc;AAC5C,SAAO,SAAS,QAAQ,SAAS,OAAO,SAAS,OAAO,KAAK,KAAK,IAAI;AACxE;AAEA,SAAS,iBAAiB,OAAwB;AAChD,SAAO,CAAC,MAAM,WAAW,KAAK,KAAK,MAAM,IAAI;AAC/C;AAEA,SAAS,sBAAsB,OAAoC;AACjE,QAAM,QAA6B,CAAC,EAAE;AACtC,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,OAAO,MAAM,KAAK;AACxB,UAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,QAAI,SAAS,QAAQ,SAAS,UAAa,uBAAuB,IAAI,GAAG;AACvE,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,MAAM,SAAS,MAAM;AAC3D;AAAA,IACF,WAAW,SAAS,KAAK;AACvB,YAAM,KAAK,EAAE;AAAA,IACf,OAAO;AACL,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,SAAS,OAAO;AAAA,IACxD;AAAA,EACF;AACA,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,QAAI,QAAQ;AACZ,QAAI,MAAM,KAAK;AACf,WAAO,QAAQ,OAAO,iBAAiB,KAAK,KAAK,CAAE,EAAG;AACtD,WAAO,MAAM,SAAS,iBAAiB,KAAK,MAAM,CAAC,CAAE,EAAG;AACxD,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B,CAAC;AACH;AAEO,SAAS,sBAAsB,OAAyD;AAC7F,QAAM,SAAmD,CAAA;AACzD,aAAW,QAAQ,sBAAsB,KAAK,GAAG;AAC/C,QAAI,KAAK,WAAW,EAAG;AACvB,UAAM,WAAW,KAAK,SAAS,KAAK,KAAK,CAAC,EAAG,SAAS,OAAO,CAAC,KAAK,CAAC,EAAG;AACvE,UAAM,OAAO,WAAW,KAAK,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,EAAE;AAChF,QAAI,IAAK,QAAO,GAAG,IAAI,WAAW,YAAY;AAAA,EAChD;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,KAAqB;AACjD,MAAI,UAAU;AACd,WAAS,QAAQ,GAAG,QAAQ,IAAI,QAAQ,SAAS;AAC/C,UAAM,OAAO,IAAI,KAAK;AACtB,UAAM,aAAa,UAAU,KAAK,UAAU,IAAI,SAAS;AACzD,QAAI,SAAS,KAAK;AAChB,iBAAW;AAAA,IACb,WAAW,SAAS,QAAQ,uBAAuB,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG;AACxE,iBAAW;AAAA,IACb,WAAW,cAAc,KAAK,KAAK,IAAI,GAAG;AACxC,iBAAW,KAAK,IAAI;AAAA,IACtB,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,0BAA0B,OAAyD;AACjG,SAAO,OAAO,QAAQ,KAAK,EACxB,QAAQ,CAAC,CAAC,KAAK,IAAI,MAAM;AACxB,QAAI,CAAC,IAAK,QAAO,CAAA;AACjB,UAAM,UAAU,qBAAqB,GAAG;AACxC,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,WAAW,GAAG,IAAI,KAAK,OAAO,KAAK,OAAO;AAC9E,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,OAAO,EAAE;AAC7C,WAAO,CAAA;AAAA,EACT,CAAC,EACA,KAAK,GAAG;AACb;AAEO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,KAAK,KAAA,CAAM,EACzB,OAAO,OAAO;AACnB;AAiBO,SAAS,iBAAiB,KAAgC;AAC/D,QAAM,SAA4B,CAAA;AAClC,aAAW,SAAS,IAAI,MAAM,GAAG,GAAG;AAClC,UAAM,UAAU,MAAM,KAAA;AACtB,QAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,aAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IACzC,WAAW,QAAQ,WAAW,GAAG,GAAG;AAClC,aAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IACzC;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBAAqB,OAAkC;AACrE,QAAM,SAAmB,CAAA;AACzB,MAAI,MAAM,IAAK,QAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC3C,MAAI,MAAM,IAAK,QAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC3C,SAAO,OAAO,KAAK,GAAG;AACxB;AAOO,SAAS,sBACd,WACA,KACA,YAC0B;AAC1B,QAAM,OAAO,EAAE,GAAG,UAAA;AAClB,MAAI,YAAY;AACd,SAAK,GAAG,IAAI;AAAA,EACd,OAAO;AACL,WAAO,KAAK,GAAG;AAAA,EACjB;AACA,SAAO;AACT;;;;;;;"}

package/dist/data/data-table-filter-values.d.ts

@@ -9,6 +9,22 @@ export type DataTableFilterSelection = Record<string, string>;
 export declare function parseMultiFilterValue(value: string): Record<string, FilterBarMultiFilterMode>;
 export declare function serializeMultiFilterValue(value: Record<string, FilterBarMultiFilterMode>): string;
 export declare function splitCommaValues(value: string): string[];
+/**
+ * A bounded selection: both edges under one key, each token carrying its own
+ * comparison operator. It is the other half of the selection grammar, and the
+ * one a range and a time bound share.
+ */
+export type FilterBoundsValue = {
+    min?: string;
+    max?: string;
+};
+/**
+ * Reads a bounded selection. The bar's controls are inclusive on both edges, so
+ * that is what they write back — but a bound typed by hand or arriving in a URL
+ * keeps whatever operator it came with.
+ */
+export declare function parseBoundsValue(raw: string): FilterBoundsValue;
+export declare function serializeBoundsValue(value: FilterBoundsValue): string;
 /**
  * Writes a serialized value into a selection, dropping the key when it is
  * empty. An absent key and a key holding "" would send different query strings

package/dist/data/data-table-filter-values.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"data-table-filter-values.d.ts","sourceRoot":"","sources":["../../src/data/data-table-filter-values.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,sCAAsC,CAAC;AAErF;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAyD9D,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,wBAAwB,CAAC,CAS7F;AAoBD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,wBAAwB,CAAC,GAAG,MAAM,CAUjG;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAKxD;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,SAAS,EAAE,wBAAwB,EACnC,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,MAAM,GACjB,wBAAwB,CAQ1B"}
+{"version":3,"file":"data-table-filter-values.d.ts","sourceRoot":"","sources":["../../src/data/data-table-filter-values.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,sCAAsC,CAAC;AAErF;;;;;GAKG;AACH,MAAM,MAAM,wBAAwB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAyD9D,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,wBAAwB,CAAC,CAS7F;AAoBD,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,wBAAwB,CAAC,GAAG,MAAM,CAUjG;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAKxD;AAED;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC9B,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC;CACd,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,iBAAiB,CAW/D;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,iBAAiB,GAAG,MAAM,CAKrE;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,SAAS,EAAE,wBAAwB,EACnC,GAAG,EAAE,MAAM,EACX,UAAU,EAAE,MAAM,GACjB,wBAAwB,CAQ1B"}

package/dist/data/data-table-filter-values.js

@@ -65,6 +65,24 @@ function serializeMultiFilterValue(value) {
 function splitCommaValues(value) {
   return value.split(",").map((item) => item.trim()).filter(Boolean);
 }
+function parseBoundsValue(raw) {
+  const bounds = {};
+  for (const token of raw.split(",")) {
+    const trimmed = token.trim();
+    if (trimmed.startsWith(">")) {
+      bounds.min = trimmed.replace(/^>=?/, "");
+    } else if (trimmed.startsWith("<")) {
+      bounds.max = trimmed.replace(/^<=?/, "");
+    }
+  }
+  return bounds;
+}
+function serializeBoundsValue(value) {
+  const tokens = [];
+  if (value.min) tokens.push(`>=${value.min}`);
+  if (value.max) tokens.push(`<=${value.max}`);
+  return tokens.join(",");
+}
 function updateFilterSelection(selection, key, serialized) {
   const next = { ...selection };
   if (serialized) {
@@ -75,7 +93,9 @@ function updateFilterSelection(selection, key, serialized) {
   return next;
 }
 export {
+  parseBoundsValue,
   parseMultiFilterValue,
+  serializeBoundsValue,
   serializeMultiFilterValue,
   splitCommaValues,
   updateFilterSelection

package/dist/data/data-table-filter-values.js.map

@@ -1 +1 @@
-{"version":3,"file":"data-table-filter-values.js","sources":["../../src/data/data-table-filter-values.ts"],"sourcesContent":["import type { FilterBarMultiFilterMode } from \"../components/filter-bar-field-utils\";\n\n/**\n * A filter selection as one flat, URL-safe record: filter key → comma-joined\n * values, each optionally `!`-prefixed to exclude. It is the one encoding the\n * profile catalog (which syncs it to the URL) and the ad-hoc query browser both\n * speak, so a selection means the same thing wherever it is read.\n */\nexport type DataTableFilterSelection = Record<string, string>;\n\n// The serialized multi-filter value is a wire contract, not internal state: it\n// is packed into a query parameter and parsed server-side by clicky's\n// `entity.MultiFilter` (collections.MatchItems semantics — `,` separates\n// patterns, a leading `!` negates). That grammar has no escape sequence, so a\n// value that itself starts with `!` or contains `,` cannot be expressed on the\n// wire at all. Backslash escapes below therefore only ever apply to values the\n// server could never represent, leaving every representable value byte\n// identical, while making the local parse/serialize pair lossless so an\n// *included* \"!failed\" is not read back as an *exclusion* of \"failed\" on the\n// next render.\n//\n// WORKAROUND(no-server-escape-syntax): the escapes are understood by this\n// module only; a backslash sent to the server is matched literally.\n// Correct fix: teach entity.MultiFilter / collections.MatchItems an escape\n// sequence, then drop this note.\n// Ref: PR review, discussed with user 2026-08-05\n//\n// Grammar: `\\\\`, `\\!`, `\\,` and `\\<whitespace>` decode to the bare character; a\n// backslash before anything else is literal. Unescaped whitespace around an\n// item is trimmed (hand-edited URLs), unescaped `,` separates items, and an\n// unescaped leading `!` marks an exclusion. Empty keys are not representable\n// and are dropped.\ntype MultiFilterChar = { char: string; escaped: boolean };\n\nfunction isMultiFilterEscapable(char: string) {\n  return char === \"\\\\\" || char === \"!\" || char === \",\" || /\\s/.test(char);\n}\n\nfunction isUnescapedSpace(entry: MultiFilterChar) {\n  return !entry.escaped && /\\s/.test(entry.char);\n}\n\nfunction splitMultiFilterItems(value: string): MultiFilterChar[][] {\n  const items: MultiFilterChar[][] = [[]];\n  for (let index = 0; index < value.length; index++) {\n    const char = value[index]!;\n    const next = value[index + 1];\n    if (char === \"\\\\\" && next !== undefined && isMultiFilterEscapable(next)) {\n      items[items.length - 1]!.push({ char: next, escaped: true });\n      index++;\n    } else if (char === \",\") {\n      items.push([]);\n    } else {\n      items[items.length - 1]!.push({ char, escaped: false });\n    }\n  }\n  return items.map((item) => {\n    let start = 0;\n    let end = item.length;\n    while (start < end && isUnescapedSpace(item[start]!)) start++;\n    while (end > start && isUnescapedSpace(item[end - 1]!)) end--;\n    return item.slice(start, end);\n  });\n}\n\nexport function parseMultiFilterValue(value: string): Record<string, FilterBarMultiFilterMode> {\n  const parsed: Record<string, FilterBarMultiFilterMode> = {};\n  for (const item of splitMultiFilterItems(value)) {\n    if (item.length === 0) continue;\n    const excluded = item.length > 1 && item[0]!.char === \"!\" && !item[0]!.escaped;\n    const key = (excluded ? item.slice(1) : item).map((entry) => entry.char).join(\"\");\n    if (key) parsed[key] = excluded ? \"exclude\" : \"include\";\n  }\n  return parsed;\n}\n\nfunction escapeMultiFilterKey(key: string): string {\n  let escaped = \"\";\n  for (let index = 0; index < key.length; index++) {\n    const char = key[index]!;\n    const isBoundary = index === 0 || index === key.length - 1;\n    if (char === \",\") {\n      escaped += \"\\\\,\";\n    } else if (char === \"\\\\\" && isMultiFilterEscapable(key[index + 1] ?? \"\")) {\n      escaped += \"\\\\\\\\\";\n    } else if (isBoundary && /\\s/.test(char)) {\n      escaped += `\\\\${char}`;\n    } else {\n      escaped += char;\n    }\n  }\n  return escaped;\n}\n\nexport function serializeMultiFilterValue(value: Record<string, FilterBarMultiFilterMode>): string {\n  return Object.entries(value)\n    .flatMap(([key, mode]) => {\n      if (!key) return [];\n      const escaped = escapeMultiFilterKey(key);\n      if (mode === \"include\") return [key.startsWith(\"!\") ? `\\\\${escaped}` : escaped];\n      if (mode === \"exclude\") return [`!${escaped}`];\n      return [];\n    })\n    .join(\",\");\n}\n\nexport function splitCommaValues(value: string): string[] {\n  return value\n    .split(\",\")\n    .map((item) => item.trim())\n    .filter(Boolean);\n}\n\n/**\n * Writes a serialized value into a selection, dropping the key when it is\n * empty. An absent key and a key holding \"\" would send different query strings\n * for the same \"nothing selected\", so only one of them is ever built.\n */\nexport function updateFilterSelection(\n  selection: DataTableFilterSelection,\n  key: string,\n  serialized: string,\n): DataTableFilterSelection {\n  const next = { ...selection };\n  if (serialized) {\n    next[key] = serialized;\n  } else {\n    delete next[key];\n  }\n  return next;\n}\n"],"names":[],"mappings":"AAkCA,SAAS,uBAAuB,MAAc;AAC5C,SAAO,SAAS,QAAQ,SAAS,OAAO,SAAS,OAAO,KAAK,KAAK,IAAI;AACxE;AAEA,SAAS,iBAAiB,OAAwB;AAChD,SAAO,CAAC,MAAM,WAAW,KAAK,KAAK,MAAM,IAAI;AAC/C;AAEA,SAAS,sBAAsB,OAAoC;AACjE,QAAM,QAA6B,CAAC,EAAE;AACtC,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,OAAO,MAAM,KAAK;AACxB,UAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,QAAI,SAAS,QAAQ,SAAS,UAAa,uBAAuB,IAAI,GAAG;AACvE,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,MAAM,SAAS,MAAM;AAC3D;AAAA,IACF,WAAW,SAAS,KAAK;AACvB,YAAM,KAAK,EAAE;AAAA,IACf,OAAO;AACL,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,SAAS,OAAO;AAAA,IACxD;AAAA,EACF;AACA,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,QAAI,QAAQ;AACZ,QAAI,MAAM,KAAK;AACf,WAAO,QAAQ,OAAO,iBAAiB,KAAK,KAAK,CAAE,EAAG;AACtD,WAAO,MAAM,SAAS,iBAAiB,KAAK,MAAM,CAAC,CAAE,EAAG;AACxD,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B,CAAC;AACH;AAEO,SAAS,sBAAsB,OAAyD;AAC7F,QAAM,SAAmD,CAAA;AACzD,aAAW,QAAQ,sBAAsB,KAAK,GAAG;AAC/C,QAAI,KAAK,WAAW,EAAG;AACvB,UAAM,WAAW,KAAK,SAAS,KAAK,KAAK,CAAC,EAAG,SAAS,OAAO,CAAC,KAAK,CAAC,EAAG;AACvE,UAAM,OAAO,WAAW,KAAK,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,EAAE;AAChF,QAAI,IAAK,QAAO,GAAG,IAAI,WAAW,YAAY;AAAA,EAChD;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,KAAqB;AACjD,MAAI,UAAU;AACd,WAAS,QAAQ,GAAG,QAAQ,IAAI,QAAQ,SAAS;AAC/C,UAAM,OAAO,IAAI,KAAK;AACtB,UAAM,aAAa,UAAU,KAAK,UAAU,IAAI,SAAS;AACzD,QAAI,SAAS,KAAK;AAChB,iBAAW;AAAA,IACb,WAAW,SAAS,QAAQ,uBAAuB,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG;AACxE,iBAAW;AAAA,IACb,WAAW,cAAc,KAAK,KAAK,IAAI,GAAG;AACxC,iBAAW,KAAK,IAAI;AAAA,IACtB,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,0BAA0B,OAAyD;AACjG,SAAO,OAAO,QAAQ,KAAK,EACxB,QAAQ,CAAC,CAAC,KAAK,IAAI,MAAM;AACxB,QAAI,CAAC,IAAK,QAAO,CAAA;AACjB,UAAM,UAAU,qBAAqB,GAAG;AACxC,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,WAAW,GAAG,IAAI,KAAK,OAAO,KAAK,OAAO;AAC9E,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,OAAO,EAAE;AAC7C,WAAO,CAAA;AAAA,EACT,CAAC,EACA,KAAK,GAAG;AACb;AAEO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,KAAK,KAAA,CAAM,EACzB,OAAO,OAAO;AACnB;AAOO,SAAS,sBACd,WACA,KACA,YAC0B;AAC1B,QAAM,OAAO,EAAE,GAAG,UAAA;AAClB,MAAI,YAAY;AACd,SAAK,GAAG,IAAI;AAAA,EACd,OAAO;AACL,WAAO,KAAK,GAAG;AAAA,EACjB;AACA,SAAO;AACT;"}
+{"version":3,"file":"data-table-filter-values.js","sources":["../../src/data/data-table-filter-values.ts"],"sourcesContent":["import type { FilterBarMultiFilterMode } from \"../components/filter-bar-field-utils\";\n\n/**\n * A filter selection as one flat, URL-safe record: filter key → comma-joined\n * values, each optionally `!`-prefixed to exclude. It is the one encoding the\n * profile catalog (which syncs it to the URL) and the ad-hoc query browser both\n * speak, so a selection means the same thing wherever it is read.\n */\nexport type DataTableFilterSelection = Record<string, string>;\n\n// The serialized multi-filter value is a wire contract, not internal state: it\n// is packed into a query parameter and parsed server-side by clicky's\n// `entity.MultiFilter` (collections.MatchItems semantics — `,` separates\n// patterns, a leading `!` negates). That grammar has no escape sequence, so a\n// value that itself starts with `!` or contains `,` cannot be expressed on the\n// wire at all. Backslash escapes below therefore only ever apply to values the\n// server could never represent, leaving every representable value byte\n// identical, while making the local parse/serialize pair lossless so an\n// *included* \"!failed\" is not read back as an *exclusion* of \"failed\" on the\n// next render.\n//\n// WORKAROUND(no-server-escape-syntax): the escapes are understood by this\n// module only; a backslash sent to the server is matched literally.\n// Correct fix: teach entity.MultiFilter / collections.MatchItems an escape\n// sequence, then drop this note.\n// Ref: PR review, discussed with user 2026-08-05\n//\n// Grammar: `\\\\`, `\\!`, `\\,` and `\\<whitespace>` decode to the bare character; a\n// backslash before anything else is literal. Unescaped whitespace around an\n// item is trimmed (hand-edited URLs), unescaped `,` separates items, and an\n// unescaped leading `!` marks an exclusion. Empty keys are not representable\n// and are dropped.\ntype MultiFilterChar = { char: string; escaped: boolean };\n\nfunction isMultiFilterEscapable(char: string) {\n  return char === \"\\\\\" || char === \"!\" || char === \",\" || /\\s/.test(char);\n}\n\nfunction isUnescapedSpace(entry: MultiFilterChar) {\n  return !entry.escaped && /\\s/.test(entry.char);\n}\n\nfunction splitMultiFilterItems(value: string): MultiFilterChar[][] {\n  const items: MultiFilterChar[][] = [[]];\n  for (let index = 0; index < value.length; index++) {\n    const char = value[index]!;\n    const next = value[index + 1];\n    if (char === \"\\\\\" && next !== undefined && isMultiFilterEscapable(next)) {\n      items[items.length - 1]!.push({ char: next, escaped: true });\n      index++;\n    } else if (char === \",\") {\n      items.push([]);\n    } else {\n      items[items.length - 1]!.push({ char, escaped: false });\n    }\n  }\n  return items.map((item) => {\n    let start = 0;\n    let end = item.length;\n    while (start < end && isUnescapedSpace(item[start]!)) start++;\n    while (end > start && isUnescapedSpace(item[end - 1]!)) end--;\n    return item.slice(start, end);\n  });\n}\n\nexport function parseMultiFilterValue(value: string): Record<string, FilterBarMultiFilterMode> {\n  const parsed: Record<string, FilterBarMultiFilterMode> = {};\n  for (const item of splitMultiFilterItems(value)) {\n    if (item.length === 0) continue;\n    const excluded = item.length > 1 && item[0]!.char === \"!\" && !item[0]!.escaped;\n    const key = (excluded ? item.slice(1) : item).map((entry) => entry.char).join(\"\");\n    if (key) parsed[key] = excluded ? \"exclude\" : \"include\";\n  }\n  return parsed;\n}\n\nfunction escapeMultiFilterKey(key: string): string {\n  let escaped = \"\";\n  for (let index = 0; index < key.length; index++) {\n    const char = key[index]!;\n    const isBoundary = index === 0 || index === key.length - 1;\n    if (char === \",\") {\n      escaped += \"\\\\,\";\n    } else if (char === \"\\\\\" && isMultiFilterEscapable(key[index + 1] ?? \"\")) {\n      escaped += \"\\\\\\\\\";\n    } else if (isBoundary && /\\s/.test(char)) {\n      escaped += `\\\\${char}`;\n    } else {\n      escaped += char;\n    }\n  }\n  return escaped;\n}\n\nexport function serializeMultiFilterValue(value: Record<string, FilterBarMultiFilterMode>): string {\n  return Object.entries(value)\n    .flatMap(([key, mode]) => {\n      if (!key) return [];\n      const escaped = escapeMultiFilterKey(key);\n      if (mode === \"include\") return [key.startsWith(\"!\") ? `\\\\${escaped}` : escaped];\n      if (mode === \"exclude\") return [`!${escaped}`];\n      return [];\n    })\n    .join(\",\");\n}\n\nexport function splitCommaValues(value: string): string[] {\n  return value\n    .split(\",\")\n    .map((item) => item.trim())\n    .filter(Boolean);\n}\n\n/**\n * A bounded selection: both edges under one key, each token carrying its own\n * comparison operator. It is the other half of the selection grammar, and the\n * one a range and a time bound share.\n */\nexport type FilterBoundsValue = {\n  min?: string;\n  max?: string;\n};\n\n/**\n * Reads a bounded selection. The bar's controls are inclusive on both edges, so\n * that is what they write back — but a bound typed by hand or arriving in a URL\n * keeps whatever operator it came with.\n */\nexport function parseBoundsValue(raw: string): FilterBoundsValue {\n  const bounds: FilterBoundsValue = {};\n  for (const token of raw.split(\",\")) {\n    const trimmed = token.trim();\n    if (trimmed.startsWith(\">\")) {\n      bounds.min = trimmed.replace(/^>=?/, \"\");\n    } else if (trimmed.startsWith(\"<\")) {\n      bounds.max = trimmed.replace(/^<=?/, \"\");\n    }\n  }\n  return bounds;\n}\n\nexport function serializeBoundsValue(value: FilterBoundsValue): string {\n  const tokens: string[] = [];\n  if (value.min) tokens.push(`>=${value.min}`);\n  if (value.max) tokens.push(`<=${value.max}`);\n  return tokens.join(\",\");\n}\n\n/**\n * Writes a serialized value into a selection, dropping the key when it is\n * empty. An absent key and a key holding \"\" would send different query strings\n * for the same \"nothing selected\", so only one of them is ever built.\n */\nexport function updateFilterSelection(\n  selection: DataTableFilterSelection,\n  key: string,\n  serialized: string,\n): DataTableFilterSelection {\n  const next = { ...selection };\n  if (serialized) {\n    next[key] = serialized;\n  } else {\n    delete next[key];\n  }\n  return next;\n}\n"],"names":[],"mappings":"AAkCA,SAAS,uBAAuB,MAAc;AAC5C,SAAO,SAAS,QAAQ,SAAS,OAAO,SAAS,OAAO,KAAK,KAAK,IAAI;AACxE;AAEA,SAAS,iBAAiB,OAAwB;AAChD,SAAO,CAAC,MAAM,WAAW,KAAK,KAAK,MAAM,IAAI;AAC/C;AAEA,SAAS,sBAAsB,OAAoC;AACjE,QAAM,QAA6B,CAAC,EAAE;AACtC,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS;AACjD,UAAM,OAAO,MAAM,KAAK;AACxB,UAAM,OAAO,MAAM,QAAQ,CAAC;AAC5B,QAAI,SAAS,QAAQ,SAAS,UAAa,uBAAuB,IAAI,GAAG;AACvE,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,MAAM,SAAS,MAAM;AAC3D;AAAA,IACF,WAAW,SAAS,KAAK;AACvB,YAAM,KAAK,EAAE;AAAA,IACf,OAAO;AACL,YAAM,MAAM,SAAS,CAAC,EAAG,KAAK,EAAE,MAAM,SAAS,OAAO;AAAA,IACxD;AAAA,EACF;AACA,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,QAAI,QAAQ;AACZ,QAAI,MAAM,KAAK;AACf,WAAO,QAAQ,OAAO,iBAAiB,KAAK,KAAK,CAAE,EAAG;AACtD,WAAO,MAAM,SAAS,iBAAiB,KAAK,MAAM,CAAC,CAAE,EAAG;AACxD,WAAO,KAAK,MAAM,OAAO,GAAG;AAAA,EAC9B,CAAC;AACH;AAEO,SAAS,sBAAsB,OAAyD;AAC7F,QAAM,SAAmD,CAAA;AACzD,aAAW,QAAQ,sBAAsB,KAAK,GAAG;AAC/C,QAAI,KAAK,WAAW,EAAG;AACvB,UAAM,WAAW,KAAK,SAAS,KAAK,KAAK,CAAC,EAAG,SAAS,OAAO,CAAC,KAAK,CAAC,EAAG;AACvE,UAAM,OAAO,WAAW,KAAK,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,EAAE,KAAK,EAAE;AAChF,QAAI,IAAK,QAAO,GAAG,IAAI,WAAW,YAAY;AAAA,EAChD;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,KAAqB;AACjD,MAAI,UAAU;AACd,WAAS,QAAQ,GAAG,QAAQ,IAAI,QAAQ,SAAS;AAC/C,UAAM,OAAO,IAAI,KAAK;AACtB,UAAM,aAAa,UAAU,KAAK,UAAU,IAAI,SAAS;AACzD,QAAI,SAAS,KAAK;AAChB,iBAAW;AAAA,IACb,WAAW,SAAS,QAAQ,uBAAuB,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG;AACxE,iBAAW;AAAA,IACb,WAAW,cAAc,KAAK,KAAK,IAAI,GAAG;AACxC,iBAAW,KAAK,IAAI;AAAA,IACtB,OAAO;AACL,iBAAW;AAAA,IACb;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,0BAA0B,OAAyD;AACjG,SAAO,OAAO,QAAQ,KAAK,EACxB,QAAQ,CAAC,CAAC,KAAK,IAAI,MAAM;AACxB,QAAI,CAAC,IAAK,QAAO,CAAA;AACjB,UAAM,UAAU,qBAAqB,GAAG;AACxC,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,WAAW,GAAG,IAAI,KAAK,OAAO,KAAK,OAAO;AAC9E,QAAI,SAAS,UAAW,QAAO,CAAC,IAAI,OAAO,EAAE;AAC7C,WAAO,CAAA;AAAA,EACT,CAAC,EACA,KAAK,GAAG;AACb;AAEO,SAAS,iBAAiB,OAAyB;AACxD,SAAO,MACJ,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,KAAK,KAAA,CAAM,EACzB,OAAO,OAAO;AACnB;AAiBO,SAAS,iBAAiB,KAAgC;AAC/D,QAAM,SAA4B,CAAA;AAClC,aAAW,SAAS,IAAI,MAAM,GAAG,GAAG;AAClC,UAAM,UAAU,MAAM,KAAA;AACtB,QAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,aAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IACzC,WAAW,QAAQ,WAAW,GAAG,GAAG;AAClC,aAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IACzC;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,qBAAqB,OAAkC;AACrE,QAAM,SAAmB,CAAA;AACzB,MAAI,MAAM,IAAK,QAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC3C,MAAI,MAAM,IAAK,QAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC3C,SAAO,OAAO,KAAK,GAAG;AACxB;AAOO,SAAS,sBACd,WACA,KACA,YAC0B;AAC1B,QAAM,OAAO,EAAE,GAAG,UAAA;AAClB,MAAI,YAAY;AACd,SAAK,GAAG,IAAI;AAAA,EACd,OAAO;AACL,WAAO,KAAK,GAAG;AAAA,EACjB;AACA,SAAO;AACT;"}

package/dist/data/data-table-server-filters.cjs

@@ -33,12 +33,7 @@ function serverFiltersToFilterBar(columns, values, setValues, options = {}) {
     }
     claimed.set(filterKey, column.name);
     const label = column.label ?? dataTableUtils.prettifyKey(column.name);
-    if (filter.kind === "time") {
-      if (config.timeRange) {
-        throw new Error(
-          `Columns ${claimed.get(filterKey)} and ${column.name} both declare a time range; the filter bar has one`
-        );
-      }
+    if (filter.kind === "time" && !config.timeRange) {
       config.timeRange = buildTimeRange(filterKey, filter, values, setValues);
       continue;
     }
@@ -62,12 +57,21 @@ function buildFilter(args) {
     ...filter.disabled !== void 0 ? { disabled: filter.disabled } : {}
   };
   switch (filter.kind) {
+    case "time":
+      return {
+        ...shared,
+        kind: "date-range",
+        ...boundsToRange(dataTableFilterValues.parseBoundsValue(raw)),
+        onApply: (from, to) => write(dataTableFilterValues.serializeBoundsValue({ min: from, max: to })),
+        ...filter.presets !== void 0 ? { presets: filter.presets } : {},
+        timeEnabled: true
+      };
     case "range":
       return {
         ...shared,
         kind: "number",
-        value: parseBoundsValue(raw),
-        onChange: (next) => write(serializeBoundsValue(next)),
+        value: dataTableFilterValues.parseBoundsValue(raw),
+        onChange: (next) => write(dataTableFilterValues.serializeBoundsValue(next)),
         ...filter.min !== void 0 ? { domainMin: filter.min } : {},
         ...filter.max !== void 0 ? { domainMax: filter.max } : {},
         ...filter.step !== void 0 ? { step: filter.step } : {}
@@ -91,7 +95,11 @@ function buildFilter(args) {
   }
 }
 function buildTermsFilter({ filter, options }, shared, raw, write) {
+  var _a;
   const lookupValues = options.lookupValues;
+  if (!filter.lookup && (((_a = filter.options) == null ? void 0 : _a.length) ?? 0) === 0) {
+    return { ...shared, kind: "text", value: raw, onChange: (next) => write(next) };
+  }
   return {
     ...shared,
     kind: "multi",
@@ -115,34 +123,20 @@ function buildTermsFilter({ filter, options }, shared, raw, write) {
   };
 }
 function buildTimeRange(filterKey, filter, values, setValues) {
-  const bounds = parseBoundsValue(values[filterKey] ?? "");
   return {
-    ...bounds.min !== void 0 ? { from: bounds.min } : {},
-    ...bounds.max !== void 0 ? { to: bounds.max } : {},
+    ...boundsToRange(dataTableFilterValues.parseBoundsValue(values[filterKey] ?? "")),
     onApply: (from, to) => setValues(
-      (current) => dataTableFilterValues.updateFilterSelection(current, filterKey, serializeBoundsValue({ min: from, max: to }))
+      (current) => dataTableFilterValues.updateFilterSelection(current, filterKey, dataTableFilterValues.serializeBoundsValue({ min: from, max: to }))
     ),
     ...filter.presets !== void 0 ? { presets: filter.presets } : {},
     timeEnabled: true
   };
 }
-function parseBoundsValue(raw) {
-  const bounds = {};
-  for (const token of raw.split(",")) {
-    const trimmed = token.trim();
-    if (trimmed.startsWith(">")) {
-      bounds.min = trimmed.replace(/^>=?/, "");
-    } else if (trimmed.startsWith("<")) {
-      bounds.max = trimmed.replace(/^<=?/, "");
-    }
-  }
-  return bounds;
-}
-function serializeBoundsValue(value) {
-  const tokens = [];
-  if (value.min) tokens.push(`>=${value.min}`);
-  if (value.max) tokens.push(`<=${value.max}`);
-  return tokens.join(",");
+function boundsToRange(bounds) {
+  return {
+    ...bounds.min !== void 0 ? { from: bounds.min } : {},
+    ...bounds.max !== void 0 ? { to: bounds.max } : {}
+  };
 }
 function toMultiSelectOption(option) {
   const label = option.label ?? option.value;

package/dist/data/data-table-server-filters.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"data-table-server-filters.cjs","sources":["../../src/data/data-table-server-filters.ts"],"sourcesContent":["import type { Dispatch, SetStateAction } from \"react\";\nimport type {\n  FilterBarFilter,\n  FilterBarNumberValue,\n  FilterBarRangePreset,\n  FilterBarRangeProps,\n} from \"../components/FilterBar\";\nimport type { FilterExtension } from \"../components/filter-bar-utils\";\nimport { applyFilterExtensions } from \"../components/filter-bar-utils\";\nimport type { MultiSelectOption } from \"../components/MultiSelect\";\nimport type { TriState } from \"../components/TriStateToggle\";\nimport type { DataTableColumn, DataTableColumnKind } from \"./DataTable\";\nimport {\n  parseMultiFilterValue,\n  serializeMultiFilterValue,\n  updateFilterSelection,\n  type DataTableFilterSelection,\n} from \"./data-table-filter-values\";\nimport { prettifyKey } from \"./data-table-utils\";\n\n/**\n * Which control a filter renders as.\n *\n * Deliberately opaque: \"terms\" is not \"a SQL IN() or an OpenSearch terms\n * query\", it is \"a set of discrete values the user includes or excludes\". The\n * source compiles the selection; nothing about how it does so crosses into the\n * browser.\n */\nexport type DataTableFilterKind = \"terms\" | \"range\" | \"time\" | \"boolean\" | \"text\";\n\nexport type DataTableFilterOption = {\n  /** Value written into the selection. */\n  value: string;\n  /** Display label. Falls back to `value`. */\n  label?: string;\n  /** How many rows carry this value, shown as a tooltip. */\n  count?: number;\n};\n\nexport type DataTableColumnFilter = {\n  kind: DataTableFilterKind;\n  /** Head of the option set for kind:\"terms\". Empty relies on `lookup`. */\n  options?: DataTableFilterOption[];\n  /** True when `options` is a capped head of a larger set. */\n  truncated?: boolean;\n  /** Distinct count behind a truncated head; drives the \"… and N more\" hint. */\n  total?: number;\n  /** The source can answer a type-ahead for this filter. */\n  lookup?: boolean;\n  /** Slider domain for kind:\"range\". */\n  min?: number;\n  max?: number;\n  step?: number;\n  /** Range presets for kind:\"time\". */\n  presets?: FilterBarRangePreset[];\n  /** Helper text shown in the filter popover. */\n  description?: string;\n  disabled?: boolean;\n};\n\n/**\n * A result column as the source describes it: how to render it, and — when the\n * source can narrow on it — which filter parameter it binds to and what control\n * that filter is.\n *\n * `filterKey` need not equal `name`: an analyzed text field filters through an\n * exact-value sibling, and a computed column filters by the alias it was given.\n */\nexport type DataTableServerColumn = {\n  /** Field name as the source knows it; also the literal row key. */\n  name: string;\n  /** Header label. Defaults to a prettified `name`. */\n  label?: string;\n  /** Backend type string, verbatim (e.g. \"TIMESTAMPTZ\", \"keyword\"). Display only. */\n  databaseType?: string;\n  /** Cell rendering kind. */\n  kind?: DataTableColumnKind;\n  /** Filter parameter this column narrows on. Absent means not filterable. */\n  filterKey?: string;\n  /** The control the filter renders as. Absent means not filterable. */\n  filter?: DataTableColumnFilter;\n};\n\n/** Head-set size for a filter value type-ahead. */\nexport const DATA_TABLE_FILTER_LOOKUP_LIMIT = 20;\n\nexport type DataTableFilterLookupRequest = {\n  /** Which filter is being searched — the column's `filterKey`. */\n  filterKey: string;\n  /** What the user typed. Empty asks for the head of the set. */\n  search: string;\n  /** How many options to return. */\n  limit: number;\n};\n\nexport type DataTableFilterLookupResult = {\n  options: DataTableFilterOption[];\n};\n\n/**\n * Answers a filter's value type-ahead. Sync or async — a static option source\n * returns an array, a server-backed one a promise.\n */\nexport type DataTableFilterLookup = (\n  request: DataTableFilterLookupRequest,\n) => Promise<DataTableFilterLookupResult> | DataTableFilterLookupResult;\n\nexport type ServerFilterBarOptions = {\n  /** Answers a terms type-ahead for filters whose `lookup` is set. */\n  lookupValues?: DataTableFilterLookup;\n  /** Decorators applied to each built filter (icons, relabelling). */\n  extensions?: FilterExtension[];\n};\n\nexport type ServerFilterConfig = {\n  filters: FilterBarFilter[];\n  /** Present when exactly one column declared kind:\"time\". */\n  timeRange?: FilterBarRangeProps;\n};\n\n/**\n * Turns the source's column description into DataTable columns.\n *\n * Every column gets a literal `accessor` — a raw result set has empty, dotted\n * and colliding names, none of which survive being read as a path — and\n * `filterable: false`, because a described result is filtered by the source and\n * never by cardinality guessed from one page.\n */\nexport function serverColumnsToDataTableColumns<T extends Record<string, unknown>>(\n  columns: DataTableServerColumn[],\n): DataTableColumn<T>[] {\n  return columns.map((column, index) => ({\n    key: column.name === \"\" ? `column-${index}` : column.name,\n    label: column.label ?? prettifyKey(column.name),\n    accessor: (row: T) => row[column.name],\n    sortable: true,\n    filterable: false,\n    ...(column.kind !== undefined ? { kind: column.kind } : {}),\n    ...(column.filterKey !== undefined ? { filterKey: column.filterKey } : {}),\n  }));\n}\n\n/**\n * Builds the FilterBar controls for a described result, already wired to\n * `values`/`setValues`.\n *\n * Pure — it holds no state and fetches nothing; a `lookup` filter closes over\n * the caller's loader. Pass the result as DataTable's `externalFilters`\n * together with `manualFilter`, since the source has already applied it.\n *\n * Throws when a column declares a filter it cannot address: no `filterKey`, a\n * `filterKey` another column already claimed, or a second time range. Each\n * would bind a control to a filter that means something else.\n */\nexport function serverFiltersToFilterBar(\n  columns: DataTableServerColumn[],\n  values: DataTableFilterSelection,\n  setValues: Dispatch<SetStateAction<DataTableFilterSelection>>,\n  options: ServerFilterBarOptions = {},\n): ServerFilterConfig {\n  const config: ServerFilterConfig = { filters: [] };\n  const claimed = new Map<string, string>();\n\n  for (const column of columns) {\n    const filter = column.filter;\n    if (!filter) continue;\n    const filterKey = column.filterKey;\n    if (!filterKey) {\n      throw new Error(`Column ${column.name} declares a filter but no filterKey to send it under`);\n    }\n    const owner = claimed.get(filterKey);\n    if (owner !== undefined) {\n      throw new Error(\n        `Columns ${owner} and ${column.name} both filter through ${filterKey}; a filter key addresses one column`,\n      );\n    }\n    claimed.set(filterKey, column.name);\n\n    const label = column.label ?? prettifyKey(column.name);\n    if (filter.kind === \"time\") {\n      if (config.timeRange) {\n        throw new Error(\n          `Columns ${claimed.get(filterKey)} and ${column.name} both declare a time range; the filter bar has one`,\n        );\n      }\n      config.timeRange = buildTimeRange(filterKey, filter, values, setValues);\n      continue;\n    }\n    config.filters.push(\n      applyFilterExtensions(\n        buildFilter({ column, filterKey, label, filter, values, setValues, options }),\n        options.extensions,\n      ),\n    );\n  }\n  return config;\n}\n\ntype BuildArgs = {\n  column: DataTableServerColumn;\n  filterKey: string;\n  label: string;\n  filter: DataTableColumnFilter;\n  values: DataTableFilterSelection;\n  setValues: Dispatch<SetStateAction<DataTableFilterSelection>>;\n  options: ServerFilterBarOptions;\n};\n\nfunction buildFilter(args: BuildArgs): FilterBarFilter {\n  const { filterKey, label, filter, values, setValues } = args;\n  const raw = values[filterKey] ?? \"\";\n  const write = (serialized: string) =>\n    setValues((current) => updateFilterSelection(current, filterKey, serialized));\n  const shared = {\n    key: filterKey,\n    label,\n    ...(filter.description !== undefined ? { description: filter.description } : {}),\n    ...(filter.disabled !== undefined ? { disabled: filter.disabled } : {}),\n  };\n\n  switch (filter.kind) {\n    case \"range\":\n      return {\n        ...shared,\n        kind: \"number\",\n        value: parseBoundsValue(raw),\n        onChange: (next: FilterBarNumberValue) => write(serializeBoundsValue(next)),\n        ...(filter.min !== undefined ? { domainMin: filter.min } : {}),\n        ...(filter.max !== undefined ? { domainMax: filter.max } : {}),\n        ...(filter.step !== undefined ? { step: filter.step } : {}),\n      };\n    case \"boolean\":\n      return {\n        ...shared,\n        kind: \"tristate\",\n        value: raw === \"\" ? undefined : raw === \"true\",\n        onChange: (next: TriState) => write(next === undefined ? \"\" : String(next)),\n      };\n    case \"text\":\n      return {\n        ...shared,\n        kind: \"text\",\n        value: raw,\n        onChange: (next: string) => write(next),\n      };\n    default:\n      return buildTermsFilter(args, shared, raw, write);\n  }\n}\n\nfunction buildTermsFilter(\n  { filter, options }: BuildArgs,\n  shared: { key: string; label: string; description?: string; disabled?: boolean },\n  raw: string,\n  write: (serialized: string) => void,\n): FilterBarFilter {\n  const lookupValues = options.lookupValues;\n  return {\n    ...shared,\n    kind: \"multi\",\n    value: parseMultiFilterValue(raw),\n    onChange: (next) => write(serializeMultiFilterValue(next)),\n    options: (filter.options ?? []).map(toMultiSelectOption),\n    ...(filter.truncated !== undefined ? { truncated: filter.truncated } : {}),\n    ...(filter.total !== undefined ? { total: filter.total } : {}),\n    // The field owns the in-flight flag from the promise this returns, so no\n    // `loading` is passed: a second source of truth for it could disagree.\n    ...(lookupValues && filter.lookup\n      ? {\n          onSearch: async (search: string) => {\n            const result = await lookupValues({\n              filterKey: shared.key,\n              search,\n              limit: DATA_TABLE_FILTER_LOOKUP_LIMIT,\n            });\n            return result.options.map(toMultiSelectOption);\n          },\n        }\n      : {}),\n  };\n}\n\nfunction buildTimeRange(\n  filterKey: string,\n  filter: DataTableColumnFilter,\n  values: DataTableFilterSelection,\n  setValues: Dispatch<SetStateAction<DataTableFilterSelection>>,\n): FilterBarRangeProps {\n  const bounds = parseBoundsValue(values[filterKey] ?? \"\");\n  return {\n    ...(bounds.min !== undefined ? { from: bounds.min } : {}),\n    ...(bounds.max !== undefined ? { to: bounds.max } : {}),\n    onApply: (from, to) =>\n      setValues((current) =>\n        updateFilterSelection(current, filterKey, serializeBoundsValue({ min: from, max: to })),\n      ),\n    ...(filter.presets !== undefined ? { presets: filter.presets } : {}),\n    timeEnabled: true,\n  };\n}\n\n/**\n * Reads the bounded half of the selection grammar: comma-separated tokens, each\n * carrying its own comparison operator. The bar's controls are inclusive on\n * both edges, so that is what they write back — but a bound typed by hand or\n * arriving in a URL keeps whatever operator it came with.\n */\nfunction parseBoundsValue(raw: string): FilterBarNumberValue {\n  const bounds: FilterBarNumberValue = {};\n  for (const token of raw.split(\",\")) {\n    const trimmed = token.trim();\n    if (trimmed.startsWith(\">\")) {\n      bounds.min = trimmed.replace(/^>=?/, \"\");\n    } else if (trimmed.startsWith(\"<\")) {\n      bounds.max = trimmed.replace(/^<=?/, \"\");\n    }\n  }\n  return bounds;\n}\n\nfunction serializeBoundsValue(value: FilterBarNumberValue): string {\n  const tokens: string[] = [];\n  if (value.min) tokens.push(`>=${value.min}`);\n  if (value.max) tokens.push(`<=${value.max}`);\n  return tokens.join(\",\");\n}\n\nfunction toMultiSelectOption(option: DataTableFilterOption): MultiSelectOption {\n  const label = option.label ?? option.value;\n  return {\n    value: option.value,\n    label,\n    ...(option.count !== undefined ? { title: `${label} · ${option.count.toLocaleString()}` } : {}),\n  };\n}\n\n/**\n * Refuses a DataTable that would filter twice or offer a control wired to\n * nothing. Both are silent in a running table — rows narrow more than the user\n * asked, or a box swallows what they type — so they are refused at the seam.\n */\nexport function assertDataTableFilterProps(props: {\n  autoFilter: boolean;\n  manualFilter: boolean;\n  showGlobalFilter: boolean;\n  globalFilterControlled: boolean;\n  hasExternalSearch: boolean;\n}): void {\n  if (props.autoFilter && props.manualFilter) {\n    throw new Error(\n      \"DataTable: autoFilter generates filters that narrow rows locally, which manualFilter then suppresses — the controls would render and do nothing. Pass externalFilters instead.\",\n    );\n  }\n  if (\n    props.manualFilter &&\n    props.showGlobalFilter &&\n    !props.globalFilterControlled &&\n    !props.hasExternalSearch\n  ) {\n    throw new Error(\n      \"DataTable: manualFilter suppresses the built-in search's row narrowing, so showGlobalFilter needs globalFilter/onGlobalFilterChange or externalSearch to reach the source.\",\n    );\n  }\n}\n"],"names":["prettifyKey","applyFilterExtensions","updateFilterSelection","parseMultiFilterValue","serializeMultiFilterValue"],"mappings":";;;;;AAoFO,MAAM,iCAAiC;AA4CvC,SAAS,gCACd,SACsB;AACtB,SAAO,QAAQ,IAAI,CAAC,QAAQ,WAAW;AAAA,IACrC,KAAK,OAAO,SAAS,KAAK,UAAU,KAAK,KAAK,OAAO;AAAA,IACrD,OAAO,OAAO,SAASA,eAAAA,YAAY,OAAO,IAAI;AAAA,IAC9C,UAAU,CAAC,QAAW,IAAI,OAAO,IAAI;AAAA,IACrC,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,KAAA,IAAS,CAAA;AAAA,IACxD,GAAI,OAAO,cAAc,SAAY,EAAE,WAAW,OAAO,cAAc,CAAA;AAAA,EAAC,EACxE;AACJ;AAcO,SAAS,yBACd,SACA,QACA,WACA,UAAkC,CAAA,GACd;AACpB,QAAM,SAA6B,EAAE,SAAS,GAAC;AAC/C,QAAM,8BAAc,IAAA;AAEpB,aAAW,UAAU,SAAS;AAC5B,UAAM,SAAS,OAAO;AACtB,QAAI,CAAC,OAAQ;AACb,UAAM,YAAY,OAAO;AACzB,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,UAAU,OAAO,IAAI,sDAAsD;AAAA,IAC7F;AACA,UAAM,QAAQ,QAAQ,IAAI,SAAS;AACnC,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI;AAAA,QACR,WAAW,KAAK,QAAQ,OAAO,IAAI,wBAAwB,SAAS;AAAA,MAAA;AAAA,IAExE;AACA,YAAQ,IAAI,WAAW,OAAO,IAAI;AAElC,UAAM,QAAQ,OAAO,SAASA,eAAAA,YAAY,OAAO,IAAI;AACrD,QAAI,OAAO,SAAS,QAAQ;AAC1B,UAAI,OAAO,WAAW;AACpB,cAAM,IAAI;AAAA,UACR,WAAW,QAAQ,IAAI,SAAS,CAAC,QAAQ,OAAO,IAAI;AAAA,QAAA;AAAA,MAExD;AACA,aAAO,YAAY,eAAe,WAAW,QAAQ,QAAQ,SAAS;AACtE;AAAA,IACF;AACA,WAAO,QAAQ;AAAA,MACbC,eAAAA;AAAAA,QACE,YAAY,EAAU,WAAW,OAAO,QAAQ,QAAQ,WAAW,SAAS;AAAA,QAC5E,QAAQ;AAAA,MAAA;AAAA,IACV;AAAA,EAEJ;AACA,SAAO;AACT;AAYA,SAAS,YAAY,MAAkC;AACrD,QAAM,EAAE,WAAW,OAAO,QAAQ,QAAQ,cAAc;AACxD,QAAM,MAAM,OAAO,SAAS,KAAK;AACjC,QAAM,QAAQ,CAAC,eACb,UAAU,CAAC,YAAYC,sBAAAA,sBAAsB,SAAS,WAAW,UAAU,CAAC;AAC9E,QAAM,SAAS;AAAA,IACb,KAAK;AAAA,IACL;AAAA,IACA,GAAI,OAAO,gBAAgB,SAAY,EAAE,aAAa,OAAO,YAAA,IAAgB,CAAA;AAAA,IAC7E,GAAI,OAAO,aAAa,SAAY,EAAE,UAAU,OAAO,aAAa,CAAA;AAAA,EAAC;AAGvE,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,OAAO,iBAAiB,GAAG;AAAA,QAC3B,UAAU,CAAC,SAA+B,MAAM,qBAAqB,IAAI,CAAC;AAAA,QAC1E,GAAI,OAAO,QAAQ,SAAY,EAAE,WAAW,OAAO,IAAA,IAAQ,CAAA;AAAA,QAC3D,GAAI,OAAO,QAAQ,SAAY,EAAE,WAAW,OAAO,IAAA,IAAQ,CAAA;AAAA,QAC3D,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,SAAS,CAAA;AAAA,MAAC;AAAA,IAE7D,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,OAAO,QAAQ,KAAK,SAAY,QAAQ;AAAA,QACxC,UAAU,CAAC,SAAmB,MAAM,SAAS,SAAY,KAAK,OAAO,IAAI,CAAC;AAAA,MAAA;AAAA,IAE9E,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,OAAO;AAAA,QACP,UAAU,CAAC,SAAiB,MAAM,IAAI;AAAA,MAAA;AAAA,IAE1C;AACE,aAAO,iBAAiB,MAAM,QAAQ,KAAK,KAAK;AAAA,EAAA;AAEtD;AAEA,SAAS,iBACP,EAAE,QAAQ,WACV,QACA,KACA,OACiB;AACjB,QAAM,eAAe,QAAQ;AAC7B,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN,OAAOC,sBAAAA,sBAAsB,GAAG;AAAA,IAChC,UAAU,CAAC,SAAS,MAAMC,sBAAAA,0BAA0B,IAAI,CAAC;AAAA,IACzD,UAAU,OAAO,WAAW,CAAA,GAAI,IAAI,mBAAmB;AAAA,IACvD,GAAI,OAAO,cAAc,SAAY,EAAE,WAAW,OAAO,UAAA,IAAc,CAAA;AAAA,IACvE,GAAI,OAAO,UAAU,SAAY,EAAE,OAAO,OAAO,MAAA,IAAU,CAAA;AAAA;AAAA;AAAA,IAG3D,GAAI,gBAAgB,OAAO,SACvB;AAAA,MACE,UAAU,OAAO,WAAmB;AAClC,cAAM,SAAS,MAAM,aAAa;AAAA,UAChC,WAAW,OAAO;AAAA,UAClB;AAAA,UACA,OAAO;AAAA,QAAA,CACR;AACD,eAAO,OAAO,QAAQ,IAAI,mBAAmB;AAAA,MAC/C;AAAA,IAAA,IAEF,CAAA;AAAA,EAAC;AAET;AAEA,SAAS,eACP,WACA,QACA,QACA,WACqB;AACrB,QAAM,SAAS,iBAAiB,OAAO,SAAS,KAAK,EAAE;AACvD,SAAO;AAAA,IACL,GAAI,OAAO,QAAQ,SAAY,EAAE,MAAM,OAAO,IAAA,IAAQ,CAAA;AAAA,IACtD,GAAI,OAAO,QAAQ,SAAY,EAAE,IAAI,OAAO,IAAA,IAAQ,CAAA;AAAA,IACpD,SAAS,CAAC,MAAM,OACd;AAAA,MAAU,CAAC,YACTF,sBAAAA,sBAAsB,SAAS,WAAW,qBAAqB,EAAE,KAAK,MAAM,KAAK,IAAI,CAAC;AAAA,IAAA;AAAA,IAE1F,GAAI,OAAO,YAAY,SAAY,EAAE,SAAS,OAAO,QAAA,IAAY,CAAA;AAAA,IACjE,aAAa;AAAA,EAAA;AAEjB;AAQA,SAAS,iBAAiB,KAAmC;AAC3D,QAAM,SAA+B,CAAA;AACrC,aAAW,SAAS,IAAI,MAAM,GAAG,GAAG;AAClC,UAAM,UAAU,MAAM,KAAA;AACtB,QAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,aAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IACzC,WAAW,QAAQ,WAAW,GAAG,GAAG;AAClC,aAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IACzC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAqC;AACjE,QAAM,SAAmB,CAAA;AACzB,MAAI,MAAM,IAAK,QAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC3C,MAAI,MAAM,IAAK,QAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAC3C,SAAO,OAAO,KAAK,GAAG;AACxB;AAEA,SAAS,oBAAoB,QAAkD;AAC7E,QAAM,QAAQ,OAAO,SAAS,OAAO;AACrC,SAAO;AAAA,IACL,OAAO,OAAO;AAAA,IACd;AAAA,IACA,GAAI,OAAO,UAAU,SAAY,EAAE,OAAO,GAAG,KAAK,MAAM,OAAO,MAAM,eAAA,CAAgB,GAAA,IAAO,CAAA;AAAA,EAAC;AAEjG;AAOO,SAAS,2BAA2B,OAMlC;AACP,MAAI,MAAM,cAAc,MAAM,cAAc;AAC1C,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AACA,MACE,MAAM,gBACN,MAAM,oBACN,CAAC,MAAM,0BACP,CAAC,MAAM,mBACP;AACA,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AACF;;;;;"}
+{"version":3,"file":"data-table-server-filters.cjs","sources":["../../src/data/data-table-server-filters.ts"],"sourcesContent":["import type { Dispatch, SetStateAction } from \"react\";\nimport type {\n  FilterBarFilter,\n  FilterBarNumberValue,\n  FilterBarRangePreset,\n  FilterBarRangeProps,\n} from \"../components/FilterBar\";\nimport type { FilterExtension } from \"../components/filter-bar-utils\";\nimport { applyFilterExtensions } from \"../components/filter-bar-utils\";\nimport type { MultiSelectOption } from \"../components/MultiSelect\";\nimport type { TriState } from \"../components/TriStateToggle\";\nimport type { DataTableColumn, DataTableColumnKind } from \"./DataTable\";\nimport {\n  parseBoundsValue,\n  parseMultiFilterValue,\n  serializeBoundsValue,\n  serializeMultiFilterValue,\n  updateFilterSelection,\n  type DataTableFilterSelection,\n  type FilterBoundsValue,\n} from \"./data-table-filter-values\";\nimport { prettifyKey } from \"./data-table-utils\";\n\n/**\n * Which control a filter renders as.\n *\n * Deliberately opaque: \"terms\" is not \"a SQL IN() or an OpenSearch terms\n * query\", it is \"a set of discrete values the user includes or excludes\". The\n * source compiles the selection; nothing about how it does so crosses into the\n * browser.\n */\nexport type DataTableFilterKind = \"terms\" | \"range\" | \"time\" | \"boolean\" | \"text\";\n\nexport type DataTableFilterOption = {\n  /** Value written into the selection. */\n  value: string;\n  /** Display label. Falls back to `value`. */\n  label?: string;\n  /** How many rows carry this value, shown as a tooltip. */\n  count?: number;\n};\n\nexport type DataTableColumnFilter = {\n  kind: DataTableFilterKind;\n  /** Head of the option set for kind:\"terms\". Empty relies on `lookup`. */\n  options?: DataTableFilterOption[];\n  /** True when `options` is a capped head of a larger set. */\n  truncated?: boolean;\n  /** Distinct count behind a truncated head; drives the \"… and N more\" hint. */\n  total?: number;\n  /** The source can answer a type-ahead for this filter. */\n  lookup?: boolean;\n  /** Slider domain for kind:\"range\". */\n  min?: number;\n  max?: number;\n  step?: number;\n  /** Range presets for kind:\"time\". */\n  presets?: FilterBarRangePreset[];\n  /** Helper text shown in the filter popover. */\n  description?: string;\n  disabled?: boolean;\n};\n\n/**\n * A result column as the source describes it: how to render it, and — when the\n * source can narrow on it — which filter parameter it binds to and what control\n * that filter is.\n *\n * `filterKey` need not equal `name`: an analyzed text field filters through an\n * exact-value sibling, and a computed column filters by the alias it was given.\n */\nexport type DataTableServerColumn = {\n  /** Field name as the source knows it; also the literal row key. */\n  name: string;\n  /** Header label. Defaults to a prettified `name`. */\n  label?: string;\n  /** Backend type string, verbatim (e.g. \"TIMESTAMPTZ\", \"keyword\"). Display only. */\n  databaseType?: string;\n  /** Cell rendering kind. */\n  kind?: DataTableColumnKind;\n  /** Filter parameter this column narrows on. Absent means not filterable. */\n  filterKey?: string;\n  /** The control the filter renders as. Absent means not filterable. */\n  filter?: DataTableColumnFilter;\n};\n\n/** Head-set size for a filter value type-ahead. */\nexport const DATA_TABLE_FILTER_LOOKUP_LIMIT = 20;\n\nexport type DataTableFilterLookupRequest = {\n  /** Which filter is being searched — the column's `filterKey`. */\n  filterKey: string;\n  /** What the user typed. Empty asks for the head of the set. */\n  search: string;\n  /** How many options to return. */\n  limit: number;\n};\n\nexport type DataTableFilterLookupResult = {\n  options: DataTableFilterOption[];\n};\n\n/**\n * Answers a filter's value type-ahead. Sync or async — a static option source\n * returns an array, a server-backed one a promise.\n */\nexport type DataTableFilterLookup = (\n  request: DataTableFilterLookupRequest,\n) => Promise<DataTableFilterLookupResult> | DataTableFilterLookupResult;\n\nexport type ServerFilterBarOptions = {\n  /** Answers a terms type-ahead for filters whose `lookup` is set. */\n  lookupValues?: DataTableFilterLookup;\n  /** Decorators applied to each built filter (icons, relabelling). */\n  extensions?: FilterExtension[];\n};\n\nexport type ServerFilterConfig = {\n  filters: FilterBarFilter[];\n  /** Present when exactly one column declared kind:\"time\". */\n  timeRange?: FilterBarRangeProps;\n};\n\n/**\n * Turns the source's column description into DataTable columns.\n *\n * Every column gets a literal `accessor` — a raw result set has empty, dotted\n * and colliding names, none of which survive being read as a path — and\n * `filterable: false`, because a described result is filtered by the source and\n * never by cardinality guessed from one page.\n */\nexport function serverColumnsToDataTableColumns<T extends Record<string, unknown>>(\n  columns: DataTableServerColumn[],\n): DataTableColumn<T>[] {\n  return columns.map((column, index) => ({\n    key: column.name === \"\" ? `column-${index}` : column.name,\n    label: column.label ?? prettifyKey(column.name),\n    accessor: (row: T) => row[column.name],\n    sortable: true,\n    filterable: false,\n    ...(column.kind !== undefined ? { kind: column.kind } : {}),\n    ...(column.filterKey !== undefined ? { filterKey: column.filterKey } : {}),\n  }));\n}\n\n/**\n * Builds the FilterBar controls for a described result, already wired to\n * `values`/`setValues`.\n *\n * Pure — it holds no state and fetches nothing; a `lookup` filter closes over\n * the caller's loader. Pass the result as DataTable's `externalFilters`\n * together with `manualFilter`, since the source has already applied it.\n *\n * Throws when a column declares a filter it cannot address: no `filterKey`, a\n * `filterKey` another column already claimed, or a second time range. Each\n * would bind a control to a filter that means something else.\n */\nexport function serverFiltersToFilterBar(\n  columns: DataTableServerColumn[],\n  values: DataTableFilterSelection,\n  setValues: Dispatch<SetStateAction<DataTableFilterSelection>>,\n  options: ServerFilterBarOptions = {},\n): ServerFilterConfig {\n  const config: ServerFilterConfig = { filters: [] };\n  const claimed = new Map<string, string>();\n\n  for (const column of columns) {\n    const filter = column.filter;\n    if (!filter) continue;\n    const filterKey = column.filterKey;\n    if (!filterKey) {\n      throw new Error(`Column ${column.name} declares a filter but no filterKey to send it under`);\n    }\n    const owner = claimed.get(filterKey);\n    if (owner !== undefined) {\n      throw new Error(\n        `Columns ${owner} and ${column.name} both filter through ${filterKey}; a filter key addresses one column`,\n      );\n    }\n    claimed.set(filterKey, column.name);\n\n    const label = column.label ?? prettifyKey(column.name);\n    // The bar's own range control is the primary way through a result, and a\n    // result has one of those — so the first time column takes it and any\n    // others are ranges among the filters. A raw SELECT commonly returns\n    // created_at beside updated_at, and refusing the second one cost the whole\n    // bar rather than just that column's control.\n    if (filter.kind === \"time\" && !config.timeRange) {\n      config.timeRange = buildTimeRange(filterKey, filter, values, setValues);\n      continue;\n    }\n    config.filters.push(\n      applyFilterExtensions(\n        buildFilter({ column, filterKey, label, filter, values, setValues, options }),\n        options.extensions,\n      ),\n    );\n  }\n  return config;\n}\n\ntype BuildArgs = {\n  column: DataTableServerColumn;\n  filterKey: string;\n  label: string;\n  filter: DataTableColumnFilter;\n  values: DataTableFilterSelection;\n  setValues: Dispatch<SetStateAction<DataTableFilterSelection>>;\n  options: ServerFilterBarOptions;\n};\n\nfunction buildFilter(args: BuildArgs): FilterBarFilter {\n  const { filterKey, label, filter, values, setValues } = args;\n  const raw = values[filterKey] ?? \"\";\n  const write = (serialized: string) =>\n    setValues((current) => updateFilterSelection(current, filterKey, serialized));\n  const shared = {\n    key: filterKey,\n    label,\n    ...(filter.description !== undefined ? { description: filter.description } : {}),\n    ...(filter.disabled !== undefined ? { disabled: filter.disabled } : {}),\n  };\n\n  switch (filter.kind) {\n    case \"time\":\n      return {\n        ...shared,\n        kind: \"date-range\",\n        ...boundsToRange(parseBoundsValue(raw)),\n        onApply: (from: string, to: string) =>\n          write(serializeBoundsValue({ min: from, max: to })),\n        ...(filter.presets !== undefined ? { presets: filter.presets } : {}),\n        timeEnabled: true,\n      };\n    case \"range\":\n      return {\n        ...shared,\n        kind: \"number\",\n        value: parseBoundsValue(raw),\n        onChange: (next: FilterBarNumberValue) => write(serializeBoundsValue(next)),\n        ...(filter.min !== undefined ? { domainMin: filter.min } : {}),\n        ...(filter.max !== undefined ? { domainMax: filter.max } : {}),\n        ...(filter.step !== undefined ? { step: filter.step } : {}),\n      };\n    case \"boolean\":\n      return {\n        ...shared,\n        kind: \"tristate\",\n        value: raw === \"\" ? undefined : raw === \"true\",\n        onChange: (next: TriState) => write(next === undefined ? \"\" : String(next)),\n      };\n    case \"text\":\n      return {\n        ...shared,\n        kind: \"text\",\n        value: raw,\n        onChange: (next: string) => write(next),\n      };\n    default:\n      return buildTermsFilter(args, shared, raw, write);\n  }\n}\n\nfunction buildTermsFilter(\n  { filter, options }: BuildArgs,\n  shared: { key: string; label: string; description?: string; disabled?: boolean },\n  raw: string,\n  write: (serialized: string) => void,\n): FilterBarFilter {\n  const lookupValues = options.lookupValues;\n  // A selection with no options and no type-ahead has nothing to select from,\n  // and a dropdown that opens empty is a control the user cannot use. The\n  // grammar is the wire format either way, so typing \"a,b\" or \"!a\" into the\n  // input still means what selecting them would have.\n  if (!filter.lookup && (filter.options?.length ?? 0) === 0) {\n    return { ...shared, kind: \"text\", value: raw, onChange: (next: string) => write(next) };\n  }\n  return {\n    ...shared,\n    kind: \"multi\",\n    value: parseMultiFilterValue(raw),\n    onChange: (next) => write(serializeMultiFilterValue(next)),\n    options: (filter.options ?? []).map(toMultiSelectOption),\n    ...(filter.truncated !== undefined ? { truncated: filter.truncated } : {}),\n    ...(filter.total !== undefined ? { total: filter.total } : {}),\n    // The field owns the in-flight flag from the promise this returns, so no\n    // `loading` is passed: a second source of truth for it could disagree.\n    ...(lookupValues && filter.lookup\n      ? {\n          onSearch: async (search: string) => {\n            const result = await lookupValues({\n              filterKey: shared.key,\n              search,\n              limit: DATA_TABLE_FILTER_LOOKUP_LIMIT,\n            });\n            return result.options.map(toMultiSelectOption);\n          },\n        }\n      : {}),\n  };\n}\n\nfunction buildTimeRange(\n  filterKey: string,\n  filter: DataTableColumnFilter,\n  values: DataTableFilterSelection,\n  setValues: Dispatch<SetStateAction<DataTableFilterSelection>>,\n): FilterBarRangeProps {\n  return {\n    ...boundsToRange(parseBoundsValue(values[filterKey] ?? \"\")),\n    onApply: (from, to) =>\n      setValues((current) =>\n        updateFilterSelection(current, filterKey, serializeBoundsValue({ min: from, max: to })),\n      ),\n    ...(filter.presets !== undefined ? { presets: filter.presets } : {}),\n    timeEnabled: true,\n  };\n}\n\n/** Names a bounded selection's edges the way a range control reads them. */\nfunction boundsToRange(bounds: FilterBoundsValue): { from?: string; to?: string } {\n  return {\n    ...(bounds.min !== undefined ? { from: bounds.min } : {}),\n    ...(bounds.max !== undefined ? { to: bounds.max } : {}),\n  };\n}\n\nfunction toMultiSelectOption(option: DataTableFilterOption): MultiSelectOption {\n  const label = option.label ?? option.value;\n  return {\n    value: option.value,\n    label,\n    ...(option.count !== undefined ? { title: `${label} · ${option.count.toLocaleString()}` } : {}),\n  };\n}\n\n/**\n * Refuses a DataTable that would filter twice or offer a control wired to\n * nothing. Both are silent in a running table — rows narrow more than the user\n * asked, or a box swallows what they type — so they are refused at the seam.\n */\nexport function assertDataTableFilterProps(props: {\n  autoFilter: boolean;\n  manualFilter: boolean;\n  showGlobalFilter: boolean;\n  globalFilterControlled: boolean;\n  hasExternalSearch: boolean;\n}): void {\n  if (props.autoFilter && props.manualFilter) {\n    throw new Error(\n      \"DataTable: autoFilter generates filters that narrow rows locally, which manualFilter then suppresses — the controls would render and do nothing. Pass externalFilters instead.\",\n    );\n  }\n  if (\n    props.manualFilter &&\n    props.showGlobalFilter &&\n    !props.globalFilterControlled &&\n    !props.hasExternalSearch\n  ) {\n    throw new Error(\n      \"DataTable: manualFilter suppresses the built-in search's row narrowing, so showGlobalFilter needs globalFilter/onGlobalFilterChange or externalSearch to reach the source.\",\n    );\n  }\n}\n"],"names":["prettifyKey","applyFilterExtensions","updateFilterSelection","parseBoundsValue","serializeBoundsValue","parseMultiFilterValue","serializeMultiFilterValue"],"mappings":";;;;;AAuFO,MAAM,iCAAiC;AA4CvC,SAAS,gCACd,SACsB;AACtB,SAAO,QAAQ,IAAI,CAAC,QAAQ,WAAW;AAAA,IACrC,KAAK,OAAO,SAAS,KAAK,UAAU,KAAK,KAAK,OAAO;AAAA,IACrD,OAAO,OAAO,SAASA,eAAAA,YAAY,OAAO,IAAI;AAAA,IAC9C,UAAU,CAAC,QAAW,IAAI,OAAO,IAAI;AAAA,IACrC,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,KAAA,IAAS,CAAA;AAAA,IACxD,GAAI,OAAO,cAAc,SAAY,EAAE,WAAW,OAAO,cAAc,CAAA;AAAA,EAAC,EACxE;AACJ;AAcO,SAAS,yBACd,SACA,QACA,WACA,UAAkC,CAAA,GACd;AACpB,QAAM,SAA6B,EAAE,SAAS,GAAC;AAC/C,QAAM,8BAAc,IAAA;AAEpB,aAAW,UAAU,SAAS;AAC5B,UAAM,SAAS,OAAO;AACtB,QAAI,CAAC,OAAQ;AACb,UAAM,YAAY,OAAO;AACzB,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MAAM,UAAU,OAAO,IAAI,sDAAsD;AAAA,IAC7F;AACA,UAAM,QAAQ,QAAQ,IAAI,SAAS;AACnC,QAAI,UAAU,QAAW;AACvB,YAAM,IAAI;AAAA,QACR,WAAW,KAAK,QAAQ,OAAO,IAAI,wBAAwB,SAAS;AAAA,MAAA;AAAA,IAExE;AACA,YAAQ,IAAI,WAAW,OAAO,IAAI;AAElC,UAAM,QAAQ,OAAO,SAASA,eAAAA,YAAY,OAAO,IAAI;AAMrD,QAAI,OAAO,SAAS,UAAU,CAAC,OAAO,WAAW;AAC/C,aAAO,YAAY,eAAe,WAAW,QAAQ,QAAQ,SAAS;AACtE;AAAA,IACF;AACA,WAAO,QAAQ;AAAA,MACbC,eAAAA;AAAAA,QACE,YAAY,EAAU,WAAW,OAAO,QAAQ,QAAQ,WAAW,SAAS;AAAA,QAC5E,QAAQ;AAAA,MAAA;AAAA,IACV;AAAA,EAEJ;AACA,SAAO;AACT;AAYA,SAAS,YAAY,MAAkC;AACrD,QAAM,EAAE,WAAW,OAAO,QAAQ,QAAQ,cAAc;AACxD,QAAM,MAAM,OAAO,SAAS,KAAK;AACjC,QAAM,QAAQ,CAAC,eACb,UAAU,CAAC,YAAYC,sBAAAA,sBAAsB,SAAS,WAAW,UAAU,CAAC;AAC9E,QAAM,SAAS;AAAA,IACb,KAAK;AAAA,IACL;AAAA,IACA,GAAI,OAAO,gBAAgB,SAAY,EAAE,aAAa,OAAO,YAAA,IAAgB,CAAA;AAAA,IAC7E,GAAI,OAAO,aAAa,SAAY,EAAE,UAAU,OAAO,aAAa,CAAA;AAAA,EAAC;AAGvE,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,GAAG,cAAcC,uCAAiB,GAAG,CAAC;AAAA,QACtC,SAAS,CAAC,MAAc,OACtB,MAAMC,sBAAAA,qBAAqB,EAAE,KAAK,MAAM,KAAK,GAAA,CAAI,CAAC;AAAA,QACpD,GAAI,OAAO,YAAY,SAAY,EAAE,SAAS,OAAO,QAAA,IAAY,CAAA;AAAA,QACjE,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,OAAOD,sBAAAA,iBAAiB,GAAG;AAAA,QAC3B,UAAU,CAAC,SAA+B,MAAMC,sBAAAA,qBAAqB,IAAI,CAAC;AAAA,QAC1E,GAAI,OAAO,QAAQ,SAAY,EAAE,WAAW,OAAO,IAAA,IAAQ,CAAA;AAAA,QAC3D,GAAI,OAAO,QAAQ,SAAY,EAAE,WAAW,OAAO,IAAA,IAAQ,CAAA;AAAA,QAC3D,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,SAAS,CAAA;AAAA,MAAC;AAAA,IAE7D,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,OAAO,QAAQ,KAAK,SAAY,QAAQ;AAAA,QACxC,UAAU,CAAC,SAAmB,MAAM,SAAS,SAAY,KAAK,OAAO,IAAI,CAAC;AAAA,MAAA;AAAA,IAE9E,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM;AAAA,QACN,OAAO;AAAA,QACP,UAAU,CAAC,SAAiB,MAAM,IAAI;AAAA,MAAA;AAAA,IAE1C;AACE,aAAO,iBAAiB,MAAM,QAAQ,KAAK,KAAK;AAAA,EAAA;AAEtD;AAEA,SAAS,iBACP,EAAE,QAAQ,WACV,QACA,KACA,OACiB;;AACjB,QAAM,eAAe,QAAQ;AAK7B,MAAI,CAAC,OAAO,aAAW,YAAO,YAAP,mBAAgB,WAAU,OAAO,GAAG;AACzD,WAAO,EAAE,GAAG,QAAQ,MAAM,QAAQ,OAAO,KAAK,UAAU,CAAC,SAAiB,MAAM,IAAI,EAAA;AAAA,EACtF;AACA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN,OAAOC,sBAAAA,sBAAsB,GAAG;AAAA,IAChC,UAAU,CAAC,SAAS,MAAMC,sBAAAA,0BAA0B,IAAI,CAAC;AAAA,IACzD,UAAU,OAAO,WAAW,CAAA,GAAI,IAAI,mBAAmB;AAAA,IACvD,GAAI,OAAO,cAAc,SAAY,EAAE,WAAW,OAAO,UAAA,IAAc,CAAA;AAAA,IACvE,GAAI,OAAO,UAAU,SAAY,EAAE,OAAO,OAAO,MAAA,IAAU,CAAA;AAAA;AAAA;AAAA,IAG3D,GAAI,gBAAgB,OAAO,SACvB;AAAA,MACE,UAAU,OAAO,WAAmB;AAClC,cAAM,SAAS,MAAM,aAAa;AAAA,UAChC,WAAW,OAAO;AAAA,UAClB;AAAA,UACA,OAAO;AAAA,QAAA,CACR;AACD,eAAO,OAAO,QAAQ,IAAI,mBAAmB;AAAA,MAC/C;AAAA,IAAA,IAEF,CAAA;AAAA,EAAC;AAET;AAEA,SAAS,eACP,WACA,QACA,QACA,WACqB;AACrB,SAAO;AAAA,IACL,GAAG,cAAcH,sBAAAA,iBAAiB,OAAO,SAAS,KAAK,EAAE,CAAC;AAAA,IAC1D,SAAS,CAAC,MAAM,OACd;AAAA,MAAU,CAAC,YACTD,sBAAAA,sBAAsB,SAAS,WAAWE,sBAAAA,qBAAqB,EAAE,KAAK,MAAM,KAAK,IAAI,CAAC;AAAA,IAAA;AAAA,IAE1F,GAAI,OAAO,YAAY,SAAY,EAAE,SAAS,OAAO,QAAA,IAAY,CAAA;AAAA,IACjE,aAAa;AAAA,EAAA;AAEjB;AAGA,SAAS,cAAc,QAA2D;AAChF,SAAO;AAAA,IACL,GAAI,OAAO,QAAQ,SAAY,EAAE,MAAM,OAAO,IAAA,IAAQ,CAAA;AAAA,IACtD,GAAI,OAAO,QAAQ,SAAY,EAAE,IAAI,OAAO,QAAQ,CAAA;AAAA,EAAC;AAEzD;AAEA,SAAS,oBAAoB,QAAkD;AAC7E,QAAM,QAAQ,OAAO,SAAS,OAAO;AACrC,SAAO;AAAA,IACL,OAAO,OAAO;AAAA,IACd;AAAA,IACA,GAAI,OAAO,UAAU,SAAY,EAAE,OAAO,GAAG,KAAK,MAAM,OAAO,MAAM,eAAA,CAAgB,GAAA,IAAO,CAAA;AAAA,EAAC;AAEjG;AAOO,SAAS,2BAA2B,OAMlC;AACP,MAAI,MAAM,cAAc,MAAM,cAAc;AAC1C,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AACA,MACE,MAAM,gBACN,MAAM,oBACN,CAAC,MAAM,0BACP,CAAC,MAAM,mBACP;AACA,UAAM,IAAI;AAAA,MACR;AAAA,IAAA;AAAA,EAEJ;AACF;;;;;"}

package/dist/data/data-table-server-filters.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"data-table-server-filters.d.ts","sourceRoot":"","sources":["../../src/data/data-table-server-filters.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,OAAO,CAAC;AACtD,OAAO,KAAK,EACV,eAAe,EAEf,oBAAoB,EACpB,mBAAmB,EACpB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAItE,OAAO,KAAK,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACxE,OAAO,EAIL,KAAK,wBAAwB,EAC9B,MAAM,4BAA4B,CAAC;AAGpC;;;;;;;GAOG;AACH,MAAM,MAAM,mBAAmB,GAAG,OAAO,GAAG,OAAO,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC;AAElF,MAAM,MAAM,qBAAqB,GAAG;IAClC,wCAAwC;IACxC,KAAK,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAAG;IAClC,IAAI,EAAE,mBAAmB,CAAC;IAC1B,yEAAyE;IACzE,OAAO,CAAC,EAAE,qBAAqB,EAAE,CAAC;IAClC,4DAA4D;IAC5D,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,8EAA8E;IAC9E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,sCAAsC;IACtC,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qCAAqC;IACrC,OAAO,CAAC,EAAE,oBAAoB,EAAE,CAAC;IACjC,+CAA+C;IAC/C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,MAAM,qBAAqB,GAAG;IAClC,mEAAmE;IACnE,IAAI,EAAE,MAAM,CAAC;IACb,qDAAqD;IACrD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mFAAmF;IACnF,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,2BAA2B;IAC3B,IAAI,CAAC,EAAE,mBAAmB,CAAC;IAC3B,4EAA4E;IAC5E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,MAAM,CAAC,EAAE,qBAAqB,CAAC;CAChC,CAAC;AAEF,mDAAmD;AACnD,eAAO,MAAM,8BAA8B,KAAK,CAAC;AAEjD,MAAM,MAAM,4BAA4B,GAAG;IACzC,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;IAClB,+DAA+D;IAC/D,MAAM,EAAE,MAAM,CAAC;IACf,kCAAkC;IAClC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,2BAA2B,GAAG;IACxC,OAAO,EAAE,qBAAqB,EAAE,CAAC;CAClC,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,qBAAqB,GAAG,CAClC,OAAO,EAAE,4BAA4B,KAClC,OAAO,CAAC,2BAA2B,CAAC,GAAG,2BAA2B,CAAC;AAExE,MAAM,MAAM,sBAAsB,GAAG;IACnC,oEAAoE;IACpE,YAAY,CAAC,EAAE,qBAAqB,CAAC;IACrC,oEAAoE;IACpE,UAAU,CAAC,EAAE,eAAe,EAAE,CAAC;CAChC,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,OAAO,EAAE,eAAe,EAAE,CAAC;IAC3B,4DAA4D;IAC5D,SAAS,CAAC,EAAE,mBAAmB,CAAC;CACjC,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,+BAA+B,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/E,OAAO,EAAE,qBAAqB,EAAE,GAC/B,eAAe,CAAC,CAAC,CAAC,EAAE,CAUtB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,qBAAqB,EAAE,EAChC,MAAM,EAAE,wBAAwB,EAChC,SAAS,EAAE,QAAQ,CAAC,cAAc,CAAC,wBAAwB,CAAC,CAAC,EAC7D,OAAO,GAAE,sBAA2B,GACnC,kBAAkB,CAqCpB;AA4ID;;;;GAIG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE;IAChD,UAAU,EAAE,OAAO,CAAC;IACpB,YAAY,EAAE,OAAO,CAAC;IACtB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,sBAAsB,EAAE,OAAO,CAAC;IAChC,iBAAiB,EAAE,OAAO,CAAC;CAC5B,GAAG,IAAI,CAgBP"}
+{"version":3,"file":"data-table-server-filters.d.ts","sourceRoot":"","sources":["../../src/data/data-table-server-filters.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,OAAO,CAAC;AACtD,OAAO,KAAK,EACV,eAAe,EAEf,oBAAoB,EACpB,mBAAmB,EACpB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAItE,OAAO,KAAK,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACxE,OAAO,EAML,KAAK,wBAAwB,EAE9B,MAAM,4BAA4B,CAAC;AAGpC;;;;;;;GAOG;AACH,MAAM,MAAM,mBAAmB,GAAG,OAAO,GAAG,OAAO,GAAG,MAAM,GAAG,SAAS,GAAG,MAAM,CAAC;AAElF,MAAM,MAAM,qBAAqB,GAAG;IAClC,wCAAwC;IACxC,KAAK,EAAE,MAAM,CAAC;IACd,4CAA4C;IAC5C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,qBAAqB,GAAG;IAClC,IAAI,EAAE,mBAAmB,CAAC;IAC1B,yEAAyE;IACzE,OAAO,CAAC,EAAE,qBAAqB,EAAE,CAAC;IAClC,4DAA4D;IAC5D,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,8EAA8E;IAC9E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,sCAAsC;IACtC,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,qCAAqC;IACrC,OAAO,CAAC,EAAE,oBAAoB,EAAE,CAAC;IACjC,+CAA+C;IAC/C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,MAAM,qBAAqB,GAAG;IAClC,mEAAmE;IACnE,IAAI,EAAE,MAAM,CAAC;IACb,qDAAqD;IACrD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mFAAmF;IACnF,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,2BAA2B;IAC3B,IAAI,CAAC,EAAE,mBAAmB,CAAC;IAC3B,4EAA4E;IAC5E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,MAAM,CAAC,EAAE,qBAAqB,CAAC;CAChC,CAAC;AAEF,mDAAmD;AACnD,eAAO,MAAM,8BAA8B,KAAK,CAAC;AAEjD,MAAM,MAAM,4BAA4B,GAAG;IACzC,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;IAClB,+DAA+D;IAC/D,MAAM,EAAE,MAAM,CAAC;IACf,kCAAkC;IAClC,KAAK,EAAE,MAAM,CAAC;CACf,CAAC;AAEF,MAAM,MAAM,2BAA2B,GAAG;IACxC,OAAO,EAAE,qBAAqB,EAAE,CAAC;CAClC,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,qBAAqB,GAAG,CAClC,OAAO,EAAE,4BAA4B,KAClC,OAAO,CAAC,2BAA2B,CAAC,GAAG,2BAA2B,CAAC;AAExE,MAAM,MAAM,sBAAsB,GAAG;IACnC,oEAAoE;IACpE,YAAY,CAAC,EAAE,qBAAqB,CAAC;IACrC,oEAAoE;IACpE,UAAU,CAAC,EAAE,eAAe,EAAE,CAAC;CAChC,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,OAAO,EAAE,eAAe,EAAE,CAAC;IAC3B,4DAA4D;IAC5D,SAAS,CAAC,EAAE,mBAAmB,CAAC;CACjC,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,+BAA+B,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC/E,OAAO,EAAE,qBAAqB,EAAE,GAC/B,eAAe,CAAC,CAAC,CAAC,EAAE,CAUtB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,qBAAqB,EAAE,EAChC,MAAM,EAAE,wBAAwB,EAChC,SAAS,EAAE,QAAQ,CAAC,cAAc,CAAC,wBAAwB,CAAC,CAAC,EAC7D,OAAO,GAAE,sBAA2B,GACnC,kBAAkB,CAqCpB;AAyID;;;;GAIG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE;IAChD,UAAU,EAAE,OAAO,CAAC;IACpB,YAAY,EAAE,OAAO,CAAC;IACtB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,sBAAsB,EAAE,OAAO,CAAC;IAChC,iBAAiB,EAAE,OAAO,CAAC;CAC5B,GAAG,IAAI,CAgBP"}