@@ -1086,9 +1086,6 @@ def reduce_by(self, package_request: Requirement) -> tuple[_PackageScope | None,
10861086 if self .is_conflict or self .is_ephemeral :
10871087 return (self , [])
10881088
1089- assert self .variant_slice is not None , \
1090- "variant_slice should always exist for non-conflicted non-ephemeral requests"
1091-
10921089 # perform the reduction
10931090 new_slice , reductions = self .variant_slice .reduce_by (package_request )
10941091
@@ -1299,7 +1296,7 @@ def _create_phase(status: SolverStatus | None = None) -> _ResolvePhase:
12991296 # iteratively extract until no more extractions possible
13001297 while True :
13011298 self .pr .subheader ("EXTRACTING:" )
1302- extracted_requests_ = []
1299+ extracted_requests = []
13031300
13041301 # perform all possible extractions
13051302 with self .solver .timed (self .solver .extraction_time ):
@@ -1308,20 +1305,20 @@ def _create_phase(status: SolverStatus | None = None) -> _ResolvePhase:
13081305 scope_ , extracted_request = scopes [i ].extract ()
13091306
13101307 if extracted_request :
1311- extracted_requests_ .append (extracted_request )
1308+ extracted_requests .append (extracted_request )
13121309 k = (scopes [i ].package_name , extracted_request .name )
13131310 extractions [k ] = extracted_request
13141311 self .solver .extractions_count += 1
13151312 scopes [i ] = scope_
13161313 else :
13171314 break
13181315
1319- if not extracted_requests_ :
1316+ if not extracted_requests :
13201317 break
13211318
13221319 # simplify extractions (there may be overlaps)
13231320 self .pr .subheader ("MERGE-EXTRACTIONS:" )
1324- extracted_requests = RequirementList (extracted_requests_ )
1321+ extracted_requests = RequirementList (extracted_requests )
13251322
13261323 if extracted_requests .conflict : # extractions are in conflict
13271324 req1 , req2 = extracted_requests .conflict
@@ -1464,10 +1461,10 @@ def _create_phase(status: SolverStatus | None = None) -> _ResolvePhase:
14641461 # A different order here wouldn't cause an invalid solve, however
14651462 # rez solves must be deterministic, so this is why we sort.
14661463 #
1467- pending_reducts_ = sorted (pending_reducts )
1464+ pending_reducts = sorted (pending_reducts )
14681465
1469- while pending_reducts_ :
1470- x , y = pending_reducts_ .pop ()
1466+ while pending_reducts :
1467+ x , y = pending_reducts .pop ()
14711468 if x == y :
14721469 continue
14731470
@@ -1484,7 +1481,7 @@ def _create_phase(status: SolverStatus | None = None) -> _ResolvePhase:
14841481 # other scopes need to reduce against x again
14851482 for j in all_scopes_i :
14861483 if j != x :
1487- pending_reducts_ .append ((j , x ))
1484+ pending_reducts .append ((j , x ))
14881485
14891486 changed_scopes_i = set ()
14901487
@@ -1974,12 +1971,12 @@ def __init__(self,
19741971 self .optimised = optimised
19751972
19761973 # these values are all set in _init()
1977- self .phase_stack : list [_ResolvePhase ]
1978- self .failed_phase_list : list [_ResolvePhase ]
1979- self .depth_counts : dict
1980- self .solve_begun : bool
1981- self .solve_time : float
1982- self .load_time : float
1974+ self .phase_stack : list [_ResolvePhase ] = None
1975+ self .failed_phase_list : list [_ResolvePhase ] = None
1976+ self .depth_counts : dict = None
1977+ self .solve_begun : bool = None
1978+ self .solve_time : float = None
1979+ self .load_time : float = None
19831980
19841981 self .abort_reason : str | None = None
19851982 self .callback_return : SolverCallbackReturn | None = None
@@ -2320,7 +2317,7 @@ def dump(self) -> None:
23202317 for i , phase in enumerate (self .phase_stack ):
23212318 rows .append ((self ._depth_label (i ), phase .status , str (phase )))
23222319
2323- print ("status: %s (%s)" % (self .status .name , self .status .value [ 0 ] ))
2320+ print ("status: %s (%s)" % (self .status .name , self .status .description ))
23242321 print ("initial request: %s" % str (self .request_list ))
23252322 print ()
23262323 print ("solve stack:" )
0 commit comments