+ 2jxjRt^RIHt^RIt^RIt^RIt^RIt^RIHtH t ^RI H t H t ^RI HtHt^RIHtHtHtHtHtHt^RIHt^RIHt^R IHt^R IHt^R IH t!^R IH"t#^R IH$t%^RIH&t'^RIH(t)^RI*H+t+H,t,H-t-^RI.H/t/^RI0H1t1^RI2H3t3^RI4H5t5]'dQ^RI6t6^RI7H8t8H9t9H:t:^RI;H;t;^RIH?t?H@t@^RIAHBtB^RICHDtD^RIEHFtF^RIGHHtHHItIHJtJ^RIKHLtL^RIMHNtN^RI4HOtO.RTOtP]P!]R4tS]P!R34tUR4R5ltVR6R7ltW!R8R+]X4tY!R9R$]P4t[!R:R;]P4t\!R<R#]P4t]!R=R!]P4t^!R>R.]P4t_!R?R"]P4t`] !R@R@RA7!RBR)44ta] !R@R@RA7!RCR244tb] !R@R@RA7!RDR 44tc!RER*]X4td!RFR1]d4te!RGR%]d4tf!RHR&]d4tg!RIR']X4th!RJR/]X4ti!RKR0]X4tj] !RLR-44tk]],tl]m;QJd.RM] !]k44FNK 5M!RM] !]k444tnRNROlto!RPR(4tp]q!4trRQRRlts!RSR,4ttR#)UzIndex-backed provider for nab-resolver. Fetches package metadata from package indexes on demand using nab-index, converting PEP 440/508 types into nab-resolver Range types. A FetchCoordinator overlaps index I/O on a background asyncio loop. ) annotationsN) defaultdictdeque) dataclassfields) TYPE_CHECKINGcast)MalformedSimpleResponseErrorMetadataHashMismatchError SdistFileSdistHashMismatchError WheelFileWheelHashMismatchError)IndexAccessError)UnserveableUrlError)EMPTY_MEMBERSHIP_SETS)extras)listing) lookahead)metadata_resolver)priority)sources)UnsupportedVcsError VcsConfig VcsPolicy) VersionRangecanonicalize_name) WheelMetadata)host_environment)CallableMappingSequence)datetime)Path)Incompatibility RangeProtocol)Marker) Requirement)Version) IndexOverrideNabProjectConfigPackageOverride)FetchCoordinator)TagSet) ResolveTarget ArchiveSource BuildPolicy DecisionOrder DistPolicy ExtrasModeForeignMetadataErrorIncompatiblePythonErrorInvalidUploadTimeErrorListingFilterCache LocalSource MetadataErrorMissingExtraErrorProvider ProviderStatsResolutionStrategySiblingMetadataDivergenceErrorSourceNameMismatchErrorUnsupportedSdistError VcsSourcez'^(?P[^\[]+)\[(?P[^\]]+)\]$c V^8dQhRRRR/#)packagestrreturnztuple[str, str | None])formats"^/home/user/billing-ledger-validation/.venv/lib/python3.14/site-packages/nab_python/provider.py __annotate__rKasBBB!7Bc\PV4pVfVR3#VPR4\VPR443#)zjSplit 'name[extra]' into ('name', 'extra'), or ('name', None). The extra name is normalized per PEP 685. Nbaseextra) _EXTRA_REmatchgroupr)rEms& rJ split_extrarTasC  Ay GGFO.qwww/?@ AArLc$V^8dQhRRRRRR/#)rDrNrFrOrGrH)rIs"rJrKrKls!11S111rLc$V R\V4 R2#)zZJoin a base name and extra into 'name[extra]'. The extra name is normalized per PEP 685. []r)rNrOs&&rJ join_extrarYls V1&u-.a 00rLc]tRt^ttRtRtR#)r;zBRaised when a user-requested extra is not provided by the package.rHN__name__ __module__ __qualname____firstlineno____doc____static_attributes__rHrLrJr;r;tsLrLc*]tRt^xtRtRtRtRtRtR#)r4z5How to handle missing extras (not in Provides-Extra).warn error_user backtrackrHN) r\r]r^r_r`WARN ERROR_USER BACKTRACKrarHrLrJr4r4xs? DMJ>IzWhich version the resolver picks within an allowed range. Mirrors uv's ``--resolution`` flag. ``LOWEST_DIRECT`` catches missing ``>=`` bounds without dragging the whole transitive graph to its floor. highestlowestz lowest-directrHN) r\r]r^r_r`HIGHESTLOWEST LOWEST_DIRECTrarHrLrJr>r>s! G. F2#M=rLc$]tRt^tRtRtRtRtR#)r2zAWhether arrived listings may steer which package is decided next.arrivalstablerHN)r\r]r^r_r`ARRIVALSTABLErarHrLrJr2r2sKGP FNrLT)frozenslotscL]tRt^t$RtR]R&R]R&RtR]R&RtR ]R &R tR#) r9aA source tree on disk used as the only candidate for a package. ``name`` is the package name; the resolver pins the package to a single synthetic version, read from the directory's ``[project].version`` field or computed by the build backend when that field is declared dynamic. ``path`` is the absolute filesystem path to the source tree. ``editable`` requests a PEP 660 editable install in the lockfile; ``subdirectory`` is a path under ``path`` for monorepo layouts. rFnamepathFbooleditableN str | None subdirectoryrH) r\r]r^r_r`__annotations__rrrarHrLrJr9r9s'  I IHd#L*#rLc0]tRtRt$RtR]R&R]R&RtR#)rBi a;A VCS reference used as the only candidate for a package. ``name`` is the package name; ``url`` is the pip-style VCS URL (e.g. ``git+https://github.com/x/y.git@#subdirectory=pkg``). The provider clones the repo to its cache and treats the checked-out source as a :class:`LocalSource` for metadata extraction. rFrurlrHNr\r]r^r_r`rrarHrLrJrBrB  I HrLc0]tRtRt$RtR]R&R]R&RtR#)r0iavA direct-URL archive used as the only candidate for a package. ``name`` is the package name; ``url`` is the archive URL carrying its hash (and optional subdirectory) in the fragment, e.g. ``https://example.com/x-1.0.tar.gz#sha256=``. The provider downloads and hash-verifies the archive, then extracts and treats it as a :class:`LocalSource` for metadata extraction. rFrrrHNrrHrLrJr0r0rrLc]tRtRtRtRtR#)r:i(z4Raised when dependency metadata cannot be extracted.rHNr[rHrLrJr:r:(s>rLc]tRtRtRtRtR#)rAi,acSdist or source tree needs a backend invocation the policy disallows. Raised when extraction would require a build the current :class:`BuildPolicy` (or its per-package override) does not permit: dynamic metadata under :attr:`BuildPolicy.NEVER`, a VCS clone under :attr:`BuildPolicy.BUILD_LOCAL`, or a remote sdist build failure under :attr:`BuildPolicy.BUILD_REMOTE`. For a PyPI sdist it is caught by :meth:`Provider._look_ahead_ok`, so the resolver skips the version. A declared source (local, VCS, archive, or workspace member) is read while listing its one version, so the error ends the resolve instead. rHNr[rHrLrJrArA,s rLc]tRtRtRtRtR#)r5i;aXAn index candidate's METADATA declares a different release. Core metadata ``Name`` and ``Version`` say which release an artifact is, so a candidate whose METADATA (or :pep:`658` sidecar) names another project or version describes some other release's dependencies. Caught by :meth:`Provider._look_ahead_ok` so the resolver skips the version. rHNr[rHrLrJr5r5;srLc]tRtRtRtRtR#)r6iEaAn index candidate's METADATA Requires-Python excludes the resolve target. The Simple-API ``requires-python`` hint is optional, so the listing gate admits a version whose listing omits it. Once the wheel METADATA (or sdist PKG-INFO) is fetched, its authoritative ``Requires-Python`` is checked and an incompatible candidate is rejected. Caught by :meth:`Provider._look_ahead_ok` so the resolver skips the version. rHNr[rHrLrJr6r6ErLc]tRtRtRtRtR#)r7iRzMRaised when an index upload-time is not the timezone-aware UTC PEP 700 needs.rHNr[rHrLrJr7r7RsWrLc]tRtRtRtRtR#)r?iYa!Raised when a version's tie-ranked wheels declare different target deps. nab reads one wheel's dependencies per version and treats it as authoritative, so a tie whose wheels declare different dependencies is an ambiguity: pinning from one silently disagrees with an install of the other. rHNr[rHrLrJr?r?YsrLc]tRtRtRtRtR#)r@idaRaised when a materialised source's project name differs from its declaration. A local, VCS, or archive source maps a declared ``name`` to a directory, repo, or archive and becomes the only candidate for that package. When the source's own ``[project].name`` does not canonicalise to the declared name, it provides a different distribution, so pinning it would carry the wrong version and dependencies. rHNr[rHrLrJr@r@drrLcB]tRtRt$Rt^tR]R&^tR]R&^tR]R&^t R]R&^t R]R&^t R]R &^t R]R &^t R]R &^tR]R &^tR]R &^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&^tR]R&RtR#)r=ioaCounters describing what the provider did during a resolve. Complements :class:`nab_resolver.ResolverStats` by tracking the PyPI/wheel layer (listing fetches, metadata reads, filter rejections). Used by benchmarks to measure prefetch and look-ahead wins. intlistings_fetchedmetadata_fetchedsdist_pkg_info_fetchedwheel_metadata_range_fetchedwheel_metadata_range_full_body wheel_metadata_range_unsupportedwheel_metadata_range_missingdistributions_seen wheels_seen sdists_seenexcluded_by_pythonexcluded_by_timeexcluded_by_dist_policyexcluded_by_build_policyexcluded_by_wheel_tags%excluded_versions_no_compatible_wheelsdist_pyproject_fallbacksget_dependencies_callschoose_version_callsprioritize_callslook_ahead_rejectionsrHN)r\r]r^r_r`rrrrrrrrrrrrrrrrrrrrrrrarHrLrJr=r=oscc"#C#() #)*+"C+,-$c-() #)KKc#$S$$%c%"#C#12)32%&s&"#C# !#!c!"3"rLc#8"TFqPxK R#5iN)r).0stats& rJ rsA+@4YY+@c V^8dQhRRRR/#)rDstatsr=rGztuple[int, ...]rH)rIs"rJrKrKs@@]@@rLcxa\;QJd.V3Rl\4FNK 5#!V3Rl\44#)z=Return every counter of ``stats``, in ``_STAT_FIELDS`` order.c3<<"TFp\SV4xK R#5ir)getattr)rrrs& rJr_counters..s?,$%%,s)tuple _STAT_FIELDS)rsfrJ _countersrs% 5?,?5?5?,? ??rLc2]tRtRtRtRRltRRltRtR#) r8ia#Base listing-filter results shared across the targets of one resolve. The pre-tag half of the listing filter (see :func:`nab_python._provider.listing.base_distributions`) reads the listing's files, the policy config, and the target Python, and has no platform axis, so targets that differ only by platform recompute an identical list. Memoising it per (package, Python) leaves only the wheel-tag pass to run per target. One instance is only valid across providers that share a coordinator and a policy config, as the targets of one resolve do. cV^8dQhRR/#rDrGNonerH)rIs"rJrKListingFilterCache.__annotate__s$rLc /VnR#)zCreate an empty cache.N_entriesselfs&rJ__init__ListingFilterCache.__init__s  rLc ,V^8dQhRRRRRRRRR R /#) rDrErFpython_versionrrr=computez,Callable[[], list[tuple[Version, DistFile]]]rGlist[tuple[Version, DistFile]]rH)rIs"rJrKrs<#  >  ( rLc  VPPW34pVeQVwrg\\VRR7F+wrV 'gK\ W8\ W84V ,4K- \ V4#\V4p V!4p\;QJd).R\\V4V RR74FNK 5M"!R\\V4V RR744p\ V4V3VPW3&V#)zReturn the filter result for ``package``, running ``compute`` once. A memo hit replays the counters the filter raised onto ``stats``, so every target still reports the files it would have walked. T)strictc36"TFwrW, xK R#5irrH)rnowwass& rJr.ListingFilterCache.filtered..s &P(#CII&Ps) rgetziprsetattrrlistrr) rrErrrentryresultdeltarcountbefores &&&&& rJfilteredListingFilterCache.filtereds !!7";<  !MF"<tD 5E)=)EF E< 5! &))E*:F4&P  &))E*:F4&P  59L%3H w/0 rLrN)r\r]r^r_r`rrrarHrLrJr8r8s rLc V^8dQhRRRR/#)rDvalueobjectrGrH)rIs"rJrKrKs  & V rLcVf\#V#)aMap ``None`` to ``_UNSET``, passing every other value through. Most policy fields store ``None`` to mean "unset" on the override dataclasses, so wrapping their attribute access in this helper yields the ``_UNSET``-or-value shape :meth:`Provider._effective_field` expects. The upload-time helpers, where ``None`` is a real value (a disabled cutoff), build that shape themselves and skip this. )_UNSETrs&rJ_unset_if_noners } LrLcP]tRtRt$Rt^tR]R&^tR]R&^@tR]R&^@t R]R&^t ^t ] Pt ] Pt] Pt] P t] P"tRRR]P&R]P*]P.RRRRRRRRR]P2RRR3R RR R R ]P6/R RllltRRltRRltRRRlltRRlt RRRllt!RRRllt"RRRllt#RRlt$RR lt%R!R"lt&R#R$lt'R%R&lt(])R'R(l4t*])R)R*l4t+R+R,lt,R-R.lt-R/R0lt.R1R2lt/R3R4lt0R5R6lt1R7R8lt2R9R:lt3R;R<lt4R=R>lt5R?R@lt6RARBlt7RCRDlt8RERFlt9RGRHlt:RIRJlt;RKRLltRRRSlt?RTRUlt@RVRWltARXRYltBRZR[ltCR\RR]R/R^R_lltDR`RaltERbRcltFRdReltGRfRgltHRhRiltIRjRk/RlRmlltJRnRoltKRpRqltLRrRsltMRtRultNRvRwltORxRyltPRzR{ltQR|R}ltRR~RltSRRltTRRltURRltVRRltWRRltXRRltYRR /RRlltZRRlt[RRlt\RRlt]RRlt^RRlt_RRlt`RRltaRRRlltbRRltcRRltdRRlteRRltfRRltgRRlthRtiR#)r<iaLazy index-backed provider for nab-resolver. Fetches version lists and .metadata from PyPI via nab-index. A FetchCoordinator submits listing fetches to a background asyncio loop, so transitive deps are fetched concurrently with resolution. ``target`` is the environment the resolve is for: its markers gate every dependency, its Python filters candidates by Requires-Python, and its wheel tags filter candidates by PEP 425 compatibility, so a version whose only wheels the target cannot install is a version the resolver never sees. Left unset, markers evaluate against the host and neither filter runs, since nothing has said which machine the resolve targets. ``constraints`` are the user's version bounds, keyed as the resolver keys packages, so an extras proxy carries its base's bound under its own ``name[extra]`` key. The provider reads them when deciding whether a missing root extra is worth reporting. ``preferences`` are versions another resolve already decided, tried first when they are usable here. A multi-target resolve passes the pins of an already-resolved target, which aligns the matrix on one version where every target can take it. A package the strategy wants lowest for ignores the preference and takes its own floor. ``listing_filter_cache`` shares the platform-independent half of the listing filter with the other targets of the same resolve; see :class:`ListingFilterCache`. ``decision_order`` chooses whether the decision scan may rank a package on whether its listing has landed yet. See :meth:`settled_listing`. rPREFETCH_BATCHPREFETCH_DEPTHDEEP_PREFETCH_COUNT_BROAD_LA_REJECT_CAPN constraintstrust_unverified_sdist_depsFdecision_orderc2|V^8dQhRRRRRRRRR R R R R RRRRRRRRRRRRRRRRRRRR R!R"R#R$R%R&R'R(R)R*R+R,R-R.R/R0R1/#)2rD coordinatorr-targetzResolveTarget | Noneroot_requirementszdict[str, VersionRange] | Noneuploaded_prior_todatetime | None extras_moder4 root_extraszset[tuple[str, str]] | None dist_policyr3 build_policyr1package_overrideszSequence[PackageOverride]index_overridesz"Mapping[str, IndexOverride] | None vcs_configzVcsConfig | None local_sourceszlist[LocalSource] | None vcs_sourceszlist[VcsSource] | None vcs_cache_dirz Path | Nonearchive_sourceszlist[ArchiveSource] | Nonearchive_cache_dir build_configzNabProjectConfig | Noneresolution_strategyzResolutionStrategy | strdirect_packageszfrozenset[str] | None preferenceszMapping[str, Version] | Nonelisting_filter_cachezListingFilterCache | Nonerz!Mapping[str, VersionRange] | Nonerrrr2rGrrH)rIs"rJrKProvider.__annotate__6sc=c=%c=%c=: c= + c=  c=1c= c="c=5c=<c=%c=0c=,c=#c= 4!c="'#c=$.%c=&6'c=(/)c=*2+c=,8-c=071c=2&*3c=4&5c=6 7c=rLc \V\4'd \V4pWnW nW@nVVnVVn WPn T;'g \4Vn Wpn WnT;'gVRJ;'d VPVnVVnV\"P$JVnT;'g \)4VnT;'g/P-4UUu/uFwpp\/V4VbK uppVn\3V 4VnT ;'g/Vn\9VP4;'g VP64Vn\<;QJd&RVP44F 'gK RM RM!RVP444;'ge\<;QJd4RVP6P?44F 'gK RM) RM%!RVP6P?444Vn T ;'g \C4Vn"\FPH!Y ;'g.4Vn%Wn&/Vn'\FPP!Y ;'g.4Vn)VVn*\FPV!Y;'g.4Vn,Vf1RVn-\]4Vn//VP^C\`CVn1M@VPdVn-\gVPh4Vn/VPk4Vn1VeVPl'd VPnMRVn8/Vn9/Vn:\4Vn;T;'g/Vn<T;'g/Vn=/Vn>/Vn?/Vn@/VnA/VnB/VnC/VnD/VnE^VnF/VnG/VnH\4VnI/VnJ/VnK/VnL/VnM/VnN/VnO/VnP/VnQ/VnR/VnS/VnT/VnU.VnV\\4VnY\\4VnZ\\PP4Vn^\\PP4Vn_\\4Vn`\\f4Vna/Vnb.Vnc/VndRVne\4VngVPx'd{VPxFhpVPV4wpp V VPJ9g#V VPR9gV VPX9dKMVP PV 4Kj R#R# \d2p\ R\44pRT: RT: 2p\T4ThRp?ii;iuuppi) z?Construct the provider; see the class docstring for parameters.c38"TFqPxK R#5irr)rss& rJr$Provider.__init__..WsC0B1ww0Brz#resolution_strategy must be one of z; got Nc3f"TF'pVPRJ;'g VPxK) R#5irruploaded_prior_to_disabledros& rJrr s3& ,   t + K Kq/K/K K,11TFc3f"TF'pVPRJ;'g VPxK) R#5irrrs& rJrr s3 3   t + K Kq/K/K K3r)j isinstancerFr> ValueErrorsortedrrrrrrsetr _dist_policyrr_resolution_strategyr2rsettle_listings frozenset_direct_packagesitemsr _preferencesr_package_overrides_index_overridesr_has_overridesanyvaluesoverrides_set_timerr_sourcesindex_local_sourcesrrvcs_pinsindex_vcs_sourcesrrindex_archive_sourcesrrr environmentrenv_with_extrapython_full_versiondict marker_envenv_with_membership tags_faithfultags wheel_tagstag_excluded_wheelstag_excluded_wheels_by_versionbase_filtered_packagesrrversions_cache deps_cachemetadata_cacheextra_deps_mapdeferred_url_extras_unsupported_sdists_invalid_metadatamatching_cache_scan_generation_absent_listing_scanrequires_python_cacheconsulted_markersmarker_base_cachemarker_extra_cachemarker_text_cache_package_partspriority_cacheversions_only_cachewheel_by_version_cache_ascending_versions_cache_widened_ranges_gap_widened_rangessolution_rangessolution_decisionspending_clausesrrpending_blockspending_range_blocks _lookahead DepRangeUnionzeropending_decision_dep_rangespending_range_dep_rangespending_root_blockspending_metadata_blocks_no_versions_reasons_force_backtrack_targets_force_backtrack_counts_probing_satisfiabler=rsplit_and_normalizerequest_listing)!rrrrrrrrrrrrrrrrrrrrrrrrrexcvalidmsgrversionpkg_ normalizeds!&&&&&&&&&&&&&&&&&&&&&&$$$ rJrProvider.__init__6s: )3 / / /&89L&M#' !2%9!)&&//#%'( ,G, ,  $ Q Q)Q)Q (%8!-1E1EE0?0N0N9;#."3"3!:!:!<1 !< g d #W ,!<1 #((9":=L=R=RPR#4#:#:#S#Sd>S>ST#&#& ,,& ###& ,,& # # # S **113 SSS **113   %33 %99$@S@SQST*(* #55d.2D /?/AD D""D'DD  #)"<"D "-&2F2F2FFKKD 46 OQ+ 14#!2!8!8b7B7H7HbIKNP IK     DF BDMO!"46!79"/2e 35>@13GI   >@ JL# DF&HJLN EG9;DF      !  0055 6 (  0055 6 %       $ 57!46% 8:$%*!"_  ! ! !--#'#;#;C#@ 1j$"4"44!T%5%55!T%9%99  00<. "u /C0BCC9%C/24!o3.  /J1 s V)W W%,WWc V^8dQhRRRR/#)rDrErFrGrrH)rIs"rJrKr [s66c6.L6rLc .\P!W4#)z8See :func:`nab_python._provider.listing.fetch_versions`.)_listingfetch_versionsrrEs&&rJrjProvider.fetch_versions[s&&t55rLc V^8dQhRRRR/#rDcanonical_namerFrGrrH)rIs"rJrKr _sHHCHJHrLc LVPPPV4#)zReturn the index that served ``canonical_name``'s listing, or None. Drawn from the coordinator's record of which configured index a package's listing came from; ``None`` before any listing resolves or for synthetic (local / VCS / archive) sources. )rindexget_listing_indexrros&&rJ serving_indexProvider.serving_index_s!%%77GGrLc(V^8dQhRRRRRRRR/#) rDrorFrbr) index_namerrGr1rH)rIs"rJrKr hs2   rLc  VPVVVRRRR7pV\Jd VP#\V\4'gQhV#)aNReturn the build policy for ``canonical_name==version`` from ``index_name``. Caller must canonicalise the name first. A per-package override whose version range contains ``version`` and a per-index override for ``index_name`` that both set ``build-policy`` are a conflict (raises :class:`~nab_python.config.OverrideConflictError`). z build-policyc,\VP4#rrrrs&rJ1Provider.effective_build_policy..zs N1>>$BrLc,\VP4#rrzr{s&rJr|r}{s ."@rLfield package_value index_value)_effective_fieldrrrr1rrorbrwrs&&&& rJeffective_build_policyProvider.effective_build_policyhsY&&    B@ '  V $$ $&+.... rLc V^8dQhRRRR/#)rDrorFrGr1rH)rIs"rJrKr s!!! !rLc VPFYpVPV8XgKVPfK&\VPP 4'dKMVPu# VP#)aqReturn the build policy for a synthetic local/VCS/archive source. These sources have no serving index and their version is not known until the backend runs, so the version-scoped lookup does not apply. A per-package override is honoured only when it uses a bare-name requirement (full range); a version-scoped override does not govern such a source's build decision. )r rrrF requirement specifier)rrooverrides&& rJ!effective_build_policy_for_source*Provider.effective_build_policy_for_sources]//H /))5H00::;;,,, 0   rLc(V^8dQhRRRRRRRR/#) rDrorFrbr)rwrrGr3rH)rIs"rJrKr s2   rLc  VP'g VP#VPVVVRRRR7pV\Jd VP#\ V\ 4'gQhV#)zHReturn the dist policy for ``name==version`` served from ``index_name``.z dist-policyc,\VP4#rrrr{s&rJr|0Provider.effective_dist_policy..s N1==$ArLc,\VP4#rrr{s&rJr|rs ."?rLr)r"rrrrr3rs&&&& rJeffective_dist_policyProvider.effective_dist_policysq"""$$ $&&   A? '  V $$ $&*---- rLc(V^8dQhRRRRRRRR/#) rDrorFrbr)rwrrGrrH)rIs"rJrKr s2//// /  /rLc  VP'g VP#VPVVVRVPVPR7pV\ Jd VP#\ RV4#)auReturn the upload-time cutoff for ``canonical_name==version``, or None. A matching override may set an absolute cutoff or disable it (the ``false`` form); a disabling override returns ``None``. Falls back to the global ``uploaded_prior_to`` when no override sets the field. A per-package (range-matching) and a per-index override that both set the field are a conflict. zuploaded-prior-torr)r"rr_package_uploaded_prior_to_index_uploaded_prior_torrrs&&&& rJeffective_uploaded_prior_to$Provider.effective_uploaded_prior_tosu""")) )&&   %9955 '  V )) )%v..rLc(V^8dQhRRRRRRRR/#) rDrorFrbr)rwrrGrrH)rIs"rJrKr s2   rLc  VPVVVRRRR7pV\Jd VP#\V\4'gQhV#)z.sN13O3O$PrLc,\VP4#rrr{s&rJr|rs.1M1M"NrLr)rrrrrrs&&&& rJeffective_trust_unverified#Provider.effective_trust_unverifiedsY&&   5PN '  V 33 3&$'''' rLc$V^8dQhRRRRRR/#)rDrorFrbr)rGztuple[Requirement, ...] | NonerH)rIs"rJrKr s$%%!%,3% '%rLc NVPVVR4pVfR#VP#)aReturn the ``dependencies`` metadata override for ``name==version``. Metadata overrides live only on the per-package surface, so this is a single-surface lookup with no per-index arbitration and no :class:`OverrideConflictError`. Returns the replacement requirement tuple (possibly empty, meaning "no runtime deps") when a range-matching override sets ``dependencies``, else ``None`` when nothing overrides them. c,\VP4#r)r dependenciesr{s&rJr|1Provider.effective_dependencies..s nQ^^4rLN)_matching_package_overriderrrorbrs&&& rJeffective_dependenciesProvider.effective_dependenciess422   4   $$$rLc$V^8dQhRRRRRR/#)rDrorFrbr)rGrrH)rIs"rJrKr s$((!(,3( (rLc vVP'gR#VPVVR4pVfR#VP#)a3Return the ``requires-python`` metadata override for ``name==version``. Single-surface (per-package only), like :meth:`effective_dependencies`. Returns the raw specifier string a range-matching override sets (which may be ``""``, meaning "no Python requirement"), else ``None`` when nothing overrides it. Nc,\VP4#r)rrequires_pythonr{s&rJr|4Provider.effective_requires_python..snQ%6%67rL)r rrrs&&& rJeffective_requires_python"Provider.effective_requires_pythonsC&&&22   7   '''rLc$V^8dQhRRRRRR/#)rDrorFrbr)rGztuple[str, ...] | NonerH)rIs"rJrKr  s$''!',3' 'rLc NVPVVR4pVfR#VP#)zReturn the ``provides-extra`` metadata override for ``name==version``. Single-surface (per-package only). Returns the declared extras (possibly empty, meaning "no extras") a range-matching override sets, else ``None`` when nothing overrides them. c,\VP4#r)rprovides_extrar{s&rJr|3Provider.effective_provides_extra..snQ%5%56rLN)rrrs&&& rJeffective_provides_extra!Provider.effective_provides_extra s422   6   &&&rLc V^8dQhRRRR/#)rDrorFrGItuple[tuple[Requirement, ...] | None, str | None, tuple[str, ...] | None]rH)rIs"rJrKr s77!7 R7rLc lRpRpRpVPFpVPV8wdK\VPP4'dK=VfVP e VP pVfVP e VP pVeKVPfKVPpK W#V3#)aResolve a local/VCS/archive source's metadata override bundle. These sources have no listing and their version is not known until materialised, so a metadata override governs them only through a bare-name requirement (full range); a version-scoped override does not match a source. Mirrors :meth:`effective_build_policy_for_source`. Each field is taken from the first bare-name entry that sets it (a present ``""`` or ``()`` is a set value); the parse-time overlap rules make that entry unique. N)r rrFrrrrr)rrodepsrrrs&& rJ_source_metadata_override"Provider._source_metadata_overrides04&*15//H}}.8''1122| 5 5 A,,&8+C+C+O"*":":%(*A*A*M!)!8!80~66rLc$V^8dQhRRRRRR/#)rDrorFrbr)rGrrH)rIs"rJrKr 8s$  ! ,3 R rLc WP9g!WP9gWP9dVPV4#VP W4VP W4VP W43#)aOResolve the ``(dependencies, requires_python, provides_extra)`` override. A local/VCS/archive source selects bare-name-only (its materialised version is not knowable to the user when writing the selector); every other candidate selects version-scoped. Each field resolves independently, so the three may come from different entries. )rrrrrrrrrorbs&&&rJeffective_metadata_override$Provider.effective_metadata_override8sm 00 0!1!11!5!5511.A A  ' ' @  * *> C  ) ). B  rLc V^8dQhRRRR/#)rDrr,rGrrH)rIs"rJrKr Os_rLc jVPe VP#VP'dR#\#)zIPer-package upload-time value: a datetime, ``None`` (disabled), or unset.Nrrrrs&rJr#Provider._package_uploaded_prior_toN0  % % 1-- -  . . . rLc V^8dQhRRRR/#)rDrr*rGrrH)rIs"rJrKr Xs=VrLc jVPe VP#VP'dR#\#)zGPer-index upload-time value: a datetime, ``None`` (disabled), or unset.Nrrs&rJr!Provider._index_uploaded_prior_toWrrLc(V^8dQhRRRRRRRR/#) rDrorFrbr) sets_fieldzCallable[..., object]rGzPackageOverride | NonerH)rIs"rJrKr `s,!,3AV rLc VPF<pVPV8wdKW$P9dK(V!V4\JgK:Vu# R#)zReturn the per-package override for ``version`` that sets the field. At most one matches because the parse-time non-overlap check forbids two same-field entries with overlapping ranges. N)r r version_ranger)rrorbrrs&&&& rJr#Provider._matching_package_override`sI//H}}.444(#61 0rLc4V^8dQhRRRRRRRRRR R R R R /#)rDrorFrbr)rwrrrz#Callable[[PackageOverride], object]rz!Callable[[IndexOverride], object]rGrrH)rIs"rJrKr qsP**** *  *;*7* *rLc  0VPWV4pVeVPPV4MRpVe V!V4M\p VeAV \Jd7^RIHp RV RV RV: R\ VP4: RV: R2 p V !V 4hVe V!V4#V #) apResolve one policy field for a candidate across both override surfaces. Returns the per-package value when a range-matching per-package override sets ``field``, else the per-index value when the serving index's override sets it, else ``_UNSET`` (the caller substitutes the global default). When BOTH surfaces set the field for this candidate, raises :class:`~nab_python.config.OverrideConflictError`: the two surfaces are deliberately not ranked. Each value callable returns ``_UNSET`` when its override does not set the field, and the actual value (which may be ``None`` for a disabled upload-time cutoff) when it does. NOverrideConflictErrorzoverride conflict for ==z served from index z: both a per-package override (z!) and the per-index override set zh. The per-package and per-index surfaces are not ranked; remove one of the two settings for this field.)rr!rrconfigrrFr) rrorbrwrrrrcidx idx_valuerras &&&&$$$ rJrProvider._effective_fieldqs.--n}U7A7Md##'' 3SW(+K$V ?y6 5)(87)D$(),-9JJ (, , ? % %rLc V^8dQhRRRR/#)rDrorFrGrrH)rIs"rJrKr sCCCCCCrLc :VPPV^4#)z:How many times this package has triggered force-backtrack.)r[rrss&&rJforce_backtrack_countProvider.force_backtrack_counts++//BBrLc$V^8dQhRRRRRR/#)rDrorFrbr)rGrrH)rIs"rJrKr s&CC3CCTCrLc "W3VP9#)z?Return True if metadata parsing previously failed for this pin.)r=rs&&&rJhas_invalid_metadataProvider.has_invalid_metadatas(D,B,BBBrLc$V^8dQhRRRRRR/#)rDrerFsourcer9rGrrH)rIs"rJrKr s(     ( rLc n.p\P!WV4FwrEVPWE34K V#)zBSee :func:`nab_python._provider.sources.materialize_local_source`.)r&materialize_local_sourceappendrrerrrbsdists&&& rJr!Provider.materialize_local_sources= 24&?? f NG MM7* +  rLc$V^8dQhRRRRRR/#)rDrerFrrBrGrrH)rIs"rJrKr s(     ( rLc n.p\P!WV4FwrEVPWE34K V#)z@See :func:`nab_python._provider.sources.materialize_vcs_source`.)r&materialize_vcs_sourcerrs&&& rJrProvider.materialize_vcs_sources8 24&==dPVWNG MM7* +X rLc$V^8dQhRRRRRR/#)rDrerFrr0rGrrH)rIs"rJrKr s(     ( rLc n.p\P!WV4FwrEVPWE34K V#)zDSee :func:`nab_python._provider.sources.materialize_archive_source`.)r&materialize_archive_sourcerrs&&& rJr#Provider.materialize_archive_sources= 24&AA f NG MM7* +  rLc$V^8dQhRRRRRR/#rDrerF version_listrrG list[Version]rH)rIs"rJrKr s-FFF5F  FrLc 0\P!WV4#)z7See :func:`nab_python._provider.listing.versions_only`.)ri versions_onlyrrers&&&rJrProvider.versions_onlys %%d EErLc$V^8dQhRRRRRR/#)rDrerFrrrGdict[Version, DistFile]rH)rIs"rJrKr s-III5I ! IrLc 0\P!WV4#)z:See :func:`nab_python._provider.listing.wheel_by_version`.)riwheel_by_versionrs&&&rJ_wheel_by_versionProvider._wheel_by_versions ((<HHrLc$V^8dQhRRRRRR/#)rDrerFversionsrrGrrH)rIs"rJrKr s-BBB1B  BrLc 4\P!WV4R#)z>See :func:`nab_python._provider.listing.speculative_prefetch`.N)rispeculative_prefetchrrers&&&rJrProvider.speculative_prefetchs %%dArLc V^8dQhRRRR/#rDrerFrGrrH)rIs"rJrKr sQQcQdQrLc H\P!WVP4R#)z=See :func:`nab_python._provider.listing.prefetch_walk_ahead`.N)riprefetch_walk_aheadrrres&&rJr Provider.prefetch_walk_aheads$$Tt7O7OPrLc$V^8dQhRRRRRR/#)rDrerFfileszSequence[WheelFile | SdistFile]rGrrH)rIs"rJrKr s)FFF&EF 'FrLc 0\P!WV4#)z>See :func:`nab_python._provider.listing.filter_distributions`.)rifilter_distributions)rrers&&&rJrProvider.filter_distributionss,,TuEErLc$V^8dQhRRRRRR/#)rDrerFrrrGztuple[Version, DistFile] | NonerH)rIs"rJrKr s-HHH1H ) HrLc 0\P!WV4#)z=See :func:`nab_python._provider.listing.pick_best_candidate`.)ripick_best_candidaters&&&rJrProvider.pick_best_candidates ++DhGGrLc$V^8dQhRRRRRR/#)rDrErFrRangeProtocol[Version]rGVersion | NonerH)rIs"rJrKr s$- - - +A- - rLc \V\4'gQhVP;P^, unVP V4wr4pVP WWEV4pVeVP 4V#VeVPWWB4#VPV4pVPWW4p\VPVRR74p VPV4'dV P4VP'*;'dVP'*p V 'g V 'g/V 'gVP!WVR7V 'd V ^,#R#VP#WW4p VP%WYWV4#)zPick a version within the allowed range, respecting the strategy. A preference another resolve decided wins when it is in range and usable here; otherwise the strategy picks. N descending assume_sorted)r)rrrrr]_preferred_version_flush_pending_blocks_choose_extra_versionrjrrfilter wants_lowestreverserrN_record_no_versions_reasonr_run_full_scan) rrErrNrOre preferredr all_versions candidates no_lookaheadrs &&& rJchoose_versionProvider.choose_versionse-6666 ''1,'"&":":7"CZ++ 5m    & & (   --gUR R**73 ))*C   \ J   Z ( (    111QQ$:Q:Q6Q z//0%/:a= 8D 811*K"" $4|  rLc 0V^8dQhRRRRRRRRRRR R /#) rDrErFrNrOrrerrrGrrH)rIs"rJrKr #sF)-)-)-)- )-  )- $ )- )-rLc VPPV4pVeVPV4'dR#VPW@P V44pTpVe(VP PV4p V e WY,pVP VRR7p Wj9dR#Ve\P!WW64MVPWFRR7p V 'dV#R#)azReturn the preferred version for ``package``, or None to pick fresh. A preference is honored only when it is in range and usable here: a base version needs extractable metadata, an extras proxy additionally needs to declare the extra. A package the strategy wants lowest for keeps its own floor, so alignment cannot make the result depend on the order the targets resolve in. NrrTcheck_decisions) rrr$rrjrMr#_extrasversion_provides_extra_look_ahead_ok) rrErNrOrerr(r) admit_range base_rangein_rangeusables &&&&&& rJr Provider._preferred_version#s %%))*5   1 1* = =))*6I6I'6RS $  --11*=J%+8 %%l,%O  $   * *4u H$$ZD$Q  #y,,rLc$V^8dQhRRRRRR/#)rDrErFrrrGrrH)rIs"rJrKr Ns.GCGCGC+AGC GCrLc  b^RIHp\VP4p\VP4pRVnVP W4RJRVnVP4VP4W@nVPPV4pWPnVeW`PV&## \\\\\T\\ \"\$3 dgRTnTP4TP4Y@nTPPT4pYPnTeY`PT&R#R#i;i RTnTP4TP4Y@nTPPT4pYPnTeY`PT&ii;i)aPReport whether a usable version exists, side-effect-free. Runs the real ``choose_version`` over ``version_range`` so look-ahead rejections are honored, then rolls back the state it records: the queued clauses and force-backtrack signal are drained, and the force-backtrack budget and no-versions reasons are restored to their pre-probe values. A failed-resolve attribution probe therefore cannot alter a later decision. The one exception is ``package``'s own no-versions reason. When the un-narrowed range yields no version because a transitive conflict rejected every candidate, this probe is the only pass that names the blocker, so its reason is kept rather than rolled back to the generic no-match the constraint-narrowed pass recorded. The reason map only labels a ``NO_VERSIONS`` clause, so keeping it cannot alter a decision. The probe also suppresses the two look-ahead shortcuts that could otherwise report a version the decided blocker rejects: ``_probing_satisfiable`` skips the abort and keeps checking decisions past ``_BROAD_LA_REJECT_CAP``. The un-narrowed range spans versions the constraint clipped away, so look-ahead can reach one whose metadata raises a hard error the narrowed resolve never touched (a failed integrity check, a tie-ranked-wheel divergence, or an advertised sidecar the index answered it will not serve). Each names a fault of that one version, so the probe catches them and returns ``False`` rather than aborting; the crash still fires when the version is pinned for real. A transient transport failure is deliberately not in that tuple. A 5xx that outlived the retry budget, or a dropped connection, says nothing about the version, and swallowing it would report "no satisfying candidate" for a version that has one and hand back a different resolution instead of failing. The ``finally`` restores the snapshot either way. rTNF)rrr.r[rYr\r,consume_pending_clausesconsume_force_backtrack_targetsrr r rrr7r?NotImplementedErrorr r)rrErr saved_counts saved_reasons probed_reasons&&& rJhas_satisfying_versionProvider.has_satisfying_versionNsP 2D889 T667 $(! C&&w>dJ).D %  ( ( *  0 0 2+7 (!5599'BM(5 %(5B))'2)+ & " "  " ! *  (   (-D %  ( ( *  0 0 2+7 (!5599'BM(5 %(5B))'2)- ).D %  ( ( *  0 0 2+7 (!5599'BM(5 %(5B))'2)s$B--5E"E EE A#F.c 0V^8dQhRRRRRRRRRRR R /#) rDrerFr*rrrrEr)rGrrH)rIs"rJrKr sF   " 2    $   rLc ^pVPW^,RR7'dVP4V^,#VP;P^, unV^, pVP VVR,VVV^,R7pVeVP4V#VP V4pVP4VP WEVR7R#)z7Run the decision-aware look-ahead scan over candidates.Tr0:NN)first_candidateN)blockers)r4r!rr_scan_candidates_pipelined_capture_lookahead_blockersr&) rrer*rrEr)broad_rejectionsfoundrHs &&&&&& rJr'Provider._run_full_scans   za=$  O O  & & (a=  ((A-(A//  rN  &qM 0     & & (L33J? ""$ '''QrLc ,V^8dQhRRRRRRRRRR/#) rDrErFrNrOrrrGrrH)rIs"rJrKr s;WWW"%W.1WBNW WrLc 2\P!WW#V4#)z=See :func:`nab_python._provider.extras.choose_extra_version`.)r2choose_extra_version)rrErNrOrs&&&&&rJr"Provider._choose_extra_versions++D4 VVrLrGc 0V^8dQhRRRRRRRRR R R R /#) rDrerF remainingrrrrKrrGrrGrH)rIs"rJrKr sF999!92 9  9(9 9rLc xVPV4\\^\V4VP44p\ 4p\VP 4FMp\VR4p V fM  & &z =(,(8(8#3) %G"rLc ,V^8dQhRRRRRRRRR R /#) rDrerFr`rrKrrGrrGztuple[Version | None, int]rH)rIs"rJrKr s<!&!&!&!& !& ( !& $ !&rLc VFpVP;'gW0P8pVPWVR7'dWS3u#VP;P^, unV'gKpV^, pVfKW0P 8dKVP'dKVP V4'gKWC3u# RV3#)zLook-ahead-check each version. Return (winner, new_rejection_count). Winner is the first compatible candidate, or ``first_candidate`` when the abort fires, or None to keep scanning further batches. r0N)r\rr4rr_LOOKAHEAD_ABORT_THRESHOLD_try_abort_lookahead)rrer`rKrGrbr1s&&&&& rJr\Provider._scan_batchsG))@@#&?&?? ""_#00 JJ , , 1 ,"  ! &"A"AA(((((44&88)*%%%rLc V^8dQhRRRR/#rDrerFrGrrH)rIs"rJrKr sstrLc 8VPV4pVfR#VPV4Vwr4VPPV^4pW0P9dBWPP 8d2VPP V4V^,VPV&R#)zRun the monolithic-rejection abort. Return True when it fires. Firing queues the blocker for force-backtrack, up to the per-blocker cap; the caller then falls back to its first candidate. FT)_should_abort_lookahead _discard_pending_decision_blocksr[rrZ_MAX_FORCE_BACKTRACKS_PER_PKGr)rreblocker blocker_pkgrd prior_firess&& rJrjProvider._try_abort_lookaheads ..z: ? --j9  2266{AF << <@@@  ) ) 0 0 =8CaD ( ( 5rLc V^8dQhRRRR/#)rDrerFrGztuple[str, Version] | NonerH)rIs"rJrKr 1s  # :T rLc ja\4pVPF4wr4pVS8XgKVPWE34\V4^8gK3R# \V4^8wdR#\;QJd)V3RlVP 4F 'gK RM RM!V3RlVP 44'dR#\;QJd)V3RlVP 4F 'gK RM RM!V3RlVP 44'dR#SVP9dR#\\V44#)aReturn the single shared blocker if every rejection blames it. The trigger is intentionally narrow: only when *every* rejection for ``normalized`` is a decision block with the same ``(blocker_pkg, blocker_version)`` key and there are no range / root / metadata blocks. Returns ``(blocker_pkg, blocker_version)`` when the condition holds, else ``None``. Mixed-cause scans keep the per-version clauses because at least one rejection cause is a real constraint the resolver still needs to learn. Nc30<"TF vrVS8HxK R#5irrHrcandrdres& rJr3Provider._should_abort_lookahead..EsL2Khdtz!2KTFc30<"TF vrVS8HxK R#5irrHrys& rJrr{GsK2Jhdtz!2Jr|) rrPaddrWr#rQrWrXrXrU)rreseenrzrsblocker_versions&f rJro Provider._should_abort_lookahead1s*-262E2E .Dz!+78t9q= 3F t9> 3L$2K2KL333L$2K2KL L L 3K$2J2JK333K$2J2JK K K 55 5DJrLc V^8dQhRRRR/#r rH)rIs"rJrKr Ms  3 4 rLc  \\VPP4UUu/uFwr#V^,V8wgKW#bK upp4Vn\\P P VPP4UUu/uFwr#V^,V8wgKW#bK upp4VnR#uuppiuuppi)aDrop decision-block entries for ``normalized`` without emitting clauses. Used by the look-ahead abort path: the blocker clauses the queue would otherwise produce are exactly the ones that mislead the resolver into picking a deep candidate. Range / root / metadata blocks are left in place because the abort path only fires when none exist for this candidate; this helper still scopes its delete to the matching candidate name for safety. N)rrrPrrRrSrTrU)rrekvs&& rJrp)Provider._discard_pending_decision_blocksMs* "11779 P9daQqTZ=OTQT9 P  ,7  $ $ ) )!<<BBD DDAQ4:%D , ( Q  sB9 B9 B? $B? c V^8dQhRRRR/#rmrH)rIs"rJrKr fs  s t rLc VP\PJdR#VP\PJdWP9#R#)zWhether the resolver should pick the minimum version for ``normalized``. Lookup keys are canonical names; extras-proxy callers must pass the *base* name (the strategy decision is keyed off the underlying package, not the proxy). TF)rr>r~rrrs&&rJr$Provider.wants_lowestfsC  $ $(:(A(A A  $ $(:(H(H H!6!66 6rLrHrc ,V^8dQhRRRRRRRRR R /#) rDrErFr)rrHzlist[str] | NonerVersionRange | NonerGrrH)rIs"rJrKr ssCg4g4g4$g4 # g4 + g4 g4rLc 0VPV4wrVV'EgVPPPV4pVPP V^4pV'g`VPPP V4'dRp MVPPPV4'dRp MRp MV'dW`P9dRV R2p MV'dB\;QJdRV4F 'gK RM RM !RV44'dRV R 2p MZR p MWV'dR PV4p R V 2p M8WP9dR #Ve!\P!WWB4'dRp MRp WPV&R #)a Record why ``choose_version`` returned ``None`` for ``package``. ``blockers`` carries the look-ahead rejection causes when every candidate that fell in ``version_range`` was rejected: either because of an already-decided package, a positive-range constraint, a root-requirement disagreement, or because the candidate's metadata could not be read under the current build policy. When supplied, the recorded reason names those causes so the user does not see a bare "no version matches the requirement", which would suggest the package is missing from the index when in fact it is the resolver's transitive constraints (or a too-strict build policy) that excluded every candidate. ``version_range`` is passed only when no surviving version fell inside it. A version the listing filter dropped that does fall inside it is the release the requirement asked for, so the reason names the filter rather than reporting no match. ``all_versions`` is post-filter, so an empty one means either the index served no files or every file it served was dropped by the wheel-tag filter, requires-python, dist-policy, or the upload-time cutoff. The stored listing tells absence from incompatibility apart, except that it is also empty for an index skipped offline and for a page of formats nab does not read (``.zip`` sdists, ``.exe`` installers). Both are marked when stored so the reason names them instead of absence. The wheel-tag case (a Windows-only package on a Linux target) is named only when the base pass dropped nothing, or when the file it dropped was an sdist: there the reason names both the rejected tags and the filtered sdist, because the sdist is what the user can bring back. A base-filtered wheel alongside a tag-rejected wheel on another version reports the base-filter reason alone. A look-ahead rejection emits a clause that removes the rejected versions from the range, so the resolver asks again over a range nothing falls in. That second ask has no blockers of its own, so its no-match reason must not overwrite the one naming the blocker. z4offline mode skipped an index with no cached listingzPfound on index but no file is a wheel or a .tar.gz sdist (the formats nab reads)z)package not found on any configured indexzTfound on index but none of the wheel's tags are compatible with the resolve target (z: wheels rejected), and no sdist is available to build fromc3B"TFp\V\4xK R#5ir)rr )rfs& rJr6Provider._record_no_versions_reason..s%T 1jI&>&> sTFz] wheels rejected), and the sdist was filtered by requires-python, dist-policy, or upload-timezofound on index but no distribution is compatible (all filtered by requires-python, dist-policy, or upload-time)z; z%every version in range was rejected: Nzfound on index but every version matching the requirement was filtered (by requires-python, wheel tags, dist-policy, or upload-time)z"no version matches the requirement)r]rrq get_listingr4ris_offline_listing_missis_unreadable_only_listingr6r#joinrYrihas_filtered_in_range_release) rrEr)rHrrdre raw_listing tag_excludedreasonjoineds &&&$$ rJr&#Provider._record_no_versions_reasonss^ 33G<1|**00<->y-I,J*?*;= 3F-1,E,E (Dy!55I.e  JJK=T->->y-I,J*4+<+->y-I,J&t'8'8'D&EG &++// ; IET$++-01Iz 9%   gJ9+UVW rLc V^8dQhRRRR/#)rDrErFrGrrH)rIs"rJrKr s66c6j6rLc 8VPPV4#)zReturn the recorded reason for ``package``'s NO_VERSIONS clause. Returns ``None`` if no diagnostic was captured (e.g. the package was decided successfully or failed for a non-listing reason such as a metadata parse error). )rYrrks&&rJget_no_versions_reasonProvider.get_no_versions_reasons((,,W55rLc(V^8dQhRRRRRRRR/#) rDrErFrrrrrG/list[tuple[Version, str, str, threading.Event]]rH)rIs"rJrKr !s8RRR R2 R 9 RrLc 0\P!WW#4#)z8See :func:`nab_python._provider.listing.prefetch_batch`.)riprefetch_batch)rrErrs&&&&rJrYProvider._prefetch_batch!s&&thQQrLc$V^8dQhRRRRRR/#)rDrErFrarrGrrH)rIs"rJrKr *s.@@@C@  @rLc 4\P!WV4R#)z>See :func:`nab_python._provider.listing.await_metadata_batch`.N)riawait_metadata_batch)rrEras&&&rJr[Provider._await_metadata_batch*s %%dY?rLc$V^8dQhRRRRRR/#)rDpositive_rangesz$Mapping[str, RangeProtocol[Version]] decisionszMapping[str, Version]rGrrH)rIs"rJrKr 2s(,,=,),  ,rLc WnW nR#)aAccept a snapshot of the resolver's positive-range assignments. Decision-only forward checking is safer than reasoning over derivations because backjumping a decision also undoes its derivations. The caller hands over fresh snapshots it does not retain or mutate, so we store them directly. We only ever read these maps, never mutate them in place; both are reassigned wholesale on the next hint. N)rMrN)rrrs&&&rJreceive_partial_solution_hint&Provider.receive_partial_solution_hint2s /"+rLr1Tc(V^8dQhRRRRRRRR/#)rDrErFrbr)r1rrGrH)rIs"rJrKr Cs,   %, BF  rLc 2\P!WW#R7#)z9See :func:`nab_python._provider.lookahead.look_ahead_ok`.r0)rR look_ahead_ok)rrErbr1s&&&$rJr4Provider._look_ahead_okCs'' 7  rLcV^8dQhRR/#rrH)rIs"rJrKr Ks..t.rLc 2\P!V4R#)z@See :func:`nab_python._provider.lookahead.flush_pending_blocks`.N)rRflush_pending_blocksrs&rJr!Provider._flush_pending_blocksKs''-rLcV^8dQhRR/#)rDrGz#list[Incompatibility[str, Version]]rH)rIs"rJrKr Os)LrLc ,VPp.VnV#)z7Drain queued binary clauses for the resolver to absorb.)rO)rclausess& rJr< Provider.consume_pending_clausesOs&&!rLcV^8dQhRR/#)rDrGrrH)rIs"rJrKr Us   rLc ,VPp.VnV#)a5Drain blocker packages queued by the look-ahead abort path. See ``ResolverProvider.consume_force_backtrack_targets`` for the contract. Returning a non-empty list asks the resolver to skip deciding the candidate just returned by ``choose_version`` and instead targeted-back-track these packages immediately. )rZ)rtargetss& rJr=(Provider.consume_force_backtrack_targetsUs//(*%rLc$V^8dQhRRRRRR/#rrH)rIs"rJrKr as(5  rLc VPPV4pVf2\\VP W444pW0PV&V#)aReturn the widening universe for ``normalized``: ascending, cached. The reversed ``versions_only`` view of the post-filter listing, so pre-release, dev, post, and local versions all fence widening. Yanked files are dropped at nab-index parse time and can never be selected; if that ever moves into a provider-level filter, this universe must be sourced below it, or widened ranges would span selectable yanked versions. )rJrrreversedr)rrercacheds&&& rJ_ascending_versionsProvider._ascending_versionsasL//33J? >(4#5#5j#OPQF9? * *: 6 rLc$V^8dQhRRRRRR/#rDrErFrbr)rGrrH)rIs"rJrKr us'DDcDGD@SDrLc TVPV4wr4pVPWRVRJR7#)aReturn the widened parent range for a decided ``version``, or None. For a base package the range spans adjacent listed versions whose cached dependency dicts equal the decided version's, then widens to the open gap around that span, so every selectable version inside has exactly the dependencies being recorded (see ``ResolverProvider.widen_decision`` for the contract). Under a lowest preference the upward half is capped and that side keeps the plain neighbor gap (see ``_span_identical_deps``); otherwise the span runs both ways. Extras proxies keep the pure neighbor gap over the base package's universe: their dependency sets are per-extra-context. Local, VCS, and archive sources (synthesized single-version listings) and packages whose listing is not cached are not widened. The span is computed once from ``deps_cache`` and memoized. Later fetches cannot invalidate it: metadata is immutable and the universe never grows mid-resolve, so recomputing could only widen the span. The cap is not part of the memo key: the strategy and the direct-package set are both fixed at construction, so ``wants_lowest`` gives one answer per package for the provider's whole life. Nspanr]_widen)rrErbrdrOres&&& rJwiden_decisionProvider.widen_decisionus00 $77@*{{:Ud]{CCrLc$V^8dQhRRRRRR/#rrH)rIs"rJrKr s" < <# <    rLc pWP9g!WP9gWP9dR#VPP V4pVfR#W3pV'd VP M VP pVP V4pVfVPW4p\P!W4p \P!W4p V'dVPWWV 4wrV 'dW^, ,MRp V \V48d W,MRp \P!WRRR7pWvV&V#)zEWiden ``version`` over ``normalized``'s universe; memoized per shape.NF) include_lower include_upper)rrrr7rrKrLrbisect bisect_left bisect_right_span_identical_depsrWr from_bounds) rrerbrrkeymemowideneduniversebelowaboveprevnxts &&&$ rJrProvider._widens ,, ,---111**..z:  #'+t##1I1I((3- ?// IH&&x9E'':E#88%  +08AI&TD%*S]%:(/C"..eG IrLc 0V^8dQhRRRRRRRRR RR R /#) rDrerFrbr)rrrrrrGztuple[int, int]rH)rIs"rJrKr sF!!!! !  !  ! !rLc jVPpVPW34pVfWE3#V'd1VPWV^, ,34V8Xd V^,pK8VPV4'dWE3#\V4pWX8d*VPWV,34V8Xd V^, pK/WE3#)aExtend ``[below, above)`` across neighbors with equal cached deps. Reads ``deps_cache`` only, never fetches. A neighbor whose cached dependency dict is missing or differs fences the span; so does a decided version whose own deps are not cached. The upward half is capped when ``wants_lowest`` picks the minimum for this package, the same per-package answer ``choose_version`` orders candidates by. Under a lowest preference the answer sits near the floor, so an upward span carries the search away from it a whole run at a time; capping leaves the plain neighbor gap there, and the search resumes at the adjacent listed version. Every other package spans both ways. )r8rr$rW) rrerbrrrrrtops &&&&&& rJrProvider._span_identical_depss,zz:/0 <<  J0C#DEM QJE   Z ( (< (mkfjj*uo)FG4O QJE|rLc$V^8dQhRRRRRR/#)rDrEr constraintrrGrH)rIs"rJrKr s$000+A0 0rLc a\V\4'gS#VPV4wr4VPP V4pVfS#\S\ 4'gQhVP WE4pV'dfVR,S9dX\;QJdV3RlV4F 'dK RM RM!V3RlV44'd\ P!RR7#SPV4#)aMap a possibly-widened ``constraint`` back onto listed versions. A constraint containing every listed version is promoted to the full range rather than snapped, so it reads as "any version". An empty universe never promotes: that would widen a constraint no version satisfies. Render-time only and cache-only: the ROOT sentinel (a non-str package) and packages whose listing is not cached return ``constraint`` unchanged, and nothing is ever fetched. c3,<"TF qS9xK R#5irrH)rrbrs& rJr.Provider.narrow_for_display..sBgz)sFT)admit_arbitrary) rrFr]r7rrrallfull snap_bounds)rrErrdrerrs&&f rJnarrow_for_displayProvider.narrow_for_displays'3'' 33G<1**..z:   *l3333++JE  *BBBBBB$$U; ;%%h//rLc V^8dQhRRRR/#)rDrrrGrFrH)rIs"rJrKr s""'="#"rLc \V\4'gQhVP'dR#V(P'dR#VP4pVf \ V4#\ V4#)a6Render ``constraint`` for a failure report. ``VersionRange`` has no ``__str__``, so interpolating one gives the debug repr, including the internal boundary-kind sentinels. A range a specifier set can spell reads as that specifier set, so ``==3.0.0`` shows the way a user would have written it. An unconstrained range renders as nothing, leaving the package name to carry the line, and the empty range gets a phrase rather than the ``<0`` a specifier set spells it with. A range with no specifier spelling, such as a disjunction, keeps the range's own rendering. z no version)rris_emptyto_specifier_setrF)rr specifier_sets&& rJrProvider.format_ranges`*l3333     K ! ! !"335  z? "=!!rLc$V^8dQhRRRRRR/#)rDrErFrbr)rGdict[str, VersionRange]rH)rIs"rJrKr s$5*5*5*%,5* 5*rLc VP;P^, unVPV4wr4pVeVPW4V4#WR3pW`P9dVPV,#VP P V4pVe \V4hVPP V4pVe \V4hVPV4p W`P9dfWPP9g!WPP9gWPP9d6VPW`PV,4VPV,#VP!WR4eRVPV\#WRR74VP%VPV,4VPV,#VP'WV4wrVP)WjV R7VP+WV4VP;P,^, unVP%VPV,4VPV,#)z8Fetch .metadata and return dependencies as VersionRange.)rrb from_sdist)rrr]_get_extra_dependenciesr8r<rrAr=r:rjr9rrr_cache_deps_from_metadatarrprefetch_new_deps_resolve_metadata!_parse_and_cache_metadata_guarded"_check_sibling_metadata_divergencer) rrErbrNrOre cache_keycached_unsupportedcached_invalidr metadata_textr s &&& rJget_dependenciesProvider.get_dependenciess ))Q.)"&":":7"CZ  //WE E)  '??9- -!5599)D  )'(:; ;//33I>  %/ /&&w/ ++ + ,, ,---111  * *96I6I)6T U??9- -  & &z ; G  * *=jJ   " "4??9#= >??9- -$($:$:8g$V!  ..  /  //7K ##q(# ty9:y))rLc(V^8dQhRRRRRRRR/# rDrtuple[str, Version]rrFr rrGrrH)rIs"rJrKr Ls,/./.,/.=@/.QU/. /.rLc  VwrE^RIHpVPWVR7R# \dp\ T4TP T&hRp?i\ \3dp\ T4TPT&hRp?i\\\\\\T3dh\dCp\ P#RTTT4RT RT RT 2pYPT&\%T4ThRp?ii;i)aParse fetched metadata, routing each failure to its own cache. A disallowed build, a candidate ruled out by its own metadata, and an unparseable payload each record their own failure kind so a re-query is answered from cache. Hard errors propagate unrecorded. rr NzSkipping %s==%s: metadata cannot be parsed (%s). Subsequent lookups for this version reuse the cached failure and do not re-emit this warning.zInvalid metadata for rz: )rrparse_and_cache_metadatarArFr<r5r6r=r r rrr>r7 Exceptionloggerwarningr:) rrrr rErbrr_ras &&&$ rJr*Provider._parse_and_cache_metadata_guardedLs%1# .  ) )Z * % 25c(D $ $Y / $&=> 03CD " "9 -  " %    " !   . NN<  *'"WIRuEC03 " "9 -$# - .s>! C(AC(C(A22'C( C(%C(&=C##C(c V^8dQhRRRR/#)rDrrrGrrH)rIs"rJrKr }s//&=/$/rLc 2\P!W4R#)z;See :func:`nab_python._provider.listing.prefetch_new_deps`.N)rir )rrs&&rJr Provider.prefetch_new_deps}s""4.rLc(V^8dQhRRRRRRRR/#) rDrrrErFrbr)rGztuple[str, bool]rH)rIs"rJrKr s8UU0UU U  UrLc 0\P!WW#4#)zDSee :func:`nab_python._provider.metadata_resolver.resolve_metadata`.)_metadata_resolverresolve_metadatarrrErbs&&&&rJrProvider._resolve_metadatas"2247TTrLc(V^8dQhRRRRRRRR/#) rDrrrErFrbr)rGrrH)rIs"rJrKr s2   0        rLc 4\P!WW#4R#)zCheck the version's tie-ranked wheels for divergent target deps. See :func:`._provider.metadata_resolver.check_sibling_metadata_divergence`. N)r%!check_sibling_metadata_divergencer's&&&&rJr+Provider._check_sibling_metadata_divergences << G rLr c(V^8dQhRRRRRRRR/#rrH)rIs"rJrKr s2   &        rLc 6\P!WW#R7R#)zBSee :func:`._provider.metadata_resolver.parse_and_cache_metadata`.r N)r%r)rrrr s&&&$rJr!Provider.parse_and_cache_metadatas 33 ] rLc$V^8dQhRRRRRR/#)rDrrmetadatarrGrrH)rIs"rJrKr s-OO&O O  OrLc 4\P!WV4R#)zBSee :func:`._provider.metadata_resolver.cache_deps_from_metadata`.N)r%cache_deps_from_metadata)rrr1s&&&rJr "Provider._cache_deps_from_metadatas 33DXNrLc(V^8dQhRRRRRRRR/#)rDrNrFrOrbr)rGrrH)rIs"rJrKr s8JJJJ J ! JrLc 0\P!WW#4#)z?See :func:`nab_python._provider.extras.get_extra_dependencies`.)r2get_extra_dependencies)rrNrOrbs&&&&rJr  Provider._get_extra_dependenciess--d%IIrLc V^8dQhRRRR/#)rDrErFrGztuple[str, str | None, str]rH)rIs"rJrKr s  3 3N rLc VPPV4pVeV#\V4wr4\V4pW4V3pW`PV&V#)zBReturn ``(base, extra, normalized_base)`` for ``package``, cached.)rFrrTr)rrErrNrOrers&& rJr]Provider.split_and_normalizesV$$((1  M!'* &t, z*'-G$ rLcV^8dQhRR/#rrH)rIs"rJrKr s##T#rLc 8V;P^, unR#)zOpen a decision scan, expiring the last one's in-flight answers. The coming scan re-reads the index, then holds any name it finds still in flight that way until the next call. N)r?rs&rJbegin_decision_scanProvider.begin_decision_scans "rLc V^8dQhRRRR/#rDrerFrGzlist[DistFile] | NonerH)rIs"rJrKr s#2GrLc VPPV4VP8XdR#VPPP V4pVfVPVPV&V#)aReturn ``normalized``'s listing, or None while it is in flight. The fetcher thread publishes listings asynchronously, so a bare index read can answer differently for two packages compared inside one decision scan, and differently for the two halves of one package's sort key. A name first seen in flight stays in flight until the next ``begin_decision_scan``, so one scan sorts against one view of what has landed. N)r@rr?rrqrrrers&& rJarrived_listingProvider.arrived_listingsb  $ $ ( ( 48M8M M""((44Z@ ?484I4ID % %j 1rLc V^8dQhRRRR/#rArH)rIs"rJrKr s>>#>2G>rLc FVPPPV4pVeV#VPPPV4eR#VPP V4P 4VPPPV4#)aReturn ``normalized``'s listing, waiting once for it to land. The blocking counterpart of :meth:`arrived_listing`, used by the decision scan under :attr:`DecisionOrder.STABLE`: waiting for the fetch gives the scan the same version count whatever the HTTP cache held, where reading what has arrived so far does not. A listing that already failed is not re-requested, and one wait is enough because every terminal path in the fetcher sets the event. ``None`` still means there is no listing to count, so a caller must not spin on it. N)rrqrget_listing_errorr^waitrCs&& rJsettled_listingProvider.settled_listings""((44Z@  N    ! ! 3 3J ? K ((499;%%11*==rLc V^8dQhRRRR/#)rDrErFrGrrH)rIs"rJrKr s<<<  rLc V^8dQhRRRR/#)rDrorFrGzLocalSource | NonerH)rIs"rJrKr  sIIsI7IIrLc JVPP\V44#)zDReturn the local source registered under ``canonical_name`` or None.)rrrrss&&rJlocal_source_forProvider.local_source_for s!!%%&7&GHHrLc V^8dQhRRRR/#)rDrorFrGzVcsSource | NonerH)rIs"rJrKr  sGGSG5EGrLc JVPP\V44#)zBReturn the VCS source registered under ``canonical_name`` or None.)rrrrss&&rJvcs_source_forProvider.vcs_source_for s##$5n$EFFrLc V^8dQhRRRR/#)rDrorFrGzArchiveSource | NonerH)rIs"rJrKr  sKKK9MKrLc JVPP\V44#)zFReturn the archive source registered under ``canonical_name`` or None.)rrrrss&&rJarchive_source_forProvider.archive_source_for s##''(9.(IJJrLc V^8dQhRRRR/#rnrH)rIs"rJrKr " sDD#D*DrLc JVPP\V44#)zReturn the post-clone commit SHA for ``canonical_name``, or None. Written by :func:`~nab_python._provider.sources.materialize_vcs_source` after the shallow clone resolves the ref to a 40-char SHA. )r(rrrss&&rJ vcs_pin_forProvider.vcs_pin_for" s }}  !2>!BCCrLc$V^8dQhRRRRRR/#)rDrorFrbr)rGzlist[DistFile]rH)rIs"rJrKr * s! = =S =7 =~ =rLc \V4pVPPV.4pVUUu.uFwrVWR8XgK VNK upp#uuppi)zReturn every distribution file the resolver saw at ``version``. Drawn from the cached listing populated during the resolve, so callers do not pay another fetch. When the package was never listed (synthetic / not asked for), returns an empty list. )rr7r)rrorbrerrdists&&& rJdist_files_forProvider.dist_files_for* sF'~6 %%))*b9$+r9r%rPrOrUrXrQrVrWrGrrArrrrNrMrr4r5rrrrrr(rr7rHrIr3rHr)jr\r]r^r_r`rrrrrrirqrT TIER_AFFECTED TIER_NORMAL TIER_CULPRITCONFLICT_THRESHOLDCULPRIT_DEMOTE_THRESHOLDr4rgr3rrr1rxr>r}r2rrrjrtrrrrrrrrrr staticmethodrrrrrrrrrrrrr rrr,r rBr'r"rIr\rjrorpr$r&rJrrYr[rr4r!r<r=rrrrrrrrrr rrrr r r]r>rDrJrNrUrYr]rarerjrnrarHrLrJr<r<s!TNC NC "!!##""# %&!++M''K))L"55(AA (,<@-1","7"737",";";$/$;$;79>B'+26.2%)6:)-048J8R8R1548:>-c=0:>1c=2-23c=4)6(=(=5c=c=J 6H4!$./>(%*(,'$7: ,"*XCC   FIBQF H- ^)-VGCR DW 9+/9v!&F( 8 2 g4 &* g4 .2 g4R:x6R@," IM . (D6 < D!F0<".5*n/.b/U    !  OJ #">*<& *IGKD =QQrL)r0r1r2DistFiler3r4r5r6r7r8r9r:r;r<r=r>r?r@rArrrrBrYrT)ur` __future__rrenumloggingre collectionsrr dataclassesrrtypingrrnab_index.clientr r r r r rnab_index.errorsrnab_index.transportr_conflict_kindr _providerrr2rrirrRrr%rrTrr&_vcs_admissionrrr_vendor.packaging.rangesr_vendor.packaging.utilsrr1rrr threadingcollections.abcr r!r"r#pathlibr$nab_resolver.typesr%r&_vendor.packaging.markersr'_vendor.packaging.requirementsr(_vendor.packaging.versionr)rr*r+r,fetchr-r2r.r/__all__ getLoggerr\rcompilerPrTrYrr;Enumr4rjr3r1r>r2r9rBr0r:rAr5r6r7r?r@r=rvrrrr8rrrr<rHrLrJrsf#  *)&.31(*.>,* 36#$;;!A1;2HH'% :   8 $ JJA B B1M M = = $))  >$$))$N>>"ODIIO $d#$$$$& $d#   $   $d#   $  ?I? M =mXYXYi ## #> y uA6-+@AuuA6-+@AA @ 00j  XQXQrL