object: Split each object type into its own package v0.1.108

1 files changed, 0 insertions, 76 deletions

diff --git a/object/tree_parse_test.go b/object/tree_parse_test.go
deleted file mode 100644
index 2e78243c..00000000
--- a/object/tree_parse_test.go
+++ /dev/null
@@ -1,76 +0,0 @@
-package object_test
-
-import (
-	"bytes"
-	"testing"
-
-	"codeberg.org/lindenii/furgit/internal/testgit"
-	"codeberg.org/lindenii/furgit/object"
-	objectid "codeberg.org/lindenii/furgit/object/id"
-)
-
-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 {
-			err := inserted.InsertEntry(entry)
-			if 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)
-
-			if got == nil {
-				t.Fatalf("Entry(%q) returned nil", want.Name)
-			}
-
-			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")
-		}
-	})
-}