Blame view

src/utils/helper/treeHelper.ts 5.09 KB
陈文彬 authored
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
interface TreeHelperConfig {
  id: string;
  children: string;
  pid: string;
}
const DEFAULT_CONFIG: TreeHelperConfig = {
  id: 'id',
  children: 'children',
  pid: 'pid',
};

const getConfig = (config: Partial<TreeHelperConfig>) => Object.assign({}, DEFAULT_CONFIG, config);

// tree from list
export function listToTree<T = any>(list: any[], config: Partial<TreeHelperConfig> = {}): T[] {
  const conf = getConfig(config) as TreeHelperConfig;
  const nodeMap = new Map();
  const result: T[] = [];
  const { id, children, pid } = conf;

  for (const node of list) {
    node[children] = node[children] || [];
    nodeMap.set(node[id], node);
  }
  for (const node of list) {
    const parent = nodeMap.get(node[pid]);
27
    (parent ? parent[children] : result).push(node);
陈文彬 authored
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
  }
  return result;
}

export function treeToList<T = any>(tree: any, config: Partial<TreeHelperConfig> = {}): T {
  config = getConfig(config);
  const { children } = config;
  const result: any = [...tree];
  for (let i = 0; i < result.length; i++) {
    if (!result[i][children!]) continue;
    result.splice(i + 1, 0, ...result[i][children!]);
  }
  return result;
}

export function findNode<T = any>(
  tree: any,
  func: Fn,
vben authored
46
  config: Partial<TreeHelperConfig> = {},
陈文彬 authored
47
48
49
50
51
52
53
54
55
56
57
58
59
60
): T | null {
  config = getConfig(config);
  const { children } = config;
  const list = [...tree];
  for (const node of list) {
    if (func(node)) return node;
    node[children!] && list.push(...node[children!]);
  }
  return null;
}

export function findNodeAll<T = any>(
  tree: any,
  func: Fn,
vben authored
61
  config: Partial<TreeHelperConfig> = {},
陈文彬 authored
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
): T[] {
  config = getConfig(config);
  const { children } = config;
  const list = [...tree];
  const result: T[] = [];
  for (const node of list) {
    func(node) && result.push(node);
    node[children!] && list.push(...node[children!]);
  }
  return result;
}

export function findPath<T = any>(
  tree: any,
  func: Fn,
vben authored
77
  config: Partial<TreeHelperConfig> = {},
陈文彬 authored
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
): T | T[] | null {
  config = getConfig(config);
  const path: T[] = [];
  const list = [...tree];
  const visitedSet = new Set();
  const { children } = config;
  while (list.length) {
    const node = list[0];
    if (visitedSet.has(node)) {
      path.pop();
      list.shift();
    } else {
      visitedSet.add(node);
      node[children!] && list.unshift(...node[children!]);
      path.push(node);
      if (func(node)) {
        return path;
      }
    }
  }
  return null;
}

export function findPathAll(tree: any, func: Fn, config: Partial<TreeHelperConfig> = {}) {
  config = getConfig(config);
103
  const path: any[] = [];
陈文彬 authored
104
  const list = [...tree];
105
  const result: any[] = [];
陈文彬 authored
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
  const visitedSet = new Set(),
    { children } = config;
  while (list.length) {
    const node = list[0];
    if (visitedSet.has(node)) {
      path.pop();
      list.shift();
    } else {
      visitedSet.add(node);
      node[children!] && list.unshift(...node[children!]);
      path.push(node);
      func(node) && result.push([...path]);
    }
  }
  return result;
}

export function filter<T = any>(
  tree: T[],
  func: (n: T) => boolean,
vben authored
126
  config: Partial<TreeHelperConfig> = {},
vben authored
127
): T[] {
陈文彬 authored
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
  config = getConfig(config);
  const children = config.children as string;
  function listFilter(list: T[]) {
    return list
      .map((node: any) => ({ ...node }))
      .filter((node) => {
        node[children] = node[children] && listFilter(node[children]);
        return func(node) || (node[children] && node[children].length);
      });
  }
  return listFilter(tree);
}

export function forEach<T = any>(
  tree: T[],
  func: (n: T) => any,
vben authored
144
  config: Partial<TreeHelperConfig> = {},
vben authored
145
): void {
陈文彬 authored
146
147
148
149
  config = getConfig(config);
  const list: any[] = [...tree];
  const { children } = config;
  for (let i = 0; i < list.length; i++) {
150
151
152
153
    //func 返回true就终止遍历,避免大量节点场景下无意义循环,引起浏览器卡顿
    if (func(list[i])) {
      return;
    }
陈文彬 authored
154
155
156
157
158
    children && list[i][children] && list.splice(i + 1, 0, ...list[i][children]);
  }
}

/**
159
 * @description: Extract tree specified structure
陈文彬 authored
160
 */
vben authored
161
export function treeMap<T = any>(treeData: T[], opt: { children?: string; conversion: Fn }): T[] {
陈文彬 authored
162
163
  return treeData.map((item) => treeMapEach(item, opt));
}
164
陈文彬 authored
165
/**
166
 * @description: Extract tree specified structure
陈文彬 authored
167
168
169
 */
export function treeMapEach(
  data: any,
vben authored
170
  { children = 'children', conversion }: { children?: string; conversion: Fn },
陈文彬 authored
171
172
173
174
175
176
177
178
179
180
) {
  const haveChildren = Array.isArray(data[children]) && data[children].length > 0;
  const conversionData = conversion(data) || {};
  if (haveChildren) {
    return {
      ...conversionData,
      [children]: data[children].map((i: number) =>
        treeMapEach(i, {
          children,
          conversion,
vben authored
181
        }),
陈文彬 authored
182
183
184
185
186
187
188
189
      ),
    };
  } else {
    return {
      ...conversionData,
    };
  }
}
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204

/**
 * 递归遍历树结构
 * @param treeDatas 树
 * @param callBack 回调
 * @param parentNode 父节点
 */
export function eachTree(treeDatas: any[], callBack: Fn, parentNode = {}) {
  treeDatas.forEach((element) => {
    const newNode = callBack(element, parentNode) || element;
    if (element.children) {
      eachTree(element.children, callBack, newNode);
    }
  });
}