-
Notifications
You must be signed in to change notification settings - Fork 138
/
tree.ts
188 lines (159 loc) Β· 5.17 KB
/
tree.ts
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
/**
* @license
*
* Use of this source code is governed by an MIT-style license that can be
* found in the LICENSE file at https://github.com/IDuxFE/idux/blob/main/LICENSE
*/
import type { VKey } from './props'
import { isArray, isNil } from 'lodash-es'
export type TreeTypeData<V extends object, C extends VKey> = {
[key in C]?: (TreeTypeData<V, C> & V)[]
}
export function traverseTree<V extends TreeTypeData<V, C>, C extends keyof V>(
data: V[],
childrenKey: C,
fn: (item: V, parents: V[]) => void,
traverseStrategy: 'pre' | 'post' = 'pre',
): void {
const traverse = (_data: V[], parents: V[]) => {
for (let idx = 0; idx < _data.length; idx++) {
const item = _data[idx]
traverseStrategy === 'pre' && fn(item, parents)
if (item[childrenKey]) {
traverse(item[childrenKey]!, [item, ...parents])
}
traverseStrategy === 'post' && fn(item, parents)
}
}
traverse(data, [])
}
export function mapTree<V extends TreeTypeData<V, C>, R extends object, C extends keyof V>(
data: V[],
childrenKey: C,
mapFn: (item: V, parents: V[], index: number) => R | undefined,
): (R & TreeTypeData<R, C>)[] {
const map = (_data: V[], parents: V[]) => {
const res: (TreeTypeData<R, C> & R)[] = []
for (let idx = 0; idx < _data.length; idx++) {
const item = _data[idx]
const mappedItem = mapFn(item, parents, idx) as R & TreeTypeData<R, C>
if (!mappedItem) {
continue
}
if (item[childrenKey]) {
const mappedChildren = map(item[childrenKey]!, [item, ...parents])
;(mappedItem[childrenKey] as (R & TreeTypeData<R, C>)[]) = mappedChildren
}
res.push(mappedItem)
}
return res
}
return map(data, [])
}
export function filterTree<V extends TreeTypeData<V, C>, C extends keyof V>(
data: V[],
childrenKey: C,
filterFn: (item: V, parents: V[], filteredChildren: V[] | undefined) => boolean,
filterStrategy: 'and' | 'or' = 'or',
): V[] {
const filter = (_data: V[], parents: V[]): V[] => {
const res: V[] = []
for (let idx = 0; idx < _data.length; idx++) {
let children: V[] | undefined
const item = _data[idx]
if (item[childrenKey]) {
children = filter(item[childrenKey]!, [item, ...parents])
}
let itemValid = filterFn(item, parents, children)
const childrenValid = (children && children.length > 0) || (!item[childrenKey]?.length && itemValid)
itemValid = filterStrategy === 'and' ? childrenValid && itemValid : childrenValid || itemValid
if (itemValid) {
res.push({
...item,
[childrenKey]: item[childrenKey] && children,
})
}
}
return res
}
return filter(data, [])
}
export function mergeTree<V extends TreeTypeData<V, C>, R extends V, C extends keyof V | keyof R>(
originalTree: V[],
overideTree: R[],
childrenKey: C,
getKey: (item: V) => VKey,
): (V & Partial<R>)[] {
const result = originalTree.map(item => ({ ...item })) as (V & Partial<R>)[]
for (const overideItem of overideTree) {
const originalItem = result.find(item => {
const overideItemKey = getKey(overideItem)
const originalItemKey = getKey(item)
return !isNil(overideItemKey) && !isNil(originalItemKey) && overideItemKey === originalItemKey
})
if (!originalItem) {
result.push({ ...overideItem })
continue
}
for (const key of [
...Object.getOwnPropertyNames(overideItem),
...Object.getOwnPropertySymbols(overideItem),
] as (keyof R)[]) {
if (key === childrenKey) {
continue
}
originalItem[key] = overideItem[key]
}
if (isArray(overideItem[childrenKey])) {
originalItem[childrenKey] = mergeTree(
originalItem[childrenKey] ?? [],
overideItem[childrenKey]!,
childrenKey,
getKey,
) as (V & Partial<R>)[C]
}
}
return result
}
export function flattenTree<V extends TreeTypeData<V, C>, C extends keyof V>(data: V[], childrenKey: C): V[]
export function flattenTree<V extends TreeTypeData<V, C>, C extends keyof V>(
data: V[],
childrenKey: C,
mapFn: undefined,
leafOnly?: boolean,
): V[]
export function flattenTree<V extends TreeTypeData<V, C>, R extends object, C extends keyof V>(
data: V[],
childrenKey: C,
mapFn: (item: V) => R,
leafOnly?: boolean,
): (R & TreeTypeData<R, C>)[]
export function flattenTree<V extends TreeTypeData<V, C>, R extends object, C extends keyof V>(
data: V[],
childrenKey: C,
mapFn?: (item: V) => R,
leafOnly = false,
): V[] | (R & TreeTypeData<R, C>)[] {
const res: V[] | (R & TreeTypeData<R, C>)[] = []
traverseTree(data, childrenKey, item => {
if (!leafOnly || !item[childrenKey] || item[childrenKey]!.length <= 0) {
const mappedItem = mapFn ? mapFn(item) : item
mappedItem && res.push(mappedItem as V & (R & TreeTypeData<R, C>))
}
})
return res
}
export function getTreeKeys<V extends TreeTypeData<V, C>, C extends keyof V>(
data: V[],
childrenKey: C,
getKey: (item: V) => VKey,
leafOnly = false,
): VKey[] {
const keys: VKey[] = []
traverseTree(data, childrenKey, item => {
if (!leafOnly || !item[childrenKey]?.length) {
keys.push(getKey(item))
}
})
return keys
}