57
57
58
58
if TYPE_CHECKING :
59
59
from .base import IndexFile
60
- from objects .tree import TreeCacheTup
60
+ from git . objects .tree import TreeCacheTup
61
61
# from git.objects.fun import EntryTupOrNone
62
62
63
63
# ------------------------------------------------------------------------------------
@@ -250,7 +250,7 @@ def read_cache(stream: IO[bytes]) -> Tuple[int, Dict[Tuple[PathLike, int], 'Inde
250
250
251
251
252
252
def write_tree_from_cache (entries : List [IndexEntry ], odb , sl : slice , si : int = 0
253
- ) -> Tuple [bytes , List [TreeCacheTup ]]:
253
+ ) -> Tuple [bytes , List [' TreeCacheTup' ]]:
254
254
"""Create a tree from the given sorted list of entries and put the respective
255
255
trees into the given object database
256
256
@@ -260,7 +260,7 @@ def write_tree_from_cache(entries: List[IndexEntry], odb, sl: slice, si: int = 0
260
260
:param sl: slice indicating the range we should process on the entries list
261
261
:return: tuple(binsha, list(tree_entry, ...)) a tuple of a sha and a list of
262
262
tree entries being a tuple of hexsha, mode, name"""
263
- tree_items : List [TreeCacheTup ] = []
263
+ tree_items : List [' TreeCacheTup' ] = []
264
264
265
265
ci = sl .start
266
266
end = sl .stop
@@ -306,7 +306,7 @@ def write_tree_from_cache(entries: List[IndexEntry], odb, sl: slice, si: int = 0
306
306
return (istream .binsha , tree_items )
307
307
308
308
309
- def _tree_entry_to_baseindexentry (tree_entry : TreeCacheTup , stage : int ) -> BaseIndexEntry :
309
+ def _tree_entry_to_baseindexentry (tree_entry : ' TreeCacheTup' , stage : int ) -> BaseIndexEntry :
310
310
return BaseIndexEntry ((tree_entry [1 ], tree_entry [0 ], stage << CE_STAGESHIFT , tree_entry [2 ]))
311
311
312
312
0 commit comments