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
|
package mount
import (
"github.com/chrislusf/seaweedfs/weed/util"
"testing"
)
func TestInodeEntry_removeOnePath(t *testing.T) {
tests := []struct {
name string
entry InodeEntry
p util.FullPath
want bool
count int
}{
{
name: "actual case",
entry: InodeEntry{
paths: []util.FullPath{"/pjd/nx", "/pjd/n0"},
},
p: "/pjd/nx",
want: true,
count: 1,
},
{
name: "empty",
entry: InodeEntry{},
p: "x",
want: false,
count: 0,
},
{
name: "single",
entry: InodeEntry{
paths: []util.FullPath{"/x"},
},
p: "/x",
want: true,
count: 0,
},
{
name: "first",
entry: InodeEntry{
paths: []util.FullPath{"/x", "/y", "/z"},
},
p: "/x",
want: true,
count: 2,
},
{
name: "middle",
entry: InodeEntry{
paths: []util.FullPath{"/x", "/y", "/z"},
},
p: "/y",
want: true,
count: 2,
},
{
name: "last",
entry: InodeEntry{
paths: []util.FullPath{"/x", "/y", "/z"},
},
p: "/z",
want: true,
count: 2,
},
{
name: "not found",
entry: InodeEntry{
paths: []util.FullPath{"/x", "/y", "/z"},
},
p: "/t",
want: false,
count: 3,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := tt.entry.removeOnePath(tt.p); got != tt.want {
t.Errorf("removeOnePath() = %v, want %v", got, tt.want)
}
if tt.count != len(tt.entry.paths) {
t.Errorf("removeOnePath path count = %v, want %v", len(tt.entry.paths), tt.count)
}
for i, p := range tt.entry.paths {
if p == tt.p {
t.Errorf("removeOnePath found path still exists at %v, %v", i, p)
}
}
})
}
}
|
