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
|
package object_test
import (
"bytes"
"testing"
"codeberg.org/lindenii/furgit/internal/testgit"
"codeberg.org/lindenii/furgit/object"
"codeberg.org/lindenii/furgit/objectid"
)
func TestTreeParseFromGit(t *testing.T) {
t.Parallel()
testgit.ForEachAlgorithm(t, func(t *testing.T, algo objectid.Algorithm) { //nolint:thelper
testRepo := testgit.NewRepo(t, testgit.RepoOptions{ObjectFormat: algo, Bare: true})
entries := adversarialRootEntries(t, testRepo)
inserted := &object.Tree{}
for _, entry := range entries {
if err := inserted.InsertEntry(entry); err != nil {
t.Fatalf("InsertEntry(%q): %v", entry.Name, err)
}
}
treeID := testRepo.Mktree(t, buildGitMktreeInput(inserted.Entries))
rawBody := testRepo.CatFile(t, "tree", treeID)
tree, err := object.ParseTree(rawBody, algo)
if err != nil {
t.Fatalf("ParseTree: %v", err)
}
if len(tree.Entries) != len(inserted.Entries) {
t.Fatalf("entry count = %d, want %d", len(tree.Entries), len(inserted.Entries))
}
for i := range inserted.Entries {
got := tree.Entries[i]
want := inserted.Entries[i]
if got.Mode != want.Mode || got.ID != want.ID || !bytes.Equal(got.Name, want.Name) {
t.Fatalf("entry[%d] mismatch: got (%o,%q,%s) want (%o,%q,%s)",
i, got.Mode, got.Name, got.ID, want.Mode, want.Name, want.ID)
}
}
lsNames := gitLsTreeNames(testRepo.RunBytes(t, "ls-tree", "--name-only", "-z", treeID.String()))
if len(lsNames) != len(tree.Entries) {
t.Fatalf("ls-tree names = %d, want %d", len(lsNames), len(tree.Entries))
}
for i := range lsNames {
if !bytes.Equal(lsNames[i], tree.Entries[i].Name) {
t.Fatalf("ordering mismatch at %d: git=%q parsed=%q", i, lsNames[i], tree.Entries[i].Name)
}
}
for _, want := range inserted.Entries {
got := tree.Entry(want.Name)
//nolint:staticcheck
if got == nil {
t.Fatalf("Entry(%q) returned nil", want.Name)
}
//nolint:staticcheck
if got.Mode != want.Mode || got.ID != want.ID {
t.Fatalf("Entry(%q) mismatch", want.Name)
}
}
if tree.Entry([]byte("does-not-exist")) != nil {
t.Fatalf("Entry on missing name should be nil")
}
})
}
|
