forked from sourcegraph/appdash
/
trace_test.go
92 lines (85 loc) · 1.84 KB
/
trace_test.go
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
package appdash
import "testing"
func TestTrace_TreeString(t *testing.T) {
t.Skip("TODO")
x := &Trace{
Span: Span{
ID: SpanID{1, 1, 0},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
Sub: []*Trace{
{
Span: Span{
ID: SpanID{1, 2, 1},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
Sub: []*Trace{
{
Span: Span{
ID: SpanID{1, 3, 2},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
},
},
},
{
Span: Span{
ID: SpanID{1, 4, 1},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
Sub: []*Trace{
{
Span: Span{
ID: SpanID{1, 5, 4},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
},
{
Span: Span{
ID: SpanID{1, 6, 4},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
},
},
},
},
}
want := ``
if ts := x.TreeString(); ts != want {
t.Errorf("got TreeString\n%s\n\nwant TreeString\n%s", ts, want)
}
}
func TestTrace_FindSpan(t *testing.T) {
x := &Trace{
Span: Span{
ID: SpanID{1, 1, 0},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
Sub: []*Trace{
{
Span: Span{
ID: SpanID{1, 2, 1},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
Sub: []*Trace{
{
Span: Span{
ID: SpanID{1, 3, 2},
Annotations: []Annotation{{Key: "k", Value: []byte("v")}},
},
},
},
},
},
}
testSpanIDs := []ID{1, 2, 3}
for _, id := range testSpanIDs {
span := x.FindSpan(id)
if span == nil {
t.Errorf("%v: got nil, want found", id)
}
if span.Span.ID.Span != id {
t.Errorf("%v: got span ID %v, want %v", id, span.Span.ID.Span, id)
}
}
}