This repository was archived by the owner on Dec 26, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathTreeModelHelper.ts
More file actions
258 lines (226 loc) Β· 6.23 KB
/
Copy pathTreeModelHelper.ts
File metadata and controls
258 lines (226 loc) Β· 6.23 KB
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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
import { ITreeItem, ITreeItemWithParent } from '../types/ITreeItem';
import { TaskInMyDay } from '../modules/tasks/models/TaskInMyDay';
import TaskModel from '../modules/tasks/models/TaskModel';
import TaskFactory from '../modules/tasks/TaskFactory';
import ProjectModel from '../modules/projects/models/ProjectModel';
const TreeModelHelper = {
getPathToNode<T extends ITreeItemWithParent = ITreeItemWithParent>(node: T) {
const result: string[] = [];
let ptrNode: T | undefined = node;
while (ptrNode) {
result.unshift(ptrNode.key);
// @ts-ignore
ptrNode = ptrNode.parent;
}
return result;
},
copyItemsToTreeUnderProject(
project: ProjectModel | undefined,
sourceTree: TaskModel[],
destTree: TaskInMyDay[],
keysToNode: string[]
): boolean {
if (!project) {
return false;
}
let destProject = destTree.find((node) => node.key === project.key);
if (!destProject) {
destProject = TaskFactory.createTaskModelProxy(
new TaskModel({
key: project.key,
projectId: project.key,
title: project.title,
active: false,
checked: false,
children: [],
datesInProgress: [],
details: [],
expanded: true,
inMyDay: new Date().toString(),
parent: undefined,
time: [],
withoutActions: true,
})
);
destTree.push(destProject);
}
return TreeModelHelper.copyItemsToTree(
sourceTree,
destProject.children || [],
keysToNode
);
},
/**
* Make a copy of tasks to 'My Day'
*/
copyItemsToTree(
sourceTree: TaskModel[],
destTree: TaskInMyDay[],
keysToNode: string[]
) {
let keyIdx = 0;
let sourceChildren = sourceTree;
let destChildren = destTree;
if (keysToNode.length === 1) {
const source = sourceChildren.find((node) => node.key === keysToNode[0]);
if (source) {
destChildren.push(TaskFactory.createTaskModelProxy(source));
}
return !!source;
}
do {
const nextSourceNode = sourceChildren.find(
(task) => task.key === keysToNode[keyIdx]
);
if (!nextSourceNode) {
return false;
}
const nextDestNode = destChildren.find(
(task) => task.key === keysToNode[keyIdx]
);
if (nextDestNode) {
// We already have a copy of node, go on
keyIdx++;
sourceChildren = nextSourceNode.children || [];
destChildren = nextDestNode.children || [];
} else {
// Make a copy from this node
const restKeysToNode = keysToNode.slice(keyIdx);
return TreeModelHelper.copySubItemsToTree(
sourceChildren,
destChildren,
restKeysToNode
);
}
} while (keyIdx < keysToNode.length);
return true;
},
copySubItemsToTree(
sourceTree: TaskModel[],
destTree: TaskInMyDay[],
keysToNode: string[]
) {
if (!sourceTree) {
return false;
}
let keyIdx = 0;
let destChildren = destTree;
let sourceNode = sourceTree.find((node) => node.key === keysToNode[keyIdx]);
if (!sourceNode) {
return false;
}
while (true) {
const copyNode = TaskFactory.createTaskModelProxy(sourceNode);
destChildren.push(copyNode);
keyIdx++;
if (keyIdx === keysToNode.length) {
return true;
}
destChildren = copyNode.children || [];
sourceNode = sourceNode.children?.find(
(node) => node.key === keysToNode[keyIdx]
);
if (!sourceNode) {
return false;
}
}
},
walkRecursive<T extends ITreeItem>(
fn: (item: T, parent?: T) => void,
treeItems: T[],
parent?: T
) {
treeItems.forEach((item) => {
fn(item, parent);
if (item.children?.length) {
this.walkRecursive(fn, item.children as T[], item);
}
});
},
walkToParent<T extends ITreeItemWithParent>(
fn: (nParent: T) => void,
treeItem: T
) {
if (treeItem.parent) {
fn(treeItem.parent as T);
this.walkToParent(fn, treeItem.parent as T);
}
},
modifyItemsWithIdsRecursive<T extends ITreeItem>(
treeItems: T[],
ids: string[],
fn: (treeItem: T, ids: string[]) => void
) {
treeItems.forEach((item) => {
fn(item, ids);
if (Array.isArray(item.children) && item.children.length) {
this.modifyItemsWithIdsRecursive(item.children as T[], ids, fn);
}
});
},
getItemRecursive<T extends ITreeItem>(
items: T[],
condition: (task: T) => boolean
): T | undefined {
for (const item of items) {
if (condition(item)) {
return item;
}
if (item.children?.length) {
const found = this.getItemRecursive(item.children as T[], condition);
if (found) {
return found;
}
}
}
return undefined;
},
getFlatItemsRecursive<T extends ITreeItem>(
tree: T[],
condition: (task: T) => boolean
): T[] {
const result: T[] = [];
this.getFlatItemsRecursiveBase(tree, condition, result);
return result;
},
getFlatItemsRecursiveBase<T extends ITreeItem>(
treeItems: T[],
condition: (item: T) => boolean,
result: T[]
): T[] {
treeItems.forEach((item) => {
if (condition(item)) {
result.push(item);
}
if (item.children?.length) {
this.getFlatItemsRecursiveBase(item.children as T[], condition, result);
}
});
return result;
},
deleteItems<T extends ITreeItem>(
treeItems: T[],
condition: (item: T) => boolean
): T[] {
const result = treeItems.filter((t) => !condition(t));
result.forEach((item) => {
if (item.children?.length) {
item.children = this.deleteItems(item.children as T[], condition);
}
});
return result;
},
fillParent<T extends ITreeItemWithParent>(items: T[]) {
TreeModelHelper.walkRecursive(setParent, items);
},
clearParent<T extends ITreeItemWithParent>(items: T[]) {
TreeModelHelper.walkRecursive(clearParent, items);
},
};
const setParent = <T extends ITreeItemWithParent>(item: T, parent?: T) => {
item.parent = parent;
};
const clearParent = <T extends ITreeItemWithParent>(item: T) => {
item.parent = undefined;
};
export default TreeModelHelper;