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
|
package filetree
import (
"sort"
"strings"
)
type FileNode struct {
Tree *FileTree
Parent *FileNode
Name string
Collapsed bool
Hidden bool
Data *FileChangeInfo
Children map[string]*FileNode
}
func NewNode(parent *FileNode, name string, data *FileChangeInfo) (node *FileNode) {
node = new(FileNode)
node.Name = name
if data == nil {
data = &FileChangeInfo{}
}
node.Data = data
node.Children = make(map[string]*FileNode)
node.Parent = parent
if parent != nil {
node.Tree = parent.Tree
}
return node
}
func (node *FileNode) Copy() *FileNode {
// newNode := new(FileNode)
// *newNode = *node
// return newNode
newNode := NewNode(node.Parent, node.Name, node.Data)
for name, child := range node.Children {
newNode.Children[name] = child.Copy()
}
return newNode
}
func (node *FileNode) AddChild(name string, data *FileChangeInfo) (child *FileNode) {
child = NewNode(node, name, data)
if node.Children[name] != nil {
// tree node already exists, replace the payload, keep the children
node.Children[name].Data = data
} else {
node.Children[name] = child
node.Tree.Size++
}
return child
}
func (node *FileNode) Remove() error {
for _, child := range node.Children {
child.Remove()
}
delete(node.Parent.Children, node.Name)
node.Tree.Size--
return nil
}
func (node *FileNode) String() string {
return node.Name
}
func (node *FileNode) Visit(visiter Visiter) error {
var keys []string
for key := range node.Children {
keys = append(keys, key)
}
sort.Strings(keys)
for _, name := range keys {
child := node.Children[name]
err := child.Visit(visiter)
if err != nil {
return err
}
}
return visiter(node)
}
func (node *FileNode) VisitDepthParentFirst(visiter Visiter, evaluator VisitEvaluator) error {
err := visiter(node)
if err != nil {
return err
}
var keys []string
for key := range node.Children {
keys = append(keys, key)
}
sort.Strings(keys)
for _, name := range keys {
child := node.Children[name]
if evaluator == nil || !evaluator(node) {
continue
}
err = child.VisitDepthParentFirst(visiter, evaluator)
if err != nil {
return err
}
}
return err
}
func (node *FileNode) IsWhiteout() bool {
return strings.HasPrefix(node.Name, whiteoutPrefix)
}
func (node *FileNode) Path() string {
path := []string{}
curNode := node
for {
if curNode.Parent == nil {
break
}
name := curNode.Name
if curNode == node {
// white out prefixes are fictitious on leaf nodes
name = strings.TrimPrefix(name, whiteoutPrefix)
}
path = append([]string{name}, path...)
curNode = curNode.Parent
}
return "/" + strings.Join(path, "/")
}
func (node *FileNode) IsLeaf() bool {
return len(node.Children) == 0
}
func (node *FileNode) deriveDiffType(diffType DiffType) error {
// THE DIFF_TYPE OF A NODE IS ALWAYS THE DIFF_TYPE OF ITS ATTRIBUTES AND ITS CONTENTS
// THE CONTENTS ARE THE BYTES OF A FILE OR THE CHILDREN OF A DIRECTORY
if node.IsLeaf() {
node.AssignDiffType(diffType)
return nil
}
myDiffType := diffType
for _, v := range node.Children {
vData := v.Data
myDiffType = myDiffType.merge(vData.DiffType)
}
node.AssignDiffType(myDiffType)
return nil
}
func (node *FileNode) AssignDiffType(diffType DiffType) error {
if node.Path() == "/" {
return nil
}
node.Data.DiffType = diffType
return nil
}
func (a *FileNode) compare(b *FileNode) DiffType {
if a == nil && b == nil {
return Unchanged
}
// a is nil but not b
if a == nil && b != nil {
return Added
}
// b is nil but not a
if a != nil && b == nil {
return Removed
}
if b.IsWhiteout() {
return Removed
}
if a.Name != b.Name {
panic("comparing mismatched nodes")
}
// TODO: fails on nil
return a.Data.getDiffType(b.Data)
}
|
