@eifi1/ui-kit 0.8.1 → 0.9.0

package/dist/search/global-search.js

@@ -0,0 +1,277 @@
+"use client";
+import { Fragment, jsx, jsxs } from "react/jsx-runtime";
+import { useCallback, useEffect, useLayoutEffect, useMemo, useRef, useState } from "react";
+import { useHref, useInRouterContext, useNavigate } from "react-router";
+import { AlertCircle, Loader2, Search } from "lucide-react";
+import { Tooltip } from "../components/tooltip.js";
+import { TOPBAR_TRIGGER_CLASS } from "../shell/topbar-controls.js";
+import { cn } from "../lib/cn.js";
+import { useKitLabels } from "../i18n/kit-labels.js";
+import { CommandPalette, DEFAULT_COMMAND_PALETTE_LABELS, useCommandKey } from "./command-palette.js";
+import { createSearchIndex } from "./search-index.js";
+const DEFAULT_GLOBAL_SEARCH_LABELS = {
+  trigger: "Search",
+  placeholder: "Search or jump to\u2026",
+  shortcut: (keys) => `Search (${keys})`,
+  suggestions: "Try",
+  results: "Results"
+};
+function isApplePlatform() {
+  if (typeof navigator === "undefined") return false;
+  const nav = navigator;
+  return /mac|iphone|ipad|ipod/i.test(nav.userAgentData?.platform || nav.platform || nav.userAgent);
+}
+const pageLoad = (href) => window.location.assign(href);
+const identity = (href) => href;
+function signature(entries) {
+  return entries.map(
+    (e) => [e.id, e.title, (e.keywords ?? []).join(""), e.description, e.group, e.hint, e.href, e.weight, e.redact].join(
+      "
"
+    )
+  ).join("");
+}
+function refocusField() {
+  requestAnimationFrame(() => {
+    const fields = document.querySelectorAll('[role="dialog"][aria-modal="true"] input[role="combobox"]');
+    fields[fields.length - 1]?.focus();
+  });
+}
+function GlobalSearch(props) {
+  const inRouter = useInRouterContext();
+  if (inRouter && (!props.navigate || !props.hrefFor)) return /* @__PURE__ */ jsx(RoutedGlobalSearch, { ...props });
+  return /* @__PURE__ */ jsx(GlobalSearchImpl, { ...props, navigate: props.navigate ?? pageLoad, hrefFor: props.hrefFor ?? identity });
+}
+function RoutedGlobalSearch(props) {
+  const routerNavigate = useNavigate();
+  const base = useHref("/").replace(/\/$/, "");
+  const navigate = useCallback((href) => void routerNavigate(href), [routerNavigate]);
+  const hrefFor = useCallback((href) => href.startsWith("/") ? base + href : href, [base]);
+  return /* @__PURE__ */ jsx(GlobalSearchImpl, { ...props, navigate: props.navigate ?? navigate, hrefFor: props.hrefFor ?? hrefFor });
+}
+function GlobalSearchImpl({
+  entries,
+  sources,
+  suggestions,
+  groupOrder,
+  indexOptions,
+  navigate,
+  hrefFor,
+  shortcut = true,
+  open: openProp,
+  onOpenChange,
+  query: queryProp,
+  onQueryChange,
+  searchOn,
+  redactLabels = false,
+  fullScreenOnPhone,
+  trigger = "button",
+  hideTriggerOnPhone = false,
+  triggerClassName,
+  labels,
+  paletteLabels
+}) {
+  const l = useKitLabels("globalSearch", DEFAULT_GLOBAL_SEARCH_LABELS, labels);
+  const pl = useKitLabels("commandPalette", DEFAULT_COMMAND_PALETTE_LABELS, paletteLabels);
+  const [ownOpen, setOwnOpen] = useState(false);
+  const open = openProp ?? ownOpen;
+  const [ownQuery, setOwnQuery] = useState("");
+  const queryControlled = queryProp !== void 0;
+  const query = queryControlled ? queryProp : ownQuery;
+  const q = query.trim();
+  const setOpen = useCallback(
+    (next) => {
+      if (openProp === void 0) setOwnOpen(next);
+      onOpenChange?.(next);
+    },
+    [openProp, onOpenChange]
+  );
+  const setQuery = useCallback(
+    (next) => {
+      if (!queryControlled) setOwnQuery(next);
+      onQueryChange?.(next);
+    },
+    [queryControlled, onQueryChange]
+  );
+  const [wasOpen, setWasOpen] = useState(open);
+  if (wasOpen !== open) {
+    setWasOpen(open);
+    if (open && !queryControlled) setOwnQuery("");
+  }
+  const openSearch = useCallback(() => setOpen(true), [setOpen]);
+  const noop = useCallback(() => {
+  }, []);
+  useCommandKey(shortcut ? openSearch : noop);
+  const list = entries ?? EMPTY;
+  const sig = signature(list);
+  const optionsKey = JSON.stringify(indexOptions ?? {});
+  const groupLimit = indexOptions?.groupLimit ?? 8;
+  const index = useMemo(() => createSearchIndex(list, indexOptions), [sig, optionsKey]);
+  const byId = useMemo(() => new Map(list.map((e) => [e.id, e])), [sig]);
+  const sourceKey = (sources ?? []).map((s) => [s.id, s.group, s.minChars ?? 2, s.debounceMs ?? 200, s.limit, s.redact].join("
")).join("");
+  const sourceList = useMemo(() => sources ?? [], [sourceKey]);
+  const suggestionsKey = (suggestions ?? []).map((s) => typeof s === "string" ? `i:${s}` : "query" in s ? `q:${s.query}` : `e:${signature([s])}`).join("");
+  const suggestionList = useMemo(() => suggestions ?? [], [suggestionsKey]);
+  const groupOrderKey = (groupOrder ?? []).join("");
+  const order = useMemo(() => groupOrder ?? [], [groupOrderKey]);
+  const live = useRef({ entries: list, sources: sources ?? [], suggestions: suggestions ?? [], navigate });
+  useLayoutEffect(() => {
+    live.current = { entries: list, sources: sources ?? [], suggestions: suggestions ?? [], navigate };
+  });
+  const [sourceResults, setSourceResults] = useState({});
+  useEffect(() => {
+    const controllers = [];
+    const timers = [];
+    const asked = open ? live.current.sources.filter((s) => q.length >= (s.minChars ?? 2)) : [];
+    for (const source of asked) {
+      const id = source.id;
+      const controller = new AbortController();
+      controllers.push(controller);
+      timers.push(
+        setTimeout(async () => {
+          const settle = (result) => {
+            if (!controller.signal.aborted) setSourceResults((prev) => ({ ...prev, [id]: result }));
+          };
+          try {
+            const found = await source.search(q, controller.signal);
+            settle({ query: q, status: "done", entries: found });
+          } catch (error) {
+            if (controller.signal.aborted) return;
+            source.onError?.(error);
+            settle({ query: q, status: "error", entries: [] });
+          }
+        }, source.debounceMs ?? 200)
+      );
+    }
+    return () => {
+      timers.forEach(clearTimeout);
+      controllers.forEach((c) => c.abort());
+    };
+  }, [open, q, sourceKey]);
+  const toItem = useCallback(
+    (prefix, entry, group, redact = redactLabels) => ({
+      id: `${prefix}${entry.id}`,
+      label: entry.title,
+      hint: entry.hint,
+      group,
+      icon: entry.icon,
+      redact: entry.redact ?? redact,
+      href: entry.href !== void 0 ? hrefFor(entry.href) : void 0,
+      onSelect: () => {
+        const current = live.current.entries.find((e) => e.id === entry.id) ?? entry;
+        if (current.onSelect) current.onSelect();
+        else if (current.href !== void 0) live.current.navigate(current.href);
+      }
+    }),
+    [hrefFor, redactLabels]
+  );
+  const items = useMemo(() => {
+    if (!q) {
+      const out2 = [];
+      suggestionList.forEach((s, i) => {
+        if (typeof s === "string") {
+          const entry = byId.get(s);
+          if (entry) out2.push(toItem("try:", entry, l.suggestions));
+        } else if ("query" in s) {
+          out2.push({
+            id: `try:q${i}`,
+            label: s.query,
+            group: l.suggestions,
+            icon: /* @__PURE__ */ jsx(Search, { className: "size-4" }),
+            onSelect: () => {
+              setOpen(true);
+              setQuery(s.query);
+              refocusField();
+            }
+          });
+        } else out2.push(toItem("try:", s, l.suggestions));
+      });
+      return out2;
+    }
+    const out = index.search(q).map((hit) => toItem("s:", hit.entry, hit.entry.group ?? l.results));
+    for (const source of sourceList) {
+      if (q.length < (source.minChars ?? 2)) continue;
+      const result = sourceResults[source.id];
+      const status = (label, icon) => ({
+        id: `src:${source.id}:status`,
+        label,
+        group: source.group,
+        icon,
+        kind: "status",
+        onSelect: noop
+      });
+      if (!result || result.query !== q) {
+        out.push(status(pl.loading, /* @__PURE__ */ jsx(Loader2, { className: "size-3.5 animate-spin" })));
+      } else if (result.status === "error") {
+        out.push(status(pl.error ?? DEFAULT_COMMAND_PALETTE_LABELS.error, /* @__PURE__ */ jsx(AlertCircle, { className: "size-3.5" })));
+      } else {
+        for (const entry of result.entries.slice(0, source.limit ?? groupLimit)) {
+          out.push(toItem(`src:${source.id}:`, entry, source.group, source.redact ?? redactLabels));
+        }
+      }
+    }
+    if (!order.length) return out;
+    const rank = (group) => {
+      const i = order.indexOf(group);
+      return i === -1 ? order.length : i;
+    };
+    return out.map((item, i) => ({ item, i })).sort((a, b) => rank(a.item.group) - rank(b.item.group) || a.i - b.i).map(({ item }) => item);
+  }, [q, suggestionList, byId, index, sourceList, sourceResults, order, groupLimit, toItem, l.suggestions, l.results, pl.loading, pl.error, setOpen, setQuery, noop, redactLabels]);
+  const provider = useCallback(() => items, [items]);
+  const resolvedPaletteLabels = useMemo(
+    () => ({ dialog: l.trigger, placeholder: l.placeholder, ...paletteLabels }),
+    [l.trigger, l.placeholder, paletteLabels]
+  );
+  const apple = useMemo(() => isApplePlatform(), []);
+  const keys = apple ? "\u2318K" : "Ctrl K";
+  const triggerProps = {
+    open: openSearch,
+    label: l.trigger,
+    tooltip: l.shortcut(keys),
+    keys,
+    ariaKeyShortcuts: "Meta+K Control+K"
+  };
+  return /* @__PURE__ */ jsxs(Fragment, { children: [
+    typeof trigger === "function" ? trigger(triggerProps) : trigger === "button" && /* @__PURE__ */ jsx(
+      Tooltip,
+      {
+        label: triggerProps.tooltip,
+        side: "bottom",
+        portal: true,
+        className: hideTriggerOnPhone ? "hidden sm:block" : void 0,
+        children: /* @__PURE__ */ jsx(
+          "button",
+          {
+            type: "button",
+            onClick: openSearch,
+            "aria-label": l.trigger,
+            "aria-keyshortcuts": triggerProps.ariaKeyShortcuts,
+            "aria-haspopup": "dialog",
+            className: cn(TOPBAR_TRIGGER_CLASS, triggerClassName),
+            children: /* @__PURE__ */ jsx(Search, { className: "size-4" })
+          }
+        )
+      }
+    ),
+    /* @__PURE__ */ jsx(
+      CommandPalette,
+      {
+        open,
+        onClose: () => setOpen(false),
+        search: provider,
+        revision: items,
+        query,
+        onQueryChange: setQuery,
+        searchOn,
+        redactLabels,
+        fullScreenOnPhone,
+        labels: resolvedPaletteLabels
+      }
+    )
+  ] });
+}
+const EMPTY = [];
+export {
+  DEFAULT_GLOBAL_SEARCH_LABELS,
+  GlobalSearch
+};
+//# sourceMappingURL=global-search.js.map

package/dist/search/global-search.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/search/global-search.tsx"],"sourcesContent":["import { useCallback, useEffect, useLayoutEffect, useMemo, useRef, useState } from \"react\";\nimport type { ReactNode } from \"react\";\nimport { useHref, useInRouterContext, useNavigate } from \"react-router\";\nimport { AlertCircle, Loader2, Search } from \"lucide-react\";\nimport { Tooltip } from \"../components/tooltip\";\nimport { TOPBAR_TRIGGER_CLASS } from \"../shell/topbar-controls\";\nimport { cn } from \"../lib/cn\";\nimport { useKitLabels } from \"../i18n/kit-labels\";\nimport { CommandPalette, DEFAULT_COMMAND_PALETTE_LABELS, useCommandKey } from \"./command-palette\";\nimport type { CommandItem, CommandPaletteLabels } from \"./command-palette\";\nimport { createSearchIndex } from \"./search-index\";\nimport type { SearchEntry, SearchIndexOptions } from \"./search-index\";\n\nexport interface GlobalSearchLabels {\n  /** The trigger's accessible name, and the dialog's. */\n  trigger: string;\n  /** The field's placeholder — says WHAT can be found, which \"Search…\" does not. */\n  placeholder: string;\n  /** The trigger's tooltip, given the shortcut as the platform writes it (\"⌘K\",\n   *  \"Ctrl K\"). A function so a language can put the keys where its grammar wants. */\n  shortcut: (keys: string) => string;\n  /** Heading of the suggestions shown for an empty query. */\n  suggestions: string;\n  /** Heading for entries that name no `group`. */\n  results: string;\n}\n\nexport const DEFAULT_GLOBAL_SEARCH_LABELS: GlobalSearchLabels = {\n  trigger: \"Search\",\n  placeholder: \"Search or jump to…\",\n  shortcut: (keys) => `Search (${keys})`,\n  suggestions: \"Try\",\n  results: \"Results\",\n};\n\n/**\n * A place results come from that is not the static index — a server search, a\n * local-first store too large to hand over whole. Each source is its own group, with its\n * own debounce, its own \"Searching…\" line and its own failure: the static groups never\n * wait for it, and one source failing never takes another's results with it.\n */\nexport interface GlobalSearchSource {\n  /** Stable key — the effect that runs the source is keyed by it, not by identity. */\n  id: string;\n  /** The group its results are shown under (an entry's own `group` is ignored). */\n  group: string;\n  /** Called with the trimmed query. Its results are shown AS GIVEN — the source ranked\n   *  them — and never re-filtered by the index's matcher. `signal` aborts when the query\n   *  moves on or the palette closes; a stale answer is dropped either way. */\n  search: (query: string, signal: AbortSignal) => Promise<readonly SearchEntry[]> | readonly SearchEntry[];\n  /** Shortest query it is asked for. Default 2 — one letter matches half a database. */\n  minChars?: number;\n  /** Quiet period after the last keystroke before it is asked. Default 200ms. */\n  debounceMs?: number;\n  /** Rows kept. Default: `indexOptions.groupLimit` (8). */\n  limit?: number;\n  /** Mask every row of this source for session replay, hints (amounts) included. An\n   *  entry's own `redact` still wins. */\n  redact?: boolean;\n  /** Told when `search` throws or rejects (not when it is aborted). The group then\n   *  shows the palette's `error` line instead of rows. */\n  onError?: (error: unknown) => void;\n}\n\n/** What a custom trigger gets: everything the default button uses. */\nexport interface GlobalSearchTriggerProps {\n  open: () => void;\n  /** Resolved `trigger` label — the accessible name. */\n  label: string;\n  /** Resolved `shortcut(keys)` — the tooltip. */\n  tooltip: string;\n  /** \"⌘K\" on Apple platforms, \"Ctrl K\" elsewhere. */\n  keys: string;\n  /** For the trigger's `aria-keyshortcuts`. */\n  ariaKeyShortcuts: string;\n}\n\n/** A suggestion for the empty query: an entry, the `id` of one in `entries`, or a query\n *  to type into the field. */\nexport type GlobalSearchSuggestion = SearchEntry | string | { query: string };\n\nexport interface GlobalSearchProps {\n  /**\n   * The static index: pages, actions, settings rows — already filtered by the app (by\n   * role, by privacy mode). Matched and ranked by {@link createSearchIndex}.\n   *\n   * Changing it re-runs the open search by itself. Nothing has to be stable: the index is\n   * rebuilt only when the entries' TEXT changes (ids, titles, keywords, …), so a list\n   * rebuilt on every render — `data = []` while a query is pending, icons as fresh JSX —\n   * neither re-indexes nor loops, and the icons and handlers used are always the latest.\n   */\n  entries?: readonly SearchEntry[];\n  /** The async sources, each streamed into its own group. */\n  sources?: readonly GlobalSearchSource[];\n  /** What the empty query shows, under the `suggestions` heading. */\n  suggestions?: readonly GlobalSearchSuggestion[];\n  /** Groups listed here come first, in this order; the rest follow in ranking order. */\n  groupOrder?: readonly string[];\n  /** Ranking and capping — `groupLimit` (default 8) applies to every group. */\n  indexOptions?: SearchIndexOptions;\n  /**\n   * How an entry's `href` is followed on a plain click or ↵. Default: react-router's\n   * `navigate` when the search is rendered inside a router, else a full page load.\n   */\n  navigate?: (href: string) => void;\n  /**\n   * The browser URL of an `href`, for the row's real link (middle-/⌘-click opens a tab).\n   * Default inside a router: the router's own (`#/page` under a hash router, the\n   * basename prefixed under a browser router); outside one, the href itself.\n   */\n  hrefFor?: (href: string) => string;\n  /** Register ⌘K / Ctrl K. Default true; turn it off for a second, scoped search on a\n   *  page that already has the app-wide one. */\n  shortcut?: boolean;\n  /** Controlled open state — so a button anywhere can open it. */\n  open?: boolean;\n  onOpenChange?: (open: boolean) => void;\n  /** Controlled query, as on `CommandPalette` (keksdose binds it to the URL's `q`). */\n  query?: string;\n  onQueryChange?: (query: string) => void;\n  searchOn?: \"input\" | \"submit\";\n  /** Mask every row for session replay (see `CommandPalette`). A source's or an entry's\n   *  own `redact` wins. */\n  redactLabels?: boolean;\n  fullScreenOnPhone?: boolean;\n  /** `\"button\"` (default): the top-bar icon button. `\"none\"`: no trigger — the shortcut\n   *  or a controlled `open` opens it. A function renders a trigger of your own. */\n  trigger?: \"button\" | \"none\" | ((props: GlobalSearchTriggerProps) => ReactNode);\n  /** Hide the default trigger below `sm` (kastlan's phone top bar has no room). */\n  hideTriggerOnPhone?: boolean;\n  /** Class for the default trigger button, merged over `TOPBAR_TRIGGER_CLASS`. */\n  triggerClassName?: string;\n  labels?: Partial<GlobalSearchLabels>;\n  /** Passed through to the palette (`empty`, `loading`, `error`, `hint`, …). */\n  paletteLabels?: Partial<CommandPaletteLabels>;\n}\n\nfunction isApplePlatform(): boolean {\n  if (typeof navigator === \"undefined\") return false;\n  const nav = navigator as Navigator & { userAgentData?: { platform?: string } };\n  return /mac|iphone|ipad|ipod/i.test(nav.userAgentData?.platform || nav.platform || nav.userAgent);\n}\n\nconst pageLoad = (href: string) => window.location.assign(href);\nconst identity = (href: string) => href;\n\n/** The entries' text, which is all the index reads — see `entries`. */\nfunction signature(entries: readonly SearchEntry[]): string {\n  return entries\n    .map((e) =>\n      [e.id, e.title, (e.keywords ?? []).join(\"\\u0003\"), e.description, e.group, e.hint, e.href, e.weight, e.redact].join(\n        \"\\u0001\",\n      ),\n    )\n    .join(\"\\u0002\");\n}\n\n/** Focus the open palette's field again — after a suggestion typed itself into it, the\n *  row that was clicked (and held focus) is gone. */\nfunction refocusField() {\n  requestAnimationFrame(() => {\n    const fields = document.querySelectorAll<HTMLInputElement>('[role=\"dialog\"][aria-modal=\"true\"] input[role=\"combobox\"]');\n    fields[fields.length - 1]?.focus();\n  });\n}\n\ninterface SourceResult {\n  query: string;\n  status: \"loading\" | \"done\" | \"error\";\n  entries: readonly SearchEntry[];\n}\n\n/**\n * The app-wide ⌘K search, whole: the top-bar trigger, the shortcut, and a\n * {@link CommandPalette} fed from a ranked index ({@link createSearchIndex}) and any\n * number of async sources.\n *\n * Every consumer had built this out of `CommandPalette` by hand, and each copy had the\n * same holes — a substring match, no ranking, no typo tolerance, results in declaration\n * order, one monolithic provider in which the static groups waited on the slowest\n * request. This is that wrapper once:\n *\n *     <GlobalSearch\n *       entries={pages}              // { id, title, keywords, group, href, icon }\n *       sources={[{ id: \"tx\", group: \"Transactions\", search: (q, signal) => api.search(q, { signal }) }]}\n *       suggestions={[\"page-budget\", \"action-new-account\"]}\n *     />\n *\n * Inside a react-router tree it navigates with the router and builds its links with it;\n * outside one, pass `navigate` (or accept full page loads).\n */\nexport function GlobalSearch(props: GlobalSearchProps) {\n  // Two components rather than a conditional hook: `useNavigate` throws outside a\n  // router, and whether we are in one does not change over a component's life.\n  const inRouter = useInRouterContext();\n  if (inRouter && (!props.navigate || !props.hrefFor)) return <RoutedGlobalSearch {...props} />;\n  return <GlobalSearchImpl {...props} navigate={props.navigate ?? pageLoad} hrefFor={props.hrefFor ?? identity} />;\n}\n\nfunction RoutedGlobalSearch(props: GlobalSearchProps) {\n  const routerNavigate = useNavigate();\n  // The router's href for \"/\" is its base (\"#/\" under a hash router, \"/app/\" under a\n  // basename); every href is that base plus the path.\n  const base = useHref(\"/\").replace(/\\/$/, \"\");\n  const navigate = useCallback((href: string) => void routerNavigate(href), [routerNavigate]);\n  const hrefFor = useCallback((href: string) => (href.startsWith(\"/\") ? base + href : href), [base]);\n  return <GlobalSearchImpl {...props} navigate={props.navigate ?? navigate} hrefFor={props.hrefFor ?? hrefFor} />;\n}\n\nfunction GlobalSearchImpl({\n  entries,\n  sources,\n  suggestions,\n  groupOrder,\n  indexOptions,\n  navigate,\n  hrefFor,\n  shortcut = true,\n  open: openProp,\n  onOpenChange,\n  query: queryProp,\n  onQueryChange,\n  searchOn,\n  redactLabels = false,\n  fullScreenOnPhone,\n  trigger = \"button\",\n  hideTriggerOnPhone = false,\n  triggerClassName,\n  labels,\n  paletteLabels,\n}: GlobalSearchProps & { navigate: (href: string) => void; hrefFor: (href: string) => string }) {\n  const l = useKitLabels(\"globalSearch\", DEFAULT_GLOBAL_SEARCH_LABELS, labels);\n  const pl = useKitLabels(\"commandPalette\", DEFAULT_COMMAND_PALETTE_LABELS, paletteLabels);\n  const [ownOpen, setOwnOpen] = useState(false);\n  const open = openProp ?? ownOpen;\n  const [ownQuery, setOwnQuery] = useState(\"\");\n  const queryControlled = queryProp !== undefined;\n  const query = queryControlled ? queryProp : ownQuery;\n  const q = query.trim();\n\n  const setOpen = useCallback(\n    (next: boolean) => {\n      if (openProp === undefined) setOwnOpen(next);\n      onOpenChange?.(next);\n    },\n    [openProp, onOpenChange],\n  );\n  const setQuery = useCallback(\n    (next: string) => {\n      if (!queryControlled) setOwnQuery(next);\n      onQueryChange?.(next);\n    },\n    [queryControlled, onQueryChange],\n  );\n\n  // Each open starts blank — unless the owner controls the query (a URL `q`). Adjusted\n  // during render, React's pattern for state that follows a prop, so a controlled `open`\n  // gets the same reset as the trigger does.\n  const [wasOpen, setWasOpen] = useState(open);\n  if (wasOpen !== open) {\n    setWasOpen(open);\n    if (open && !queryControlled) setOwnQuery(\"\");\n  }\n\n  const openSearch = useCallback(() => setOpen(true), [setOpen]);\n  const noop = useCallback(() => {}, []);\n  useCommandKey(shortcut ? openSearch : noop);\n\n  /* ── the static index ─────────────────────────────────────────────────── */\n\n  // Everything below is keyed by CONTENT, never by the identity of what the app passed:\n  // inline arrays and `data = []` defaults are the norm, and an identity key would\n  // re-index and re-search on every render of the app. Handlers, which can close over\n  // anything, are read from refs at the moment a row is chosen — never stale.\n  const list = entries ?? EMPTY;\n  const sig = signature(list);\n  const optionsKey = JSON.stringify(indexOptions ?? {});\n  const groupLimit = indexOptions?.groupLimit ?? 8;\n  // `sig` and `optionsKey` stand for `list` and `indexOptions`: same text, same index.\n  /* eslint-disable react-hooks/exhaustive-deps */\n  const index = useMemo(() => createSearchIndex(list, indexOptions), [sig, optionsKey]);\n  const byId = useMemo(() => new Map(list.map((e) => [e.id, e])), [sig]);\n\n  const sourceKey = (sources ?? [])\n    .map((s) => [s.id, s.group, s.minChars ?? 2, s.debounceMs ?? 200, s.limit, s.redact].join(\"\\u0001\"))\n    .join(\"\\u0002\");\n  const sourceList = useMemo(() => sources ?? [], [sourceKey]);\n\n  const suggestionsKey = (suggestions ?? [])\n    .map((s) => (typeof s === \"string\" ? `i:${s}` : \"query\" in s ? `q:${s.query}` : `e:${signature([s])}`))\n    .join(\"\\u0002\");\n  const suggestionList = useMemo(() => suggestions ?? [], [suggestionsKey]);\n\n  const groupOrderKey = (groupOrder ?? []).join(\"\\u0002\");\n  const order = useMemo(() => groupOrder ?? [], [groupOrderKey]);\n  /* eslint-enable react-hooks/exhaustive-deps */\n\n  // The live objects, for the moment a row is chosen or a source is asked.\n  const live = useRef({ entries: list, sources: sources ?? [], suggestions: suggestions ?? [], navigate });\n  useLayoutEffect(() => {\n    live.current = { entries: list, sources: sources ?? [], suggestions: suggestions ?? [], navigate };\n  });\n\n  /* ── the async sources ────────────────────────────────────────────────── */\n\n  const [sourceResults, setSourceResults] = useState<Record<string, SourceResult>>({});\n  useEffect(() => {\n    const controllers: AbortController[] = [];\n    const timers: ReturnType<typeof setTimeout>[] = [];\n    const asked = open ? live.current.sources.filter((s) => q.length >= (s.minChars ?? 2)) : [];\n    for (const source of asked) {\n      const id = source.id;\n      const controller = new AbortController();\n      controllers.push(controller);\n      timers.push(\n        setTimeout(async () => {\n          const settle = (result: SourceResult) => {\n            if (!controller.signal.aborted) setSourceResults((prev) => ({ ...prev, [id]: result }));\n          };\n          try {\n            const found = await source.search(q, controller.signal);\n            settle({ query: q, status: \"done\", entries: found });\n          } catch (error) {\n            if (controller.signal.aborted) return;\n            source.onError?.(error);\n            settle({ query: q, status: \"error\", entries: [] });\n          }\n        }, source.debounceMs ?? 200),\n      );\n    }\n    return () => {\n      timers.forEach(clearTimeout);\n      controllers.forEach((c) => c.abort());\n    };\n  }, [open, q, sourceKey]);\n\n  /* ── rows ─────────────────────────────────────────────────────────────── */\n\n  const toItem = useCallback(\n    (prefix: string, entry: SearchEntry, group: string, redact = redactLabels): CommandItem => ({\n      id: `${prefix}${entry.id}`,\n      label: entry.title,\n      hint: entry.hint,\n      group,\n      icon: entry.icon,\n      redact: entry.redact ?? redact,\n      href: entry.href !== undefined ? hrefFor(entry.href) : undefined,\n      onSelect: () => {\n        // The entry as the app has it NOW — its handler may close over newer state\n        // than the one this row was built from.\n        const current = live.current.entries.find((e) => e.id === entry.id) ?? entry;\n        if (current.onSelect) current.onSelect();\n        else if (current.href !== undefined) live.current.navigate(current.href);\n      },\n    }),\n    [hrefFor, redactLabels],\n  );\n\n  // `toItem` only BUILDS `onSelect` closures here; `live` is read when a row is chosen,\n  // which the compiler lint cannot tell from a read during render.\n  /* eslint-disable react-hooks/refs */\n  const items = useMemo((): CommandItem[] => {\n    if (!q) {\n      const out: CommandItem[] = [];\n      suggestionList.forEach((s, i) => {\n        if (typeof s === \"string\") {\n          const entry = byId.get(s);\n          if (entry) out.push(toItem(\"try:\", entry, l.suggestions));\n        } else if (\"query\" in s) {\n          out.push({\n            id: `try:q${i}`,\n            label: s.query,\n            group: l.suggestions,\n            icon: <Search className=\"size-4\" />,\n            onSelect: () => {\n              // The palette closes before it runs a row; a query suggestion keeps it\n              // open and types itself in instead.\n              setOpen(true);\n              setQuery(s.query);\n              refocusField();\n            },\n          });\n        } else out.push(toItem(\"try:\", s, l.suggestions));\n      });\n      return out;\n    }\n\n    const out = index.search(q).map((hit) => toItem(\"s:\", hit.entry, hit.entry.group ?? l.results));\n    for (const source of sourceList) {\n      if (q.length < (source.minChars ?? 2)) continue;\n      const result = sourceResults[source.id];\n      const status = (label: string, icon: ReactNode): CommandItem => ({\n        id: `src:${source.id}:status`,\n        label,\n        group: source.group,\n        icon,\n        kind: \"status\",\n        onSelect: noop,\n      });\n      // Anything but an answer to THIS query is still loading — including the previous\n      // query's rows, which would otherwise sit under the new query as if they matched.\n      if (!result || result.query !== q) {\n        out.push(status(pl.loading, <Loader2 className=\"size-3.5 animate-spin\" />));\n      } else if (result.status === \"error\") {\n        out.push(status(pl.error ?? DEFAULT_COMMAND_PALETTE_LABELS.error!, <AlertCircle className=\"size-3.5\" />));\n      } else {\n        for (const entry of result.entries.slice(0, source.limit ?? groupLimit)) {\n          out.push(toItem(`src:${source.id}:`, entry, source.group, source.redact ?? redactLabels));\n        }\n      }\n    }\n\n    if (!order.length) return out;\n    const rank = (group: string) => {\n      const i = order.indexOf(group);\n      return i === -1 ? order.length : i;\n    };\n    // Stable: within a rank, groups keep the order their best hit gave them.\n    return out\n      .map((item, i) => ({ item, i }))\n      .sort((a, b) => rank(a.item.group) - rank(b.item.group) || a.i - b.i)\n      .map(({ item }) => item);\n  }, [q, suggestionList, byId, index, sourceList, sourceResults, order, groupLimit, toItem, l.suggestions, l.results, pl.loading, pl.error, setOpen, setQuery, noop, redactLabels]);\n  /* eslint-enable react-hooks/refs */\n\n  // The palette re-runs its provider on a `revision` change, never on the provider's\n  // identity — and `items` is everything the provider answers with.\n  const provider = useCallback(() => items, [items]);\n\n  const resolvedPaletteLabels = useMemo(\n    () => ({ dialog: l.trigger, placeholder: l.placeholder, ...paletteLabels }),\n    [l.trigger, l.placeholder, paletteLabels],\n  );\n\n  const apple = useMemo(() => isApplePlatform(), []);\n  const keys = apple ? \"⌘K\" : \"Ctrl K\";\n  const triggerProps: GlobalSearchTriggerProps = {\n    open: openSearch,\n    label: l.trigger,\n    tooltip: l.shortcut(keys),\n    keys,\n    ariaKeyShortcuts: \"Meta+K Control+K\",\n  };\n\n  return (\n    <>\n      {typeof trigger === \"function\"\n        ? trigger(triggerProps)\n        : trigger === \"button\" && (\n            <Tooltip\n              label={triggerProps.tooltip}\n              side=\"bottom\"\n              portal\n              className={hideTriggerOnPhone ? \"hidden sm:block\" : undefined}\n            >\n              <button\n                type=\"button\"\n                onClick={openSearch}\n                aria-label={l.trigger}\n                aria-keyshortcuts={triggerProps.ariaKeyShortcuts}\n                aria-haspopup=\"dialog\"\n                className={cn(TOPBAR_TRIGGER_CLASS, triggerClassName)}\n              >\n                <Search className=\"size-4\" />\n              </button>\n            </Tooltip>\n          )}\n      <CommandPalette\n        open={open}\n        onClose={() => setOpen(false)}\n        search={provider}\n        revision={items}\n        query={query}\n        onQueryChange={setQuery}\n        searchOn={searchOn}\n        redactLabels={redactLabels}\n        fullScreenOnPhone={fullScreenOnPhone}\n        labels={resolvedPaletteLabels}\n      />\n    </>\n  );\n}\n\nconst EMPTY: readonly SearchEntry[] = [];\n"],"mappings":";AAmM8D,SA0P1D,UA1P0D,KA0P1D,YA1P0D;AAnM9D,SAAS,aAAa,WAAW,iBAAiB,SAAS,QAAQ,gBAAgB;AAEnF,SAAS,SAAS,oBAAoB,mBAAmB;AACzD,SAAS,aAAa,SAAS,cAAc;AAC7C,SAAS,eAAe;AACxB,SAAS,4BAA4B;AACrC,SAAS,UAAU;AACnB,SAAS,oBAAoB;AAC7B,SAAS,gBAAgB,gCAAgC,qBAAqB;AAE9E,SAAS,yBAAyB;AAiB3B,MAAM,+BAAmD;AAAA,EAC9D,SAAS;AAAA,EACT,aAAa;AAAA,EACb,UAAU,CAAC,SAAS,WAAW,IAAI;AAAA,EACnC,aAAa;AAAA,EACb,SAAS;AACX;AAwGA,SAAS,kBAA2B;AAClC,MAAI,OAAO,cAAc,YAAa,QAAO;AAC7C,QAAM,MAAM;AACZ,SAAO,wBAAwB,KAAK,IAAI,eAAe,YAAY,IAAI,YAAY,IAAI,SAAS;AAClG;AAEA,MAAM,WAAW,CAAC,SAAiB,OAAO,SAAS,OAAO,IAAI;AAC9D,MAAM,WAAW,CAAC,SAAiB;AAGnC,SAAS,UAAU,SAAyC;AAC1D,SAAO,QACJ;AAAA,IAAI,CAAC,MACJ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,GAAG,KAAK,GAAQ,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE;AAAA,MAC7G;AAAA,IACF;AAAA,EACF,EACC,KAAK,GAAQ;AAClB;AAIA,SAAS,eAAe;AACtB,wBAAsB,MAAM;AAC1B,UAAM,SAAS,SAAS,iBAAmC,2DAA2D;AACtH,WAAO,OAAO,SAAS,CAAC,GAAG,MAAM;AAAA,EACnC,CAAC;AACH;AA2BO,SAAS,aAAa,OAA0B;AAGrD,QAAM,WAAW,mBAAmB;AACpC,MAAI,aAAa,CAAC,MAAM,YAAY,CAAC,MAAM,SAAU,QAAO,oBAAC,sBAAoB,GAAG,OAAO;AAC3F,SAAO,oBAAC,oBAAkB,GAAG,OAAO,UAAU,MAAM,YAAY,UAAU,SAAS,MAAM,WAAW,UAAU;AAChH;AAEA,SAAS,mBAAmB,OAA0B;AACpD,QAAM,iBAAiB,YAAY;AAGnC,QAAM,OAAO,QAAQ,GAAG,EAAE,QAAQ,OAAO,EAAE;AAC3C,QAAM,WAAW,YAAY,CAAC,SAAiB,KAAK,eAAe,IAAI,GAAG,CAAC,cAAc,CAAC;AAC1F,QAAM,UAAU,YAAY,CAAC,SAAkB,KAAK,WAAW,GAAG,IAAI,OAAO,OAAO,MAAO,CAAC,IAAI,CAAC;AACjG,SAAO,oBAAC,oBAAkB,GAAG,OAAO,UAAU,MAAM,YAAY,UAAU,SAAS,MAAM,WAAW,SAAS;AAC/G;AAEA,SAAS,iBAAiB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW;AAAA,EACX,MAAM;AAAA,EACN;AAAA,EACA,OAAO;AAAA,EACP;AAAA,EACA;AAAA,EACA,eAAe;AAAA,EACf;AAAA,EACA,UAAU;AAAA,EACV,qBAAqB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AACF,GAAgG;AAC9F,QAAM,IAAI,aAAa,gBAAgB,8BAA8B,MAAM;AAC3E,QAAM,KAAK,aAAa,kBAAkB,gCAAgC,aAAa;AACvF,QAAM,CAAC,SAAS,UAAU,IAAI,SAAS,KAAK;AAC5C,QAAM,OAAO,YAAY;AACzB,QAAM,CAAC,UAAU,WAAW,IAAI,SAAS,EAAE;AAC3C,QAAM,kBAAkB,cAAc;AACtC,QAAM,QAAQ,kBAAkB,YAAY;AAC5C,QAAM,IAAI,MAAM,KAAK;AAErB,QAAM,UAAU;AAAA,IACd,CAAC,SAAkB;AACjB,UAAI,aAAa,OAAW,YAAW,IAAI;AAC3C,qBAAe,IAAI;AAAA,IACrB;AAAA,IACA,CAAC,UAAU,YAAY;AAAA,EACzB;AACA,QAAM,WAAW;AAAA,IACf,CAAC,SAAiB;AAChB,UAAI,CAAC,gBAAiB,aAAY,IAAI;AACtC,sBAAgB,IAAI;AAAA,IACtB;AAAA,IACA,CAAC,iBAAiB,aAAa;AAAA,EACjC;AAKA,QAAM,CAAC,SAAS,UAAU,IAAI,SAAS,IAAI;AAC3C,MAAI,YAAY,MAAM;AACpB,eAAW,IAAI;AACf,QAAI,QAAQ,CAAC,gBAAiB,aAAY,EAAE;AAAA,EAC9C;AAEA,QAAM,aAAa,YAAY,MAAM,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC;AAC7D,QAAM,OAAO,YAAY,MAAM;AAAA,EAAC,GAAG,CAAC,CAAC;AACrC,gBAAc,WAAW,aAAa,IAAI;AAQ1C,QAAM,OAAO,WAAW;AACxB,QAAM,MAAM,UAAU,IAAI;AAC1B,QAAM,aAAa,KAAK,UAAU,gBAAgB,CAAC,CAAC;AACpD,QAAM,aAAa,cAAc,cAAc;AAG/C,QAAM,QAAQ,QAAQ,MAAM,kBAAkB,MAAM,YAAY,GAAG,CAAC,KAAK,UAAU,CAAC;AACpF,QAAM,OAAO,QAAQ,MAAM,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;AAErE,QAAM,aAAa,WAAW,CAAC,GAC5B,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,GAAG,EAAE,cAAc,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,GAAQ,CAAC,EAClG,KAAK,GAAQ;AAChB,QAAM,aAAa,QAAQ,MAAM,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;AAE3D,QAAM,kBAAkB,eAAe,CAAC,GACrC,IAAI,CAAC,MAAO,OAAO,MAAM,WAAW,KAAK,CAAC,KAAK,WAAW,IAAI,KAAK,EAAE,KAAK,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,EAAG,EACrG,KAAK,GAAQ;AAChB,QAAM,iBAAiB,QAAQ,MAAM,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC;AAExE,QAAM,iBAAiB,cAAc,CAAC,GAAG,KAAK,GAAQ;AACtD,QAAM,QAAQ,QAAQ,MAAM,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC;AAI7D,QAAM,OAAO,OAAO,EAAE,SAAS,MAAM,SAAS,WAAW,CAAC,GAAG,aAAa,eAAe,CAAC,GAAG,SAAS,CAAC;AACvG,kBAAgB,MAAM;AACpB,SAAK,UAAU,EAAE,SAAS,MAAM,SAAS,WAAW,CAAC,GAAG,aAAa,eAAe,CAAC,GAAG,SAAS;AAAA,EACnG,CAAC;AAID,QAAM,CAAC,eAAe,gBAAgB,IAAI,SAAuC,CAAC,CAAC;AACnF,YAAU,MAAM;AACd,UAAM,cAAiC,CAAC;AACxC,UAAM,SAA0C,CAAC;AACjD,UAAM,QAAQ,OAAO,KAAK,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,IAAI,CAAC;AAC1F,eAAW,UAAU,OAAO;AAC1B,YAAM,KAAK,OAAO;AAClB,YAAM,aAAa,IAAI,gBAAgB;AACvC,kBAAY,KAAK,UAAU;AAC3B,aAAO;AAAA,QACL,WAAW,YAAY;AACrB,gBAAM,SAAS,CAAC,WAAyB;AACvC,gBAAI,CAAC,WAAW,OAAO,QAAS,kBAAiB,CAAC,UAAU,EAAE,GAAG,MAAM,CAAC,EAAE,GAAG,OAAO,EAAE;AAAA,UACxF;AACA,cAAI;AACF,kBAAM,QAAQ,MAAM,OAAO,OAAO,GAAG,WAAW,MAAM;AACtD,mBAAO,EAAE,OAAO,GAAG,QAAQ,QAAQ,SAAS,MAAM,CAAC;AAAA,UACrD,SAAS,OAAO;AACd,gBAAI,WAAW,OAAO,QAAS;AAC/B,mBAAO,UAAU,KAAK;AACtB,mBAAO,EAAE,OAAO,GAAG,QAAQ,SAAS,SAAS,CAAC,EAAE,CAAC;AAAA,UACnD;AAAA,QACF,GAAG,OAAO,cAAc,GAAG;AAAA,MAC7B;AAAA,IACF;AACA,WAAO,MAAM;AACX,aAAO,QAAQ,YAAY;AAC3B,kBAAY,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;AAAA,IACtC;AAAA,EACF,GAAG,CAAC,MAAM,GAAG,SAAS,CAAC;AAIvB,QAAM,SAAS;AAAA,IACb,CAAC,QAAgB,OAAoB,OAAe,SAAS,kBAA+B;AAAA,MAC1F,IAAI,GAAG,MAAM,GAAG,MAAM,EAAE;AAAA,MACxB,OAAO,MAAM;AAAA,MACb,MAAM,MAAM;AAAA,MACZ;AAAA,MACA,MAAM,MAAM;AAAA,MACZ,QAAQ,MAAM,UAAU;AAAA,MACxB,MAAM,MAAM,SAAS,SAAY,QAAQ,MAAM,IAAI,IAAI;AAAA,MACvD,UAAU,MAAM;AAGd,cAAM,UAAU,KAAK,QAAQ,QAAQ,KAAK,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,KAAK;AACvE,YAAI,QAAQ,SAAU,SAAQ,SAAS;AAAA,iBAC9B,QAAQ,SAAS,OAAW,MAAK,QAAQ,SAAS,QAAQ,IAAI;AAAA,MACzE;AAAA,IACF;AAAA,IACA,CAAC,SAAS,YAAY;AAAA,EACxB;AAKA,QAAM,QAAQ,QAAQ,MAAqB;AACzC,QAAI,CAAC,GAAG;AACN,YAAMA,OAAqB,CAAC;AAC5B,qBAAe,QAAQ,CAAC,GAAG,MAAM;AAC/B,YAAI,OAAO,MAAM,UAAU;AACzB,gBAAM,QAAQ,KAAK,IAAI,CAAC;AACxB,cAAI,MAAO,CAAAA,KAAI,KAAK,OAAO,QAAQ,OAAO,EAAE,WAAW,CAAC;AAAA,QAC1D,WAAW,WAAW,GAAG;AACvB,UAAAA,KAAI,KAAK;AAAA,YACP,IAAI,QAAQ,CAAC;AAAA,YACb,OAAO,EAAE;AAAA,YACT,OAAO,EAAE;AAAA,YACT,MAAM,oBAAC,UAAO,WAAU,UAAS;AAAA,YACjC,UAAU,MAAM;AAGd,sBAAQ,IAAI;AACZ,uBAAS,EAAE,KAAK;AAChB,2BAAa;AAAA,YACf;AAAA,UACF,CAAC;AAAA,QACH,MAAO,CAAAA,KAAI,KAAK,OAAO,QAAQ,GAAG,EAAE,WAAW,CAAC;AAAA,MAClD,CAAC;AACD,aAAOA;AAAA,IACT;AAEA,UAAM,MAAM,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,QAAQ,OAAO,MAAM,IAAI,OAAO,IAAI,MAAM,SAAS,EAAE,OAAO,CAAC;AAC9F,eAAW,UAAU,YAAY;AAC/B,UAAI,EAAE,UAAU,OAAO,YAAY,GAAI;AACvC,YAAM,SAAS,cAAc,OAAO,EAAE;AACtC,YAAM,SAAS,CAAC,OAAe,UAAkC;AAAA,QAC/D,IAAI,OAAO,OAAO,EAAE;AAAA,QACpB;AAAA,QACA,OAAO,OAAO;AAAA,QACd;AAAA,QACA,MAAM;AAAA,QACN,UAAU;AAAA,MACZ;AAGA,UAAI,CAAC,UAAU,OAAO,UAAU,GAAG;AACjC,YAAI,KAAK,OAAO,GAAG,SAAS,oBAAC,WAAQ,WAAU,yBAAwB,CAAE,CAAC;AAAA,MAC5E,WAAW,OAAO,WAAW,SAAS;AACpC,YAAI,KAAK,OAAO,GAAG,SAAS,+BAA+B,OAAQ,oBAAC,eAAY,WAAU,YAAW,CAAE,CAAC;AAAA,MAC1G,OAAO;AACL,mBAAW,SAAS,OAAO,QAAQ,MAAM,GAAG,OAAO,SAAS,UAAU,GAAG;AACvE,cAAI,KAAK,OAAO,OAAO,OAAO,EAAE,KAAK,OAAO,OAAO,OAAO,OAAO,UAAU,YAAY,CAAC;AAAA,QAC1F;AAAA,MACF;AAAA,IACF;AAEA,QAAI,CAAC,MAAM,OAAQ,QAAO;AAC1B,UAAM,OAAO,CAAC,UAAkB;AAC9B,YAAM,IAAI,MAAM,QAAQ,KAAK;AAC7B,aAAO,MAAM,KAAK,MAAM,SAAS;AAAA,IACnC;AAEA,WAAO,IACJ,IAAI,CAAC,MAAM,OAAO,EAAE,MAAM,EAAE,EAAE,EAC9B,KAAK,CAAC,GAAG,MAAM,KAAK,EAAE,KAAK,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,KAAK,EAAE,IAAI,EAAE,CAAC,EACnE,IAAI,CAAC,EAAE,KAAK,MAAM,IAAI;AAAA,EAC3B,GAAG,CAAC,GAAG,gBAAgB,MAAM,OAAO,YAAY,eAAe,OAAO,YAAY,QAAQ,EAAE,aAAa,EAAE,SAAS,GAAG,SAAS,GAAG,OAAO,SAAS,UAAU,MAAM,YAAY,CAAC;AAKhL,QAAM,WAAW,YAAY,MAAM,OAAO,CAAC,KAAK,CAAC;AAEjD,QAAM,wBAAwB;AAAA,IAC5B,OAAO,EAAE,QAAQ,EAAE,SAAS,aAAa,EAAE,aAAa,GAAG,cAAc;AAAA,IACzE,CAAC,EAAE,SAAS,EAAE,aAAa,aAAa;AAAA,EAC1C;AAEA,QAAM,QAAQ,QAAQ,MAAM,gBAAgB,GAAG,CAAC,CAAC;AACjD,QAAM,OAAO,QAAQ,YAAO;AAC5B,QAAM,eAAyC;AAAA,IAC7C,MAAM;AAAA,IACN,OAAO,EAAE;AAAA,IACT,SAAS,EAAE,SAAS,IAAI;AAAA,IACxB;AAAA,IACA,kBAAkB;AAAA,EACpB;AAEA,SACE,iCACG;AAAA,WAAO,YAAY,aAChB,QAAQ,YAAY,IACpB,YAAY,YACV;AAAA,MAAC;AAAA;AAAA,QACC,OAAO,aAAa;AAAA,QACpB,MAAK;AAAA,QACL,QAAM;AAAA,QACN,WAAW,qBAAqB,oBAAoB;AAAA,QAEpD;AAAA,UAAC;AAAA;AAAA,YACC,MAAK;AAAA,YACL,SAAS;AAAA,YACT,cAAY,EAAE;AAAA,YACd,qBAAmB,aAAa;AAAA,YAChC,iBAAc;AAAA,YACd,WAAW,GAAG,sBAAsB,gBAAgB;AAAA,YAEpD,8BAAC,UAAO,WAAU,UAAS;AAAA;AAAA,QAC7B;AAAA;AAAA,IACF;AAAA,IAEN;AAAA,MAAC;AAAA;AAAA,QACC;AAAA,QACA,SAAS,MAAM,QAAQ,KAAK;AAAA,QAC5B,QAAQ;AAAA,QACR,UAAU;AAAA,QACV;AAAA,QACA,eAAe;AAAA,QACf;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ;AAAA;AAAA,IACV;AAAA,KACF;AAEJ;AAEA,MAAM,QAAgC,CAAC;","names":["out"]}

package/dist/search/search-index.d.ts

@@ -0,0 +1,105 @@
+import { ReactNode } from 'react';
+
+/**
+ * The matcher behind {@link GlobalSearch} — pure, React-free, testable on its own.
+ *
+ * WHY IT EXISTS. `CommandPalette` is deliberately domain-free: it shows whatever a
+ * `search(query)` provider returns. So every app wrote that provider, and every app wrote
+ * the same one — `label.toLowerCase().includes(q)` over its pages and actions (kastlan's
+ * command palette, keksdose's global search) plus a second copy with keywords for the
+ * settings catalogue (keksdose's `matchSettingsEntries`). A substring test answers "does
+ * this string contain that one", which is not what a search box is asked:
+ *
+ *  - "range date" finds nothing, because the words are in the other order;
+ *  - "Uberweisung" misses "Überweisung", and "Tooltp" misses "Tooltip";
+ *  - "del" matches "model" as happily as "delete", and every hit ranks the same, so the
+ *    exact page name can sit under six unrelated rows.
+ *
+ * What it does instead, per entry:
+ *
+ *  - NORMALISES both sides: lower case, accents stripped (NFD minus combining marks),
+ *    `ß` → `ss`, punctuation as a word break, and camelCase split so `DateRangePicker`
+ *    is also the words date, range, picker.
+ *  - Requires EVERY query word to match SOMEWHERE in the entry — title, keywords or
+ *    description, in any order.
+ *  - A word matches a word of the entry exactly, as its prefix, inside it (four letters or
+ *    more, for compounds: "bereich" in "Datumsbereich"), or — for words of five letters
+ *    or more — at edit distance one, transpositions included ("tooltp", "calender").
+ *  - RANKS in tiers: exact title > title prefix > all words in the title > some word only
+ *    in the keywords > some word only in the description. Within a tier, better word
+ *    matches (exact over prefix over infix over typo) score higher, and `weight` is added
+ *    last. The tiers are {@link SEARCH_TIER_POINTS} points apart, so a weight below that reorders within
+ *    a tier and never across one.
+ *  - Caps each group (`groupLimit`, default 8) after ranking, so one broad group cannot
+ *    push every other group off the list.
+ */
+/** One searchable thing: a page, an action, a record, a settings row. */
+interface SearchEntry {
+    /** Unique across the entries handed to one index. */
+    id: string;
+    /** What the row says, and what ranks highest. */
+    title: string;
+    /** Other words or phrases that should find it — synonyms, a translated name, tags.
+     *  Matched like the title, ranked below it. */
+    keywords?: readonly string[];
+    /** Longer text, matched last and ranked lowest. Not shown in the row. */
+    description?: string;
+    /** Heading the row is grouped under in the palette. */
+    group?: string;
+    /** Secondary text on the row's trailing side (the page it lives on, an amount). */
+    hint?: string;
+    /** Leading icon. */
+    icon?: ReactNode;
+    /** Where it leads — the app's own path, handed to `GlobalSearch`'s `navigate`. */
+    href?: string;
+    /** Run instead of navigating. Wins over `href` for a plain click and ↵; `href` still
+     *  makes the row a real link for a middle-/⌘-click. */
+    onSelect?: () => void;
+    /** Added to the score. Below {@link SEARCH_TIER_POINTS} it reorders within a tier. */
+    weight?: number;
+    /** Masks the row for session replay (see `CommandItem.redact`). */
+    redact?: boolean;
+}
+type SearchMatchField = "title" | "keywords" | "description";
+interface SearchHit<E extends SearchEntry = SearchEntry> {
+    entry: E;
+    score: number;
+    /** The weakest field any query word had to be found in. */
+    field: SearchMatchField;
+}
+interface SearchIndexOptions {
+    /** Hits kept per `group` after ranking. Default 8; `Infinity` for no cap. */
+    groupLimit?: number;
+    /** Hits kept in total. Default: no cap beyond `groupLimit`. */
+    limit?: number;
+    /** Shortest query word allowed an edit-distance-1 match. Default 5 — below that a
+     *  single typo is a different word ("cat" / "car"). */
+    typoMinLength?: number;
+    /** Shortest query word matched INSIDE an entry word. Default 4. */
+    infixMinLength?: number;
+}
+interface SearchIndex<E extends SearchEntry = SearchEntry> {
+    /** Ranked hits for `query`; an empty query returns none. */
+    search: (query: string) => SearchHit<E>[];
+    readonly entries: readonly E[];
+}
+/** Points between two ranking tiers. */
+declare const SEARCH_TIER_POINTS = 1000;
+/**
+ * Lower case, accents off, punctuation to spaces — the form both sides are compared in.
+ * Exported so an app can normalise its own keys the same way.
+ */
+declare function normalizeSearchText(text: string): string;
+/**
+ * Build an index over `entries`. Normalisation happens once here, so `search` is a scan
+ * over prepared words — a few thousand entries per keystroke is nothing.
+ */
+declare function createSearchIndex<E extends SearchEntry>(entries: readonly E[], options?: SearchIndexOptions): SearchIndex<E>;
+/**
+ * One-shot form of {@link createSearchIndex}: the matching entries, best first. For a
+ * list that changes on every call (a server response, a store selector); build an index
+ * once when the entries are stable.
+ */
+declare function matchEntries<E extends SearchEntry>(entries: readonly E[], query: string, options?: SearchIndexOptions): E[];
+
+export { SEARCH_TIER_POINTS, type SearchEntry, type SearchHit, type SearchIndex, type SearchIndexOptions, type SearchMatchField, createSearchIndex, matchEntries, normalizeSearchText };

package/dist/search/search-index.js

@@ -0,0 +1,142 @@
+"use client";
+const SEARCH_TIER_POINTS = 1e3;
+const TIERS = {
+  exact: 5,
+  prefix: 4,
+  title: 3,
+  keywords: 2,
+  description: 1
+};
+const WORD_SCORE = { exact: 40, prefix: 30, infix: 15, typo: 10 };
+const FIELD_FACTOR = { title: 3, keywords: 2, description: 1 };
+function normalizeSearchText(text) {
+  return text.normalize("NFD").replace(/\p{M}+/gu, "").toLowerCase().replace(/ß/g, "ss").replace(/[^\p{L}\p{N}]+/gu, " ").trim();
+}
+function words(text) {
+  const out = /* @__PURE__ */ new Set();
+  const spaced = text.replace(/(\p{Ll}|\p{N})(\p{Lu})/gu, "$1 $2").replace(/(\p{Lu})(\p{Lu}\p{Ll})/gu, "$1 $2");
+  for (const w of normalizeSearchText(text).split(" ")) if (w) out.add(w);
+  for (const w of normalizeSearchText(spaced).split(" ")) if (w) out.add(w);
+  return [...out];
+}
+function withinDistance(a, b, max) {
+  if (Math.abs(a.length - b.length) > max) return false;
+  if (a === b) return true;
+  const n = a.length;
+  const m = b.length;
+  let prev2 = [];
+  let prev = Array.from({ length: m + 1 }, (_, j) => j);
+  for (let i = 1; i <= n; i++) {
+    const cur = [i];
+    let rowMin = i;
+    for (let j = 1; j <= m; j++) {
+      const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+      let v = Math.min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + cost);
+      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+        v = Math.min(v, prev2[j - 2] + 1);
+      }
+      cur.push(v);
+      if (v < rowMin) rowMin = v;
+    }
+    if (rowMin > max) return false;
+    prev2 = prev;
+    prev = cur;
+  }
+  return prev[m] <= max;
+}
+function matchWord(q, word, opts) {
+  if (word === q) return "exact";
+  if (word.startsWith(q)) return "prefix";
+  if (q.length >= opts.infixMinLength && word.includes(q)) return "infix";
+  if (q.length >= opts.typoMinLength) {
+    if (withinDistance(q, word, 1)) return "typo";
+    if (word.length > q.length && withinDistance(q, word.slice(0, q.length), 1)) return "typo";
+  }
+  return null;
+}
+function createSearchIndex(entries, options = {}) {
+  const { groupLimit = 8, limit = Infinity, typoMinLength = 5, infixMinLength = 4 } = options;
+  const wordOpts = { typoMinLength, infixMinLength };
+  const prepared = entries.map((entry) => {
+    const title = normalizeSearchText(entry.title);
+    return {
+      entry,
+      title,
+      titleCompact: title.replace(/ /g, ""),
+      fields: [
+        ["title", words(entry.title)],
+        ["keywords", (entry.keywords ?? []).flatMap(words)],
+        ["description", entry.description ? words(entry.description) : []]
+      ]
+    };
+  });
+  const search = (query) => {
+    const q = normalizeSearchText(query);
+    if (!q) return [];
+    const qWords = [...new Set(q.split(" "))];
+    const qCompact = q.replace(/ /g, "");
+    const hits = [];
+    for (const p of prepared) {
+      let quality = 0;
+      let weakest = "title";
+      let ok = true;
+      for (const qw of qWords) {
+        let best = 0;
+        let bestField = null;
+        for (const [field, fieldWords] of p.fields) {
+          for (const w of fieldWords) {
+            const kind = matchWord(qw, w, wordOpts);
+            if (!kind) continue;
+            const s = WORD_SCORE[kind] * FIELD_FACTOR[field];
+            if (s > best) {
+              best = s;
+              bestField = field;
+            }
+          }
+        }
+        if (!bestField) {
+          ok = false;
+          break;
+        }
+        quality += best;
+        if (FIELD_FACTOR[bestField] < FIELD_FACTOR[weakest]) weakest = bestField;
+      }
+      if (!ok) continue;
+      let tier = TIERS[weakest];
+      if (p.title === q || p.titleCompact === qCompact) tier = TIERS.exact;
+      else if (p.title.startsWith(q) || p.titleCompact.startsWith(qCompact) || // The whole title, mistyped once ("Tooltp") — as good as a prefix, not exact.
+      qCompact.length >= typoMinLength && withinDistance(qCompact, p.titleCompact, 1)) {
+        tier = TIERS.prefix;
+      }
+      const coverage = Math.min(1, qCompact.length / Math.max(1, p.titleCompact.length)) * 40;
+      const score = tier * SEARCH_TIER_POINTS + Math.min(quality / qWords.length + coverage, SEARCH_TIER_POINTS / 2 - 1) + (p.entry.weight ?? 0);
+      hits.push({ entry: p.entry, score, field: weakest });
+    }
+    hits.sort((a, b) => b.score - a.score || a.entry.title.localeCompare(b.entry.title));
+    return capByGroup(hits, groupLimit, limit);
+  };
+  return { search, entries };
+}
+function capByGroup(hits, groupLimit, limit) {
+  const perGroup = /* @__PURE__ */ new Map();
+  const out = [];
+  for (const hit of hits) {
+    if (out.length >= limit) break;
+    const g = hit.entry.group ?? "";
+    const n = perGroup.get(g) ?? 0;
+    if (n >= groupLimit) continue;
+    perGroup.set(g, n + 1);
+    out.push(hit);
+  }
+  return out;
+}
+function matchEntries(entries, query, options) {
+  return createSearchIndex(entries, options).search(query).map((hit) => hit.entry);
+}
+export {
+  SEARCH_TIER_POINTS,
+  createSearchIndex,
+  matchEntries,
+  normalizeSearchText
+};
+//# sourceMappingURL=search-index.js.map

package/dist/search/search-index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/search/search-index.ts"],"sourcesContent":["import type { ReactNode } from \"react\";\n\n/**\n * The matcher behind {@link GlobalSearch} — pure, React-free, testable on its own.\n *\n * WHY IT EXISTS. `CommandPalette` is deliberately domain-free: it shows whatever a\n * `search(query)` provider returns. So every app wrote that provider, and every app wrote\n * the same one — `label.toLowerCase().includes(q)` over its pages and actions (kastlan's\n * command palette, keksdose's global search) plus a second copy with keywords for the\n * settings catalogue (keksdose's `matchSettingsEntries`). A substring test answers \"does\n * this string contain that one\", which is not what a search box is asked:\n *\n *  - \"range date\" finds nothing, because the words are in the other order;\n *  - \"Uberweisung\" misses \"Überweisung\", and \"Tooltp\" misses \"Tooltip\";\n *  - \"del\" matches \"model\" as happily as \"delete\", and every hit ranks the same, so the\n *    exact page name can sit under six unrelated rows.\n *\n * What it does instead, per entry:\n *\n *  - NORMALISES both sides: lower case, accents stripped (NFD minus combining marks),\n *    `ß` → `ss`, punctuation as a word break, and camelCase split so `DateRangePicker`\n *    is also the words date, range, picker.\n *  - Requires EVERY query word to match SOMEWHERE in the entry — title, keywords or\n *    description, in any order.\n *  - A word matches a word of the entry exactly, as its prefix, inside it (four letters or\n *    more, for compounds: \"bereich\" in \"Datumsbereich\"), or — for words of five letters\n *    or more — at edit distance one, transpositions included (\"tooltp\", \"calender\").\n *  - RANKS in tiers: exact title > title prefix > all words in the title > some word only\n *    in the keywords > some word only in the description. Within a tier, better word\n *    matches (exact over prefix over infix over typo) score higher, and `weight` is added\n *    last. The tiers are {@link SEARCH_TIER_POINTS} points apart, so a weight below that reorders within\n *    a tier and never across one.\n *  - Caps each group (`groupLimit`, default 8) after ranking, so one broad group cannot\n *    push every other group off the list.\n */\n\n/** One searchable thing: a page, an action, a record, a settings row. */\nexport interface SearchEntry {\n  /** Unique across the entries handed to one index. */\n  id: string;\n  /** What the row says, and what ranks highest. */\n  title: string;\n  /** Other words or phrases that should find it — synonyms, a translated name, tags.\n   *  Matched like the title, ranked below it. */\n  keywords?: readonly string[];\n  /** Longer text, matched last and ranked lowest. Not shown in the row. */\n  description?: string;\n  /** Heading the row is grouped under in the palette. */\n  group?: string;\n  /** Secondary text on the row's trailing side (the page it lives on, an amount). */\n  hint?: string;\n  /** Leading icon. */\n  icon?: ReactNode;\n  /** Where it leads — the app's own path, handed to `GlobalSearch`'s `navigate`. */\n  href?: string;\n  /** Run instead of navigating. Wins over `href` for a plain click and ↵; `href` still\n   *  makes the row a real link for a middle-/⌘-click. */\n  onSelect?: () => void;\n  /** Added to the score. Below {@link SEARCH_TIER_POINTS} it reorders within a tier. */\n  weight?: number;\n  /** Masks the row for session replay (see `CommandItem.redact`). */\n  redact?: boolean;\n}\n\nexport type SearchMatchField = \"title\" | \"keywords\" | \"description\";\n\nexport interface SearchHit<E extends SearchEntry = SearchEntry> {\n  entry: E;\n  score: number;\n  /** The weakest field any query word had to be found in. */\n  field: SearchMatchField;\n}\n\nexport interface SearchIndexOptions {\n  /** Hits kept per `group` after ranking. Default 8; `Infinity` for no cap. */\n  groupLimit?: number;\n  /** Hits kept in total. Default: no cap beyond `groupLimit`. */\n  limit?: number;\n  /** Shortest query word allowed an edit-distance-1 match. Default 5 — below that a\n   *  single typo is a different word (\"cat\" / \"car\"). */\n  typoMinLength?: number;\n  /** Shortest query word matched INSIDE an entry word. Default 4. */\n  infixMinLength?: number;\n}\n\nexport interface SearchIndex<E extends SearchEntry = SearchEntry> {\n  /** Ranked hits for `query`; an empty query returns none. */\n  search: (query: string) => SearchHit<E>[];\n  readonly entries: readonly E[];\n}\n\n/** Points between two ranking tiers. */\nexport const SEARCH_TIER_POINTS = 1000;\n\nconst TIERS = {\n  exact: 5,\n  prefix: 4,\n  title: 3,\n  keywords: 2,\n  description: 1,\n} as const;\n\n/** How well one query word matched one entry word — higher is better. */\nconst WORD_SCORE = { exact: 40, prefix: 30, infix: 15, typo: 10 } as const;\n/** How much the field a word matched in is worth, multiplied with the above. */\nconst FIELD_FACTOR: Record<SearchMatchField, number> = { title: 3, keywords: 2, description: 1 };\n\n/**\n * Lower case, accents off, punctuation to spaces — the form both sides are compared in.\n * Exported so an app can normalise its own keys the same way.\n */\nexport function normalizeSearchText(text: string): string {\n  return text\n    .normalize(\"NFD\")\n    .replace(/\\p{M}+/gu, \"\")\n    .toLowerCase()\n    .replace(/ß/g, \"ss\")\n    .replace(/[^\\p{L}\\p{N}]+/gu, \" \")\n    .trim();\n}\n\n/** The words of a text, camelCase split too: \"DateRangePicker\" → daterangepicker, date,\n *  range, picker. The joined word stays so \"daterange\" still prefixes it. */\nfunction words(text: string): string[] {\n  const out = new Set<string>();\n  // Split camelCase BEFORE lower-casing, or the boundaries are gone.\n  const spaced = text.replace(/(\\p{Ll}|\\p{N})(\\p{Lu})/gu, \"$1 $2\").replace(/(\\p{Lu})(\\p{Lu}\\p{Ll})/gu, \"$1 $2\");\n  for (const w of normalizeSearchText(text).split(\" \")) if (w) out.add(w);\n  for (const w of normalizeSearchText(spaced).split(\" \")) if (w) out.add(w);\n  return [...out];\n}\n\n/** Restricted Damerau–Levenshtein distance, early-exiting once it must exceed `max`. */\nfunction withinDistance(a: string, b: string, max: number): boolean {\n  if (Math.abs(a.length - b.length) > max) return false;\n  if (a === b) return true;\n  const n = a.length;\n  const m = b.length;\n  let prev2: number[] = [];\n  let prev = Array.from({ length: m + 1 }, (_, j) => j);\n  for (let i = 1; i <= n; i++) {\n    const cur = [i];\n    let rowMin = i;\n    for (let j = 1; j <= m; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      let v = Math.min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + cost);\n      if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n        v = Math.min(v, prev2[j - 2] + 1);\n      }\n      cur.push(v);\n      if (v < rowMin) rowMin = v;\n    }\n    if (rowMin > max) return false;\n    prev2 = prev;\n    prev = cur;\n  }\n  return prev[m] <= max;\n}\n\ntype WordKind = keyof typeof WORD_SCORE;\n\nfunction matchWord(q: string, word: string, opts: Required<Pick<SearchIndexOptions, \"typoMinLength\" | \"infixMinLength\">>): WordKind | null {\n  if (word === q) return \"exact\";\n  if (word.startsWith(q)) return \"prefix\";\n  if (q.length >= opts.infixMinLength && word.includes(q)) return \"infix\";\n  if (q.length >= opts.typoMinLength) {\n    // The whole word, or the word's start as long as the query (a typo in a prefix:\n    // \"calender\" is one edit from \"calendar\", the start of \"calendars\").\n    if (withinDistance(q, word, 1)) return \"typo\";\n    if (word.length > q.length && withinDistance(q, word.slice(0, q.length), 1)) return \"typo\";\n  }\n  return null;\n}\n\ninterface Prepared<E> {\n  entry: E;\n  title: string;\n  titleCompact: string;\n  fields: Array<[SearchMatchField, string[]]>;\n}\n\n/**\n * Build an index over `entries`. Normalisation happens once here, so `search` is a scan\n * over prepared words — a few thousand entries per keystroke is nothing.\n */\nexport function createSearchIndex<E extends SearchEntry>(\n  entries: readonly E[],\n  options: SearchIndexOptions = {},\n): SearchIndex<E> {\n  const { groupLimit = 8, limit = Infinity, typoMinLength = 5, infixMinLength = 4 } = options;\n  const wordOpts = { typoMinLength, infixMinLength };\n  const prepared: Prepared<E>[] = entries.map((entry) => {\n    const title = normalizeSearchText(entry.title);\n    return {\n      entry,\n      title,\n      titleCompact: title.replace(/ /g, \"\"),\n      fields: [\n        [\"title\", words(entry.title)],\n        [\"keywords\", (entry.keywords ?? []).flatMap(words)],\n        [\"description\", entry.description ? words(entry.description) : []],\n      ],\n    };\n  });\n\n  const search = (query: string): SearchHit<E>[] => {\n    const q = normalizeSearchText(query);\n    if (!q) return [];\n    const qWords = [...new Set(q.split(\" \"))];\n    const qCompact = q.replace(/ /g, \"\");\n    const hits: SearchHit<E>[] = [];\n\n    for (const p of prepared) {\n      let quality = 0;\n      let weakest: SearchMatchField = \"title\";\n      let ok = true;\n      for (const qw of qWords) {\n        let best = 0;\n        let bestField: SearchMatchField | null = null;\n        for (const [field, fieldWords] of p.fields) {\n          for (const w of fieldWords) {\n            const kind = matchWord(qw, w, wordOpts);\n            if (!kind) continue;\n            const s = WORD_SCORE[kind] * FIELD_FACTOR[field];\n            if (s > best) {\n              best = s;\n              bestField = field;\n            }\n          }\n        }\n        if (!bestField) {\n          ok = false;\n          break;\n        }\n        quality += best;\n        if (FIELD_FACTOR[bestField] < FIELD_FACTOR[weakest]) weakest = bestField;\n      }\n      if (!ok) continue;\n\n      let tier: number = TIERS[weakest];\n      if (p.title === q || p.titleCompact === qCompact) tier = TIERS.exact;\n      else if (\n        p.title.startsWith(q) ||\n        p.titleCompact.startsWith(qCompact) ||\n        // The whole title, mistyped once (\"Tooltp\") — as good as a prefix, not exact.\n        (qCompact.length >= typoMinLength && withinDistance(qCompact, p.titleCompact, 1))\n      ) {\n        tier = TIERS.prefix;\n      }\n      // Within a tier: how well the words matched (≤ 120 each, averaged so a long query\n      // cannot climb by word count), and how much of the title the query covers — so\n      // \"Tooltip\" beats \"Popovers, menus & tooltips\" for the same one-word match.\n      const coverage = Math.min(1, qCompact.length / Math.max(1, p.titleCompact.length)) * 40;\n      const score =\n        tier * SEARCH_TIER_POINTS +\n        Math.min(quality / qWords.length + coverage, SEARCH_TIER_POINTS / 2 - 1) +\n        (p.entry.weight ?? 0);\n      hits.push({ entry: p.entry, score, field: weakest });\n    }\n\n    hits.sort((a, b) => b.score - a.score || a.entry.title.localeCompare(b.entry.title));\n    return capByGroup(hits, groupLimit, limit);\n  };\n\n  return { search, entries };\n}\n\nfunction capByGroup<E extends SearchEntry>(hits: SearchHit<E>[], groupLimit: number, limit: number): SearchHit<E>[] {\n  const perGroup = new Map<string, number>();\n  const out: SearchHit<E>[] = [];\n  for (const hit of hits) {\n    if (out.length >= limit) break;\n    const g = hit.entry.group ?? \"\";\n    const n = perGroup.get(g) ?? 0;\n    if (n >= groupLimit) continue;\n    perGroup.set(g, n + 1);\n    out.push(hit);\n  }\n  return out;\n}\n\n/**\n * One-shot form of {@link createSearchIndex}: the matching entries, best first. For a\n * list that changes on every call (a server response, a store selector); build an index\n * once when the entries are stable.\n */\nexport function matchEntries<E extends SearchEntry>(\n  entries: readonly E[],\n  query: string,\n  options?: SearchIndexOptions,\n): E[] {\n  return createSearchIndex(entries, options)\n    .search(query)\n    .map((hit) => hit.entry);\n}\n"],"mappings":";AA4FO,MAAM,qBAAqB;AAElC,MAAM,QAAQ;AAAA,EACZ,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,UAAU;AAAA,EACV,aAAa;AACf;AAGA,MAAM,aAAa,EAAE,OAAO,IAAI,QAAQ,IAAI,OAAO,IAAI,MAAM,GAAG;AAEhE,MAAM,eAAiD,EAAE,OAAO,GAAG,UAAU,GAAG,aAAa,EAAE;AAMxF,SAAS,oBAAoB,MAAsB;AACxD,SAAO,KACJ,UAAU,KAAK,EACf,QAAQ,YAAY,EAAE,EACtB,YAAY,EACZ,QAAQ,MAAM,IAAI,EAClB,QAAQ,oBAAoB,GAAG,EAC/B,KAAK;AACV;AAIA,SAAS,MAAM,MAAwB;AACrC,QAAM,MAAM,oBAAI,IAAY;AAE5B,QAAM,SAAS,KAAK,QAAQ,4BAA4B,OAAO,EAAE,QAAQ,4BAA4B,OAAO;AAC5G,aAAW,KAAK,oBAAoB,IAAI,EAAE,MAAM,GAAG,EAAG,KAAI,EAAG,KAAI,IAAI,CAAC;AACtE,aAAW,KAAK,oBAAoB,MAAM,EAAE,MAAM,GAAG,EAAG,KAAI,EAAG,KAAI,IAAI,CAAC;AACxE,SAAO,CAAC,GAAG,GAAG;AAChB;AAGA,SAAS,eAAe,GAAW,GAAW,KAAsB;AAClE,MAAI,KAAK,IAAI,EAAE,SAAS,EAAE,MAAM,IAAI,IAAK,QAAO;AAChD,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,IAAI,EAAE;AACZ,QAAM,IAAI,EAAE;AACZ,MAAI,QAAkB,CAAC;AACvB,MAAI,OAAO,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC;AACpD,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,UAAM,MAAM,CAAC,CAAC;AACd,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,YAAM,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI;AACzC,UAAI,IAAI,KAAK,IAAI,KAAK,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,IAAI,CAAC,IAAI,IAAI;AAChE,UAAI,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AACpE,YAAI,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC;AAAA,MAClC;AACA,UAAI,KAAK,CAAC;AACV,UAAI,IAAI,OAAQ,UAAS;AAAA,IAC3B;AACA,QAAI,SAAS,IAAK,QAAO;AACzB,YAAQ;AACR,WAAO;AAAA,EACT;AACA,SAAO,KAAK,CAAC,KAAK;AACpB;AAIA,SAAS,UAAU,GAAW,MAAc,MAA+F;AACzI,MAAI,SAAS,EAAG,QAAO;AACvB,MAAI,KAAK,WAAW,CAAC,EAAG,QAAO;AAC/B,MAAI,EAAE,UAAU,KAAK,kBAAkB,KAAK,SAAS,CAAC,EAAG,QAAO;AAChE,MAAI,EAAE,UAAU,KAAK,eAAe;AAGlC,QAAI,eAAe,GAAG,MAAM,CAAC,EAAG,QAAO;AACvC,QAAI,KAAK,SAAS,EAAE,UAAU,eAAe,GAAG,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,CAAC,EAAG,QAAO;AAAA,EACtF;AACA,SAAO;AACT;AAaO,SAAS,kBACd,SACA,UAA8B,CAAC,GACf;AAChB,QAAM,EAAE,aAAa,GAAG,QAAQ,UAAU,gBAAgB,GAAG,iBAAiB,EAAE,IAAI;AACpF,QAAM,WAAW,EAAE,eAAe,eAAe;AACjD,QAAM,WAA0B,QAAQ,IAAI,CAAC,UAAU;AACrD,UAAM,QAAQ,oBAAoB,MAAM,KAAK;AAC7C,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,cAAc,MAAM,QAAQ,MAAM,EAAE;AAAA,MACpC,QAAQ;AAAA,QACN,CAAC,SAAS,MAAM,MAAM,KAAK,CAAC;AAAA,QAC5B,CAAC,aAAa,MAAM,YAAY,CAAC,GAAG,QAAQ,KAAK,CAAC;AAAA,QAClD,CAAC,eAAe,MAAM,cAAc,MAAM,MAAM,WAAW,IAAI,CAAC,CAAC;AAAA,MACnE;AAAA,IACF;AAAA,EACF,CAAC;AAED,QAAM,SAAS,CAAC,UAAkC;AAChD,UAAM,IAAI,oBAAoB,KAAK;AACnC,QAAI,CAAC,EAAG,QAAO,CAAC;AAChB,UAAM,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC;AACxC,UAAM,WAAW,EAAE,QAAQ,MAAM,EAAE;AACnC,UAAM,OAAuB,CAAC;AAE9B,eAAW,KAAK,UAAU;AACxB,UAAI,UAAU;AACd,UAAI,UAA4B;AAChC,UAAI,KAAK;AACT,iBAAW,MAAM,QAAQ;AACvB,YAAI,OAAO;AACX,YAAI,YAAqC;AACzC,mBAAW,CAAC,OAAO,UAAU,KAAK,EAAE,QAAQ;AAC1C,qBAAW,KAAK,YAAY;AAC1B,kBAAM,OAAO,UAAU,IAAI,GAAG,QAAQ;AACtC,gBAAI,CAAC,KAAM;AACX,kBAAM,IAAI,WAAW,IAAI,IAAI,aAAa,KAAK;AAC/C,gBAAI,IAAI,MAAM;AACZ,qBAAO;AACP,0BAAY;AAAA,YACd;AAAA,UACF;AAAA,QACF;AACA,YAAI,CAAC,WAAW;AACd,eAAK;AACL;AAAA,QACF;AACA,mBAAW;AACX,YAAI,aAAa,SAAS,IAAI,aAAa,OAAO,EAAG,WAAU;AAAA,MACjE;AACA,UAAI,CAAC,GAAI;AAET,UAAI,OAAe,MAAM,OAAO;AAChC,UAAI,EAAE,UAAU,KAAK,EAAE,iBAAiB,SAAU,QAAO,MAAM;AAAA,eAE7D,EAAE,MAAM,WAAW,CAAC,KACpB,EAAE,aAAa,WAAW,QAAQ;AAAA,MAEjC,SAAS,UAAU,iBAAiB,eAAe,UAAU,EAAE,cAAc,CAAC,GAC/E;AACA,eAAO,MAAM;AAAA,MACf;AAIA,YAAM,WAAW,KAAK,IAAI,GAAG,SAAS,SAAS,KAAK,IAAI,GAAG,EAAE,aAAa,MAAM,CAAC,IAAI;AACrF,YAAM,QACJ,OAAO,qBACP,KAAK,IAAI,UAAU,OAAO,SAAS,UAAU,qBAAqB,IAAI,CAAC,KACtE,EAAE,MAAM,UAAU;AACrB,WAAK,KAAK,EAAE,OAAO,EAAE,OAAO,OAAO,OAAO,QAAQ,CAAC;AAAA,IACrD;AAEA,SAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,MAAM,cAAc,EAAE,MAAM,KAAK,CAAC;AACnF,WAAO,WAAW,MAAM,YAAY,KAAK;AAAA,EAC3C;AAEA,SAAO,EAAE,QAAQ,QAAQ;AAC3B;AAEA,SAAS,WAAkC,MAAsB,YAAoB,OAA+B;AAClH,QAAM,WAAW,oBAAI,IAAoB;AACzC,QAAM,MAAsB,CAAC;AAC7B,aAAW,OAAO,MAAM;AACtB,QAAI,IAAI,UAAU,MAAO;AACzB,UAAM,IAAI,IAAI,MAAM,SAAS;AAC7B,UAAM,IAAI,SAAS,IAAI,CAAC,KAAK;AAC7B,QAAI,KAAK,WAAY;AACrB,aAAS,IAAI,GAAG,IAAI,CAAC;AACrB,QAAI,KAAK,GAAG;AAAA,EACd;AACA,SAAO;AACT;AAOO,SAAS,aACd,SACA,OACA,SACK;AACL,SAAO,kBAAkB,SAAS,OAAO,EACtC,OAAO,KAAK,EACZ,IAAI,CAAC,QAAQ,IAAI,KAAK;AAC3B;","names":[]}

package/dist/search.d.ts

@@ -1,2 +1,4 @@
 export { CommandItem, CommandPalette, CommandPaletteLabels, DEFAULT_COMMAND_PALETTE_LABELS, useCommandKey } from './search/command-palette.js';
+export { SEARCH_TIER_POINTS, SearchEntry, SearchHit, SearchIndex, SearchIndexOptions, SearchMatchField, createSearchIndex, matchEntries, normalizeSearchText } from './search/search-index.js';
+export { DEFAULT_GLOBAL_SEARCH_LABELS, GlobalSearch, GlobalSearchLabels, GlobalSearchProps, GlobalSearchSource, GlobalSearchSuggestion, GlobalSearchTriggerProps } from './search/global-search.js';
 import 'react';

package/dist/search.js

@@ -1,3 +1,5 @@
 "use client";
 export * from "./search/command-palette.js";
+export * from "./search/search-index.js";
+export * from "./search/global-search.js";
 //# sourceMappingURL=search.js.map

package/dist/search.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/search.ts"],"sourcesContent":["// `@eifi1/ui-kit/search` — the command palette / global search.\n// A re-slicing of the main barrel, not a new API.\nexport * from \"./search/command-palette\";\n"],"mappings":";AAEA,cAAc;","names":[]}
+{"version":3,"sources":["../src/search.ts"],"sourcesContent":["// `@eifi1/ui-kit/search` — the command palette / global search.\n// A re-slicing of the main barrel, not a new API.\nexport * from \"./search/command-palette\";\nexport * from \"./search/search-index\";\nexport * from \"./search/global-search\";\n"],"mappings":";AAEA,cAAc;AACd,cAAc;AACd,cAAc;","names":[]}