2bi P S SK r S SKrS SKrSSKJr SSKJrJrJr \ R " SSS/5 r
" S S \ 5 r " S
S \ 5 r
" S S
\ 5 r " S S\5 r " S S\ 5 r " S S\5 r " S S\5 r\ R " SS5 r " S S\5 rS r\ R " SS 5 rS r " S S \5 rg) N )AbstractResolver)
DirectedGraphIteratorMappingbuild_iter_viewRequirementInformation requirementparentc \ rS rSrSrSrg)ResolverException
zA base class for all exceptions raised by this module.
Exceptions derived by this class should all be handled in this module. Any
bubbling pass the resolver should be treated as a bug.
N)__name__
__module__ __qualname____firstlineno____doc____static_attributes__r ڒ/builddir/build/BUILDROOT/alt-python313-pip-23.3.1-3.el8.x86_64/opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/resolvelib/resolvers.pyr r
s r r c . ^ \ rS rSrU 4S jrS rSrU =r$ )RequirementsConflicted c 8 > [ [ U ] U5 Xl g N)superr __init__ criterion)selfr __class__s r r RequirementsConflicted.__init__ s
$d4Y?"r c SR SR S U R R 5 5 5 5 $ )NzRequirements conflict: {}, c 3 8 # U H n[ U5 v M g 7fr repr.0rs r 1RequirementsConflicted.__str__.. I'H!d1gg'H )formatjoinr iter_requirementr s r __str__ RequirementsConflicted.__str__ s4 *11 IIIt~~'F'F'HI I
r )r r r r r r r2 r
__classcell__r s @r r r s #
r r c . ^ \ rS rSrU 4S jrS rSrU =r$ )InconsistentCandidate c D > [ [ U ] X5 Xl X l g r )r r8 r candidater )r r; r r s r r InconsistentCandidate.__init__! s
#T3II""r c SR U R SR S U R R 5 5 5 5 $ )Nz+Provided candidate {!r} does not satisfy {}r# c 3 8 # U H n[ U5 v M g 7fr r% r' s r r* 0InconsistentCandidate.__str__..) r, r- )r. r; r/ r r0 r1 s r r2 InconsistentCandidate.__str__& s; <CC NN IIIt~~'F'F'HI I
r )r; r r4 r6 s @r r8 r8 s #
r r8 c 0 \ rS rSrSrS rS rS rS rSr g) Criterion- a Representation of possible resolution results of a package.
This holds three attributes:
* `information` is a collection of `RequirementInformation` pairs.
Each pair is a requirement contributing to this criterion, and the
candidate that provides the requirement.
* `incompatibilities` is a collection of all known not-to-work candidates
to exclude from consideration.
* `candidates` is a collection containing all possible candidates deducted
from the union of contributing requirements and known incompatibilities.
It should never be empty, except when the criterion is an attribute of a
raised `RequirementsConflicted` (in which case it is always empty).
.. note::
This class is intended to be externally immutable. **Do not** mutate
any of its attribute containers.
c ( Xl X l X0l g r
candidates informationincompatibilities)r rF rG rH s r r Criterion.__init__A s $&!2 r c h SR S U R 5 5 nSR U5 $ )Nr# c 3 H # U H u pS R X5 v M g7f)z({!r}, via={!r})N)r. )r( reqr
s r r* %Criterion.__repr__..G s' !
/
% %c 2 2 /s "z
Criterion({}))r/ rG r. )r requirementss r __repr__Criterion.__repr__F s6 yy !
# / /!
%%l33r c ( S U R 5 $ )Nc 3 8 # U H oR v M g 7fr r r( is r r* -Criterion.iter_requirement..N s 8'7!
'7r- rG r1 s r r0 Criterion.iter_requirementM s 8t'7'788r c ( S U R 5 $ )Nc 3 8 # U H oR v M g 7fr r
rT s r r* (Criterion.iter_parent..Q s 3"2Q"2r- rW r1 s r iter_parentCriterion.iter_parentP s 3$"2"233r )rF rH rG N)
r r r r r r rO r0 r] r r r r rB rB - s &3
494r rB c \ rS rSrSrg)ResolutionErrorT r N)r r r r r r r r r` r` T s r r` c ( ^ \ rS rSrU 4S jrSrU =r$ )ResolutionImpossibleX c 8 > [ [ U ] U5 Xl g r )r rc r causes)r rf r s r r ResolutionImpossible.__init__Y s
"D26: r rf r r r r r r r5 r6 s @r rc rc X s
r rc c ( ^ \ rS rSrU 4S jrSrU =r$ )ResolutionTooDeep_ c 8 > [ [ U ] U5 Xl g r )r rk r round_count)r rn r s r r ResolutionTooDeep.__init__` s
/ <&r )rn ri r6 s @r rk rk _ s
' 'r rk Statez!mapping criteria backtrack_causesc d \ rS rSrSrS r\S 5 rS rS r S r
S r S r S
r
S rS rS
rSrg)
Resolutioni zStateful resolution object.
This is designed as a one-off object that holds information to kick start
the resolution process, and holds the results afterwards.
c * Xl X l / U l g r _p_r_states)r providerreporters r r Resolution.__init__p s r c T U R S $ ! [ a [ S5 ef = f)Nstate)rx
IndexErrorAttributeErrorr1 s r r~ Resolution.stateu s0 *<<# # * ) ) *s 'c U R S n[ UR R 5 UR R 5 UR
SS S9nU R R
U5 g)zqPush a new state into history.
This new state will be used to hold resolution results of the next
coming round.
r} Nmappingcriteriabacktrack_causes)rx rp r copyr r append)r baser~ s r _push_new_stateResolution._push_new_state| s^ ||B LL%%']]'') ! 2 21 5
E"r c
n U R R X#S9 U R R US9nUR U5 nU( a [ UR 5 nO/ nU R R U[ U[ R " S5 XB/05 [ U[ R " S5 XF05 S9nU( a0 [ UR 5 nUR [ X#5 5 O [ X#5 /n[ [! U5 UUS9nUR" ( d [% U5 eXQU' g )N)r r
)requirement_or_candidater0 rH
identifierrN rH rE )rw adding_requirementrv identifygetlistrH find_matchesr operator methodcaller
attrgetterrG r r rB r rF r ) r r r r
r r rH matchesrG s r _add_to_criteriaResolution._add_to_criteria s" ""{"JWW%%{%K
LL, $Y%@%@ A " ''&&!(%%&89]+
.##$78/ '
y 4 45K 5k J K1+FGK &w/# /
##(3 3 ( r c
< U( d gUR 5 H{ u p4[ UR UR Vs/ s H= nUR b+ U R
R
UR 5 U; d M; UPM? snUR 5 X' M} gs snf )a/ Remove information from parents of criteria.
Concretely, removes all values from each criterion's ``information``
field that have one of ``parents`` as provider of the requirement.
:param criteria: The criteria to update.
:param parents: Identifiers for which to remove information from all criteria.
N)itemsrB rF rG r
rv r rH )r r parentskeyr rG s r !_remove_information_from_criteria,Resolution._remove_information_from_criteria s &nn .NC %$$ (1'<'<'< #**2 77++K,>,>?wN '< ++ HM /s :B :B c T U R R UU R R [ U R R
[ R " S5 5 [ U R R
[ R " S5 5 U R R S9$ )NrF rG )r resolutionsrF rG r ) rv get_preferencer~ r r r r r r )r names r _get_preferenceResolution._get_preference s ww%%
**&
####L1 (
####M2 "ZZ 8 8 &
r c ^ ^ T R R U m[ UU 4S jUR 5 5 5 $ ! [ a gf = f)NFc 3 X ># U H nTR R UTS 9v M! g7f)r r; Nrv is_satisfied_by)r( r) current_pinr s r r* 8Resolution._is_current_pin_satisfying.. s,
1
GG # #[ # I1 '*)r~ r KeyErrorallr0 )r r r r s ` @r _is_current_pin_satisfying%Resolution._is_current_pin_satisfying sU **,,T2K
//1
s A
A
Ac U R R R 5 nU R R US9 H nU R X#US9 M U$ )Nr; r[ )r~ r r rv get_dependenciesr )r r; r r s r _get_updated_criteria Resolution._get_updated_criteria sO ::&&++- 7733i3HK ! !( ! J Ir c ^ ^ T R R U n/ nUR H m T R T5 n[ UU 4S jUR 5 5 5 nU( d [ TU5 eT R
R TS9 T R R R U5 T R R R US 5 TT R R U' / s $ U$ ! [ aM nT R
R
UR T5 UR UR 5 S nAGM# S nAff = f)Nc 3 X ># U H nTR R UTS 9v M! g7fr r )r( r) r; r s r r* 7Resolution._attempt_to_pin_criterion.. s, 5A ''A'K5r r )r~ r rF r r rw rejecting_candidater r r r0 r8 pinningupdater pop)r r r rf r e satisfiedr; s ` @r _attempt_to_pin_criterion$Resolution._attempt_to_pin_criterion s JJ''- "--I
55i@ "335 I +IyAA GGOOiO 0 JJ & &x 0
JJ " "4 .'0DJJ t $I7 .>
9 *
++AKKC
akk*
s C;;
EAE
Ec ^ ^ [ R " S U 5 S U 5 5 nU Vs1 s H nT R R U5 iM nn[ T R
5 S: GaJ T R
S SnU( d T R
R
5 nUR R 5 u pxT R R U5 V s1 s H n T R R U 5 iM n
n U
R U5 ( + nU( d M WR R 5 V V s/ s H u pU [! U R" 5 4PM sn n mTR% WW/45 UU 4S jn
T R' 5 U
" 5 nU( a g[ T R
5 S: a GMJ gs snf ! [ [ 4 a [ U5 ef = fs sn f s sn n f )ar Perform backjumping.
When we enter here, the stack is like this::
[ state Z ]
[ state Y ]
[ state X ]
.... earlier states are irrelevant.
1. No pins worked for Z, so it does not have a pin.
2. We want to reset state Y to unpinned, and pin another candidate.
3. State X holds what state Y was before the pin, but does not
have the incompatibility information gathered in state Y.
Each iteration of the loop will:
1. Identify Z. The incompatibility is not always caused by the latest
state. For example, given three requirements A, B and C, with
dependencies A1, B1 and C1, where A1 and B1 are incompatible: the
last state might be related to C, so we want to discard the
previous state.
2. Discard Z.
3. Discard Y but remember its incompatibility information gathered
previously, and the failure we're dealing with right now.
4. Push a new state Y' based on X, and apply the incompatibility
information from Y to Y'.
5a. If this causes Y' to conflict, we need to backtrack again. Make Y'
the new Z and go back to step 2.
5b. If the incompatibilities apply cleanly, end backtracking.
c 3 V # U H oR c M UR v M! g 7fr r[ r( cs r r* 'Resolution._backjump... s >v!XQXXvs ))c 3 8 # U H oR v M g 7fr rS r s r r* r / s +Fq]]Fr- r} Fc T > T GH u pU( d M TR R U nTR R U [ TR R [ R " S5 5 [ TR R [ R " S5 X05 S9n[ U5 nU( d gUR UR 5 [ U[ UR 5 US9TR R U ' GM g! [ a GM" f = f)Nr0 rH r FrE T)r~ r r rv r r r r r r extendrH rB r rG )krH r r rF incompatibilities_from_brokenr s r _patch_criteria-Resolution._backjump.._patch_criteriaQ s
,I(A, !$(JJ$7$7$: #gg 2 2#$%4 JJ / / $ 1 12D E& +: JJ / / $ / /0C D 2+
3 G "1!9J% $%,,Y-H-HI-6#-$()>)>$?*;.DJJ''*/ -J8 / $ ! !s D
D'&D'T) itertoolschainrv r lenrx r r popitemr r rc r
isdisjointr r r rH r r )r rf incompatible_reqsr) incompatible_depsincompatible_state broken_stater r; dcurrent_dependenciesr vr successr s ` @r _backjumpResolution._backjump s > &OO >v > +F +
;L L:KQTWW - -a 0:K L$,, 1$ R "' (7#'<<#3#3#5L&2&:&:&B&B&DOD
"WW 5 5i @( @ GG$$Q' @ % ( *>)H)H%* &" )(" ) 1 1 7 7 9- 9DA D,,-. 9- )
* 0 0$ 1D E
>
"%'G G $,, 1$R U M #H- 7.v667(-s %F86F= %G :#G!= Gc U R ( a [ S5 eU R R 5 [ [
R " 5 0 / S9/U l U H) n U R U R R US S9 M+ U R 5 [ U5 GHH nU R R! US9 U R R R# 5 VVs/ s H u pgU R% Xg5 ( a M UPM! nnnU( d1 U R R' U R S9 U R s $ [) U R R R+ 5 5 [) U5 -
n [- XR. S9n
U R1 U
5 n U ( a U V V
s/ s H oR H oPM M nn n
U R R3 US9 U R5 U5 nXR R6 S S & U( d [ U R R6 5 eOU R R R# 5 VVs1 s H& u pgXi; d M U R% Xg5 ( a M$ UiM( nnnU R9 U R R U5 U R 5 U R R; XPR S9 GMK [= U5 e! [ a$ n[ UR R 5 eS nAff = fs snnf s sn
n f s snnf ) Nzalready resolvedr r[ )index)r~ )r rh )r r~ ) rx RuntimeErrorrw startingrp collections OrderedDictr r~ r r rc r rG r rangestarting_roundr r endingsetkeysminr r resolving_conflictsr r r ending_roundrk )r rN
max_roundsr) r round_indexr r unsatisfied_namessatisfied_namesr failure_causesr rU rf r newly_unsatisfied_namess r resolveResolution.resolve} s << 12 2
#//1!#
A
D%%djj&9&91T%J
,K GG " " " 5 '+jj&9&9&?&?&A!&ANC66sF &A
! %TZZ0zz! "$**"5"5":":"< =!A O
(.B.BCD ! ; ;D AN %3K^]]!]!^K ++6+: ..017
++A. .tzz/J/JKK +/***=*=*C*C*E+*E- ! ; ;C K *E ( + 66JJ'')@ $$& GG {** Ec -f
++w *
D*1;;+B+BCC
D!* L+s< !%K=) L. L.3 L4$ L:3L: L:=
L+ L&&L+ru N)r r r r r r propertyr~ r r r r r r r r r r r r r rr rr i sR
* * # %)N2
#Jm^L,r rr c X; a gX; a gX R 5 HN n U[ U5 nXS; a UR U5 g[ XX#5 ( d M= UR U5 g g! [ a M` f = f)NTF)r] idr add_has_route_to_root)r r all_keys connectedppkeys r r r s
]
&
&
( BqE?D MM# hh B B MM# ) s A22
B ?B Resultzmapping graph criteriac U R nUR 5 VVs0 s H u p#[ U5 U_M nnnS U[ S 5 ' [ 5 nUR S 5 S 1nU R
R 5 H u px[
U R
XtU5 ( d M# Xu; a UR U5 UR 5 H9 n U[ U 5 n
X; a UR U
5 UR X5 M; M [ UR 5 VVs0 s H u p#X&; d M X#_M snnUU R
S9$ s snnf ! [ a M f = fs snnf )N)r graphr ) r r r r r r r r] r connectr ) r~ r r r r r r r r r r s r
_build_resultr s3 mmG%,]]_5_TQ1q_H5 HRX OE IIdOI ....0!%..#KK IIcN&&(A
1 $ MM$ $ ) 1 ")--/D/$!Q^/D + 6
Es# E
E# E!
2E!
E E c & \ rS rSrSr\rSS jrSrg)Resolveri z3The thing that performs the actual resolution work.c v [ U R U R 5 nUR XS9n[ U5 $ )af Take a collection of constraints, spit out the resolution result.
The return value is a representation to the final resolution result. It
is a tuple subclass with three public members:
* `mapping`: A dict of resolved candidates. Each key is an identifier
of a requirement (as returned by the provider's `identify` method),
and the value is the resolved candidate.
* `graph`: A `DirectedGraph` instance representing the dependency tree.
The vertices are keys of `mapping`, and each edge represents *why*
a particular package is included. A special vertex `None` is
included to represent parents of user-supplied requirements.
* `criteria`: A dict of "criteria" that hold detailed information on
how edges in the graph are derived. Each key is an identifier of a
requirement, and the value is a `Criterion` instance.
The following exceptions may be raised if a resolution cannot be found:
* `ResolutionImpossible`: A resolution cannot be found for the given
combination of requirements. The `causes` attribute of the
exception is a list of (requirement, parent), giving the
requirements that could not be satisfied.
* `ResolutionTooDeep`: The dependency tree is too deeply nested and
the resolver gave up. This is usually caused by a circular
dependency, but you can try to resolve this by increasing the
`max_rounds` argument.
)r )rr ry rz r r )r rN r
resolutionr~ s r r Resolver.resolve s6 8
t}}=
""<"G U##r r N)d ) r r r r r r base_exceptionr r r r r r r s =&N $r r )r r r providersr structsr r r
namedtupler Exceptionr r r8 objectrB r` rc rk rp rr r r r r r r r r s ' D D$// }h 7
.
-
$4 $4N ' ? ' ' w(KL`, `,F &
*B C<#$ #$r