runxiyu.tngl.sh
Fast implementation of Git in pure Go
1package object_test
2
3import (
4 "bytes"
5 "testing"
6
7 "codeberg.org/lindenii/furgit/internal/testgit"
8 "codeberg.org/lindenii/furgit/object"
9 "codeberg.org/lindenii/furgit/objectid"
10)
11
12func TestTreeParseFromGit(t *testing.T) {
13 t.Parallel()
14 testgit.ForEachAlgorithm(t, func(t *testing.T, algo objectid.Algorithm) { //nolint:thelper
15 testRepo := testgit.NewRepo(t, testgit.RepoOptions{ObjectFormat: algo, Bare: true})
16 entries := adversarialRootEntries(t, testRepo)
17
18 inserted := &object.Tree{}
19 for _, entry := range entries {
20 err := inserted.InsertEntry(entry)
21 if err != nil {
22 t.Fatalf("InsertEntry(%q): %v", entry.Name, err)
23 }
24 }
25
26 treeID := testRepo.Mktree(t, buildGitMktreeInput(inserted.Entries))
27
28 rawBody := testRepo.CatFile(t, "tree", treeID)
29
30 tree, err := object.ParseTree(rawBody, algo)
31 if err != nil {
32 t.Fatalf("ParseTree: %v", err)
33 }
34
35 if len(tree.Entries) != len(inserted.Entries) {
36 t.Fatalf("entry count = %d, want %d", len(tree.Entries), len(inserted.Entries))
37 }
38
39 for i := range inserted.Entries {
40 got := tree.Entries[i]
41
42 want := inserted.Entries[i]
43 if got.Mode != want.Mode || got.ID != want.ID || !bytes.Equal(got.Name, want.Name) {
44 t.Fatalf("entry[%d] mismatch: got (%o,%q,%s) want (%o,%q,%s)",
45 i, got.Mode, got.Name, got.ID, want.Mode, want.Name, want.ID)
46 }
47 }
48
49 lsNames := gitLsTreeNames(testRepo.RunBytes(t, "ls-tree", "--name-only", "-z", treeID.String()))
50 if len(lsNames) != len(tree.Entries) {
51 t.Fatalf("ls-tree names = %d, want %d", len(lsNames), len(tree.Entries))
52 }
53
54 for i := range lsNames {
55 if !bytes.Equal(lsNames[i], tree.Entries[i].Name) {
56 t.Fatalf("ordering mismatch at %d: git=%q parsed=%q", i, lsNames[i], tree.Entries[i].Name)
57 }
58 }
59
60 for _, want := range inserted.Entries {
61 got := tree.Entry(want.Name)
62
63 if got == nil {
64 t.Fatalf("Entry(%q) returned nil", want.Name)
65 }
66
67 if got.Mode != want.Mode || got.ID != want.ID {
68 t.Fatalf("Entry(%q) mismatch", want.Name)
69 }
70 }
71
72 if tree.Entry([]byte("does-not-exist")) != nil {
73 t.Fatalf("Entry on missing name should be nil")
74 }
75 })
76}