+ 2j`Ba0t$Rt^RIHt^RIHtHtHt^RIH t ^RI H t H t H t Ht]'d2^RIHtHt^RI Ht]]].]3,tR]R&]].]3,tR]R &.R+OtR ]3R R llt^t]!] P] P604tR ]3R RlltRRltRRltRRlt RRlt!RRlt"RRlt#]3RRllt$]3RRllt%RR lt&R!R"lt']3R#R$llt(]3R%R&llt)R'R(lt*R)R*lt+R #),a5Error reporting and term combinators. Mirrors pubgrub-rs's ``report.rs`` / dart pub's ``failure.dart``: the message-building walk and the prior-cause / term-union combinators sit alongside the public ``ResolutionError``. Reference: https://github.com/dart-lang/pub/blob/master/doc/solver.md#error-reporting ) annotations) TYPE_CHECKINGAny TypeAlias)ROOT)IncompatibilityCause PackageTypeTerm VersionType)CallableSequence)Incompatibilityr _NarrowFn _FormatFnNc(V^8dQhRRRRRRRR/#) root_incompatibilityIncompatibility[Any, Any]narrow_NarrowFn | None format_rangerreturnstr)formats"^/home/user/billing-ledger-validation/.venv/lib/python3.14/site-packages/nab_resolver/report.py __annotate__r"s6BB3B BB Bcf.p\W\4W4V'dRPV4#R#)aFormat a human-readable error from an incompatibility derivation tree. Where narrowing leaves a line ruling out versions its causes no longer account for, the range it dropped is stated once for that package, as the resolver states it when it looks for a version in a range and finds none. ``narrow`` maps ``(package, constraint)`` to a display constraint and is applied to originally-positive terms only; a negative dependency-side term renders as requested even when displayed negated. On a ``NO_VERSIONS`` line a narrowing to the full range is ignored, since the range is what keeps the sentence true. Narrowing happens at render time only, never mutating the derivation tree. ``format_range`` renders a constraint for display and defaults to ``str``, which reads well for the resolver's own ``Range``. A range type whose ``str`` is a debug repr passes its own. Rendering a constraint as the empty string drops it from the line along with its separating space.  zResolution impossible)explain_incompatibilitysetjoin)rrrliness&&& r format_errorr$"s/.E0U$499U A*AArc 0V^8dQhRRRRRRRRR R R R /#) rincompatibilityrr#z list[str] visited_idszset[int]rrrrrNoner)rs"rrrIsD)7)7.)7 )7)7  )7  )7  )7rcVR3.pVf//3M \W4wrgV'EdgVP4wrV 'dVP\V4R4FKp VPV R4p V fK\ \ V 4V!V 44p VP RV R24KM VP \WV44K\V4V9dKVP\V44VP VR34VP\P8XgEK VP'dVP VPR34VP'gEKOVP VPR34EKoR#)zWalk the cause tree appending one explanatory line per node. The walk is iterative: the tree gains a level per conflict, so a deeply backtracked resolve overflows the recursion limit. FNzbecause no versions of  are availableTr)_unstated_rangespopgetid _with_rangerappend _render_lineaddcauserDERIVED cause_right cause_left) r&r#r'rrstackneededunstatednodeexpandedpackagegapsubjects &&&&& rr r Is@=LU;S:TENR(8(QF % !::bh3ll7D1?)#g, S8IJGLL#:7)>!RS 4 LLdLA B  d8{ " 4! dD\" ::-55 5 d..67 doou56- rc$V^8dQhRRRRRR/#)rtermTerm[Any, Any]rrrr)rs"rrrus&TT>T9TTrcVP4'gV#\VPV!VPVP4RR7#)zDReturn ``term`` with a narrowed constraint when originally positive.Tpositive) is_positiver r< constraint)r@rs&&r_narrow_positiverGus8       fT\\4??Cd SSrc$V^8dQhRRRRRR/#)rr&rrrrzdict[Any, Term[Any, Any]]r)rs"rrr|s$  . 8A  rcVP\PJd'VPUu/uFq"PVbK up#VPUu/uFq"P\ W!4bK up#uupiuupi)zReturn the terms of ``incompatibility`` as its line renders them. The comparison runs on exactly what the reader sees, so a requirement is read as printed, un-narrowed, the way the line states it. )r3r NO_VERSIONStermsr<rG)r&rr@s&& r _shown_termsrL|sx 4 @ @@/>/D/DE/Dt d"/DEEAPAVAV AV &t44AV F s A4A9c V^8dQhRRRR/#)rr@Term[Any, Any] | Nonerrr)rs"rrrsGG+GGrclVfR#VP4'd VP#VP(#)zFReturn the versions that satisfy ``term``, or None for no restriction.N)rErFr@s&r _satisfyingrQs. |"..004??Ft6FFrc(V^8dQhRRRRRRRR/#)r conclusionrNleftrightrrr)rs"rrrs0<<%< < !< V % G  $F~G8;6+;;rc$V^8dQhRRRRRR/#)rrootrrrrz+tuple[dict[int, list[Any]], dict[Any, Any]]r)rs"rrrs$ #-60rc/p/p\4pV.pV'dVP4p\V4V9dK*VP\V44\ Wa4FPwrxVP \V4.4P V4VPV4p V fTMW,W7&KR VPeVP VP4VPfKVP VP4KW#3#)alReturn which line needs a package's listing stated, and what to state. The first mapping is node id to packages, the second is package to the whole range to state for it. A derivation can reach past its causes at more than one line over gaps of one listing, so the ranges are unioned per package and the caller states each once, at the first line that needs it. ) r!r,r.r2_narrowed_away setdefaultr0r-r6r5) r]rr8r9seen_idsr7r:r<r=previouss && rr+r+s$&F!HH.2VE yy{ d8x   RX*48LG   bh + 2 27 ;||G,H'/'7X^H 9 ?? & LL )    ' LL)) *  rc$V^8dQhRRRRRR/#)rr&rrrrzlist[tuple[Any, Any]]r)rs"rrrs$((.(8A((rcRVPpVPpVP\PJg VeVf.#VP Uu/uFqDP VbK ppVP Uu/uFqDP VbK ppVP Uu/uFqDP VbK pp\W!4p\W14p \W4p .p /VCVCFp \VPV 4VPV 4VPV 44p V eV P'gKU\V PV 4VPV 4V PV 44pVfKVP'dKV PW34K V #uupiuupiuupi)aReturn the packages and ranges narrowing drops from a line's support. Narrowing a widened term back onto the listed versions drops the versions the widening added, so a line can rule out, or resolve a requirement over, a range its causes no longer account for. Only a shortfall the un-narrowed terms do not have is reported, so what is stated is what narrowing dropped: a range holding no listed version, since narrowing keeps which listed versions a constraint contains. ) r6r5r3rr4rKr<rLr[r-is_emptyr0)r&rrTrUr@raw_left raw_rightraw_node shown_left shown_right shown_nodefoundr<raw_gapr=s&& rr_r_ss  % %D  ' 'E%9%A%AA < = /3zz:zt d"zH:05 < t# I/D/DE/Dt d"/DHEd+Ju-Ko6J#%E,h,), LL !8<<#8)--:P   w'7'7'7  NN7 #Z^^G%V  ?3<<< LL' (- L';<EsF4FF$c(V^8dQhRRRRRRRR/#) rr&rrrrrrrr)rs"rrrs0,;,;.,; ,;,; ,;rc |VPpVPpVe/V\PJdVUu.uFp\ WQ4NK ppV\P Jd\ V4\8XdVwrg\V4pVP4'd*V'dRMRp R\Wb4 RV R\Wr4 2#V'dRMRp \VP4V4p R\Wb4 RV RV 2#V\PJdQ\ V4\8Xd=VwrVP4'dTMVP4p \W4p RV 2#V\PJd;VwpV!VP4p \!\#VP$4V 4pR V 2#\'W4V4#uupi) z8Render a single incompatibility as one explanation line.areiszbecause  z incompatible with z depend onz depends onz because your project depends on zbecause the user constrained )r3rKrrJrG DEPENDENCYlen_ATTRIBUTION_CLAUSE_TERMS_is_fullrE format_term_format_requirementnegater CONSTRAINTconstraint_ranger/rr<_render_prefix_line)r&rrr3rKr@parentdeppluralverb requirement_ positive_depshownr>s&&& rr1r1s  ! !E  ! !Ee+?+K+KKc$,,/7.wi88 u\ ::CCsF9c(V^8dQhRRRRRRRR/#) rr3rrKzSequence[Term[Any, Any]]rrrrr)rs"rrr#s0  # rcaaVUu.uFq3P\JgKVNK ppV'gR#\PR\PR\PR\P R/P VR4pV\9d\M\oRPVV3RlV44pV\PJd V R V R 2#V R V 2#uupi) zDRender a clause that has no attribution form as a prefix and a body.z2so your project's requirements cannot be satisfiedzbecause root requiresbecausezbecause no versions ofsoz and c36<"TFpS!VS4xK R#5i)Nr).0r@rrenders& r &_render_prefix_line..6sFvtt\22vsrrr*) r<rrrsrJr4r-_REQUIREMENT_PREFIX_CAUSESrxrwr")r3rKrr@rZprefixbodyrs&&f @rr|r|#s % Aut D(@dduF A C !!#:''((*B$$d   c%n  %*-G$G [F <<FvF FD $0004&//XQtf Bs CCc V^8dQhRRRR/#)rr@rArboolr)rs"rrr=s>>>>d>rc`VP4;'dVP(P#)zJReturn whether ``term`` is positive over a range with an empty complement.)rErFrerPs&rrvrv=s&     = =DOO#3"="==rc$V^8dQhRRRRRR/#)rr>rrrr)rs"rrrBs!666S6S6rc$V'dV RV 2#T#)zJoin a subject to its rendered range, omitting an empty one. An unconstrained range renders as the empty string, and a bare space before nothing would trail the line. rrr)r>rs&&rr/r/Bs $)gYaw 5g5rc$V^8dQhRRRRRR/#rr@rArrrrr)rs"rrrKs"++n+I+PS+rcd\V4'd\VP4#\W4#)zaRender a term in object position ("depends on b"). A full term there is the package name alone. )rvrr<rw)r@rs&&rrxrxKs' ~~4<<  t **rc$V^8dQhRRRRRR/#rr)rs"rrrUs& O On OI O Orc\V4'dRVP 2#VP4'dRMRp\V VP 2V!VP44#)zRender a single term as ``[not ]package range``. A full term reads as "all versions of package"; :func:`_format_requirement` renders the object form. zall versions of rznot )rvr<rEr/rF)r@rsigns&& rrwrwUsV ~~!$,,00!!##2D $ ~. T__0M NNrc(V^8dQhRRRRRRRR/#)rr&z)Incompatibility[PackageType, VersionType]satisfier_causeshared_packagerrz$list[Term[PackageType, VersionType]]r)rs"rrras044>4>4 4* 4rcVPUu/uFq3PVbK ppVPUu/uFq3PVbK pp.pVPVR4pVPVR4pVe&Ve"\Wx4p V eVP V 4M+VeVP V4MVeVP V4/VCVCp V Fp VP V 4p VP V 4p V e/V e+V P V 4pVfQhVP V4KWV eVP V 4KnV fQhVP V 4K V#uupiuupi)a<Compute the prior cause by resolving two incompatibilities. Follows pubgrub-rs's prior_cause: for the shared package, union the terms (and drop if the union is a tautology). For other shared packages, intersect the terms. For packages in only one side, keep as-is. Reference: https://github.com/pubgrub-rs/pubgrub N)rKr<r,rWr0r- intersect)r&rrr@incompat_terms cause_termsresultincompat_shared cause_sharedunioned all_packagesr< incompat_term cause_term intersecteds&&& r prior_causeras(7'<'<I'O??>48L"|'?o<   MM' "  $ o&  ! l# 5n4 4L&**73  __W-  $)?'11*=K* ** MM+ &  & MM- () )) MM* %  MMIFs EEc$V^8dQhRRRRRR/#)rfirstzTerm[PackageType, VersionType]secondrz%Term[PackageType, VersionType] | Noner)rs"rrrs$:: ):3Q:*:rcVP4'dLVP4'd6VPVP,p\VPVRR7#VP4'g`VP4'gJVPVP,pVP'dR#\VPVRR7#VP4'dTMTpVP4'dTMTpVPVP, pVP'dR#\VPVRR7#)a/Union two terms for the same package. Returns None when the union is a tautology (the term can be dropped from the resolvent). Only a negative result can be one: a positive term, even over the full range, still requires the package to be selected, so solutions that omit the package don't satisfy it. TrCNF)rErFr r<re)rrmerged positive_term negative_term remainders&& rrWrWs v1133!!F$5$55EMM6D99     v'9'9';';!!F$5$55 ???EMM6E::#..00EfM#//11FuM((=+C+CCI  y5 99r)r r$rwrrW),__conditional_annotations____doc__ __future__rtypingrrrr]rtypesrrr r collections.abcr r r r__annotations__rr__all__r$ru frozensetrJrr rGrLrQr[r+r_r1r|rvr/rxrwrrW)rs@rrs#00GG2&#S#JO4Iy4#SE3J/Iy/  $!B<' 4 @ @A $! )7XT G<*D(\",;d"4> 6IL+AD O4n:r