@cloudcome/utils-core 1.1.1 → 1.2.0

package/{src/tree.ts → dist/tree.d.ts}

@@ -1,68 +1,57 @@
-import { arrayEach } from './array';
-import { isArray, isNullish, isUndefined } from './type';
-import type { AnyObject } from './types';
-
+import { AnyObject } from './types';
 /**
  * 表示深度遍历中的节点对象，包含子节点列表。
  */
 export type TTreeItem = AnyObject & {
-  /**
-   * 子节点列表。
-   */
-  children?: TTreeItem[];
+    /**
+     * 子节点列表。
+     */
+    children?: TTreeItem[];
 };
-
 /**
  * 表示深度遍历中的节点列表。
  *
  * @template I - 节点对象的类型，必须继承自 `TreeItem`。
  */
 export type TTreeList<I extends TTreeItem> = I[];
-
 /**
  * 表示深度遍历中的遍历器状态。
  *
  * @template I - 节点对象的类型，必须继承自 `TreeItem`。
  */
 export type TTreeWalker<I extends TTreeItem> = {
-  /**
-   * 当前层级的节点列表。
-   */
-  list: TTreeList<I>;
-
-  /**
-   * 当前节点的父节点，如果为根节点则为 `null`。
-   */
-  parent: I | null;
-
-  /**
-   * 当前节点的层级，从 1 开始计数。
-   */
-  level: number;
-
-  /**
-   * 从根节点到当前节点的路径。
-   */
-  path: TTreeList<I>;
+    /**
+     * 当前层级的节点列表。
+     */
+    list: TTreeList<I>;
+    /**
+     * 当前节点的父节点，如果为根节点则为 `null`。
+     */
+    parent: I | null;
+    /**
+     * 当前节点的层级，从 1 开始计数。
+     */
+    level: number;
+    /**
+     * 从根节点到当前节点的路径。
+     */
+    path: TTreeList<I>;
 };
-
 /**
  * 表示深度遍历中的节点信息。
  *
  * @template I - 节点对象的类型，必须继承自 `TreeItem`。
  */
 export type TTreeInfo<I extends TTreeItem> = TTreeWalker<I> & {
-  /**
-   * 当前节点。
-   */
-  item: I;
-
-  /**
-   * 当前节点在 `list` 中的索引。
-   */
-  index: number;
+    /**
+     * 当前节点。
+     */
+    item: I;
+    /**
+     * 当前节点在 `list` 中的索引。
+     */
+    index: number;
 };
-
 /**
  * 深度遍历的同步迭代器函数类型。
  *
@@ -71,7 +60,6 @@ export type TTreeInfo<I extends TTreeItem> = TTreeWalker<I> & {
  * @returns 如果返回 `false`，则提前终止遍历。
  */
 export type TreeEachIterator<I extends TTreeItem> = (info: TTreeInfo<I>) => false | unknown;
-
 /**
  * 深度遍历的异步迭代器函数类型。
  *
@@ -80,7 +68,6 @@ export type TreeEachIterator<I extends TTreeItem> = (info: TTreeInfo<I>) => fals
  * @returns 如果返回 `false`，则提前终止遍历。
  */
 export type TreeEachIteratorAsync<I extends TTreeItem> = (info: TTreeInfo<I>) => Promise<boolean | unknown>;
-
 /**
  * 深度遍历的同步遍历器函数类型。
  *
@@ -89,7 +76,6 @@ export type TreeEachIteratorAsync<I extends TTreeItem> = (info: TTreeInfo<I>) =>
  * @returns 遍历结果。
  */
 export type TreeWalk<I extends TTreeItem> = (walker: TTreeWalker<I>) => unknown;
-
 /**
  * 深度遍历的异步遍历器函数类型。
  *
@@ -98,7 +84,6 @@ export type TreeWalk<I extends TTreeItem> = (walker: TTreeWalker<I>) => unknown;
  * @returns 异步遍历结果。
  */
 export type TreeWalkAsync<I extends TTreeItem> = (walker: TTreeWalker<I>) => Promise<unknown>;
-
 /**
  * 深度遍历数组中的每个元素，并对每个元素执行提供的回调函数。
  *
@@ -120,90 +105,7 @@ export type TreeWalkAsync<I extends TTreeItem> = (walker: TTreeWalker<I>) => Pro
  * });
  * ```
  */
-export function treeEach<I extends TTreeItem = TTreeItem>(
-  treeList: TTreeList<I>,
-  iterator: TreeEachIterator<I>,
-  breadthFist = false,
-): void {
-  const treeInfoList: TTreeInfo<I>[] = [];
-  let returnFalse = false;
-
-  const iterate = (info: TTreeInfo<I>) => {
-    if (iterator(info) === false) {
-      returnFalse = true;
-      return false;
-    }
-  };
-
-  const next = (info: TTreeInfo<I>, walk: TreeWalk<I>) => {
-    const { item, level, parent, path } = info;
-    const { children } = item;
-
-    if (isArray(children)) {
-      returnFalse =
-        walk({
-          ...info,
-          parent: item,
-          list: children as TTreeList<I>,
-          level: level + 1,
-        }) === false;
-    }
-  };
-
-  const walk: TreeWalk<I> = (walker) => {
-    const { list, level, parent, path } = walker;
-
-    const path2 = [...path];
-    while (parent !== null && path2.length > 0 && path2[path2.length - 1] !== parent) {
-      path2.pop();
-    }
-
-    arrayEach(list, (item, index) => {
-      if (returnFalse) return false;
-
-      const info: TTreeInfo<I> = {
-        ...walker,
-        item,
-        index,
-        path: [...path2, item],
-      };
-
-      // 广度优先
-      if (breadthFist) {
-        treeInfoList.push(info);
-      }
-      // 深度优先
-      else {
-        iterate(info);
-        if (returnFalse) return false;
-        next(info, walk);
-      }
-    });
-
-    if (breadthFist) {
-      while (!returnFalse) {
-        const info = treeInfoList.shift();
-        if (!info) break;
-
-        iterate(info);
-        if (returnFalse) break;
-
-        // 内部也会进入 walk
-        next(info, walk);
-      }
-    }
-
-    return !returnFalse;
-  };
-
-  walk({
-    list: treeList,
-    level: 1,
-    parent: null,
-    path: [],
-  });
-}
-
+export declare function treeEach<I extends TTreeItem = TTreeItem>(treeList: TTreeList<I>, iterator: TreeEachIterator<I>, breadthFist?: boolean): void;
 /**
  * 在深度数组中查找满足条件的第一个节点信息。
  *
@@ -231,27 +133,7 @@ export function treeEach<I extends TTreeItem = TTreeItem>(
  * // }
  * ```
  */
-export function treeFind<I extends TTreeItem>(
-  treeList: TTreeList<I>,
-  predicate: (info: TTreeInfo<I>) => boolean,
-  breadthFist = false,
-): TTreeInfo<I> | undefined {
-  let found: TTreeInfo<I> | undefined;
-
-  treeEach(
-    treeList,
-    (info) => {
-      if (predicate(info)) {
-        found = info;
-        return false;
-      }
-    },
-    breadthFist,
-  );
-
-  return found;
-}
-
+export declare function treeFind<I extends TTreeItem>(treeList: TTreeList<I>, predicate: (info: TTreeInfo<I>) => boolean, breadthFist?: boolean): TTreeInfo<I> | undefined;
 /**
  * 将深度嵌套的树形结构扁平化为一维数组，并对每个节点执行指定的转换函数。
  *
@@ -272,37 +154,18 @@ export function treeFind<I extends TTreeItem>(
  * console.log(flattened); // [1, 2, 3, 4]
  * ```
  */
-export function deepFlat<I extends TTreeItem, T>(
-  deepList: TTreeList<I>,
-  flatten: (info: TTreeInfo<I>) => T,
-  breadthFist = false,
-): T[] {
-  const list2: T[] = [];
-
-  treeEach(
-    deepList,
-    (info) => {
-      list2.push(flatten(info));
-    },
-    breadthFist,
-  );
-
-  return list2;
-}
-
+export declare function deepFlat<I extends TTreeItem, T>(deepList: TTreeList<I>, flatten: (info: TTreeInfo<I>) => T, breadthFist?: boolean): T[];
 type FromItemInfo<I> = {
-  selfKey: unknown;
-  parentKey: unknown;
-  item: I;
-  index: number;
+    selfKey: unknown;
+    parentKey: unknown;
+    item: I;
+    index: number;
 };
-
 export type TTreeFromOptions<I extends TTreeItem> = {
-  getSelfKey: (item: I, index: number) => unknown;
-  getParentKey: (item: I, index: number) => unknown;
-  appendChild: (parentInfo: FromItemInfo<I>, info: FromItemInfo<I>) => unknown;
+    getSelfKey: (item: I, index: number) => unknown;
+    getParentKey: (item: I, index: number) => unknown;
+    appendChild: (parentInfo: FromItemInfo<I>, info: FromItemInfo<I>) => unknown;
 };
-
 /**
  * 从扁平列表构建树形结构。
  *
@@ -343,52 +206,5 @@ export type TTreeFromOptions<I extends TTreeItem> = {
  * // }
  * ```
  */
-export function treeFrom<I extends TTreeItem>(list: I[], options: TTreeFromOptions<I>): TTreeList<I> | undefined {
-  const keyMap = new Map<unknown, FromItemInfo<I>>();
-  const freeSet = new Set<FromItemInfo<I>>();
-  const roots: TTreeList<I> = [];
-
-  // 分配节点
-  const assign = (info: FromItemInfo<I>, isFirst = false) => {
-    const { selfKey, parentKey, item, index } = info;
-
-    // 父级指向为空
-    if (isNullish(parentKey)) {
-      roots.push(item);
-    }
-    // 父级指向不为空
-    else {
-      const parent = keyMap.get(parentKey);
-
-      // 未找到父级节点
-      if (isUndefined(parent)) {
-        // 游离节点
-        if (isFirst) freeSet.add(info);
-      }
-      // 已找到父级节点
-      else {
-        options.appendChild(parent, info);
-      }
-    }
-  };
-
-  // 构建 map
-  arrayEach(list, (item, index) => {
-    const selfKey = options.getSelfKey(item, index);
-    const parentKey = options.getParentKey(item, index);
-
-    if (isNullish(selfKey)) return;
-
-    const info = { selfKey, parentKey, item, index };
-    keyMap.set(selfKey, info);
-
-    assign(info, true);
-  });
-
-  // 处理游离节点
-  for (const info of freeSet.values()) {
-    assign(info);
-  }
-
-  return roots;
-}
+export declare function treeFrom<I extends TTreeItem>(list: I[], options: TTreeFromOptions<I>): TTreeList<I> | undefined;
+export {};

package/dist/tree.mjs

@@ -0,0 +1,125 @@
+import { arrayEach } from "./array.mjs";
+import { isNullish, isUndefined, isArray } from "./type.mjs";
+function treeEach(treeList, iterator, breadthFist = false) {
+  const treeInfoList = [];
+  let returnFalse = false;
+  const iterate = (info) => {
+    if (iterator(info) === false) {
+      returnFalse = true;
+      return false;
+    }
+  };
+  const next = (info, walk2) => {
+    const { item, level, parent, path } = info;
+    const { children } = item;
+    if (isArray(children)) {
+      returnFalse = walk2({
+        ...info,
+        parent: item,
+        list: children,
+        level: level + 1
+      }) === false;
+    }
+  };
+  const walk = (walker) => {
+    const { list, level, parent, path } = walker;
+    const path2 = [...path];
+    while (parent !== null && path2.length > 0 && path2[path2.length - 1] !== parent) {
+      path2.pop();
+    }
+    arrayEach(list, (item, index) => {
+      if (returnFalse) return false;
+      const info = {
+        ...walker,
+        item,
+        index,
+        path: [...path2, item]
+      };
+      if (breadthFist) {
+        treeInfoList.push(info);
+      } else {
+        iterate(info);
+        if (returnFalse) return false;
+        next(info, walk);
+      }
+    });
+    if (breadthFist) {
+      while (!returnFalse) {
+        const info = treeInfoList.shift();
+        if (!info) break;
+        iterate(info);
+        if (returnFalse) break;
+        next(info, walk);
+      }
+    }
+    return !returnFalse;
+  };
+  walk({
+    list: treeList,
+    level: 1,
+    parent: null,
+    path: []
+  });
+}
+function treeFind(treeList, predicate, breadthFist = false) {
+  let found;
+  treeEach(
+    treeList,
+    (info) => {
+      if (predicate(info)) {
+        found = info;
+        return false;
+      }
+    },
+    breadthFist
+  );
+  return found;
+}
+function deepFlat(deepList, flatten, breadthFist = false) {
+  const list2 = [];
+  treeEach(
+    deepList,
+    (info) => {
+      list2.push(flatten(info));
+    },
+    breadthFist
+  );
+  return list2;
+}
+function treeFrom(list, options) {
+  const keyMap = /* @__PURE__ */ new Map();
+  const freeSet = /* @__PURE__ */ new Set();
+  const roots = [];
+  const assign = (info, isFirst = false) => {
+    const { selfKey, parentKey, item, index } = info;
+    if (isNullish(parentKey)) {
+      roots.push(item);
+    } else {
+      const parent = keyMap.get(parentKey);
+      if (isUndefined(parent)) {
+        if (isFirst) freeSet.add(info);
+      } else {
+        options.appendChild(parent, info);
+      }
+    }
+  };
+  arrayEach(list, (item, index) => {
+    const selfKey = options.getSelfKey(item, index);
+    const parentKey = options.getParentKey(item, index);
+    if (isNullish(selfKey)) return;
+    const info = { selfKey, parentKey, item, index };
+    keyMap.set(selfKey, info);
+    assign(info, true);
+  });
+  for (const info of freeSet.values()) {
+    assign(info);
+  }
+  return roots;
+}
+export {
+  deepFlat,
+  treeEach,
+  treeFind,
+  treeFrom
+};
+//# sourceMappingURL=tree.mjs.map

package/dist/tree.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.mjs","sources":["../src/tree.ts"],"sourcesContent":["import { arrayEach } from './array';\nimport { isArray, isNullish, isUndefined } from './type';\nimport type { AnyObject } from './types';\n\n/**\n * 表示深度遍历中的节点对象，包含子节点列表。\n */\nexport type TTreeItem = AnyObject & {\n  /**\n   * 子节点列表。\n   */\n  children?: TTreeItem[];\n};\n\n/**\n * 表示深度遍历中的节点列表。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n */\nexport type TTreeList<I extends TTreeItem> = I[];\n\n/**\n * 表示深度遍历中的遍历器状态。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n */\nexport type TTreeWalker<I extends TTreeItem> = {\n  /**\n   * 当前层级的节点列表。\n   */\n  list: TTreeList<I>;\n\n  /**\n   * 当前节点的父节点，如果为根节点则为 `null`。\n   */\n  parent: I | null;\n\n  /**\n   * 当前节点的层级，从 1 开始计数。\n   */\n  level: number;\n\n  /**\n   * 从根节点到当前节点的路径。\n   */\n  path: TTreeList<I>;\n};\n\n/**\n * 表示深度遍历中的节点信息。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n */\nexport type TTreeInfo<I extends TTreeItem> = TTreeWalker<I> & {\n  /**\n   * 当前节点。\n   */\n  item: I;\n\n  /**\n   * 当前节点在 `list` 中的索引。\n   */\n  index: number;\n};\n\n/**\n * 深度遍历的同步迭代器函数类型。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n * @param info - 当前节点的信息。\n * @returns 如果返回 `false`，则提前终止遍历。\n */\nexport type TreeEachIterator<I extends TTreeItem> = (info: TTreeInfo<I>) => false | unknown;\n\n/**\n * 深度遍历的异步迭代器函数类型。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n * @param info - 当前节点的信息。\n * @returns 如果返回 `false`，则提前终止遍历。\n */\nexport type TreeEachIteratorAsync<I extends TTreeItem> = (info: TTreeInfo<I>) => Promise<boolean | unknown>;\n\n/**\n * 深度遍历的同步遍历器函数类型。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n * @param walker - 遍历器状态。\n * @returns 遍历结果。\n */\nexport type TreeWalk<I extends TTreeItem> = (walker: TTreeWalker<I>) => unknown;\n\n/**\n * 深度遍历的异步遍历器函数类型。\n *\n * @template I - 节点对象的类型，必须继承自 `TreeItem`。\n * @param walker - 遍历器状态。\n * @returns 异步遍历结果。\n */\nexport type TreeWalkAsync<I extends TTreeItem> = (walker: TTreeWalker<I>) => Promise<unknown>;\n\n/**\n * 深度遍历数组中的每个元素，并对每个元素执行提供的回调函数。\n *\n * @param treeList - 要遍历的深度数组。\n * @param iterator - 对每个元素执行的回调函数。如果回调函数返回 `false`，则提前终止遍历。\n * @param breadthFist - 是否使用广度优先遍历，默认为 `false`（深度优先）。\n * @returns 无返回值。\n *\n * @example\n * ```typescript\n * const treeList = [\n *   { value: 1, children: [{ value: 2 }, { value: 3 }] },\n *   { value: 4 }\n * ];\n *\n * treeEach(treeList, (item) => {\n *   console.log(item.value);\n *   if (item.value === 2) return false; // 提前终止遍历\n * });\n * ```\n */\nexport function treeEach<I extends TTreeItem = TTreeItem>(\n  treeList: TTreeList<I>,\n  iterator: TreeEachIterator<I>,\n  breadthFist = false,\n): void {\n  const treeInfoList: TTreeInfo<I>[] = [];\n  let returnFalse = false;\n\n  const iterate = (info: TTreeInfo<I>) => {\n    if (iterator(info) === false) {\n      returnFalse = true;\n      return false;\n    }\n  };\n\n  const next = (info: TTreeInfo<I>, walk: TreeWalk<I>) => {\n    const { item, level, parent, path } = info;\n    const { children } = item;\n\n    if (isArray(children)) {\n      returnFalse =\n        walk({\n          ...info,\n          parent: item,\n          list: children as TTreeList<I>,\n          level: level + 1,\n        }) === false;\n    }\n  };\n\n  const walk: TreeWalk<I> = (walker) => {\n    const { list, level, parent, path } = walker;\n\n    const path2 = [...path];\n    while (parent !== null && path2.length > 0 && path2[path2.length - 1] !== parent) {\n      path2.pop();\n    }\n\n    arrayEach(list, (item, index) => {\n      if (returnFalse) return false;\n\n      const info: TTreeInfo<I> = {\n        ...walker,\n        item,\n        index,\n        path: [...path2, item],\n      };\n\n      // 广度优先\n      if (breadthFist) {\n        treeInfoList.push(info);\n      }\n      // 深度优先\n      else {\n        iterate(info);\n        if (returnFalse) return false;\n        next(info, walk);\n      }\n    });\n\n    if (breadthFist) {\n      while (!returnFalse) {\n        const info = treeInfoList.shift();\n        if (!info) break;\n\n        iterate(info);\n        if (returnFalse) break;\n\n        // 内部也会进入 walk\n        next(info, walk);\n      }\n    }\n\n    return !returnFalse;\n  };\n\n  walk({\n    list: treeList,\n    level: 1,\n    parent: null,\n    path: [],\n  });\n}\n\n/**\n * 在深度数组中查找满足条件的第一个节点信息。\n *\n * @param treeList - 要查找的深度数组。\n * @param predicate - 判断节点是否满足条件的回调函数。\n * @param breadthFist - 是否使用广度优先查找，默认为 `false`（深度优先）。\n * @returns 如果找到满足条件的节点，则返回该节点的信息；否则返回 `undefined`。\n *\n * @example\n * ```typescript\n * const treeList = [\n *   { value: 1, children: [{ value: 2 }, { value: 3 }] },\n *   { value: 4 }\n * ];\n *\n * const found = treeFind(treeList, (info) => info.item.value === 3);\n * console.log(found);\n * // {\n * //    item: { value: 3 },\n * //    index: 1,\n * //    list: [{ value: 2 }, { value: 3 }],\n * //    parent: { value: 1, children: [{ value: 2 }, { value: 3 }] },\n * //    level: 2,\n * //    path: [{ value: 1, children: [{ value: 2 }, { value: 3 }] }, { value: 3 }]\n * // }\n * ```\n */\nexport function treeFind<I extends TTreeItem>(\n  treeList: TTreeList<I>,\n  predicate: (info: TTreeInfo<I>) => boolean,\n  breadthFist = false,\n): TTreeInfo<I> | undefined {\n  let found: TTreeInfo<I> | undefined;\n\n  treeEach(\n    treeList,\n    (info) => {\n      if (predicate(info)) {\n        found = info;\n        return false;\n      }\n    },\n    breadthFist,\n  );\n\n  return found;\n}\n\n/**\n * 将深度嵌套的树形结构扁平化为一维数组，并对每个节点执行指定的转换函数。\n *\n * @template I - 树节点的类型，必须继承自 `TreeItem`。\n * @template T - 转换后的数据类型。\n * @param {TTreeList<I>} deepList - 要扁平化的深度嵌套树形结构。\n * @param {(info: TTreeInfo<I>) => T} flatten - 对每个节点执行的转换函数，返回转换后的数据。\n * @param {boolean} [breadthFist=false] - 是否使用广度优先遍历，默认为 `false`（深度优先）。\n * @returns {T[]} - 转换后的一维数组。\n * @example\n * ```typescript\n * const treeList = [\n *   { value: 1, children: [{ value: 2 }, { value: 3 }] },\n *   { value: 4 }\n * ];\n *\n * const flattened = deepFlat(treeList, (info) => info.item.value);\n * console.log(flattened); // [1, 2, 3, 4]\n * ```\n */\nexport function deepFlat<I extends TTreeItem, T>(\n  deepList: TTreeList<I>,\n  flatten: (info: TTreeInfo<I>) => T,\n  breadthFist = false,\n): T[] {\n  const list2: T[] = [];\n\n  treeEach(\n    deepList,\n    (info) => {\n      list2.push(flatten(info));\n    },\n    breadthFist,\n  );\n\n  return list2;\n}\n\ntype FromItemInfo<I> = {\n  selfKey: unknown;\n  parentKey: unknown;\n  item: I;\n  index: number;\n};\n\nexport type TTreeFromOptions<I extends TTreeItem> = {\n  getSelfKey: (item: I, index: number) => unknown;\n  getParentKey: (item: I, index: number) => unknown;\n  appendChild: (parentInfo: FromItemInfo<I>, info: FromItemInfo<I>) => unknown;\n};\n\n/**\n * 从扁平列表构建树形结构。\n *\n * @template I - 节点对象的类型，必须继承自 `AnyObject`。\n * @param {I[]} list - 扁平化的节点列表。\n * @param {TTreeFromOptions<I>} options - 构建树形结构的配置选项。\n * @param {function} options.getSelfKey - 获取节点自身唯一标识的函数。\n * @param {function} options.getParentKey - 获取节点父节点唯一标识的函数。\n * @param {function} options.appendChild - 将子节点添加到父节点的函数。\n * @returns {I | undefined} - 构建的树形结构的根节点，如果未找到根节点则返回 `undefined`。\n *\n * @example\n * ```typescript\n * const list = [\n *   { id: 1, parentId: null, name: 'Root' },\n *   { id: 2, parentId: 1, name: 'Child 1' },\n *   { id: 3, parentId: 1, name: 'Child 2' }\n * ];\n *\n * const tree = treeFrom(list, {\n *   getSelfKey: (item) => item.id,\n *   getParentKey: (item) => item.parentId,\n *   appendChild: (parent, info) => {\n *     if (!parent.children) parent.children = [];\n *     parent.children.push(info.item);\n *   }\n * });\n *\n * console.log(tree);\n * // {\n * //   id: 1,\n * //   parentId: null,\n * //   name: 'Root',\n * //   children: [\n * //     { id: 2, parentId: 1, name: 'Child 1' },\n * //     { id: 3, parentId: 1, name: 'Child 2' }\n * //   ]\n * // }\n * ```\n */\nexport function treeFrom<I extends TTreeItem>(list: I[], options: TTreeFromOptions<I>): TTreeList<I> | undefined {\n  const keyMap = new Map<unknown, FromItemInfo<I>>();\n  const freeSet = new Set<FromItemInfo<I>>();\n  const roots: TTreeList<I> = [];\n\n  // 分配节点\n  const assign = (info: FromItemInfo<I>, isFirst = false) => {\n    const { selfKey, parentKey, item, index } = info;\n\n    // 父级指向为空\n    if (isNullish(parentKey)) {\n      roots.push(item);\n    }\n    // 父级指向不为空\n    else {\n      const parent = keyMap.get(parentKey);\n\n      // 未找到父级节点\n      if (isUndefined(parent)) {\n        // 游离节点\n        if (isFirst) freeSet.add(info);\n      }\n      // 已找到父级节点\n      else {\n        options.appendChild(parent, info);\n      }\n    }\n  };\n\n  // 构建 map\n  arrayEach(list, (item, index) => {\n    const selfKey = options.getSelfKey(item, index);\n    const parentKey = options.getParentKey(item, index);\n\n    if (isNullish(selfKey)) return;\n\n    const info = { selfKey, parentKey, item, index };\n    keyMap.set(selfKey, info);\n\n    assign(info, true);\n  });\n\n  // 处理游离节点\n  for (const info of freeSet.values()) {\n    assign(info);\n  }\n\n  return roots;\n}\n"],"names":["walk"],"mappings":";;AA0HO,SAAS,SACd,UACA,UACA,cAAc,OACR;AACN,QAAM,eAA+B,CAAC;AACtC,MAAI,cAAc;AAEZ,QAAA,UAAU,CAAC,SAAuB;AAClC,QAAA,SAAS,IAAI,MAAM,OAAO;AACd,oBAAA;AACP,aAAA;AAAA,IAAA;AAAA,EAEX;AAEM,QAAA,OAAO,CAAC,MAAoBA,UAAsB;AACtD,UAAM,EAAE,MAAM,OAAO,QAAQ,KAAS,IAAA;AAChC,UAAA,EAAE,aAAa;AAEjB,QAAA,QAAQ,QAAQ,GAAG;AACrB,oBACEA,MAAK;AAAA,QACH,GAAG;AAAA,QACH,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,OAAO,QAAQ;AAAA,MAChB,CAAA,MAAM;AAAA,IAAA;AAAA,EAEb;AAEM,QAAA,OAAoB,CAAC,WAAW;AACpC,UAAM,EAAE,MAAM,OAAO,QAAQ,KAAS,IAAA;AAEhC,UAAA,QAAQ,CAAC,GAAG,IAAI;AACf,WAAA,WAAW,QAAQ,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,CAAC,MAAM,QAAQ;AAChF,YAAM,IAAI;AAAA,IAAA;AAGF,cAAA,MAAM,CAAC,MAAM,UAAU;AAC/B,UAAI,YAAoB,QAAA;AAExB,YAAM,OAAqB;AAAA,QACzB,GAAG;AAAA,QACH;AAAA,QACA;AAAA,QACA,MAAM,CAAC,GAAG,OAAO,IAAI;AAAA,MACvB;AAGA,UAAI,aAAa;AACf,qBAAa,KAAK,IAAI;AAAA,MAAA,OAGnB;AACH,gBAAQ,IAAI;AACZ,YAAI,YAAoB,QAAA;AACxB,aAAK,MAAM,IAAI;AAAA,MAAA;AAAA,IACjB,CACD;AAED,QAAI,aAAa;AACf,aAAO,CAAC,aAAa;AACb,cAAA,OAAO,aAAa,MAAM;AAChC,YAAI,CAAC,KAAM;AAEX,gBAAQ,IAAI;AACZ,YAAI,YAAa;AAGjB,aAAK,MAAM,IAAI;AAAA,MAAA;AAAA,IACjB;AAGF,WAAO,CAAC;AAAA,EACV;AAEK,OAAA;AAAA,IACH,MAAM;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,MAAM,CAAA;AAAA,EAAC,CACR;AACH;AA6BO,SAAS,SACd,UACA,WACA,cAAc,OACY;AACtB,MAAA;AAEJ;AAAA,IACE;AAAA,IACA,CAAC,SAAS;AACJ,UAAA,UAAU,IAAI,GAAG;AACX,gBAAA;AACD,eAAA;AAAA,MAAA;AAAA,IAEX;AAAA,IACA;AAAA,EACF;AAEO,SAAA;AACT;AAsBO,SAAS,SACd,UACA,SACA,cAAc,OACT;AACL,QAAM,QAAa,CAAC;AAEpB;AAAA,IACE;AAAA,IACA,CAAC,SAAS;AACF,YAAA,KAAK,QAAQ,IAAI,CAAC;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AAEO,SAAA;AACT;AAuDgB,SAAA,SAA8B,MAAW,SAAwD;AACzG,QAAA,6BAAa,IAA8B;AAC3C,QAAA,8BAAc,IAAqB;AACzC,QAAM,QAAsB,CAAC;AAG7B,QAAM,SAAS,CAAC,MAAuB,UAAU,UAAU;AACzD,UAAM,EAAE,SAAS,WAAW,MAAM,MAAU,IAAA;AAGxC,QAAA,UAAU,SAAS,GAAG;AACxB,YAAM,KAAK,IAAI;AAAA,IAAA,OAGZ;AACG,YAAA,SAAS,OAAO,IAAI,SAAS;AAG/B,UAAA,YAAY,MAAM,GAAG;AAEnB,YAAA,QAAiB,SAAA,IAAI,IAAI;AAAA,MAAA,OAG1B;AACK,gBAAA,YAAY,QAAQ,IAAI;AAAA,MAAA;AAAA,IAClC;AAAA,EAEJ;AAGU,YAAA,MAAM,CAAC,MAAM,UAAU;AAC/B,UAAM,UAAU,QAAQ,WAAW,MAAM,KAAK;AAC9C,UAAM,YAAY,QAAQ,aAAa,MAAM,KAAK;AAE9C,QAAA,UAAU,OAAO,EAAG;AAExB,UAAM,OAAO,EAAE,SAAS,WAAW,MAAM,MAAM;AACxC,WAAA,IAAI,SAAS,IAAI;AAExB,WAAO,MAAM,IAAI;AAAA,EAAA,CAClB;AAGU,aAAA,QAAQ,QAAQ,UAAU;AACnC,WAAO,IAAI;AAAA,EAAA;AAGN,SAAA;AACT;"}

package/dist/type.cjs

@@ -0,0 +1,78 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function typeIs(unknown) {
+  return Object.prototype.toString.call(unknown).slice(8, -1).toLowerCase();
+}
+function isString(unknown) {
+  return typeof unknown === "string";
+}
+function isBoolean(unknown) {
+  return typeof unknown === "boolean";
+}
+function isSymbol(unknown) {
+  return typeof unknown === "symbol";
+}
+function isBigInt(unknown) {
+  return typeof unknown === "bigint";
+}
+function isNumber(unknown) {
+  return typeof unknown === "number" && !Number.isNaN(unknown);
+}
+function isUndefined(unknown) {
+  return typeof unknown === "undefined";
+}
+function isVoid(unknown) {
+  return isUndefined(unknown);
+}
+function isNever(unknown) {
+}
+function isNull(unknown) {
+  return unknown === null;
+}
+function isNullish(unknown) {
+  return isNull(unknown) || isUndefined(unknown) || isVoid(unknown);
+}
+function isPrimitive(unknown) {
+  return isNull(unknown) || !(typeof unknown === "object" || typeof unknown === "function");
+}
+function isObject(unknown) {
+  return typeIs(unknown) === "object";
+}
+function isArray(unknown) {
+  return Array.isArray(unknown);
+}
+function isFunction(unknown) {
+  return typeof unknown === "function";
+}
+function isAsyncFunction(unknown) {
+  return isFunction(unknown) && unknown.constructor.name === "AsyncFunction";
+}
+function isError(unknown) {
+  return unknown instanceof Error;
+}
+function isPromise(unknown) {
+  return typeIs(unknown) === "promise";
+}
+function isDate(unknown) {
+  return unknown instanceof Date;
+}
+exports.isArray = isArray;
+exports.isAsyncFunction = isAsyncFunction;
+exports.isBigInt = isBigInt;
+exports.isBoolean = isBoolean;
+exports.isDate = isDate;
+exports.isError = isError;
+exports.isFunction = isFunction;
+exports.isNever = isNever;
+exports.isNull = isNull;
+exports.isNullish = isNullish;
+exports.isNumber = isNumber;
+exports.isObject = isObject;
+exports.isPrimitive = isPrimitive;
+exports.isPromise = isPromise;
+exports.isString = isString;
+exports.isSymbol = isSymbol;
+exports.isUndefined = isUndefined;
+exports.isVoid = isVoid;
+exports.typeIs = typeIs;
+//# sourceMappingURL=type.cjs.map

package/dist/type.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"type.cjs","sources":["../src/type.ts"],"sourcesContent":["import type { AnyArray, AnyAsyncFunction, AnyFunction, AnyObject } from './types';\n\n/**\n * 获取未知类型的类型名称\n * @param unknown - 未知类型的值\n * @returns 类型名称字符串\n */\nexport function typeIs(\n  unknown: unknown,\n):\n  | 'string'\n  | 'number'\n  | 'boolean'\n  | 'object'\n  | 'array'\n  | 'function'\n  | 'null'\n  | 'undefined'\n  | 'symbol'\n  | 'bigint'\n  | 'error'\n  | 'promise'\n  | string {\n  return Object.prototype.toString.call(unknown).slice(8, -1).toLowerCase();\n}\n\n/**\n * 检查值是否为字符串\n * @param unknown - 未知类型的值\n * @returns 如果值为字符串则返回 true，否则返回 false\n */\nexport function isString(unknown: unknown): unknown is string {\n  return typeof unknown === 'string';\n}\n\n/**\n * 检查值是否为布尔值\n * @param unknown - 未知类型的值\n * @returns 如果值为布尔值则返回 true，否则返回 false\n */\nexport function isBoolean(unknown: unknown): unknown is boolean {\n  return typeof unknown === 'boolean';\n}\n\n/**\n * 检查值是否为符号\n * @param unknown - 未知类型的值\n * @returns 如果值为符号则返回 true，否则返回 false\n */\nexport function isSymbol(unknown: unknown): unknown is symbol {\n  return typeof unknown === 'symbol';\n}\n\n/**\n * 检查值是否为大整数\n * @param unknown - 未知类型的值\n * @returns 如果值为大整数则返回 true，否则返回 false\n */\nexport function isBigInt(unknown: unknown): unknown is bigint {\n  return typeof unknown === 'bigint';\n}\n\n/**\n * 检查值是否为数字\n * @param unknown - 未知类型的值\n * @returns 如果值为数字且不是 NaN 则返回 true，否则返回 false\n */\nexport function isNumber(unknown: unknown): unknown is number {\n  return typeof unknown === 'number' && !Number.isNaN(unknown);\n}\n\n/**\n * 检查值是否为 undefined\n * @param unknown - 未知类型的值\n * @returns 如果值为 undefined 则返回 true，否则返回 false\n */\nexport function isUndefined(unknown: unknown): unknown is undefined {\n  return typeof unknown === 'undefined';\n}\n\n/**\n * 检查值是否为 void\n * @param unknown - 未知类型的值\n * @returns 如果值为 undefined 则返回 true，否则返回 false\n */\n// biome-ignore lint/suspicious/noConfusingVoidType: <explanation>\nexport function isVoid(unknown: unknown): unknown is void {\n  return isUndefined(unknown);\n}\n\n/**\n * 永不执行，用于 switch-case/if-else 类型断言\n * @param unknown - 永远不会执行的值\n */\nexport function isNever(unknown: never) {\n  //\n}\n\n/**\n * 检查值是否为 null\n * @param unknown - 未知类型的值\n * @returns 如果值为 null 则返回 true，否则返回 false\n */\nexport function isNull(unknown: unknown): unknown is null {\n  return unknown === null;\n}\n\n/**\n * 检查值是否为 nullish（null 或 undefined 或 void）\n * @param unknown - 未知类型的值\n * @returns 如果值为 null 或 undefined 或 void 则返回 true，否则返回 false\n */\n// biome-ignore lint/suspicious/noConfusingVoidType: <explanation>\nexport function isNullish(unknown: unknown): unknown is null | undefined | void {\n  return isNull(unknown) || isUndefined(unknown) || isVoid(unknown);\n}\n\n/**\n * 检查值是否为原始类型（null 或 非对象）\n * @param unknown - 未知类型的值\n * @returns 如果值为原始类型则返回 true，否则返回 false\n */\nexport function isPrimitive(\n  unknown: unknown,\n): unknown is string | number | boolean | symbol | bigint | null | undefined {\n  return isNull(unknown) || !(typeof unknown === 'object' || typeof unknown === 'function');\n}\n\n/**\n * 检查值是否为对象，但要注意，此时的对象类型是包含了数组和函数\n * @param unknown - 未知类型的值\n * @returns 如果值为对象则返回 true，否则返回 false\n */\nexport function isObject(unknown: unknown): unknown is AnyObject {\n  return typeIs(unknown) === 'object';\n}\n\n/**\n * 检查值是否为数组\n * @param unknown - 未知类型的值\n * @returns 如果值为数组则返回 true，否则返回 false\n */\nexport function isArray(unknown: unknown): unknown is AnyArray {\n  return Array.isArray(unknown);\n}\n\n/**\n * 检查值是否为函数\n * @param unknown - 未知类型的值\n * @returns 如果值为函数则返回 true，否则返回 false\n */\nexport function isFunction(unknown: unknown): unknown is AnyFunction {\n  return typeof unknown === 'function';\n}\n\n/**\n * 检查值是否为异步函数\n * @param unknown - 需要检查的值\n * @returns 如果值为异步函数则返回 true，否则返回 false\n * @example\n * ```typescript\n * async function example() {}\n *\n * isAsyncFunction(example); // true\n * isAsyncFunction(() => {}); // false\n * ```\n */\nexport function isAsyncFunction(unknown: unknown): unknown is AnyAsyncFunction {\n  return isFunction(unknown) && unknown.constructor.name === 'AsyncFunction';\n}\n\n/**\n * 检查值是否为 Error 类型\n * @param unknown - 未知类型的值\n * @returns 如果值为 Error 类型则返回 true，否则返回 false\n */\nexport function isError(unknown: unknown): unknown is Error {\n  return unknown instanceof Error;\n}\n\n/**\n * 检查值是否为 Promise 类型\n * @param unknown - 未知类型的值\n * @returns 如果值为 Promise 类型则返回 true，否则返回 false\n */\nexport function isPromise<T>(unknown: unknown): unknown is Promise<T> {\n  return typeIs(unknown) === 'promise';\n}\n\n/**\n * 检查值是否为 Date 类型\n * @param unknown - 未知类型的值\n * @returns 如果值为 Date 类型则返回 true，否则返回 false\n */\nexport function isDate(unknown: unknown): unknown is Date {\n  return unknown instanceof Date;\n}\n"],"names":[],"mappings":";;AAOO,SAAS,OACd,SAcS;AACF,SAAA,OAAO,UAAU,SAAS,KAAK,OAAO,EAAE,MAAM,GAAG,EAAE,EAAE,YAAY;AAC1E;AAOO,SAAS,SAAS,SAAqC;AAC5D,SAAO,OAAO,YAAY;AAC5B;AAOO,SAAS,UAAU,SAAsC;AAC9D,SAAO,OAAO,YAAY;AAC5B;AAOO,SAAS,SAAS,SAAqC;AAC5D,SAAO,OAAO,YAAY;AAC5B;AAOO,SAAS,SAAS,SAAqC;AAC5D,SAAO,OAAO,YAAY;AAC5B;AAOO,SAAS,SAAS,SAAqC;AAC5D,SAAO,OAAO,YAAY,YAAY,CAAC,OAAO,MAAM,OAAO;AAC7D;AAOO,SAAS,YAAY,SAAwC;AAClE,SAAO,OAAO,YAAY;AAC5B;AAQO,SAAS,OAAO,SAAmC;AACxD,SAAO,YAAY,OAAO;AAC5B;AAMO,SAAS,QAAQ,SAAgB;AAExC;AAOO,SAAS,OAAO,SAAmC;AACxD,SAAO,YAAY;AACrB;AAQO,SAAS,UAAU,SAAsD;AAC9E,SAAO,OAAO,OAAO,KAAK,YAAY,OAAO,KAAK,OAAO,OAAO;AAClE;AAOO,SAAS,YACd,SAC2E;AACpE,SAAA,OAAO,OAAO,KAAK,EAAE,OAAO,YAAY,YAAY,OAAO,YAAY;AAChF;AAOO,SAAS,SAAS,SAAwC;AACxD,SAAA,OAAO,OAAO,MAAM;AAC7B;AAOO,SAAS,QAAQ,SAAuC;AACtD,SAAA,MAAM,QAAQ,OAAO;AAC9B;AAOO,SAAS,WAAW,SAA0C;AACnE,SAAO,OAAO,YAAY;AAC5B;AAcO,SAAS,gBAAgB,SAA+C;AAC7E,SAAO,WAAW,OAAO,KAAK,QAAQ,YAAY,SAAS;AAC7D;AAOO,SAAS,QAAQ,SAAoC;AAC1D,SAAO,mBAAmB;AAC5B;AAOO,SAAS,UAAa,SAAyC;AAC7D,SAAA,OAAO,OAAO,MAAM;AAC7B;AAOO,SAAS,OAAO,SAAmC;AACxD,SAAO,mBAAmB;AAC5B;;;;;;;;;;;;;;;;;;;;"}