(t *testing.T)
| 26 | } |
| 27 | |
| 28 | func TestTreeBuilderInsert(t *testing.T) { |
| 29 | t.Parallel() |
| 30 | repo := createTestRepo(t) |
| 31 | defer cleanupTestRepo(t, repo) |
| 32 | |
| 33 | subTree, err := repo.TreeBuilder() |
| 34 | if err != nil { |
| 35 | t.Fatalf("TreeBuilder: %v", err) |
| 36 | } |
| 37 | defer subTree.Free() |
| 38 | |
| 39 | odb, err := repo.Odb() |
| 40 | if err != nil { |
| 41 | t.Fatalf("repo.Odb: %v", err) |
| 42 | } |
| 43 | blobId, err := odb.Write([]byte("hello"), ObjectBlob) |
| 44 | if err != nil { |
| 45 | t.Fatalf("odb.Write: %v", err) |
| 46 | } |
| 47 | if err = subTree.Insert("subfile", blobId, FilemodeBlobExecutable); err != nil { |
| 48 | t.Fatalf("TreeBuilder.Insert: %v", err) |
| 49 | } |
| 50 | treeID, err := subTree.Write() |
| 51 | if err != nil { |
| 52 | t.Fatalf("TreeBuilder.Write: %v", err) |
| 53 | } |
| 54 | |
| 55 | tree, err := repo.LookupTree(treeID) |
| 56 | if err != nil { |
| 57 | t.Fatalf("LookupTree: %v", err) |
| 58 | } |
| 59 | |
| 60 | entry, err := tree.EntryByPath("subfile") |
| 61 | if err != nil { |
| 62 | t.Fatalf("tree.EntryByPath(%q): %v", "subfile", err) |
| 63 | } |
| 64 | |
| 65 | if !entry.Id.Equal(blobId) { |
| 66 | t.Fatalf("got oid %v, want %v", entry.Id, blobId) |
| 67 | } |
| 68 | } |
| 69 | |
| 70 | func TestTreeWalk(t *testing.T) { |
| 71 | t.Parallel() |
nothing calls this directly
no test coverage detected
searching dependent graphs…