@molgenis/vip-report-template 2.7.0 → 2.7.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.scannerwork/report-task.txt +5 -5
- package/.scannerwork/ucfg2/js/_home_travis_build_molgenis_vip_report_template_src_utils_treeBuilder_ts_1_1_P1_ENTRY.ucfg +0 -0
- package/.scannerwork/ucfg2/js/src_utils_treeBuilder_ts_62_30_A_5_inp.ucfg +0 -0
- package/.scannerwork/ucfg2/js/src_utils_treeBuilder_ts_64_40_A_6_key.ucfg +0 -0
- package/.scannerwork/ucfg2/js/{src_utils_treeBuilder_ts_73_44_A_7_cat.ucfg → src_utils_treeBuilder_ts_75_46_A_7_cat.ucfg} +0 -0
- package/.scannerwork/ucfg2/js/{src_utils_treeBuilder_ts_81_33_A_8_k.ucfg → src_utils_treeBuilder_ts_96_33_A_8_k.ucfg} +0 -0
- package/package.json +1 -1
- package/src/types/DecisionTree.d.ts +2 -2
- package/src/utils/treeBuilder.ts +28 -13
- package/tests/unit/utils/treeBuilder.spec.ts +54 -0
|
@@ -1,8 +1,8 @@
|
|
|
1
1
|
organization=molgenis
|
|
2
2
|
projectKey=molgenis_vip-report-template
|
|
3
3
|
serverUrl=https://sonarcloud.io
|
|
4
|
-
serverVersion=8.0.0.
|
|
5
|
-
branch=v2.7.
|
|
6
|
-
dashboardUrl=https://sonarcloud.io/dashboard?id=molgenis_vip-report-template&branch=v2.7.
|
|
7
|
-
ceTaskId=
|
|
8
|
-
ceTaskUrl=https://sonarcloud.io/api/ce/task?id=
|
|
4
|
+
serverVersion=8.0.0.25123
|
|
5
|
+
branch=v2.7.1
|
|
6
|
+
dashboardUrl=https://sonarcloud.io/dashboard?id=molgenis_vip-report-template&branch=v2.7.1&resolved=false
|
|
7
|
+
ceTaskId=AX1bK9rH9EclnW_8YXd3
|
|
8
|
+
ceTaskUrl=https://sonarcloud.io/api/ce/task?id=AX1bK9rH9EclnW_8YXd3
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
|
Binary file
|
package/package.json
CHANGED
package/src/utils/treeBuilder.ts
CHANGED
|
@@ -63,19 +63,34 @@ export const retrieveEdges = (inputTree: DecisionTree): TreeEdgesArray => {
|
|
|
63
63
|
let edges: TreeEdgesObj = {};
|
|
64
64
|
Object.keys(inputTree.nodes).forEach((key) => {
|
|
65
65
|
const node: Node = inputTree.nodes[key];
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
66
|
+
switch (node.type) {
|
|
67
|
+
case 'BOOL':
|
|
68
|
+
edges = createSimpleEdge('True', node, key, edges);
|
|
69
|
+
edges = createSimpleEdge('False', node, key, edges);
|
|
70
|
+
if ('outcomeMissing' in node) {
|
|
71
|
+
edges = createSimpleEdge('Missing', node, key, edges);
|
|
72
|
+
}
|
|
73
|
+
break;
|
|
74
|
+
case 'CATEGORICAL':
|
|
75
|
+
Object.keys(node.outcomeMap).forEach((category) => {
|
|
76
|
+
const nextNode = node.outcomeMap[category].nextNode;
|
|
77
|
+
edges = createEdge(nextNode, category, key, edges);
|
|
78
|
+
});
|
|
79
|
+
if ('outcomeMissing' in node) {
|
|
80
|
+
edges = createSimpleEdge('Missing', node, key, edges);
|
|
81
|
+
}
|
|
82
|
+
if ('outcomeDefault' in node) {
|
|
83
|
+
edges = createSimpleEdge('Default', node, key, edges);
|
|
84
|
+
}
|
|
85
|
+
break;
|
|
86
|
+
case 'EXISTS':
|
|
87
|
+
edges = createSimpleEdge('True', node, key, edges);
|
|
88
|
+
edges = createSimpleEdge('False', node, key, edges);
|
|
89
|
+
break;
|
|
90
|
+
case 'LEAF':
|
|
91
|
+
break;
|
|
92
|
+
default:
|
|
93
|
+
throw new Error('unknown node type');
|
|
79
94
|
}
|
|
80
95
|
});
|
|
81
96
|
return Object.keys(edges).map((k) => edges[k]);
|
|
@@ -199,4 +199,58 @@ describe('treeBuilder', () => {
|
|
|
199
199
|
];
|
|
200
200
|
expect(outcome).toStrictEqual(expected);
|
|
201
201
|
});
|
|
202
|
+
it('should generate edges for CATEGORICAL node without default/missing', () => {
|
|
203
|
+
const decisionTree: DecisionTree = {
|
|
204
|
+
files: {
|
|
205
|
+
panel: {
|
|
206
|
+
path: 'path/to/tsv'
|
|
207
|
+
}
|
|
208
|
+
},
|
|
209
|
+
rootNode: 'ROOT',
|
|
210
|
+
nodes: {
|
|
211
|
+
categoricalField: {
|
|
212
|
+
type: 'CATEGORICAL',
|
|
213
|
+
description: 'check categorical field',
|
|
214
|
+
field: 'FIELD_TO_CHECK',
|
|
215
|
+
outcomeMap: {
|
|
216
|
+
P: {
|
|
217
|
+
nextNode: 'exit_t'
|
|
218
|
+
},
|
|
219
|
+
LP: {
|
|
220
|
+
nextNode: 'exit_t'
|
|
221
|
+
},
|
|
222
|
+
LB: {
|
|
223
|
+
nextNode: 'exit_f'
|
|
224
|
+
},
|
|
225
|
+
B: {
|
|
226
|
+
nextNode: 'exit_f'
|
|
227
|
+
}
|
|
228
|
+
}
|
|
229
|
+
},
|
|
230
|
+
exit_t: {
|
|
231
|
+
type: 'LEAF',
|
|
232
|
+
class: 'T'
|
|
233
|
+
},
|
|
234
|
+
exit_f: {
|
|
235
|
+
type: 'LEAF',
|
|
236
|
+
class: 'F'
|
|
237
|
+
}
|
|
238
|
+
}
|
|
239
|
+
};
|
|
240
|
+
|
|
241
|
+
const outcome = retrieveEdges(decisionTree);
|
|
242
|
+
const expected = [
|
|
243
|
+
{
|
|
244
|
+
from: 'categoricalField',
|
|
245
|
+
to: 'exit_t',
|
|
246
|
+
label: 'P\nLP'
|
|
247
|
+
},
|
|
248
|
+
{
|
|
249
|
+
from: 'categoricalField',
|
|
250
|
+
to: 'exit_f',
|
|
251
|
+
label: 'LB\nB'
|
|
252
|
+
}
|
|
253
|
+
];
|
|
254
|
+
expect(outcome).toStrictEqual(expected);
|
|
255
|
+
});
|
|
202
256
|
});
|