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
|
/*
Copyright The ORAS Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package tree
import (
"bytes"
"reflect"
"testing"
)
func TestNode_Add(t *testing.T) {
root := &Node{
Value: "root",
}
nodeNil := root.Add(nil)
want := &Node{}
if !reflect.DeepEqual(nodeNil, want) {
t.Errorf("Node.Add() = %v, want %v", nodeNil, want)
}
nodeFoo := root.Add("foo")
want = &Node{
Value: "foo",
}
if !reflect.DeepEqual(nodeFoo, want) {
t.Errorf("Node.Add() = %v, want %v", nodeFoo, want)
}
nodeBar := nodeFoo.Add("bar")
want = &Node{
Value: "bar",
}
if !reflect.DeepEqual(nodeBar, want) {
t.Errorf("Node.Add() = %v, want %v", nodeBar, want)
}
node42 := root.Add(42)
want = &Node{
Value: 42,
}
if !reflect.DeepEqual(node42, want) {
t.Errorf("Node.Add() = %v, want %v", node42, want)
}
buf := bytes.NewBuffer(nil)
printer := NewPrinter(buf)
if err := printer.Print(root); err != nil {
t.Fatalf("Printer.Print() error = %v", err)
}
gotPrint := buf.String()
// root
// ├── <nil>
// ├── foo
// │ └── bar
// └── 42
wantPrint := "root\n├── <nil>\n├── foo\n│ └── bar\n└── 42\n"
if gotPrint != wantPrint {
t.Errorf("Node = %s, want %s", gotPrint, wantPrint)
}
}
func TestNode_AddPath(t *testing.T) {
root := &Node{
Value: "root",
}
nodeNil := root.AddPath()
var want *Node
if !reflect.DeepEqual(nodeNil, want) {
t.Errorf("Node.AddPath() = %v, want %v", nodeNil, want)
}
nodeBar := root.AddPath("foo", "bar")
want = &Node{
Value: "bar",
}
if !reflect.DeepEqual(nodeBar, want) {
t.Errorf("Node.AddPath() = %v, want %v", nodeBar, want)
}
nodeBar2 := root.AddPath("foo", "bar2")
want = &Node{
Value: "bar2",
}
if !reflect.DeepEqual(nodeBar2, want) {
t.Errorf("Node.AddPath() = %v, want %v", nodeBar2, want)
}
node42 := root.AddPath(42)
want = &Node{
Value: 42,
}
if !reflect.DeepEqual(node42, want) {
t.Errorf("Node.AddPath() = %v, want %v", node42, want)
}
buf := bytes.NewBuffer(nil)
printer := NewPrinter(buf)
if err := printer.Print(root); err != nil {
t.Fatalf("Printer.Print() error = %v", err)
}
gotPrint := buf.String()
// root
// ├── foo
// │ ├── bar
// │ └── bar2
// └── 42
wantPrint := "root\n├── foo\n│ ├── bar\n│ └── bar2\n└── 42\n"
if gotPrint != wantPrint {
t.Errorf("Node = %s, want %s", gotPrint, wantPrint)
}
}
func TestNode_Find(t *testing.T) {
root := &Node{
Value: "root",
Nodes: []*Node{
{
Value: "foo",
Nodes: []*Node{
{
Value: "bar",
},
},
},
{
Value: 42,
},
},
}
tests := []struct {
name string
value any
want *Node
}{
{
name: "find existing node",
value: 42,
want: root.Nodes[1],
},
{
name: "find non-existing node",
value: "hello",
want: nil,
},
{
name: "find non-existing node but it is a grand child",
value: "bar",
want: nil,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := root.Find(tt.value); !reflect.DeepEqual(got, tt.want) {
t.Errorf("Node.Find() = %v, want %v", got, tt.want)
}
})
}
}
|
