+ 2jE9Rt^RIHt^RIHt^RIHt^RIHtH t H t H t ^RI H t ^RIHtHtHt]'d^RIHt^RIHtHtR R .t]!4t]!R R 7!R R ] ]]3,44t!RR ] ]]3,4tR#)a?Partial solution: ordered assignment list with decision levels. The partial solution is a chronological trail of assignments. Each assignment constrains a package's allowed versions and is either a decision (the resolver picks a specific version to try) or a derivation (a constraint deduced by unit propagation). Each decision opens a new "decision level". Backtracking removes all assignments above a target level, which is cheaper than copying the entire state on every decision. Reference: https://github.com/dart-lang/pub/blob/master/doc/solver.md#partial-solution ) annotations) defaultdict) dataclass) TYPE_CHECKINGAnyGenericcast)Range) PackageType RangeProtocol VersionType)Sequence)IncompatibilityTerm AssignmentPartialSolutionT)slotsc]tRt^(t$RtR]R&R]R&R]R&R]R &^tR]R &R tR ]R &R tR]R&Rt R]R&R t R]R&R t R]R&^t R]R&Rt R #)rz-A single entry in the partial solution trail.r packageRangeProtocol[VersionType]accumulated_rangeintdecision_levelbool is_decision trail_indexNzVersionType | Noneversionz0Incompatibility[PackageType, VersionType] | NonecauseTpositive!RangeProtocol[VersionType] | None cum_positive cum_negative package_index)__name__ __module__ __qualname____firstlineno____doc____annotations__rrrrr r!r"__static_attributes__r#h/home/user/billing-ledger-validation/.venv/lib/python3.14/site-packages/nab_resolver/partial_solution.pyrr(s7 311J;LK9"&G &6>BE ;BQHdG6:L3:M6:L3:MM39r+c]tRt^NtRt]3RRllt]RRl4t]RRl4t RR lt R R lt R R lt RRlt RRltRRltRRltRRltRRltRRltRRltRRltR R!ltR"tR##)$rzTracks the resolver's current partial solution as a decision trail. This is the PubGrub equivalent of a SAT solver's assignment trail. See: https://en.wikipedia.org/wiki/Conflict-driven_clause_learning#Organization c V^8dQhRRRR/#) range_typeztype[RangeProtocol[Any]]returnNoner#)formats"r, __annotate__PartialSolution.__annotate__Us#;r+c Wn.Vn^Vn/Vn/Vn/Vn\ 4Vn/Vn\\4Vn R#)z%Initialize an empty partial solution.N) _range_type _assignments_decision_level_positive_ranges_negative_ranges_decided_versionsset _undecided_effective_range_cacherlist_assignments_by_package)selfr0s&&r,__init__PartialSolution.__init__UsZ%HJ OQOQAC-0E  #   $r+cV^8dQhRR/#r/r1rr#)r3s"r,r4r5ls$$$r+c VP#)z"Return the current decision depth.)r9rBs&r,rPartialSolution.decision_levelks###r+cV^8dQhRR/#rFr#)r3s"r,r4r5qs&&c&r+c ,\VP4#)z8Return the number of assignments currently on the trail.)lenr8rHs&r, trail_lengthPartialSolution.trail_lengthps4$$%%r+c V^8dQhRRRR/#)r/rr r1z.Sequence[Assignment[PackageType, VersionType]]r#)r3s"r,r4r5us  "  7 r+c HVPPV4pVfR#V#)zpReturn the chronological assignment trail for ``package``. Read-only view; callers must not mutate the result. r#)rAget)rBrentriess&& r,assignments_forPartialSolution.assignments_forus)..227; ?Ir+c V^8dQhRRRR/#r/rr r1rr#)r3s"r,r4r5s;+Lr+c JVPPV\4pV\Jd \RV4#VPPV4pVP PV4pVfVfRpMVf VfQhV(pMVfTpMW4, pWPPV&V#)z|Get the combined allowed range for a package, or None if unassigned. Computes ``positive - negative``, cached per package. rN)r?rQ_UNSETrr:r;)rBrcachedrnegativeresults&& r,rQPartialSolution.gets ,,00&A  ;VD D((,,W5((,,W5   08discardrArrLr8r;rQappend)rBrr exact_rangepackage_entries assignments&&& r,decidePartialSolution.decides !&&009 )4g&*1w' ##''6 (66w?)//D--.$..227;o.     ,z*r+c ,V^8dQhRRRRRRRRR R /#) r/rr constraintrrrrz)Incompatibility[PackageType, VersionType]r1r2r#)r3s"r,r4r5s<-+-+-+/-+  -+ 9 -+ -+r+c fV'dWP9dVPV,V,pM!VPP4V,pWPPV&WP9dVPP V4MZWP 9dVP V,V,pM!VPP4V,pWPP V&VPPVR4VPV,p\VVVPR\VP4VVVPPV4VP PV4\V4R7 pVPP!V4VP!V4R#)z}Record a derivation from unit propagation. See: https://github.com/dart-lang/pub/blob/master/doc/solver.md#unit-propagation NF) rrrrrrrr r!r")r:r7fullr<r>addr;emptyr?r`rArr9rLr8rQrb)rBrrirr new_rangerdres&&&$$ r,derivePartialSolution.derivesb /// 11':ZG  ,,113j@ -6 ! !' *444##G,/// 11':ZG  ,,224zA -6 ! !' * ##''666w?'//D--...227;..227;o.     ,z*r+c V^8dQhRRRR/#)r/ target_levelrr1r2r#)r3s"r,r4r5s,,c,d,r+c VP'd?VPR,PV8dVPP4KPWn.pVPP 4Fwr4V'd+VR,PV8dVP4K2V'gVP V4VPPVR4VPPVR4VPPVR4VPPV4KVPW44K VFpVPVK VPP4R#)a|Remove all assignments above target_level. Non-chronological backjumping: skips past irrelevant decision levels directly to the cause of the conflict. Relies on ``Assignment.accumulated_range`` already being cumulative, so each package's surviving state can be rebuilt without re-intersecting. See: https://github.com/dart-lang/pub/blob/master/doc/solver.md#conflict-resolution N)r8rr`r9rAitemsrbr:r;r<r>ra%_update_package_state_after_backtrackr?clear)rBrrempty_packagesrrRs&& r, backtrackPartialSolution.backtracks D$5$5b$9$H$H<$W    ! ! #+,. $ < < B B D Ggbk88<G %%g.%%))'48%%))'48&&**7D9''0::7L!E&G,,W5& ##))+r+c$V^8dQhRRRRRR/#)r/rr rRz*list[Assignment[PackageType, VersionType]]r1r2r#)r3s"r,r4r5s(+-+-+-<+-  +-r+c nRpRpRpVF[pVP'dVPpVPpK/VP'dVPpKOVPpK] VfVPP VR4MW0PV&VfVP P VR4MW@P V&VfVPP VR4MWPPV&Ve"VfVPPV4R#VPPV4R#)aERecompute positive/negative/decided state for a package. Each ``Assignment.accumulated_range`` is already cumulative, so the latest entry of each kind is enough to rebuild state. Trail levels never decrease, so popping a decision pops every later entry for the same package; a surviving decision is always the current one. N) rrrrr:r`r;r<r>rlra)rBrrRlast_poslast_neglast_decision_versionres&&& r,rv5PartialSolution._update_package_state_after_backtracks7;6:48!J%%%%77(2(:(:%$$$%77%77"    ! ! % %gt 4-5 ! !' *    ! ! % %gt 4-5 ! !' * (  " " & &w 5.C " "7 +  $9$A OO   ( OO # #G ,r+cV^8dQhRR/#)r/r1zdict[PackageType, VersionType]r#)r3s"r,r4r53s,,9,r+c ,\VP4#)z8Return the current decision map: ``{package: version}``.)dictr<rHs&r, decisionsPartialSolution.decisions3sD**++r+cV^8dQhRR/#)r/r1zset[PackageType]r#)r3s"r,r4r57s$$$4$r+c ,\VP4#)zReturn packages with positive constraints but no decision yet. Packages with only negative derivations (learned exclusions) are not yet known to be required. Returns a fresh copy so callers can mutate without disturbing solver state. )r=r>rHs&r,undecided_packages"PartialSolution.undecided_packages7s4??##r+c V^8dQhRRRR/#)r/rr r1rr#)r3s"r,r4r5@sUU{UtUr+c JWP9;'gWP9#)zAReturn True if the package has a positive constraint or decision.)r:r<rBrs&&r,has_positive_constraint'PartialSolution.has_positive_constraint@s"///TT7>T>T3TTr+cV^8dQhRR/#)r/r1z-dict[PackageType, RangeProtocol[VersionType]]r#)r3s"r,r4r5Ds++!N+r+c ,\VP4#)z9Return a copy of the positive-range map for each package.)rr:rHs&r,positive_rangesPartialSolution.positive_rangesDsD))**r+c V^8dQhRRRR/#rVr#)r3s"r,r4r5Hs22k26W2r+c 8VPPV4#)zBReturn the package's accumulated positive range, or None if unset.)r:rQrs&&r,positive_rangePartialSolution.positive_rangeHs$$((11r+c(V^8dQhRRRRRRRR/#)r/rez$Assignment[PackageType, VersionType]termTerm[PackageType, VersionType] is_positiverr1r#)r3s"r,r4r5Ls2))8)-)  )  )r+c VPpV'dVfR#VfVPfQhVP(pM#VPfTpMWAP, pVPV4#)zWhether the trail up to and including ``assignment`` satisfies term. Positive terms need a positive assignment first; negatives alone only exclude versions. F)r r! satisfies)rBrerrr effectives&&&$ r, _satisfied_atPartialSolution._satisfied_atLsn".. </  **6 66#000I  $ $ ,$I$'>'>>I~~i((r+c V^8dQhRRRR/#)r/rrr1z+Assignment[PackageType, VersionType] | Noner#)r3s"r,r4r5fs2 4r+c VPPVPR4p\V4pV^8XdR#VP 4pVP W#^, ,WR7'gR#^V^, reWV8d>WV,^,pVP W',WR7'dTpK8V^,pKCW%,#)a^Find the earliest assignment that causes the term to be satisfied. The effective range only narrows along the trail, so ``term.satisfies`` is monotonic: once an entry satisfies the term, every later one does too. That lets a binary search replace the linear scan. See: https://github.com/dart-lang/pub/blob/master/doc/solver.md#conflict-resolution N)rr#)rArQrrLrr)rBrrRcountrlowhighmids&& r, satisfierPartialSolution.satisfierfs..224<<DG  A:&&( !!'!)"4d!TTuqyTj:!#C!!',!NNAg|r+) r8rAr<r9r?r;r:r7r>N)r$r%r&r'r(r rCpropertyrrMrSrQrfroryrvrrrrrrrr*r#r+r,rrNs ?D,$$&& 6+4-+^,B+-Z,$U+2)4r+N)r( __future__r collectionsr dataclassesrtypingrrrrrangesr typesr r r collections.abcr rr__all__objectrXrrr#r+r,rs ##!44::(,   ":k12":":Jrgk;67rr+