| 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
259
260
261 |
1×
1×
1×
1×
1×
1×
1×
1×
1×
1×
1×
1×
2×
3×
3×
3×
2×
3×
2×
2×
3×
3×
2×
1×
1×
1×
1×
1×
1×
53×
53×
1×
217×
217×
217×
217×
217×
217×
164×
217×
217×
53×
53×
34×
34×
1×
163×
163×
163×
163×
163×
163×
163×
4×
4×
159×
129×
129×
163×
163×
34×
1×
173×
1×
1×
27×
27×
27×
32×
32×
32×
32×
19×
19×
19×
5×
5×
5×
20×
5×
20×
5×
4×
4×
10×
4×
10×
10×
4×
4×
4×
6×
6×
6×
3×
6×
3×
3×
8×
3×
8×
8×
3×
3×
3×
5×
5×
5×
2×
5×
14×
14×
46×
46×
46×
46×
32×
46×
46×
14×
1×
| 'use strict';
var _ = require('lodash');
var Promise = require('bluebird');
var treeify = require('treeify');
var fecom = require('../fecom');
var walkable = {
nodeName: 'props',
childrenName: 'subNodes',
BFS: function (tree, callback) {
// Breadth First Search
var nodes = [];
var paths = [];
var node = tree[walkable.nodeName];
var children = tree[walkable.childrenName] || [];
nodes.push(node);
paths.push(fecom.stringify(_.omit(node, 'status')));
function iterate(children) {
children = children.filter(function (subTree) {
var subNode = subTree[walkable.nodeName];
var subChildren = subTree[walkable.childrenName];
return !('function' === typeof callback && !callback.call(null, subNode, subChildren));
});
nodes = nodes.concat(children.map(function (subTree) {
return subTree.props;
}));
Eif (children.length) {
var grandChildren = children.reduce(function (a, b) {
var subBChildren = b[walkable.childrenName];
return a.concat(subBChildren);
}, []);
if (grandChildren.length) {
iterate(grandChildren);
return true;
}
return false;
}
return false;
}
iterate(children);
return nodes;
},
BFSAsync: function (tree, callback) {
// Breadth First Search Async
var nodes = [];
var paths = [];
function iterateAsync() {
}
return iterateAsync(tree);
},
DFS: function (tree, callback) {
// Depth First Search
var nodes = [];
var paths = [];
function iterate(tree) {
var node = tree[walkable.nodeName];
var children = tree[walkable.childrenName] || [];
nodes.push(node);
paths.push(fecom.stringify(_.omit(node, 'status')));
Iif ('function' === typeof callback && !callback.call(null, tree, paths)) {
paths.pop();
return false;
}
children.forEach(function (subTree) {
iterate(subTree);
});
paths.pop();
return true;
}
iterate(tree, callback);
return nodes;
},
DFSAsync: function (tree, callback, getChildren) {
// Depth First Search Async
var nodes = [];
var paths = [];
function iterateAsync(tree) {
var subNodes = tree[walkable.childrenName];
var promise = subNodes && subNodes.length ? fecom.async(tree) : getChildren(tree);
return promise
.then(function (filledTree) {
var filledSubNodes = filledTree.subNodes;
nodes.push(filledTree.props);
paths.push(fecom.stringify(filledTree.props));
if ('function' === typeof callback && !callback.call(null, filledTree, paths)) {
paths.pop();
return fecom.async(nodes);
}
return Promise
.reduce(filledSubNodes, function (nodes, filledSubTree) {
return iterateAsync(filledSubTree)
.then(function () {
return nodes;
});
}, []);
})
.then(function () {
paths.pop();
return nodes;
});
}
return iterateAsync(tree);
}
};
/**
* @description Tree
* @param model
* @constructor
*/
var Tree = function (model) {
this.model = _.cloneDeep(model);
};
Tree.walkable = walkable;
Tree.prototype = {
constructor: Tree,
walk: function (strategy, callback) {
var self = this;
Iif ('function' !== typeof walkable[strategy]) {
throw new Error('Expected function');
}
return walkable[strategy](self.model, callback);
},
walkAsync: function (strategy, callback, getChildren) {
var self = this;
strategy = strategy + 'Async';
Iif ('function' !== typeof walkable[strategy]) {
throw new Error('Expected function');
}
return walkable[strategy](self.model, callback, getChildren);
},
getAllNodes: function (strategy) {
// Get all nodes of tree
var self = this;
Iif (strategy !== 'DFS' && strategy !== 'BFS') {
throw new Error('Strategy must be DFS or BFS');
}
return walkable[strategy](self.model);
},
findPathByNode: function (node) {
var self = this;
var paths = [];
walkable.DFS(self.model, function (tree, path) {
if (_.isMatch(tree.props, node)) {
paths.push(path.slice());
}
return true;
});
return paths;
},
updateTreeByPath: function (path, props) {
var self = this;
var nodes = path.map(function (subPath) {
return fecom.parse(subPath);
});
return nodes.reduce(function (tree, node, idx) {
var isValid, children, matched;
if (0 === idx) {
isValid = _.isMatch(tree.props, node);
Eif (isValid) {
return tree;
}
return {};
}
children = tree.subNodes || [];
matched = _.find(children, { props: _.omit(node, ['status']) }) || {};
if (nodes.length - 1 === idx && !_.isEmpty(matched)) {
matched.props = _.assign({}, matched.props, props);
}
return matched;
}, self.model);
},
removeTreeByPath: function (path) {
var self = this;
var nodes = path.map(function (subPath) {
return fecom.parse(subPath);
});
return nodes.reduce(function (tree, node, idx) {
var isValid, children, matched;
if (0 === idx) {
isValid = _.isMatch(tree.props, node);
Eif (isValid) {
return tree;
}
return {};
}
children = tree.subNodes || [];
matched = _.find(children, { props: _.omit(node, ['status']) }) || {};
if (nodes.length - 1 === idx && !_.isEmpty(matched)) {
tree.subNodes = _.reject(tree.subNodes, matched);
}
return matched;
}, self.model);
},
transform: function () {
// Transform tree to nice printed object
var self = this;
var transformNode = function (map, tree) {
var semantic = fecom.stringify(tree.props);
var subMap = {};
var subNodes = tree.subNodes || [];
subNodes.forEach(function (subNode) {
transformNode(subMap, subNode);
});
map[semantic] = subMap;
return map;
};
return transformNode({}, self.model);
}
};
module.exports = Tree;
|