+ 2jRt^RIHt^RIHt^RIHtHt^RIH t H t H t ]'d ^RI H t ^RIHt.ROtRtRR ltR R ltR R ltRRltR#)aUnit propagation for the PubGrub resolver. When an incompatibility has all but one term satisfied, the remaining term's negation is derived (unit rule). This module owns that loop plus the per-term/per-incompatibility evaluators that classify each term as SATISFIED, CONTRADICTED, or UNDETERMINED. Reference: https://github.com/dart-lang/pub/blob/master/doc/solver.md#unit-propagation ) annotations)deque) TYPE_CHECKINGAny)IncompatibilityState SetRelationTerm)Resolver)Incompatibilityic$V^8dQhRRRRRR/#)resolverResolver[Any, Any]changed_packagerreturnz Incompatibility[Any, Any] | None)formats"a/home/user/billing-ledger-validation/.venv/lib/python3.14/site-packages/nab_resolver/propagate.py __annotate__r!s$11 1361%1c\V.4pV0pV'EdVP4pVPV4VPP V.4pVEFpVP V,p\ W4pV\PJdVu#\V\4'gKRVP4p VPP V P4p VPPV PV PV P!4VR7VPP V P4p W8wgKVP";P$^, unVP&P)V PV P!4VR7V PV9gEKbVP+V P4VP-V P4EK EKR#)ajPropagate constraints from incompatibilities. When an incompatibility has all but one term satisfied, the remaining term's negation is derived (unit rule). Returns a conflicting incompatibility if all terms are satisfied, or None if propagation completes without conflict. Reference: https://github.com/dart-lang/pub/blob/master/doc/solver.md#unit-propagation )positivecauseN)rpopleftdiscardpackage_to_incompatibilitiesgetincompatibilitiesevaluate_incompatibilityrCONFLICT isinstancernegatesolutionpackagederive constraint is_positivestats derivationsobserver on_derivationappendadd) r rpropagation_queuein_queuer#related_indicesincompatibility_indexincompatibility evaluation negated_term range_before range_afters && runit_propagationr6!s%*?*;$<)*H  #++-!"??CCGRP%4 !&889NOO1(LJ1:::&&*d++)002 '0044\5I5IJ !!(( (( ++)557) ) '//33L4H4HI .NN..!3.%%33$,,!-!9!9!;-4 $++8;)001E1EF \%9%9:7&5: rc$V^8dQhRRRRRR/#)r r rr1zIncompatibility[Any, Any]rz,IncompatibilityState | Term[Any, Any] | Noner)rs"rrrUs$)) )3L)1)rcRpVPFDp\W4pV\PJdK$V\PJdR#VeR#TpKF VeV#\ P #)aEvaluate an incompatibility against the current partial solution. Returns: ``IncompatibilityState.CONFLICT``: all terms satisfied ``Term``: exactly one undetermined term (unit propagation candidate) ``None``: 0 or 2+ undetermined terms (nothing to do yet) N)terms term_relationr SATISFIED CONTRADICTEDrr)r r1undetermined_termtermrelations&& rrrUso04%% 0 {,, ,  {// /  ( &$   ( ((rc$V^8dQhRRRRRR/#)r r rr>Term[Any, Any]rrr)rs"rrrps"  . n  rcVPPVP4pVf\P#VP 4pVP pW2VP3pVPV4pVfeVPVP4p\WPVPR7p\V4\8dVP4WdV&T;'dV\PJ;'g"V'*;'dV\P JpV'd<VPP#VP4'g\P#V#)aCCheck how the partial solution relates to this term. A term can only be satisfied or contradicted when the package has a positive constraint; without one it might not participate in the solution (negative terms are trivially true for absent packages). See: https://github.com/dart-lang/pub/blob/master/doc/solver.md#term )subsetdisjoint)r"rr#r UNDETERMINEDr&relation_cacher%r?classify_relation is_subset is_disjointlenRELATION_CACHE_MAXclearr;r<has_positive_constraint) r r> assignmentrcachekeyresultr?needs_positives && rr:r:ps$""&&t||4J'''!H  # #E  1C YYs^F ~&&t7" ++h6J6J  u:+ + KKMc BB6[-B-B#B  ;;;#;#;;h//GG UU''' Mrc(V^8dQhRRRRRRRR/#)r r>rArCboolrDrrr)rs"rrrs2$$ $ $ $  $rcVP4'dYrCMY!rCV'd\P#V'd\P#\P#)aClassify a term from the assignment's relation to its constraint. ``subset`` and ``disjoint`` describe the assignment against ``term.constraint``, as returned by ``RangeProtocol.relation``. Positive term: satisfied when the assignment is a subset of the constraint; contradicted when the two are disjoint. Negative term: the two swap, since a negative term forbids the constraint's versions. )r&rr;r<rE)r>rCrD satisfied contradicteds&$$ rrGrGsG  "(<"*<$$$'''  # ##rN)rGrr:r6)__doc__ __future__r collectionsrtypingrrtypesrrrr r r __all__rKr6rr:rGrrrr^sI#%::"& 1h)6 F$r