@lobehub/ui 5.51.2 → 5.53.0

package/es/mdx/Tabs/index.mjs

@@ -1,6 +1,6 @@
 "use client";
 import FlexBasic_default from "../../Flex/FlexBasic.mjs";
-import Tabs$1 from "../../Tabs/Tabs.mjs";
+import Tabs$1 from "../../base-ui/Tabs/Tabs.mjs";
 import { styles } from "./style.mjs";
 import { useState } from "react";
 import { jsx, jsxs } from "react/jsx-runtime";
@@ -14,9 +14,14 @@ const Tabs = ({ defaultIndex = "0", items, children, className, tabNavProps = {}
 		className: cx(styles.container, className),
 		...rest,
 		children: [/* @__PURE__ */ jsx(Tabs$1, {
-			compact: true,
 			activeKey: activeIndex,
 			className: cx(styles.header, tabNavClassName),
+			variant: "square",
+			classNames: {
+				indicator: styles.indicator,
+				list: styles.list,
+				tab: styles.tab
+			},
 			items: items.map((item, i) => ({
 				key: String(i),
 				label: item

package/es/mdx/Tabs/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":["Flexbox","LobeTabs"],"sources":["../../../src/mdx/Tabs/index.tsx"],"sourcesContent":["'use client';\n\nimport { cx } from 'antd-style';\nimport { type FC, type ReactNode, useState } from 'react';\n\nimport { Flexbox, type FlexboxProps } from '@/Flex';\nimport { default as LobeTabs, type TabsProps as LobeTabsProps } from '@/Tabs';\n\nimport { styles } from './style';\n\nexport interface TabsProps extends Omit<FlexboxProps, 'children'> {\n  children: ReactNode[];\n  defaultIndex?: number | string;\n  items: string[];\n  tabNavProps?: Partial<LobeTabsProps>;\n}\n\nconst Tabs: FC<TabsProps> = ({\n  defaultIndex = '0',\n  items,\n  children,\n  className,\n  tabNavProps = {},\n  ...rest\n}) => {\n  const { className: tabNavClassName, onChange, ...tabNavRest } = tabNavProps;\n  const [activeIndex, setActiveIndex] = useState<string>(String(defaultIndex));\n\n  const index = Number(activeIndex);\n\n  return (\n    <Flexbox className={cx(styles.container, className)} {...rest}>\n      <LobeTabs\n        compact\n        activeKey={activeIndex}\n        className={cx(styles.header, tabNavClassName)}\n        items={items.map((item, i) => ({\n          key: String(i),\n          label: item,\n        }))}\n        onChange={(v) => {\n          setActiveIndex(v);\n          onChange?.(v);\n        }}\n        {...tabNavRest}\n      />\n      {children?.[index] || ''}\n    </Flexbox>\n  );\n};\n\nexport default Tabs;\n"],"mappings":";;;;;;;;AAiBA,MAAM,QAAuB,EAC3B,eAAe,KACf,OACA,UACA,WACA,cAAc,CAAC,GACf,GAAG,WACC;CACJ,MAAM,EAAE,WAAW,iBAAiB,UAAU,GAAG,eAAe;CAChE,MAAM,CAAC,aAAa,kBAAkB,SAAiB,OAAO,YAAY,CAAC;CAE3E,MAAM,QAAQ,OAAO,WAAW;CAEhC,OACE,qBAACA,mBAAD;EAAS,WAAW,GAAG,OAAO,WAAW,SAAS;EAAG,GAAI;EAAzD,UAAA,CACE,oBAACC,QAAD;GACE,SAAA;GACA,WAAW;GACX,WAAW,GAAG,OAAO,QAAQ,eAAe;GAC5C,OAAO,MAAM,KAAK,MAAM,OAAO;IAC7B,KAAK,OAAO,CAAC;IACb,OAAO;GACT,EAAE;GACF,WAAW,MAAM;IACf,eAAe,CAAC;IAChB,WAAW,CAAC;GACd;GACA,GAAI;EACL,CAAA,GACA,WAAW,UAAU,EACf;;AAEb"}
+{"version":3,"file":"index.mjs","names":["Flexbox","LobeTabs"],"sources":["../../../src/mdx/Tabs/index.tsx"],"sourcesContent":["'use client';\n\nimport { cx } from 'antd-style';\nimport { type FC, type ReactNode, useState } from 'react';\n\nimport LobeTabs, { type TabsProps as LobeTabsProps } from '@/base-ui/Tabs';\nimport { Flexbox, type FlexboxProps } from '@/Flex';\n\nimport { styles } from './style';\n\nexport interface TabsProps extends Omit<FlexboxProps, 'children'> {\n  children: ReactNode[];\n  defaultIndex?: number | string;\n  items: string[];\n  tabNavProps?: Partial<LobeTabsProps>;\n}\n\nconst Tabs: FC<TabsProps> = ({\n  defaultIndex = '0',\n  items,\n  children,\n  className,\n  tabNavProps = {},\n  ...rest\n}) => {\n  const { className: tabNavClassName, onChange, ...tabNavRest } = tabNavProps;\n  const [activeIndex, setActiveIndex] = useState<string>(String(defaultIndex));\n\n  const index = Number(activeIndex);\n\n  return (\n    <Flexbox className={cx(styles.container, className)} {...rest}>\n      <LobeTabs\n        activeKey={activeIndex}\n        className={cx(styles.header, tabNavClassName)}\n        variant={'square'}\n        classNames={{\n          indicator: styles.indicator,\n          list: styles.list,\n          tab: styles.tab,\n        }}\n        items={items.map((item, i) => ({\n          key: String(i),\n          label: item,\n        }))}\n        onChange={(v) => {\n          setActiveIndex(v);\n          onChange?.(v);\n        }}\n        {...tabNavRest}\n      />\n      {children?.[index] || ''}\n    </Flexbox>\n  );\n};\n\nexport default Tabs;\n"],"mappings":";;;;;;;;AAiBA,MAAM,QAAuB,EAC3B,eAAe,KACf,OACA,UACA,WACA,cAAc,CAAC,GACf,GAAG,WACC;CACJ,MAAM,EAAE,WAAW,iBAAiB,UAAU,GAAG,eAAe;CAChE,MAAM,CAAC,aAAa,kBAAkB,SAAiB,OAAO,YAAY,CAAC;CAE3E,MAAM,QAAQ,OAAO,WAAW;CAEhC,OACE,qBAACA,mBAAD;EAAS,WAAW,GAAG,OAAO,WAAW,SAAS;EAAG,GAAI;EAAzD,UAAA,CACE,oBAACC,QAAD;GACE,WAAW;GACX,WAAW,GAAG,OAAO,QAAQ,eAAe;GAC5C,SAAS;GACT,YAAY;IACV,WAAW,OAAO;IAClB,MAAM,OAAO;IACb,KAAK,OAAO;GACd;GACA,OAAO,MAAM,KAAK,MAAM,OAAO;IAC7B,KAAK,OAAO,CAAC;IACb,OAAO;GACT,EAAE;GACF,WAAW,MAAM;IACf,eAAe,CAAC;IAChB,WAAW,CAAC;GACd;GACA,GAAI;EACL,CAAA,GACA,WAAW,UAAU,EACf;;AAEb"}

package/es/mdx/Tabs/style.mjs

@@ -1,6 +1,6 @@
 import { createStaticStyles } from "antd-style";
 //#region src/mdx/Tabs/style.ts
-const styles = createStaticStyles(({ css }) => {
+const styles = createStaticStyles(({ css, cssVar }) => {
 	return {
 		body: css`
       padding-inline: 1em;
@@ -14,6 +14,38 @@ const styles = createStaticStyles(({ css }) => {
     `,
 		header: css`
       /* Header styles */
+    `,
+		indicator: css`
+      && {
+        height: 3px;
+        border-start-start-radius: 3px;
+        border-start-end-radius: 3px;
+      }
+    `,
+		list: css`
+      && {
+        gap: 8px;
+        padding: 4px;
+        box-shadow: none;
+      }
+    `,
+		tab: css`
+      && {
+        height: auto;
+        padding-block: 8px;
+        padding-inline: 12px;
+        border-radius: ${cssVar.borderRadius};
+
+        font-size: 14px;
+        font-weight: 400;
+        line-height: 22px;
+
+        transition: background-color 100ms ease-out;
+      }
+
+      &&:hover:not([data-disabled]) {
+        background: ${cssVar.colorFillTertiary};
+      }
     `
 	};
 });

package/es/mdx/Tabs/style.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"style.mjs","names":[],"sources":["../../../src/mdx/Tabs/style.ts"],"sourcesContent":["import { createStaticStyles } from 'antd-style';\n\nexport const styles = createStaticStyles(({ css }) => {\n  return {\n    body: css`\n      padding-inline: 1em;\n\n      > div {\n        margin-block: calc(var(--lobe-markdown-margin-multiple) * 1em);\n      }\n    `,\n    container: css`\n      /* Container styles */\n    `,\n    header: css`\n      /* Header styles */\n    `,\n  };\n});\n"],"mappings":";;AAEA,MAAa,SAAS,oBAAoB,EAAE,UAAU;CACpD,OAAO;EACL,MAAM,GAAG;;;;;;;EAOT,WAAW,GAAG;;;EAGd,QAAQ,GAAG;;;CAGb;AACF,CAAC"}
+{"version":3,"file":"style.mjs","names":[],"sources":["../../../src/mdx/Tabs/style.ts"],"sourcesContent":["import { createStaticStyles } from 'antd-style';\n\nexport const styles = createStaticStyles(({ css, cssVar }) => {\n  return {\n    body: css`\n      padding-inline: 1em;\n\n      > div {\n        margin-block: calc(var(--lobe-markdown-margin-multiple) * 1em);\n      }\n    `,\n    container: css`\n      /* Container styles */\n    `,\n    header: css`\n      /* Header styles */\n    `,\n    indicator: css`\n      && {\n        height: 3px;\n        border-start-start-radius: 3px;\n        border-start-end-radius: 3px;\n      }\n    `,\n    list: css`\n      && {\n        gap: 8px;\n        padding: 4px;\n        box-shadow: none;\n      }\n    `,\n    tab: css`\n      && {\n        height: auto;\n        padding-block: 8px;\n        padding-inline: 12px;\n        border-radius: ${cssVar.borderRadius};\n\n        font-size: 14px;\n        font-weight: 400;\n        line-height: 22px;\n\n        transition: background-color 100ms ease-out;\n      }\n\n      &&:hover:not([data-disabled]) {\n        background: ${cssVar.colorFillTertiary};\n      }\n    `,\n  };\n});\n"],"mappings":";;AAEA,MAAa,SAAS,oBAAoB,EAAE,KAAK,aAAa;CAC5D,OAAO;EACL,MAAM,GAAG;;;;;;;EAOT,WAAW,GAAG;;;EAGd,QAAQ,GAAG;;;EAGX,WAAW,GAAG;;;;;;;EAOd,MAAM,GAAG;;;;;;;EAOT,KAAK,GAAG;;;;;yBAKa,OAAO,aAAa;;;;;;;;;;sBAUvB,OAAO,kBAAkB;;;CAG7C;AACF,CAAC"}

package/es/mdx/mdxComponents/Citation/PopoverPanel.mjs

@@ -1,10 +1,10 @@
 "use client";
 import FlexBasic_default from "../../../Flex/FlexBasic.mjs";
 import Icon from "../../../Icon/Icon.mjs";
+import Popover from "../../../base-ui/Popover/Popover.mjs";
 import { styles } from "./style.mjs";
 import { useMemo } from "react";
 import { jsx, jsxs } from "react/jsx-runtime";
-import { Popover } from "antd";
 import { ArrowRightIcon } from "lucide-react";
 //#region src/mdx/mdxComponents/Citation/PopoverPanel.tsx
 const PopoverPanel = ({ children, usePopover, title, alt, url }) => {

package/es/mdx/mdxComponents/Citation/PopoverPanel.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"PopoverPanel.mjs","names":["Flexbox"],"sources":["../../../../src/mdx/mdxComponents/Citation/PopoverPanel.tsx"],"sourcesContent":["'use client';\n\nimport { Popover } from 'antd';\nimport { ArrowRightIcon } from 'lucide-react';\nimport { type FC, type ReactNode, useMemo } from 'react';\n\nimport { Flexbox } from '@/Flex';\nimport Icon from '@/Icon';\n\nimport { styles } from './style';\n\ninterface PopoverPanelProps {\n  alt?: string;\n  children?: ReactNode;\n  title?: string;\n  url?: string;\n  usePopover?: boolean;\n}\n\nconst PopoverPanel: FC<PopoverPanelProps> = ({ children, usePopover, title, alt, url }) => {\n  const [displayTitle, domain, host] = useMemo(() => {\n    try {\n      const urlObj = new URL(url!);\n      const hostForUrl = urlObj.host;\n\n      let displayTitle = title;\n\n      if (title === url) {\n        displayTitle = '';\n      }\n\n      let domain = urlObj.hostname.replace('www.', '');\n      if (!displayTitle) domain = url!;\n\n      return [displayTitle, domain, hostForUrl];\n    } catch {\n      return [title, url, url];\n    }\n  }, [url, title]);\n\n  return usePopover && url ? (\n    <Popover\n      arrow={false}\n      trigger={'hover'}\n      content={\n        <Flexbox gap={8}>\n          <Flexbox\n            horizontal\n            className={styles.link}\n            gap={12}\n            justify={'space-between'}\n            onClick={() => {\n              window.open(url, '_blank');\n            }}\n          >\n            <Flexbox horizontal align={'center'} gap={4}>\n              <img\n                alt={alt || title || url}\n                height={14}\n                src={`https://icons.duckduckgo.com/ip3/${host}.ico`}\n                style={{ borderRadius: 4 }}\n                width={14}\n              />\n              <span className={styles.url}>{domain}</span>\n            </Flexbox>\n            <Icon icon={ArrowRightIcon} />\n          </Flexbox>\n          {displayTitle}\n        </Flexbox>\n      }\n    >\n      {children}\n    </Popover>\n  ) : (\n    children\n  );\n};\n\nPopoverPanel.displayName = 'MdxPopoverPanel';\n\nexport default PopoverPanel;\n"],"mappings":";;;;;;;;;AAmBA,MAAM,gBAAuC,EAAE,UAAU,YAAY,OAAO,KAAK,UAAU;CACzF,MAAM,CAAC,cAAc,QAAQ,QAAQ,cAAc;EACjD,IAAI;GACF,MAAM,SAAS,IAAI,IAAI,GAAI;GAC3B,MAAM,aAAa,OAAO;GAE1B,IAAI,eAAe;GAEnB,IAAI,UAAU,KACZ,eAAe;GAGjB,IAAI,SAAS,OAAO,SAAS,QAAQ,QAAQ,EAAE;GAC/C,IAAI,CAAC,cAAc,SAAS;GAE5B,OAAO;IAAC;IAAc;IAAQ;GAAU;EAC1C,QAAQ;GACN,OAAO;IAAC;IAAO;IAAK;GAAG;EACzB;CACF,GAAG,CAAC,KAAK,KAAK,CAAC;CAEf,OAAO,cAAc,MACnB,oBAAC,SAAD;EACE,OAAO;EACP,SAAS;EACT,SACE,qBAACA,mBAAD;GAAS,KAAK;GAAd,UAAA,CACE,qBAACA,mBAAD;IACE,YAAA;IACA,WAAW,OAAO;IAClB,KAAK;IACL,SAAS;IACT,eAAe;KACb,OAAO,KAAK,KAAK,QAAQ;IAC3B;IAPF,UAAA,CASE,qBAACA,mBAAD;KAAS,YAAA;KAAW,OAAO;KAAU,KAAK;KAA1C,UAAA,CACE,oBAAC,OAAD;MACE,KAAK,OAAO,SAAS;MACrB,QAAQ;MACR,KAAK,oCAAoC,KAAK;MAC9C,OAAO,EAAE,cAAc,EAAE;MACzB,OAAO;KACR,CAAA,GACD,oBAAC,QAAD;MAAM,WAAW,OAAO;MAAM,UAAA;KAAa,CAAA,CACpC;IACT,CAAA,GAAA,oBAAC,MAAD,EAAM,MAAM,eAAiB,CAAA,CACtB;GACR,CAAA,GAAA,YACM;;EAGV;CACM,CAAA,IAET;AAEJ;AAEA,aAAa,cAAc"}
+{"version":3,"file":"PopoverPanel.mjs","names":["Flexbox"],"sources":["../../../../src/mdx/mdxComponents/Citation/PopoverPanel.tsx"],"sourcesContent":["'use client';\n\nimport { ArrowRightIcon } from 'lucide-react';\nimport { type FC, type ReactNode, useMemo } from 'react';\n\nimport Popover from '@/base-ui/Popover';\nimport { Flexbox } from '@/Flex';\nimport Icon from '@/Icon';\n\nimport { styles } from './style';\n\ninterface PopoverPanelProps {\n  alt?: string;\n  children?: ReactNode;\n  title?: string;\n  url?: string;\n  usePopover?: boolean;\n}\n\nconst PopoverPanel: FC<PopoverPanelProps> = ({ children, usePopover, title, alt, url }) => {\n  const [displayTitle, domain, host] = useMemo(() => {\n    try {\n      const urlObj = new URL(url!);\n      const hostForUrl = urlObj.host;\n\n      let displayTitle = title;\n\n      if (title === url) {\n        displayTitle = '';\n      }\n\n      let domain = urlObj.hostname.replace('www.', '');\n      if (!displayTitle) domain = url!;\n\n      return [displayTitle, domain, hostForUrl];\n    } catch {\n      return [title, url, url];\n    }\n  }, [url, title]);\n\n  return usePopover && url ? (\n    <Popover\n      arrow={false}\n      trigger={'hover'}\n      content={\n        <Flexbox gap={8}>\n          <Flexbox\n            horizontal\n            className={styles.link}\n            gap={12}\n            justify={'space-between'}\n            onClick={() => {\n              window.open(url, '_blank');\n            }}\n          >\n            <Flexbox horizontal align={'center'} gap={4}>\n              <img\n                alt={alt || title || url}\n                height={14}\n                src={`https://icons.duckduckgo.com/ip3/${host}.ico`}\n                style={{ borderRadius: 4 }}\n                width={14}\n              />\n              <span className={styles.url}>{domain}</span>\n            </Flexbox>\n            <Icon icon={ArrowRightIcon} />\n          </Flexbox>\n          {displayTitle}\n        </Flexbox>\n      }\n    >\n      {children}\n    </Popover>\n  ) : (\n    children\n  );\n};\n\nPopoverPanel.displayName = 'MdxPopoverPanel';\n\nexport default PopoverPanel;\n"],"mappings":";;;;;;;;;AAmBA,MAAM,gBAAuC,EAAE,UAAU,YAAY,OAAO,KAAK,UAAU;CACzF,MAAM,CAAC,cAAc,QAAQ,QAAQ,cAAc;EACjD,IAAI;GACF,MAAM,SAAS,IAAI,IAAI,GAAI;GAC3B,MAAM,aAAa,OAAO;GAE1B,IAAI,eAAe;GAEnB,IAAI,UAAU,KACZ,eAAe;GAGjB,IAAI,SAAS,OAAO,SAAS,QAAQ,QAAQ,EAAE;GAC/C,IAAI,CAAC,cAAc,SAAS;GAE5B,OAAO;IAAC;IAAc;IAAQ;GAAU;EAC1C,QAAQ;GACN,OAAO;IAAC;IAAO;IAAK;GAAG;EACzB;CACF,GAAG,CAAC,KAAK,KAAK,CAAC;CAEf,OAAO,cAAc,MACnB,oBAAC,SAAD;EACE,OAAO;EACP,SAAS;EACT,SACE,qBAACA,mBAAD;GAAS,KAAK;GAAd,UAAA,CACE,qBAACA,mBAAD;IACE,YAAA;IACA,WAAW,OAAO;IAClB,KAAK;IACL,SAAS;IACT,eAAe;KACb,OAAO,KAAK,KAAK,QAAQ;IAC3B;IAPF,UAAA,CASE,qBAACA,mBAAD;KAAS,YAAA;KAAW,OAAO;KAAU,KAAK;KAA1C,UAAA,CACE,oBAAC,OAAD;MACE,KAAK,OAAO,SAAS;MACrB,QAAQ;MACR,KAAK,oCAAoC,KAAK;MAC9C,OAAO,EAAE,cAAc,EAAE;MACzB,OAAO;KACR,CAAA,GACD,oBAAC,QAAD;MAAM,WAAW,OAAO;MAAM,UAAA;KAAa,CAAA,CACpC;IACT,CAAA,GAAA,oBAAC,MAAD,EAAM,MAAM,eAAiB,CAAA,CACtB;GACR,CAAA,GAAA,YACM;;EAGV;CACM,CAAA,IAET;AAEJ;AAEA,aAAa,cAAc"}

package/es/node_modules/.pnpm/unist-util-visit@5.1.0/node_modules/unist-util-visit/lib/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../node_modules/.pnpm/unist-util-visit@5.1.0/node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n * @import {VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<any>\n *   ? MatchesOne<Value, Check[number]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqRA,SAAgB,MAAM,MAAM,eAAe,kBAAkB,cAAc;;CAEzE,IAAI;;CAEJ,IAAI;;CAEJ,IAAI;CAEJ,IACE,OAAO,kBAAkB,cACzB,OAAO,qBAAqB,YAC5B;EACA,OAAO,KAAA;EACP,UAAU;EACV,UAAU;CACZ,OAAO;EAEL,OAAO;EAEP,UAAU;EACV,UAAU;CACZ;CAEA,aAAa,MAAM,MAAM,UAAU,OAAO;;;;;CAM1C,SAAS,SAAS,MAAM,SAAS;EAC/B,MAAM,SAAS,QAAQ,QAAQ,SAAS;EACxC,MAAM,QAAQ,SAAS,OAAO,SAAS,QAAQ,IAAI,IAAI,KAAA;EACvD,OAAO,QAAQ,MAAM,OAAO,MAAM;CACpC;AACF"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../../../../../node_modules/.pnpm/unist-util-visit@5.1.0/node_modules/unist-util-visit/lib/index.js"],"sourcesContent":["/**\n * @import {Node as UnistNode, Parent as UnistParent} from 'unist'\n * @import {VisitorResult} from 'unist-util-visit-parents'\n */\n\n/**\n * @typedef {Exclude<import('unist-util-is').Test, undefined> | undefined} Test\n *   Test from `unist-util-is`.\n *\n *   Note: we have remove and add `undefined`, because otherwise when generating\n *   automatic `.d.ts` files, TS tries to flatten paths from a local perspective,\n *   which doesn’t work when publishing on npm.\n */\n\n// To do: use types from `unist-util-visit-parents` when it’s released.\n\n/**\n * @typedef {(\n *   Fn extends (value: any) => value is infer Thing\n *   ? Thing\n *   : Fallback\n * )} Predicate\n *   Get the value of a type guard `Fn`.\n * @template Fn\n *   Value; typically function that is a type guard (such as `(x): x is Y`).\n * @template Fallback\n *   Value to yield if `Fn` is not a type guard.\n */\n\n/**\n * @typedef {(\n *   Check extends null | undefined // No test.\n *   ? Value\n *   : Value extends {type: Check} // String (type) test.\n *   ? Value\n *   : Value extends Check // Partial test.\n *   ? Value\n *   : Check extends Function // Function test.\n *   ? Predicate<Check, Value> extends Value\n *     ? Predicate<Check, Value>\n *     : never\n *   : never // Some other test?\n * )} MatchesOne\n *   Check whether a node matches a primitive check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test, but not arrays.\n */\n\n/**\n * @typedef {(\n *   Check extends ReadonlyArray<any>\n *   ? MatchesOne<Value, Check[number]>\n *   : MatchesOne<Value, Check>\n * )} Matches\n *   Check whether a node matches a check in the type system.\n * @template Value\n *   Value; typically unist `Node`.\n * @template Check\n *   Value; typically `unist-util-is`-compatible test.\n */\n\n/**\n * @typedef {0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10} Uint\n *   Number; capped reasonably.\n */\n\n/**\n * @typedef {I extends 0 ? 1 : I extends 1 ? 2 : I extends 2 ? 3 : I extends 3 ? 4 : I extends 4 ? 5 : I extends 5 ? 6 : I extends 6 ? 7 : I extends 7 ? 8 : I extends 8 ? 9 : 10} Increment\n *   Increment a number in the type system.\n * @template {Uint} [I=0]\n *   Index.\n */\n\n/**\n * @typedef {(\n *   Node extends UnistParent\n *   ? Node extends {children: Array<infer Children>}\n *     ? Child extends Children ? Node : never\n *     : never\n *   : never\n * )} InternalParent\n *   Collect nodes that can be parents of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {InternalParent<InclusiveDescendant<Tree>, Child>} Parent\n *   Collect nodes in `Tree` that can be parents of `Child`.\n * @template {UnistNode} Tree\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n */\n\n/**\n * @typedef {(\n *   Depth extends Max\n *   ? never\n *   :\n *     | InternalParent<Node, Child>\n *     | InternalAncestor<Node, InternalParent<Node, Child>, Max, Increment<Depth>>\n * )} InternalAncestor\n *   Collect nodes in `Tree` that can be ancestors of `Child`.\n * @template {UnistNode} Node\n *   All node types in a tree.\n * @template {UnistNode} Child\n *   Node to search for.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @typedef {(\n *   Tree extends UnistParent\n *     ? Depth extends Max\n *       ? Tree\n *       : Tree | InclusiveDescendant<Tree['children'][number], Max, Increment<Depth>>\n *     : Tree\n * )} InclusiveDescendant\n *   Collect all (inclusive) descendants of `Tree`.\n *\n *   > 👉 **Note**: for performance reasons, this seems to be the fastest way to\n *   > recurse without actually running into an infinite loop, which the\n *   > previous version did.\n *   >\n *   > Practically, a max of `2` is typically enough assuming a `Root` is\n *   > passed, but it doesn’t improve performance.\n *   > It gets higher with `List > ListItem > Table > TableRow > TableCell`.\n *   > Using up to `10` doesn’t hurt or help either.\n * @template {UnistNode} Tree\n *   Tree type.\n * @template {Uint} [Max=10]\n *   Max; searches up to this depth.\n * @template {Uint} [Depth=0]\n *   Current depth.\n */\n\n/**\n * @callback Visitor\n *   Handle a node (matching `test`, if given).\n *\n *   Visitors are free to transform `node`.\n *   They can also transform `parent`.\n *\n *   Replacing `node` itself, if `SKIP` is not returned, still causes its\n *   descendants to be walked (which is a bug).\n *\n *   When adding or removing previous siblings of `node` (or next siblings, in\n *   case of reverse), the `Visitor` should return a new `Index` to specify the\n *   sibling to traverse after `node` is traversed.\n *   Adding or removing next siblings of `node` (or previous siblings, in case\n *   of reverse) is handled as expected without needing to return a new `Index`.\n *\n *   Removing the children property of `parent` still results in them being\n *   traversed.\n * @param {Visited} node\n *   Found node.\n * @param {Visited extends UnistNode ? number | undefined : never} index\n *   Index of `node` in `parent`.\n * @param {Ancestor extends UnistParent ? Ancestor | undefined : never} parent\n *   Parent of `node`.\n * @returns {VisitorResult}\n *   What to do next.\n *\n *   An `Index` is treated as a tuple of `[CONTINUE, Index]`.\n *   An `Action` is treated as a tuple of `[Action]`.\n *\n *   Passing a tuple back only makes sense if the `Action` is `SKIP`.\n *   When the `Action` is `EXIT`, that action can be returned.\n *   When the `Action` is `CONTINUE`, `Index` can be returned.\n * @template {UnistNode} [Visited=UnistNode]\n *   Visited node type.\n * @template {UnistParent} [Ancestor=UnistParent]\n *   Ancestor type.\n */\n\n/**\n * @typedef {Visitor<Visited, Parent<Ancestor, Visited>>} BuildVisitorFromMatch\n *   Build a typed `Visitor` function from a node and all possible parents.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Visited\n *   Node type.\n * @template {UnistParent} Ancestor\n *   Parent type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromMatch<\n *     Matches<Descendant, Check>,\n *     Extract<Descendant, UnistParent>\n *   >\n * )} BuildVisitorFromDescendants\n *   Build a typed `Visitor` function from a list of descendants and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} Descendant\n *   Node type.\n * @template {Test} Check\n *   Test type.\n */\n\n/**\n * @typedef {(\n *   BuildVisitorFromDescendants<\n *     InclusiveDescendant<Tree>,\n *     Check\n *   >\n * )} BuildVisitor\n *   Build a typed `Visitor` function from a tree and a test.\n *\n *   It will infer which values are passed as `node` and which as `parent`.\n * @template {UnistNode} [Tree=UnistNode]\n *   Node type.\n * @template {Test} [Check=Test]\n *   Test type.\n */\n\nimport {visitParents} from 'unist-util-visit-parents'\n\nexport {CONTINUE, EXIT, SKIP} from 'unist-util-visit-parents'\n\n/**\n * Visit nodes.\n *\n * This algorithm performs *depth-first* *tree traversal* in *preorder*\n * (**NLR**) or if `reverse` is given, in *reverse preorder* (**NRL**).\n *\n * You can choose for which nodes `visitor` is called by passing a `test`.\n * For complex tests, you should test yourself in `visitor`, as it will be\n * faster and will have improved type information.\n *\n * Walking the tree is an intensive task.\n * Make use of the return values of the visitor when possible.\n * Instead of walking a tree multiple times, walk it once, use `unist-util-is`\n * to check if a node matches, and then perform different operations.\n *\n * You can change the tree.\n * See `Visitor` for more info.\n *\n * @overload\n * @param {Tree} tree\n * @param {Check} check\n * @param {BuildVisitor<Tree, Check>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @overload\n * @param {Tree} tree\n * @param {BuildVisitor<Tree>} visitor\n * @param {boolean | null | undefined} [reverse]\n * @returns {undefined}\n *\n * @param {UnistNode} tree\n *   Tree to traverse.\n * @param {Visitor | Test} testOrVisitor\n *   `unist-util-is`-compatible test (optional, omit to pass a visitor).\n * @param {Visitor | boolean | null | undefined} [visitorOrReverse]\n *   Handle each node (when test is omitted, pass `reverse`).\n * @param {boolean | null | undefined} [maybeReverse=false]\n *   Traverse in reverse preorder (NRL) instead of the default preorder (NLR).\n * @returns {undefined}\n *   Nothing.\n *\n * @template {UnistNode} Tree\n *   Node type.\n * @template {Test} Check\n *   `unist-util-is`-compatible test.\n */\nexport function visit(tree, testOrVisitor, visitorOrReverse, maybeReverse) {\n  /** @type {boolean | null | undefined} */\n  let reverse\n  /** @type {Test} */\n  let test\n  /** @type {Visitor} */\n  let visitor\n\n  if (\n    typeof testOrVisitor === 'function' &&\n    typeof visitorOrReverse !== 'function'\n  ) {\n    test = undefined\n    visitor = testOrVisitor\n    reverse = visitorOrReverse\n  } else {\n    // @ts-expect-error: assume the overload with test was given.\n    test = testOrVisitor\n    // @ts-expect-error: assume the overload with test was given.\n    visitor = visitorOrReverse\n    reverse = maybeReverse\n  }\n\n  visitParents(tree, test, overload, reverse)\n\n  /**\n   * @param {UnistNode} node\n   * @param {Array<UnistParent>} parents\n   */\n  function overload(node, parents) {\n    const parent = parents[parents.length - 1]\n    const index = parent ? parent.children.indexOf(node) : undefined\n    return visitor(node, index, parent)\n  }\n}\n"],"ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqRA,SAAgB,MAAM,MAAM,eAAe,kBAAkB,cAAc;;CAEzE,IAAI;;CAEJ,IAAI;;CAEJ,IAAI;CAEJ,IACE,OAAO,kBAAkB,cACzB,OAAO,qBAAqB,YAC5B;EACA,OAAO,KAAA;EACP,UAAU;EACV,UAAU;CACZ,OAAO;EAEL,OAAO;EAEP,UAAU;EACV,UAAU;CACZ;CAEA,aAAa,MAAM,MAAM,UAAU,OAAO;;;;;CAM1C,SAAS,SAAS,MAAM,SAAS;EAC/B,MAAM,SAAS,QAAQ,QAAQ,SAAS;EACxC,MAAM,QAAQ,SAAS,OAAO,SAAS,QAAQ,IAAI,IAAI,KAAA;EACvD,OAAO,QAAQ,MAAM,OAAO,MAAM;CACpC;AACF"}

package/es/static-css/baseline.mjs

@@ -7,7 +7,6 @@ const lobeUiAntdBaseline = [
 	"avatar",
 	"button",
 	"collapse",
-	"color-picker",
 	"date-picker",
 	"divider",
 	"drawer",
@@ -18,7 +17,6 @@ const lobeUiAntdBaseline = [
 	"input-textarea",
 	"menu",
 	"modal",
-	"popover",
 	"progress",
 	"segmented",
 	"select",
@@ -27,8 +25,7 @@ const lobeUiAntdBaseline = [
 	"tabs",
 	"tag",
 	"tag-preset",
-	"tag-status",
-	"upload"
+	"tag-status"
 ];
 //#endregion
 export { lobeUiAntdBaseline };

package/es/static-css/baseline.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"baseline.mjs","names":[],"sources":["../../src/static-css/baseline.ts"],"sourcesContent":["import type { AntdProbeName } from './registry';\n\n// The antd components @lobehub/ui internals can render. Kept in sync with the\n// source tree by baseline.test.ts — a failure there means this list must change.\nexport const lobeUiAntdBaseline: AntdProbeName[] = [\n  'alert',\n  'anchor',\n  'app',\n  'auto-complete',\n  'avatar',\n  'button',\n  'collapse',\n  'color-picker',\n  'date-picker',\n  'divider',\n  'drawer',\n  'dropdown',\n  'form',\n  'input',\n  'input-number',\n  'input-textarea',\n  'menu',\n  'modal',\n  'popover',\n  'progress',\n  'segmented',\n  'select',\n  'slider',\n  'space',\n  'tabs',\n  'tag',\n  'tag-preset',\n  'tag-status',\n  'upload',\n];\n"],"mappings":";AAIA,MAAa,qBAAsC;CACjD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF"}
+{"version":3,"file":"baseline.mjs","names":[],"sources":["../../src/static-css/baseline.ts"],"sourcesContent":["import type { AntdProbeName } from './registry';\n\n// The antd components @lobehub/ui internals can render. Kept in sync with the\n// source tree by baseline.test.ts — a failure there means this list must change.\nexport const lobeUiAntdBaseline: AntdProbeName[] = [\n  'alert',\n  'anchor',\n  'app',\n  'auto-complete',\n  'avatar',\n  'button',\n  'collapse',\n  'date-picker',\n  'divider',\n  'drawer',\n  'dropdown',\n  'form',\n  'input',\n  'input-number',\n  'input-textarea',\n  'menu',\n  'modal',\n  'progress',\n  'segmented',\n  'select',\n  'slider',\n  'space',\n  'tabs',\n  'tag',\n  'tag-preset',\n  'tag-status',\n];\n"],"mappings":";AAIA,MAAa,qBAAsC;CACjD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF"}

package/es/static-css/buildAntdStaticCss.mjs

@@ -5,8 +5,8 @@ import { antdProbeNames, antdProbeRegistry, expandComponentsToProbes } from "./r
 import { scanAntdUsage } from "./scan.mjs";
 import { styleKeysOf } from "./shared.mjs";
 import { createElement } from "react";
-import { ConfigProvider, theme } from "antd";
 import { StyleProvider } from "antd-style";
+import { ConfigProvider, theme } from "antd";
 import { createCache, extractStyle } from "@ant-design/cssinjs";
 import { renderToString } from "react-dom/server";
 //#region src/static-css/buildAntdStaticCss.ts

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lobehub/ui",
-  "version": "5.51.2",
+  "version": "5.53.0",
   "description": "Lobe UI is an open-source UI component library for building AIGC web apps",
   "keywords": [
     "lobehub",
@@ -161,6 +161,7 @@
     "@shikijs/stream": "^4.3.1",
     "@shikijs/transformers": "^4.3.1",
     "@splinetool/runtime": "1.12.98",
+    "@tanstack/react-table": "^9.2.4",
     "ahooks": "^3.9.7",
     "antd-style": "^4.1.0",
     "beautiful-mermaid": "^1.1.3",
@@ -213,6 +214,7 @@
     "ts-md5": "^2.0.1",
     "unified": "^11.0.5",
     "unist-util-visit-parents": "^6.0.2",
+    "uqr": "^0.1.3",
     "url-join": "^5.0.0",
     "use-merge-value": "^1.2.0",
     "uuid": "^14.0.1",