diff options
Diffstat (limited to 'object/tree_parse_test.go')
| -rw-r--r-- | object/tree_parse_test.go | 9 |
1 files changed, 8 insertions, 1 deletions
diff --git a/object/tree_parse_test.go b/object/tree_parse_test.go index 989d6ff1..d4b7c1e6 100644 --- a/object/tree_parse_test.go +++ b/object/tree_parse_test.go @@ -14,9 +14,11 @@ func TestTreeParseFromGit(t *testing.T) { 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 { + err := inserted.InsertEntry(entry) + if err != nil { t.Fatalf("InsertEntry(%q): %v", entry.Name, err) } } @@ -24,16 +26,19 @@ func TestTreeParseFromGit(t *testing.T) { 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)", @@ -45,6 +50,7 @@ func TestTreeParseFromGit(t *testing.T) { 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) @@ -62,6 +68,7 @@ func TestTreeParseFromGit(t *testing.T) { t.Fatalf("Entry(%q) mismatch", want.Name) } } + if tree.Entry([]byte("does-not-exist")) != nil { t.Fatalf("Entry on missing name should be nil") } |