(t *testing.T)
| 26 | } |
| 27 | |
| 28 | func TestIndexReadTree(t *testing.T) { |
| 29 | t.Parallel() |
| 30 | repo := createTestRepo(t) |
| 31 | defer cleanupTestRepo(t, repo) |
| 32 | |
| 33 | _, _ = seedTestRepo(t, repo) |
| 34 | |
| 35 | ref, err := repo.Head() |
| 36 | checkFatal(t, err) |
| 37 | |
| 38 | obj, err := ref.Peel(ObjectTree) |
| 39 | checkFatal(t, err) |
| 40 | |
| 41 | tree, err := obj.AsTree() |
| 42 | checkFatal(t, err) |
| 43 | |
| 44 | idx, err := NewIndex() |
| 45 | checkFatal(t, err) |
| 46 | |
| 47 | err = idx.ReadTree(tree) |
| 48 | checkFatal(t, err) |
| 49 | |
| 50 | id, err := idx.WriteTreeTo(repo) |
| 51 | checkFatal(t, err) |
| 52 | |
| 53 | if tree.Id().Cmp(id) != 0 { |
| 54 | t.Fatalf("Read and written trees are not the same") |
| 55 | } |
| 56 | } |
| 57 | |
| 58 | func TestIndexWriteTreeTo(t *testing.T) { |
| 59 | t.Parallel() |
nothing calls this directly
no test coverage detected
searching dependent graphs…