forked from linkedin/parseq
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathparse-test.js
More file actions
188 lines (161 loc) · 6.13 KB
/
parse-test.js
File metadata and controls
188 lines (161 loc) · 6.13 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
var assert = require('./assert'),
parseFunc = require('../..').trace.parse;
// Slightly modify the parse function to ensure required properties are always
// present.
function parse(json) {
json.traces.forEach(function(trace) {
if (trace.startNanos === undefined)
trace.startNanos = 0;
});
return parseFunc(json);
}
describe('parse', function() {
it('can parse a task\'s name', function() {
var g = parse({ traces: [ { id: 1, name: 'foo' } ] });
assert.propertyVal(g.node(1), 'name', 'foo');
});
it('can parse a task\'s value', function() {
var g = parse({ traces: [ { id: 1, value: 'bar' } ] });
assert.propertyVal(g.node(1), 'value', 'bar');
});
it('can parse a hidden task', function() {
var g = parse({ traces: [ { id: 1, hidden: true } ] });
assert.propertyVal(g.node(1), 'hidden', true);
});
it('can parse a system hidden task', function() {
var g = parse({ traces: [ { id: 1, systemHidden: true } ] });
assert.propertyVal(g.node(1), 'systemHidden', true);
});
it('can parse a task\'s startNanos', function() {
var g = parse({ traces: [ { id: 1, startNanos: 50 } ] });
assert.propertyVal(g.node(1), 'startNanos', 50);
});
it('sets a task\'s undefined pendingNanos to snapshotNanos, if available', function() {
var g = parse({ snapshotNanos: 200, traces: [ { id: 1 } ] });
assert.propertyVal(g.node(1), 'pendingNanos', 200);
});
it('sets a task\'s undefined pendingNanos to the greatest time in the trace, if snapshotNanos is undefined', function() {
var g = parse({ traces: [ { id: 1 }, { id: 2, endNanos: 50 } ] });
assert.propertyVal(g.node(1), 'pendingNanos', 50);
});
it('can parse a task\'s endNanos', function() {
var g = parse({ traces: [ { id: 1, endNanos: 100 } ] });
assert.propertyVal(g.node(1), 'endNanos', 100);
});
it('sets a task\'s undefined endNanos to snapshotNanos, if available', function() {
var g = parse({ snapshotNanos: 200, traces: [ { id: 1 } ] });
assert.propertyVal(g.node(1), 'endNanos', 200);
});
it('sets a task\'s undefined endNanos to the greatest time in the trace, if snapshotNanos is undefined #1', function() {
var g = parse({ traces: [ { id: 1 }, { id: 2, endNanos: 50 } ] });
assert.propertyVal(g.node(1), 'endNanos', 50);
});
it('sets a task\'s undefined endNanos to the greatest time in the trace, if snapshotNanos is undefined #2', function() {
var g = parse({ traces: [ { id: 1 }, { id: 2, pendingNanos: 50 } ] });
assert.propertyVal(g.node(1), 'endNanos', 50);
});
it('can parse a task\'s resultType', function() {
var g = parse({ traces: [ { id: 1, resultType: 'SUCCESS' } ] });
assert.propertyVal(g.node(1), 'resultType', 'SUCCESS');
});
it('can parse a composed task', function() {
var g = parse({
traces: [ createTaskJson(1), createTaskJson(2) ],
relationships: [ { from: 1, to: 2, relationship: 'PARENT_OF' } ]
});
assertHasParent(g, 2, 1);
});
it('can parse a task sequence', function() {
var g = parse({
traces: [ createTaskJson(1), createTaskJson(2), createTaskJson(3) ],
relationships: [
{ from: 1, to: 2, relationship: 'PARENT_OF' },
{ from: 1, to: 3, relationship: 'PARENT_OF' },
{ from: 3, to: 2, relationship: 'SUCCESSOR_OF' }
]
});
assertHasParent(g, 2, 1);
assertHasParent(g, 3, 1);
assertHasSuccessor(g, 2, 3);
});
it('can parse a potential predecessor relationship', function() {
var g = parse({
traces: [ createTaskJson(1), createTaskJson(2), createTaskJson(3) ],
relationships: [
{ from: 1, to: 2, relationship: 'PARENT_OF' },
{ from: 1, to: 3, relationship: 'PARENT_OF' },
{ from: 3, to: 2, relationship: 'POSSIBLE_SUCCESSOR_OF' }
]
});
assertHasPotentialSuccessor(g, 2, 3);
});
it('can parse a potential parent relationship', function() {
var g = parse({
traces: [ createTaskJson(1), createTaskJson(2) ],
relationships: [ { from: 1, to: 2, relationship: 'POTENTIAL_PARENT_OF' } ]
});
assertHasPotentialParent(g, 2, 1);
});
it('adds sort info by chronology', function() {
var t1 = createTaskJson(1);
t1.startNanos = 0;
var t2 = createTaskJson(2);
t2.startNanos = 20;
var t3 = createTaskJson(3);
t3.startNanos = 10;
var g = parse({
traces: [t1, t2, t3],
});
assert.propertyVal(g.node(1), 'order', 0);
assert.propertyVal(g.node(3), 'order', 1);
assert.propertyVal(g.node(2), 'order', 2);
});
it('adds sort info by hierarchy, then chronology', function() {
var t1 = createTaskJson(1);
t1.startNanos = 0;
var t2 = createTaskJson(2);
t2.startNanos = 20;
var t3 = createTaskJson(3);
t3.startNanos = 30;
var t4 = createTaskJson(4);
t4.startNanos = 5;
var t5 = createTaskJson(5);
t5.startNanos = 25;
var g = parse({
traces: [t1, t2, t3, t4, t5],
relationships: [
{ from: 1, to: 2, relationship: 'PARENT_OF' },
{ from: 2, to: 3, relationship: 'PARENT_OF' },
{ from: 1, to: 4, relationship: 'PARENT_OF' },
{ from: 4, to: 5, relationship: 'PARENT_OF' }
]
});
assert.propertyVal(g.node(1), 'order', 0);
assert.propertyVal(g.node(4), 'order', 1);
assert.propertyVal(g.node(5), 'order', 2);
assert.propertyVal(g.node(2), 'order', 3);
assert.propertyVal(g.node(3), 'order', 4);
});
});
function createTaskJson(id) {
return { id: id };
}
function assertHasParent(g, child, parent) {
assert.equal(g.parent(child), parent);
}
function assertHasEdgeOfType(g, u, v, type) {
var edges = g.outEdges(u, v);
assert.isTrue(edges.length > 0, 'Should have had at least one edge ' + u + ' -> ' + v);
var matches = edges.map(function(e) { return g.edge(e).relationship; })
.filter(function(rel) { return rel === type; });
assert.lengthOf(matches, 1);
}
function assertHasSuccessor(g, u, v) {
assertHasEdgeOfType(g, u, v, 'SUCCESSOR');
}
function assertHasPotentialSuccessor(g, u, v) {
assertHasEdgeOfType(g, u, v, 'POTENTIAL_SUCCESSOR');
}
function assertHasPotentialParent(g, child, parent) {
assertHasEdgeOfType(g, child, parent, 'POTENTIAL_PARENT');
}