+ 2jRt^RIHt^RIHt^RIHt^RIHt]'d^RI H t ^RI H t ^RI Ht^RIHt^t^t^t^t^tR tR R /R R lltRRltRRltRRRlltR#)a@Priority computation for :class:`nab_python.provider.Provider`. Owns the tier/matching/culprit logic that backs ``prioritize``. Affected packages with high conflict counts get tier 0 (decide first inside a conflict cluster); runaway top culprits get tier 2 (uv's deprioritise-on-conflict); everything else gets tier 1. ) annotations) itemgetter) TYPE_CHECKING) VersionRange)Mapping) RangeProtocol)Version)Provideriforce_backtrackedFc 0V^8dQhRRRRRRRRRR R R/#)  normalizedstraffected_countint culprit_countculprit_countsMapping[str, int] | Noner boolreturn)formats"h/home/user/billing-ledger-validation/.venv/lib/python3.14/site-packages/nab_python/_provider/priority.py __annotate__r)sD-    c|V\8d\#V'd\#\WV4'd\#\#)zDecide the priority tier from conflict and culprit counts. ``force_backtracked`` short-circuits the gap rule: the look-ahead abort is a precise enough culprit signal on its own. )CONFLICT_THRESHOLD TIER_AFFECTED TIER_CULPRITis_dominant_culprit TIER_NORMAL)r rrrr s&&&&$r compute_tierr!)s5++:nEE rc(V^8dQhRRRRRRRR/#) r providerr r r version_rangeRangeProtocol[Version]rrr)rs"rrr?s6CCCC*C Crc RVPPV4pVeVPV4pVeV#WP9;'g%WP9;'gWP9pWP 9dV'gVP 'dVPV4MVPV4pVeTVPW4pWpP V&VP;P^, un VPW4WP 9d[\V\4'gQhVP V,p\RVP!VR\#^4RR744pMV'd^pM\$#Vf/;q0PV&WV&V#)a@Return the count of cached versions of ``normalized`` in ``version_range``. Also fires speculative metadata prefetch when this is the first time we notice the listing has arrived in the coordinator index. Returns :data:`_NO_LISTING_PRIOR` while the listing is still in flight, reading arrival through ``arrived_listing`` so it agrees with ``is_ready`` for the whole decision scan. Under :attr:`~nab_python.provider.DecisionOrder.STABLE` it waits for the listing instead, so the count is the real one and this sentinel is only reached by a package with no listing to count. c3&"TFp^xK R#5i)Nr).0_s& r #compute_matching..os  sT descending) prereleaseskey assume_sorted)matching_cacheget local_sources vcs_sourcesarchive_sourcesversions_cachesettle_listingssettled_listingarrived_listingfilter_distributionsstatslistings_fetchedspeculative_prefetch isinstancersumfilterr_NO_LISTING_PRIOR) r#r r$per_pkgcachedhas_local_sourcefilesversionsmatchings &&& rcompute_matchingrH?s"%%))*5G]+  M ,,, 2 2 -- - 2 2 11 1 0009I'''  $ $Z 0))*5   44ZGH2: # #J / NN + +q 0 +  ) )* ?,,,-6666**:6 ")) qM* *   ! 8::))*5%M Orc(V^8dQhRRRRRRRR/#) r packager package_countrrrrrr)rs"rrrs6FF FF-F FrcaVe V\8dR#\V3RlVP44^R7pW, \8#)zReturn True when ``package`` is the runaway top culprit. Demote only when the gap to the next culprit is >= CULPRIT_DEMOTE_THRESHOLD; co-dominant culprits stay within ~1 of each other so the standard ordering wins. Fc3><"TFwrVS8wgKVxK R#5iNr)r)othercountrJs& rr+&is_dominant_culprit..sN#9<5Ug=M#9s  )default)CULPRIT_DEMOTE_THRESHOLDmaxitems)rJrKrsecond_highestsf&& rrrsE1I!IN>#7#7#9NN  )-E EErNc 0V^8dQhRRRRRRRRR R R R /#) r r#r rJrr$r%conflict_countszMapping[str, int]rrrztuple[int, int, bool]r)rs"rrrsD444 4*4' 4 - 4  4rcLVP;P^, unVPV4wrVpVPV^4pVeVPV^4M^p VP V4^8p V \ 8;'dV '*p V 'dDVP PV4p V e%V ^,VJdV ^,V8Xd V ^,#\VVV VV R7p \WV4pWVRJ3pV 'd"WpP9dW(V3VP V&V#)aPrioritize packages for resolution order. Returns ``(tier, matching_count, is_base)``. Extras proxies sort before their base at equal tier so they pin the base version directly (avoids the backtrack storm when the base is decided before the extras proxy). Blocks on I/O only under :attr:`~nab_python.provider.DecisionOrder.STABLE`, which waits for a listing rather than ranking its absence. N)r ) r;prioritize_callssplit_and_normalizer2force_backtrack_countrSpriority_cacher!rHr6)r#rJr$rXrr*extrar rrr cacheablerCtierrGprioritys&&&&& r prioritizerbs-" NN##q(##77@Aj$((Q7N-;-G:q)Q!66zBQF  88RRAR=RI((,,W5  q ]*q ^+!9  +  D mDH .HZ#:#::,98+T( OrrN)__doc__ __future__roperatorrtypingr_vendor.packaging.rangesrcollections.abcrnab_resolver.typesr_vendor.packaging.versionrr#r rrSrr rrAr!rHrrbrrrrksv# 3'03#    $ ,CLF(44r