Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit4333dcb

Browse files
committed
Mmmmm
1 parent1533596 commit4333dcb

File tree

2 files changed

+12
-15
lines changed

2 files changed

+12
-15
lines changed

‎git/index/fun.py‎

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -61,7 +61,7 @@
6161

6262

6363
defis_three_entry_list(inp)->TypeGuard[List['EntryTupOrNone']]:
64-
returnisinstance(inp,list)andlen(inp)==3
64+
returnisinstance(inp,(tuple,list))andlen(inp)==3
6565

6666
# ------------------------------------------------------------------------------------
6767

@@ -339,10 +339,9 @@ def aggressive_tree_merge(odb, tree_shas: Sequence[bytes]) -> List[BaseIndexEntr
339339
raiseValueError("Cannot handle %i trees at once"%len(tree_shas))
340340

341341
# three trees
342-
forthree_entriesintraverse_trees_recursive(odb,tree_shas,''):
343-
344-
assertis_three_entry_list(three_entries)
345-
base,ours,theirs=three_entries
342+
forentryointraverse_trees_recursive(odb,tree_shas,''):
343+
assertis_three_entry_list(entryo),f"{type(entryo)=} and{len(entryo)=}"# type:ignore
344+
base,ours,theirs=entryo
346345
ifbaseisnotNone:
347346
# base version exists
348347
ifoursisnotNone:

‎git/objects/fun.py‎

Lines changed: 8 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -102,13 +102,13 @@ def tree_entries_from_data(data: bytes) -> List[EntryTup]:
102102
returnout
103103

104104

105-
def_find_by_name(tree_data:Sequence[Union[EntryTup,None]],name:str,is_dir:bool,start_at:int
106-
)->Union[EntryTup,None]:
105+
def_find_by_name(tree_data:Sequence[EntryTupOrNone],name:str,is_dir:bool,start_at:int
106+
)->EntryTupOrNone:
107107
"""return data entry matching the given name and tree mode
108108
or None.
109109
Before the item is returned, the respective data item is set
110110
None in the tree_data list to mark it done"""
111-
tree_data_list:List[Union[EntryTup,None]]=list(tree_data)
111+
tree_data_list:List[EntryTupOrNone]=list(tree_data)
112112
try:
113113
item=tree_data_list[start_at]
114114
ifitemanditem[2]==nameandS_ISDIR(item[1])==is_dir:
@@ -136,15 +136,15 @@ def _to_full_path(item: EntryTup, path_prefix: str) -> EntryTup:
136136
...
137137

138138

139-
def_to_full_path(item:Union[EntryTup,None],path_prefix:str)->Union[EntryTup,None]:
139+
def_to_full_path(item:EntryTupOrNone,path_prefix:str)->EntryTupOrNone:
140140
"""Rebuild entry with given path prefix"""
141141
ifnotitem:
142142
returnitem
143143
return (item[0],item[1],path_prefix+item[2])
144144

145145

146146
deftraverse_trees_recursive(odb:'GitCmdObjectDB',tree_shas:Sequence[Union[bytes,None]],
147-
path_prefix:str)->List[Union[EntryTup,None]]:
147+
path_prefix:str)->List[EntryTupOrNone]:
148148
"""
149149
:return: list with entries according to the given binary tree-shas.
150150
The result is encoded in a list
@@ -159,11 +159,11 @@ def traverse_trees_recursive(odb: 'GitCmdObjectDB', tree_shas: Sequence[Union[by
159159
:param path_prefix: a prefix to be added to the returned paths on this level,
160160
set it '' for the first iteration
161161
:note: The ordering of the returned items will be partially lost"""
162-
trees_data:List[List[Union[EntryTup,None]]]= []
162+
trees_data:List[List[EntryTupOrNone]]= []
163163
nt=len(tree_shas)
164164
fortree_shaintree_shas:
165165
iftree_shaisNone:
166-
data:List[Union[EntryTup,None]]= []
166+
data:List[EntryTupOrNone]= []
167167
else:
168168
data=list(tree_entries_from_data(odb.stream(tree_sha).read()))# make new list for typing as invariant
169169
# END handle muted trees
@@ -181,7 +181,7 @@ def traverse_trees_recursive(odb: 'GitCmdObjectDB', tree_shas: Sequence[Union[by
181181
ifnotitem:
182182
continue
183183
# END skip already done items
184-
entries:List[Union[EntryTup,None]]
184+
entries:List[EntryTupOrNone]
185185
entries= [Nonefor_inrange(nt)]
186186
entries[ti]=item
187187
_sha,mode,name=item
@@ -196,8 +196,6 @@ def traverse_trees_recursive(odb: 'GitCmdObjectDB', tree_shas: Sequence[Union[by
196196
entries[tio]=_find_by_name(td,name,is_dir,ii)
197197

198198
# END for each other item data
199-
#Revealed type is "builtins.list[Union[Tuple[builtins.bytes, builtins.int, builtins.str], None]]"## #
200-
#Revealed type is "builtins.list[Union[Tuple[builtins.bytes, builtins.int, builtins.str], None]]"
201199
# if we are a directory, enter recursion
202200
ifis_dir:
203201
out.extend(traverse_trees_recursive(

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2026 Movatter.jp