+ 2j;OVRt^RIHt^RIHtHt^RIHt^RIH t ^RI H t ^RI H t Ht^RIHt^RIHtHt]'d^R I Ht^R IHt^R IHt.R%Ot^t^t^t^t^ tR R ltRRltRRlt RRlt!RRlt"RRlt#RRlt$RRlt%RRlt&RRlt'R R!lt(R"R#lt)R$#)&aLConflict resolution and backtracking for the PubGrub resolver. Owns the conflict-resolution loop, the most-recent-satisfier search, the always-learn force-resolution gate, the targeted backtrack queue, and the catastrophic restart handler. Reference: https://github.com/dart-lang/pub/blob/master/doc/solver.md#conflict-resolution ) annotations) TYPE_CHECKINGAny)ResolutionError)add_incompatibility)PartialSolution) format_error prior_cause)ROOT)IncompatibilityIncompatibilityCause) Assignment)Resolver)Termc$V^8dQhRRRRRR/#)resolverResolver[Any, Any]conflicting_incompatibilityIncompatibility[Any, Any]return)formats"`/home/user/billing-ledger-validation/.venv/lib/python3.14/site-packages/nab_resolver/conflict.py __annotate__r>s0MTMT MT!:MTMTc TpRp\\VPP\,4p\ V4EFp\ V4'd8\\VVPPVPR7VR7h\W4pV^,pV^,pV^,p VP;'gWP8gp V 'd \VVVVV 4wpppp p V 'dRpVP P#VVP$VPVPV V R7V 'EdV'dJ\'W4VP(;P*^, unVP P-V4T p VP'd$WP8dVP^, p \/WPP4p \V ^4p V ^8Xd8\\VVPPVPR7VR7hVPPp VPP1V 4VP(;P2^, unVP P5W4VP$pVP(P6\9V4;;,^, uu&\;VVVV4Vu#VP<fQhVfQhRp\?VVP<VP$4p\AV\BPDVVP<R7pEK RV RV: 2p\VVR7h) a1Learn a new incompatibility and backjump to the appropriate level. Implements PubGrub's conflict resolution algorithm: resolve backwards through the assignment trail combining incompatibilities until the learned clause has at most one term at the current decision level. Raises ``ResolutionError`` when the conflict proves the requirements unsatisfiable, and also when the loop exceeds its step budget, which signals a resolver bug rather than an unsatisfiable input. Reference: https://github.com/dart-lang/pub/blob/master/doc/solver.md#conflict-resolution F)narrow format_rangeincompatibilityT)satisfier_packagesatisfier_is_decisionsatisfier_levelprevious_level can_backjumpcause cause_left cause_rightz(Conflict resolution made no progress in zT steps; this is a resolver bug rather than an unsatisfiable requirement. Stalled on )#max_MIN_CONFLICT_STEPSsolution trail_length_STEPS_PER_TRAIL_ENTRYrangeis_terminal_incompatibilityrrprovidernarrow_for_displayrfind_most_recent_satisfier is_decisiondecision_leveliterate_force_resolutionobserveron_conflict_steppackagerstatsincompatibilities_learned on_learnedmin backtrack backjumps on_backjumppackage_conflict_countsconflict_credit_targetupdate_culprit_countsr'r r r DERIVED)rrcurrent_incompatibility is_derived step_budget_satisfier_resultmost_recent_satisfiermost_recent_satisfier_termprevious_satisfier_levelr% forced_anybackjump_target from_levelaffected_packageresolved_termsstalled_messages&& rconflict_resolutionrS>sY":J&&)??K ;  &'> ? ?!+#,,??!)!6!6 !8  6hX 0 3%5a%8"#3A#6  " - - P P'+O+OO  )'%*(   '%*(! ** #3;;"7"C"C1@@3% +  <#HF88A=8!!,,-DE6O%111#'K'KK"7"F"F"J!/3D3D3S3STO!/15O!#% /'00CC%-%:%: %< "**99J    ' ' 8 NN $ $ ) $    ) )* F 5<<  NN 2 2&'<=    "' %  + *%**666)555 $ # ! ' ' & . .  #2 &...-33 # S b 3;-@O " % ' /;R SSrc ,V^8dQhRRRRRRRRR R /#) rrrr rrPr satisfierAssignment[Any, Any]rNoner)rs"rrrsA(@(@ (@.(@(@$ (@  (@rc/pVPF%pVPpV\JgWb8XdK!RWF&K' \VP4^8XdNVPe@VPPF%pVPpV\JgWb8XdK!RWF&K' VP pVFpVP PV;;,^, uu&VP PV,pW8gKQW,^8XgK`W`P9gKrVPPV4K R#)aTCredit non-affected packages in a learned clause as culprits. Modelled on uv's ConflictTracker (PR #9843). Every non-affected, non-root package in the clause is a culprit; for single-term NO_VERSIONS clauses we walk the satisfier's cause chain instead. When a culprit crosses ``CULPRIT_THRESHOLD`` it gets queued for targeted backtrack. N) termsr9r lenr'CULPRIT_THRESHOLDr:package_culprit_countspending_targeted_backtrackappend) rr rPrUculprit_packagestermr9 thresholdcounts &&&& rrCrCs)+%%,, d?g9 $(! & ? !Q&9??+FOO))DllG$'"=(,  % * **I#--g6!;655g>  !Q&BBB  / / 6 6w ?$rc V^8dQhRRRR/#)rrUrVrrr)rs"rrrs&:srcLVP'gVPf VP#VPP\PJd VP#VPP ^,PpWP8Xd VP#V#)a?Return the package whose decision receives the conflict credit. A positive term over a decided package used to be satisfied only by the decision itself, so the credit landed on the package whose decision triggered the conflict. A widened parent term is often already satisfied by the earlier derivation propagated from its dependency clause; crediting the derivation's own package then starves the promotion heuristics, while crediting both packages over-promotes the whole cluster past the backjump horizon. The clause's depending parent receives the one credit instead. )r4r'r9r DEPENDENCYrY)rUparents& rrBrBs  7   $8$C$CC   __ " "1 % - -F """   Mrc 0V^8dQhRRRRRRRRR R R R /#) rrrr rrUrVsatisfier_termTerm[Any, Any]rLintrzQtuple[Incompatibility[Any, Any], Assignment[Any, Any], Term[Any, Any], int, bool]r)rs"rrrsD** *.*$*# * " *  *rcbRp\WW#4pVfMRpTp\W4wpppK'VVVVV3#)aIIterate :func:`try_force_resolution_step` while it succeeds. Returns the (possibly-resolved) incompatibility, refreshed satisfier, satisfier term, previous-satisfier level, and a ``forced_any`` flag indicating whether at least one resolution step happened. Stops when ``try_force_resolution_step`` declines (returns ``None``). FT)try_force_resolution_stepr3)rr rUrhrLrMforceds&&&&& rr6r6sb(J * y  >    'x 8    $    rc ,V^8dQhRRRRRRRRR R /#) rrrr rrUrVrhrirz Incompatibility[Any, Any] | Noner)rs"rrr<s:++ +.+$+# + & +rcVP'g-\VP4\8wgVPfR#\ WPVP 4p\V4\8dR#\V\PVVPR7p\W4wrgpVP;'gWP8gp V 'gR#V#)aResolve a single-term NO_VERSIONS clause once with a soundness gate. Standard PubGrub backjumps to root for single-term clauses, losing the supporting decisions; resolving once with the satisfier's cause exposes them so later propagation can skip the bad decision. Returns ``None`` when the resolved clause collapses to <2 terms (the eliminated package's conditioning would be lost) or when it is not assert-eligible. Nr&) r4rZrY _SINGLE_TERMr'r r9_MIN_RESOLVED_TERMSr r rDr3r5) rr rUrhrQrm forced_recentrHforced_prev_levelforced_can_backjumps &&&& rrlrl<s"  $$ % 5 ?? " .*@*@N >00 "**"OO F+EX*V'M'!!VV%6:V:V%V  Mrc$V^8dQhRRRRRR/#)rrrr rrz0tuple[Assignment[Any, Any], Term[Any, Any], int]r)rs"rrrjs$'9'9 '93L'95'9rcRpRp^pVPFpVPPV4pVfRV: R2p\V4hVPpVeWP8d Ve\ WBP 4pTpTpKs\ WFP 4pK VfRp\V4hVfQh\WW44pW#V3#)a9Find the most recently assigned satisfier across all terms. Returns ``(satisfier, term, previous_satisfier_level)``. The previous level is the highest among the other terms' satisfiers and bounds how far back the resolver can jump. Refined when the satisfier is partial (earlier assignments also contributed). NzBug: no satisfier for z in a satisfied incompatibilityz1Bug: no satisfiers in a satisfied incompatibility)rYr,rU RuntimeError trail_indexr*r5recompute_previous_level) rr most_recentmost_recent_termr$r`rU unreachablesatisfier_indexs && rr3r3js04K.2N%%%%//5  (0OP {+ +#//  ?5L5L#L&!$^5O5O!P#K#  1I1IJN& I ;''  '' '-/N . 88rc ,V^8dQhRRRRRRRRR R/#) rrrrUrVrhricurrent_previous_levelrjrr)rs"rrrs:!"!" !"#!"#!" !"  !"rcVPfV#RpVPPF"pVPVP8XgK TpM VfV#VP4pVP VP44pVfQhVP P 'dV#VPPVP44pVe\W8P4#V#)aRefine previous_level when the satisfier is partial. The satisfier's own assertion (the negated cause term) may cover only part of the term; the trail must then also exclude the difference ``own & ~term``, so the level of the earliest assignment that does is folded in. N) r'rYr9negate intersect constraintis_emptyr,rUr*r5) rrUrhr cause_termr`own_term differencedifference_satisfiers &&&& rryrys%%J%% <<>11 1J &%%  "H##N$9$9$;.is_terminal_incompatibility..sF0E||t#0Es F)rYallrs&rr0r0sF   3F0E0EF33F3F3F0E0EF FFrc V^8dQhRRRR/#rrrr Any | Noner)rs"rrrs  '9 j rcVP'd1VPPVP8d \ V4#R#)zRun :func:`apply_targeted_backtrack` if the gate is open. Gate: pending non-empty AND total conflicts past ``TARGETED_BT_MIN_CONFLICTS``. Pending culprits are kept across rounds. N)r]r: conflictsTARGETED_BT_MIN_CONFLICTSapply_targeted_backtrack)rs&rmaybe_targeted_backtrackrs6 +++ NN $ $(J(J J'11 rc(V^8dQhRRRRRRRR/#)rrrrestart_thresholdrjrestarts_remainingrztuple[int, int, bool]r)rs"rrrs0?? ??? ?rcV^8:dWR3#\VPPP4^R7pW18dWR3#VP;P^, un\ VP R7VnVPP\VP4VPP4^VPn V^,V^, R3#)zRestart the solver if any package crossed ``restart_threshold``. Returns ``(new_threshold, new_remaining, restarted)``. Preserves ``incompatibilities`` and ``package_conflict_counts`` across restart. F)default) range_typeT)r*r:rAvaluesrestartsrrr,decider root_versionr]cleartargeted_backtracks)rrr max_counts&&& r maybe_restartrsQ e;;HNN::AACQOI$ e;; NNq '83F3FGH T8#8#89 ''--/)*HNN& q "4q"8$ >>rc$V^8dQhRRRRRR/#)rrrpackagesz list[Any]rrr)rs"rrrs$.. .,5..rc&V'gR#VPpVFkpVPPV,pWB8dW PPV&W0P9gKPVPP V4Km \ V4#)aeApply a targeted back-track without waiting for the normal gate. Used when the provider supplies direct evidence that the named packages are culprits. Bumps each package's culprit count past the dominant-culprit threshold, queues it, and applies immediately. Returns the back-jumped package, or ``None`` if the back-track did not move the decision level. N)r[r:r\r]r^r)rrrar9currents&& rforce_targeted_backtrackrsx **I..77@  =FNN 1 1' : == =  / / 6 6w ?  $H --rc V^8dQhRRRR/#rr)rs"rrrs$$'9$j$rcVPPVP8dVPP 4R#VP P pRpVPF\pVP PV4pVF8pVP \8dKVP ^, pWa8dTpTpKZ K^ VPP 4VeWP P 8dR#VP PV4VP;P^, unV#)aBacktrack to before the earliest pending-culprit assignment. Picks the smallest decision-level among queued culprits' first assignments (decision OR derivation; derivations count too so propagated culprits in cluster conflicts still trigger a backtrack) and jumps to one before it. Capped at ``MAX_TARGETED_BACKTRACKS`` per restart segment. Level-1 assignments are skipped to preserve ROOT. N) r:rMAX_TARGETED_BACKTRACKSr]rr,r5assignments_for_TARGETED_BT_MIN_LEVELr>)r target_leveltriggering_packager9package_entries assignment candidates& rrrs ~~))X-M-MM++113$$33L%)66"++;;GD*J((+AA"11A5I'( %," * 7 ''--/!\5F5F5U5U%U  - NN&&!+& rN) rrBrSr3rr0r6rrryrlrC)*__doc__ __future__rtypingrrerrorsrincompat_indexrpartial_solutionrreportrr rootr typesr r r rrr__all__rprqrr.r+rSrCrBr6rlr3ryr0rrrrrrrrs#%#/--8," & MT`(@V,*Z+\'9T!"HG ?4.4$r