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
|
/*
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 pretty prints trees
package tree
import "reflect"
// Node represents a tree node.
type Node struct {
Value any
Nodes []*Node
}
// New creates a new tree / root node.
func New(value any) *Node {
return &Node{
Value: value,
}
}
// Add adds a leaf node.
func (n *Node) Add(value any) *Node {
node := New(value)
n.Nodes = append(n.Nodes, node)
return node
}
// AddPath adds a chain of nodes.
func (n *Node) AddPath(values ...any) *Node {
if len(values) == 0 {
return nil
}
current := n
for _, value := range values {
if node := current.Find(value); node == nil {
current = current.Add(value)
} else {
current = node
}
}
return current
}
// Find finds the child node with the target value.
// Nil if not found.
func (n *Node) Find(value any) *Node {
for _, node := range n.Nodes {
if reflect.DeepEqual(node.Value, value) {
return node
}
}
return nil
}
|
