(barerepo: Repository)
| 103 | |
| 104 | |
| 105 | def test_read_subtree(barerepo: Repository) -> None: |
| 106 | tree = barerepo[TREE_SHA] |
| 107 | assert isinstance(tree, Tree) |
| 108 | |
| 109 | subtree_entry = tree['c'] |
| 110 | assertTreeEntryEqual(subtree_entry, SUBTREE_SHA, 'c', 0o0040000) |
| 111 | assert subtree_entry.type == int(ObjectType.TREE) |
| 112 | assert subtree_entry.type_str == 'tree' |
| 113 | |
| 114 | subtree_entry = tree / 'c' |
| 115 | assertTreeEntryEqual(subtree_entry, SUBTREE_SHA, 'c', 0o0040000) |
| 116 | assert subtree_entry.type == int(ObjectType.TREE) |
| 117 | assert subtree_entry.type_str == 'tree' |
| 118 | |
| 119 | subtree = barerepo[subtree_entry.id] |
| 120 | assert isinstance(subtree, Tree) |
| 121 | assert 1 == len(subtree) |
| 122 | sha = '297efb891a47de80be0cfe9c639e4b8c9b450989' |
| 123 | assertTreeEntryEqual(subtree[0], sha, 'd', 0o0100644) |
| 124 | |
| 125 | subtree_entry = tree / 'c' |
| 126 | assert subtree_entry == barerepo[subtree_entry.id] |
| 127 | |
| 128 | |
| 129 | def test_new_tree(barerepo: Repository) -> None: |
nothing calls this directly
no test coverage detected
searching dependent graphs…