Repository navigation
Expand file tree
/
Copy pathexclude-test.js
More file actions
116 lines (100 loc) · 3.27 KB
/
Copy pathexclude-test.js
File metadata and controls
116 lines (100 loc) · 3.27 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
var assert = require('./assert'),
CDigraph = require('graphlib').CDigraph,
trace = require('../..').trace,
excludeParentTasks = trace.excludeParentTasks;
var hiddenType = {
excludeUserTasks: 'hidden',
excludeSystemTasks: 'systemHidden'
};
Object.keys(hiddenType).forEach(function(fnName) {
var prop = hiddenType[fnName],
fn = trace[fnName];
describe(fnName, function() {
var g, a, b, c;
beforeEach(function() {
g = new CDigraph();
a = g.addNode('a', {});
b = g.addNode('b', {});
c = g.addNode('c', {});
addSuccessorEdge(g, 'a', 'b');
addSuccessorEdge(g, 'b', 'c');
});
it('does not change a task without the ' + prop + ' property', function() {
fn(g);
assert.sameMembers(g.successors(a), [b]);
assert.sameMembers(g.successors(b), [c]);
assert.sameMembers(g.successors(c), []);
});
it('removes hidden nodes', function() {
g.node(b)[prop] = true;
fn(g);
assert.isFalse(g.hasNode(b));
});
it('points in-edges to the removed node\'s successor', function() {
g.node(b)[prop] = true;
fn(g);
assert.sameMembers(g.successors(a), [c]);
assert.sameMembers(g.successors(c), []);
});
it('does not change the edges in a removed composite task', function() {
g.node(b)[prop] = true;
g.parent(g.addNode('d', {}), b);
g.parent(g.addNode('e', {}), b);
addSuccessorEdge(g, 'd', 'e');
fn(g);
assert.sameMembers(g.successors('d'), ['e']);
});
it('points in-edges to a removed composite node\'s source nodes', function() {
g.node(b)[prop] = true;
g.parent(g.addNode('d', {}), b);
g.parent(g.addNode('e', {}), b);
addSuccessorEdge(g, 'd', 'e');
fn(g);
assert.sameMembers(g.successors(a), ['d']);
});
it('points the sinks of removed composite node to it\'s successors', function() {
g.node(b)[prop] = true;
g.parent(g.addNode('d', {}), b);
g.parent(g.addNode('e', {}), b);
addSuccessorEdge(g, 'd', 'e');
fn(g);
assert.sameMembers(g.successors('e'), [c]);
});
});
});
describe('excludeParentTasks', function() {
var g, a, b, c;
beforeEach(function() {
g = new CDigraph();
a = g.addNode('a', {});
b = g.addNode('b', {});
c = g.addNode('c', {});
addSuccessorEdge(g, 'a', 'b');
addSuccessorEdge(g, 'b', 'c');
});
it('does not change a non-composite task', function() {
excludeParentTasks(g);
assert.sameMembers(g.successors(a), [b]);
assert.sameMembers(g.successors(b), [c]);
assert.sameMembers(g.successors(c), []);
});
it('removes composite nodes', function() {
g.parent(g.addNode('d', {}), b);
g.parent(g.addNode('e', {}), b);
addSuccessorEdge(g, 'd', 'e');
excludeParentTasks(g);
assert.notInclude(g.nodes(), b);
});
it('properly links child nodes with nodes adjacent to the parent', function() {
g.parent(g.addNode('d', {}), b);
g.parent(g.addNode('e', {}), b);
addSuccessorEdge(g, 'd', 'e');
excludeParentTasks(g);
assert.sameMembers(g.successors(a), ['d']);
assert.sameMembers(g.successors('d'), ['e']);
assert.sameMembers(g.successors('e'), [c]);
});
});
function addSuccessorEdge(g, u, v) {
g.addEdge(null, u, v, { relationship: 'SUCCESSOR' });
}