Files
go-fuse/fs/inode_parents_test.go
Han-Wen NienhuysandHan-Wen Nienhuys 0f41d79d27 Run gofmt -s -w globally
Change-Id: I1aff29b88edff004f2b1cf7c36831c1767608b0d
2023-01-30 14:02:33 +00:00

56 lines
1.1 KiB
Go

package fs
import (
"testing"
)
func TestInodeParents(t *testing.T) {
var p inodeParents
var ino1, ino2, ino3 Inode
// empty store should be empty without panicing
if count := p.count(); count != 0 {
t.Error(count)
}
if p.all() != nil {
t.Error("empty store should return nil but did not")
}
// non-dupes should be stored
all := []parentData{
{"foo", &ino1},
{"foo2", &ino1},
{"foo3", &ino1},
{"foo", &ino2},
{"foo", &ino3},
}
for i, v := range all {
p.add(v)
if count := p.count(); count != i+1 {
t.Errorf("want=%d have=%d", i+1, count)
}
last := p.get()
if *last != v {
t.Error("get did not give us last-known parent")
}
}
// adding dupes should not cause the count to increase, but
// must cause get() to return the most recently added dupe.
for _, v := range all {
p.add(v)
if count := p.count(); count != len(all) {
t.Errorf("want=%d have=%d", len(all), count)
}
last := p.get()
if *last != v {
t.Error("get did not give us last-known parent")
}
}
all2 := p.all()
if len(all) != len(all2) {
t.Errorf("want=%d have=%d", len(all), len(all2))
}
}