feat: add high performance utils for tree data

Author: chandq

src/array.ts

@@ -112,105 +112,6 @@ export function arrayRemove<V>(array: V[], expect: (val: V, idx: number) => bool
   return array;
 }
 
-/**
- * 自定义深度优先遍历函数(支持continue和break操作)
- * @param {ArrayLike<V>} tree  树形数据
- * @param {Function} iterator  迭代函数, 返回值为true时continue, 返回值为false时break
- * @param {string} children 定制子元素的key
- * @param {boolean} isReverse  是否反向遍历
- * @returns {*}
- */
-export function forEachDeep<V>(
-  tree: ArrayLike<V>,
-  iterator: (val: V, i: number, arr: ArrayLike<V>, parent: V | null, level: number) => boolean | void,
-  children: string = 'children',
-  isReverse = false
-) {
-  let level = 0,
-    isBreak = false;
-  const walk = (arr: ArrayLike<V>, parent: V | null) => {
-    if (isReverse) {
-      for (let i = arr.length - 1; i >= 0; i--) {
-        if (isBreak) {
-          break;
-        }
-        const re = iterator(arr[i], i, tree, parent, level);
-        if (re === false) {
-          isBreak = true;
-          break;
-        } else if (re === true) {
-          continue;
-        }
-        // @ts-ignore
-        if (Array.isArray(arr[i][children])) {
-          ++level;
-          // @ts-ignore
-          walk(arr[i][children], arr[i]);
-        }
-      }
-    } else {
-      for (let i = 0; i < arr.length; i++) {
-        if (isBreak) {
-          break;
-        }
-        const re = iterator(arr[i], i, tree, parent, level);
-        if (re === false) {
-          isBreak = true;
-          break;
-        } else if (re === true) {
-          continue;
-        }
-        // @ts-ignore
-        if (Array.isArray(arr[i][children])) {
-          ++level;
-          // @ts-ignore
-          walk(arr[i][children], arr[i]);
-        }
-      }
-    }
-  };
-  walk(tree, null);
-}
-export type IdLike = number | string;
-export interface ITreeConf {
-  id: string | number;
-  children: string;
-}
-/**
- * 在树中找到 id 为某个值的节点，并返回上游的所有父级节点
- *
- * @param {ArrayLike<T>} tree - 树形数据
- * @param {IdLike} nodeId - 元素ID
- * @param {ITreeConf} config - 迭代配置项
- * @returns {[IdLike[], ITreeItem<V>[]]} - 由parentId...childId, parentObject-childObject组成的二维数组
- */
-export function searchTreeById<V>(tree: ArrayLike<V>, nodeId: IdLike, config?: ITreeConf): [IdLike[], ArrayLike<V>[]] {
-  const { children = 'children', id = 'id' } = config || {};
-  const toFlatArray = (tree, parentId?: IdLike, parent?: any) => {
-    return tree.reduce((t, _) => {
-      const child = _[children];
-      return [
-        ...t,
-        parentId ? { ..._, parentId, parent } : _,
-        ...(child && child.length ? toFlatArray(child, _[id], _) : [])
-      ];
-    }, []);
-  };
-  const getIds = (flatArray): [IdLike[], ArrayLike<V>[]] => {
-    let child = flatArray.find(_ => _[id] === nodeId);
-    const { parent, parentId, ...other } = child;
-    let ids = [nodeId],
-      nodes = [other];
-    while (child && child.parentId) {
-      ids = [child.parentId, ...ids];
-      nodes = [child.parent, ...nodes];
-      child = flatArray.find(_ => _[id] === child.parentId); // eslint-disable-line
-    }
-    return [ids, nodes];
-  };
-  return getIds(toFlatArray(tree));
-}
-
 /**
  * 异步ForEach函数
  * @param {array} array
@@ -239,104 +140,3 @@ async function asyncForEach(array: any[], callback: Function) {
     await callback(array[index], index, array);
   }
 }
-
-/**
- * 使用迭代函数转换数组
- * @param {T} array
- * @param {Function} callback 迭代函数
- * @return {Array}
- */
-function flatMap<T, U>(array: T[], callback: (value: T, index: number, array: T[]) => U[]): U[] {
-  const result: U[] = [];
-
-  array.forEach((value, index) => {
-    result.push(...callback(value, index, array));
-  });
-
-  return result;
-}
-
-export type WithChildren<T> = T & { children?: WithChildren<T>[] };
-
-/**
- * 根据 idProp 与 parentIdProp 从对象数组中构建对应的树
- * 当 A[parentIdProp] === B[idProp] 时，对象A会被移动到对象B的children。
- * 当一个对象的 parentIdProp 不与其他对象的 idProp 字段相等时，该对象被作为树的顶层节点
- * @param {string} idProp 元素ID
- * @param {string} parentIdProp 父元素ID
- * @param {object[]} items 一维数组
- * @returns {WithChildren<T>[]} 树
- * @example
- * const array = [
- *   { id: 'node-1', parent: 'root' },
- *   { id: 'node-2', parent: 'root' },
- *   { id: 'node-3', parent: 'node-2' },
- *   { id: 'node-4', parent: 'node-2' },
- *   { id: 'node-5', parent: 'node-4' },
- * ]
- * const tree = buildTree('id', 'parent', array)
- * expect(tree).toEqual([
- *   { id: 'node-1', parent: 'root' },
- *   {
- *     id: 'node-2',
- *     parent: 'root',
- *     children: [
- *       { id: 'node-3', parent: 'node-2' },
- *       {
- *         id: 'node-4',
- *         parent: 'node-2',
- *         children: [{ id: 'node-5', parent: 'node-4' }],
- *       },
- *     ],
- *   },
- * ])
- */
-export function buildTree<ID extends string, PID extends string, T extends { [key in ID | PID]: string }>(
-  idProp: ID,
-  parentIdProp: PID,
-  items: T[]
-): WithChildren<T>[] {
-  type Wrapper = { id: string; children: Wrapper[]; item: T; parent: Wrapper };
-
-  const wrapperMap = new Map<string, Wrapper>();
-  const ensure = (id: string) => {
-    if (wrapperMap.has(id)) {
-      return wrapperMap.get(id);
-    }
-    //@ts-ignore
-    const wrapper: Wrapper = { id, parent: null, item: null, children: [] };
-    wrapperMap.set(id, wrapper);
-    return wrapper;
-  };
-  for (const item of items) {
-    const parentWrapper = ensure(item[parentIdProp]);
-    const itemWrapper = ensure(item[idProp]);
-    //@ts-ignore
-    itemWrapper.parent = parentWrapper;
-    //@ts-ignore
-    parentWrapper.children.push(itemWrapper);
-    //@ts-ignore
-    itemWrapper.item = item;
-  }
-  const topLevelWrappers = flatMap(
-    Array.from(wrapperMap.values()).filter(wrapper => wrapper.parent === null),
-    wrapper => wrapper.children
-  );
-
-  return unwrapRecursively(topLevelWrappers);
-
-  function unwrapRecursively(wrapperArray: Wrapper[]) {
-    const result: WithChildren<T>[] = [];
-    for (const wrapper of wrapperArray) {
-      if (wrapper.children.length === 0) {
-        result.push(wrapper.item);
-      } else {
-        result.push({
-          ...wrapper.item,
-          children: unwrapRecursively(wrapper.children)
-        });
-      }
-    }
-    return result;
-  }
-}

src/object.ts

@@ -261,7 +261,7 @@ export function objectGet(
  * @param {WeakMap} map
  * @returns {AnyObject | AnyArray}
  */
-export function cloneDeep(obj: Object, map = new WeakMap()): Object {
+export function cloneDeep(obj: Object, map = new WeakMap()): AnyObject | AnyArray {
   if (obj instanceof Date) return new Date(obj);
   if (obj instanceof RegExp) return new RegExp(obj);