Ë
|
ñúh ã óÀ d dl mZ d dlZd dlmZ d dlmZmZmZm Z m
|
Z
|
m Z m Z m Z mZmZ ed« Z ed« Z ed« Zee e eg e e f f Zer*dd lmZ G d
|
d e eeef « Z G d d e eeeef « Zn ed ddg« Z ed g d¢« Z G d dee « Z G d de ee
|
e f eeeef « Z G d de e « Z G d de e « ZddZ e Z y)é )Ú annotationsN)Ú
|
namedtuple)
|
Ú TYPE_CHECKINGÚCallableÚGenericÚIterableÚIteratorÚMappingÚ
|
NamedTupleÚSequenceÚTypeVarÚUnionÚKTÚRTÚCTé )Ú Criterionc ó" e Zd ZU ded< ded< y)ÚRequirementInformationr Ú requirementz CT | NoneÚparentN)Ú__name__Ú
|
__module__Ú __qualname__Ú__annotations__© ó úQH:\Change_password\venv_build\Lib\site-packages\pip/_vendor/resolvelib/structs.pyr r s
ØØÔr r c ó0 e Zd ZU dZded< ded< ded< y) ÚStatez Resolution state in a round.z dict[KT, CT]Úmappingzdict[KT, Criterion[RT, CT]]Úcriteriaz$list[RequirementInformation[RT, CT]]Úbacktrack_causesN)r r r Ú__doc__r r r r r r s
Ù*à Ó Ø-Ó-Ø>Ô>r r r r )r! r" r# c óp e Zd ZdZddZddZddZddZddZddZ ddZ
|
dd Z dd
|
Z dd Z dd Zdd Zy)Ú DirectedGraphz&A graph structure with directed edges.c ó> t « | _ i | _ i | _ y ©N)ÚsetÚ _verticesÚ _forwardsÚ
|
_backwards©Úselfs r Ú__init__zDirectedGraph.__init__0 s Ü"%£%Ø,.Ø-/r c ó, t | j « S r( )Úiterr* r- s r Ú__iter__zDirectedGraph.__iter__5 ó ÜDNNÓ#Ð#r c ó, t | j « S r( )Úlenr* r- s r Ú__len__zDirectedGraph.__len__8 s Ü4>>Ó"Ð"r c ó || j v S r( )r* ©r. Úkeys r Ú __contains__zDirectedGraph.__contains__; s ØdnnÐ$Ð$r c ób t | « « }t | j « |_ | j j « D ci c] \ }}|t |« c}}|_ | j
|
j « D ci c] \ }}|t |« c}}|_ |S c c}}w c c}}w )z$Return a shallow copy of this graph.)Útyper) r* r+ Úitemsr, )r. ÚotherÚkÚvs r ÚcopyzDirectedGraph.copy> s àT
|
Ü dnnÓ-Ø15· ± ×1EÑ1EÓ1G×H©¨¨A1c !f9ÓHØ26·/±/×2GÑ2GÓ2I×J©$¨!¨QAs 1vIÓJÔØ ùó IùÛJs ÁB%ÂB+c óÈ || j v r t d« | j j |« t « | j |< t « | j
|
|< y)z Add a new vertex to the graph.z vertex existsN)r* Ú
|
ValueErrorÚaddr) r+ r, r8 s r rD zDirectedGraph.addF sK à $..Ñ Ü _Ó-Ð -Ø ×Ñ3Ô Ü !esÑÜ "uÒ r c ó2 | j j |« | j j |« D ] }| j | j |« " | j j |« D ] }| j | j |« " y)zCRemove a vertex from the graph, disconnecting all edges from/to it.N)r* Úremover+ Úpopr, )r. r9 ÚfÚts r rF zDirectedGraph.removeN s~ à × Ñ cÔ"Ø ×#Ñ# CÓ(ò +AØ OOAÑ × %Ñ % cÕ *ð +à ×$Ñ$ SÓ)ò *AØ NN1Ñ × $Ñ $ SÕ )ñ *r c óJ || j | v xr || j | v S r( )r, r+ ©r. rH rI s r Ú connectedzDirectedGraph.connectedV s) ØDOO AÑ&Ð&ÒA¨1°·±¸qÑ0AÐ+AÐAr c ó® || j vr t |« | j | j |« | j | j |« y)zgConnect two existing vertices.
|
|
Nothing happens if the vertices are already connected.
|
N)r* ÚKeyErrorr+ rD r, rK s r ÚconnectzDirectedGraph.connectY sH ð
|
DNNÑ "Ü1+Ð Ø qÑ× Ñ aÔ Ø Ñ× Ñ qÕ!r c # ój K | j j « D ] \ }}|D ] }||f
|
y wr( )r+ r= )r. rH ÚchildrenrI s r Ú
|
iter_edgeszDirectedGraph.iter_edgesc s> è ø Ø >>×/Ñ/Ó1ò KAxØ ò Ød
|
ñ ñ ùs 13c ó2 t | j | « S r( )r1 r+ r8 s r Ú iter_childrenzDirectedGraph.iter_childrenh s ÜDNN 3Ñ'Ó(Ð(r c ó2 t | j | « S r( )r1 r, r8 s r Ú iter_parentszDirectedGraph.iter_parentsk s ÜDOO CÑ(Ó)Ð)r N)ÚreturnÚNone©rW ú Iterator[KT]©rW Úint)r9 r rW Úbool)rW zDirectedGraph[KT])r9 r rW rX )rH r rI r rW r] )rH r rI r rW rX )rW zIterator[tuple[KT, KT]])r9 r rW rZ )r r r r$ r/ r2 r6 r: rA rD rF rL rO rR rT rV r r r r& r& - sB Ù0ó0ó
|
$ó#ó%óó%ó*óBó"óó
|
)ô*r r& c óV e Zd Z d d
|
dZd dZd dZd dZddZddZddZ y)ÚIteratorMappingNc ó6 || _ || _ |xs i | _ y r( )Ú_mappingÚ _accessorÚ_appends)r. r! ÚaccessorÚappendss r r/ zIteratorMapping.__init__p s ð Ø!Ø3:²=¸b r c ód dj | j | j | j « S )Nz!IteratorMapping({!r}, {!r}, {!r}))Úformatra rb rc r- s r Ú__repr__zIteratorMapping.__repr__z s* Ø2×9Ñ9Ø MMØ NNØ MMó
|
ð
|
r c óH t | j xs | j « S r( )r] ra rc r- s r Ú__bool__zIteratorMapping.__bool__ s ÜDMMÒ2 T§]¡]Ó3Ð3r c ó> || j v xs || j v S r( )ra rc r8 s r r: z IteratorMapping.__contains__ s ØdmmÐ#Ò; s¨d¯m©mÐ';Ð;r c óî | j | }t j
|
| j |« | j j |d« « S # t $ r t | j | « cY S w xY w)Nr )ra rN r1 rc Ú itertoolsÚchainrb Úget)r. r? r@ s r Ú __getitem__zIteratorMapping.__getitem__ sg ð *Ø aÑ Aô t~~¨aÓ 0°$·-±-×2CÑ2CÀAÀrÓ2JÓKÐKøô ò *Ü aÑ(Ó)Ò )ð *ús A Á!A4Á3A4c ón fd j D « }t j j |« S )Nc 3 ó@ K | ] }|j vs| y wr( ©ra ©Ú.0r? r. s r ú <genexpr>z+IteratorMapping.__iter__.<locals>.<genexpr> s øè ø ÒCa¨A°T·]±]Ò,BÑCùó )rc rm rn ra ©r. Úmores ` r r2 zIteratorMapping.__iter__ s& ø ÛC4==ÔCÜt}}¨dÓ3Ð3r c óp t fd j D « « }t j « |z S )Nc 3 ó@ K | ] }|j vsd yw)r Nrs rt s r rv z*IteratorMapping.__len__.<locals>.<genexpr> s øè ø ÒF¨q¸¿ ¹ Ò/E1ÑFùrw )Úsumrc r5 ra rx s ` r r6 zIteratorMapping.__len__ s+ ø ÜÓFdmmÔFÓFÜ4==Ó! DÑ(Ð(r r( )r! zMapping[KT, RT]rd z Callable[[RT], Iterable[CT]]re z Mapping[KT, Iterable[CT]] | NonerW rX ©rW Ústr©rW r] )r9 ÚobjectrW r] )r? r rW z Iterator[CT]rY r[ )
|
r r r r/ rh rj r: rp r2 r6 r r r r_ r_ o sV ð
|
59ð Aà ðAð /ðAð 2ð Að
|
|
ó Aó
|
ó4ó<óLó4ô)r r_ c ó0 e Zd ZdZddZddZd dZd
|
dZy) Ú_FactoryIterableViewa: Wrap an iterator factory returned by `find_matches()`.
|
|
Calling `iter()` on this class would invoke the underlying iterator
|
factory, making it a "collection with ordering" that can be iterated
|
through multiple times, but lacks random access methods presented in
|
built-in Python sequence types.
|
c ó || _ d | _ y r( )Ú_factoryÚ _iterable)r. Úfactorys r r/ z _FactoryIterableView.__init__ s Ø Ø.2r c óJ t | « j dt | « dS ©Nú(ú))r< r Úlistr- s r rh z _FactoryIterableView.__repr__¤ s$ Üt*×%Ñ%Ð& a¬¨T«
|
|°1Ð5Ð5r c óL t t | « « y# t $ r Y yw xY w)NFT)Únextr1 Ú StopIterationr- s r rj z _FactoryIterableView.__bool__§ s, ð Ü dÔ ð øô ò Ùð ús #¢#c ó | j | j « n | j }t j |« \ | _ }|S r( )r
r rm Útee)r. ÚiterableÚcurrents r r2 z _FactoryIterableView.__iter__® s6 Ø&*§n¡nÐ&<4==?À$Ç.Á.Ü"+§-¡-°Ó"9Ñ Ør N)r zCallable[[], Iterable[RT]]rW rX r} r ©rW z Iterator[RT]©r r r r$ r/ rh rj r2 r r r r r s ñó3ó6óôr r c ó0 e Zd ZdZddZddZd dZd
|
dZy) Ú_SequenceIterableViewz²Wrap an iterable returned by find_matches().
|
|
This is essentially just a proxy to the underlying sequence that provides
|
the same interface as `_FactoryIterableView`.
|
c ó || _ y r( )Ú _sequence)r. Úsequences r r/ z _SequenceIterableView.__init__» s Ø!r c óL t | « j d| j dS r )r< r r r- s r rh z _SequenceIterableView.__repr__¾ s% Üt*×%Ñ%Ð& a¨¯©Ð'7°qÐ9Ð9r c ó, t | j « S r( )r] r r- s r rj z _SequenceIterableView.__bool__Á r3 r c ó, t | j « S r( )r1 r r- s r r2 z _SequenceIterableView.__iter__Ä r3 r N)r z Sequence[RT]r} r r r r r r r r ´ s ñó "ó:ó$ô$r r c óz t | « r t | « S t | t « s t | « } t | « S )zCBuild an iterable view from the value returned by `find_matches()`.)Úcallabler Ú
|
isinstancer r r )Úmatchess r Úbuild_iter_viewr¡ È s3 äÔÜ# GÓ,Ð,Ü gxÔ (Üw-Ü Ó )Ð)r )r z Matches[CT]rW z Iterable[CT]) Ú
|
__future__r rm Ú collectionsr Útypingr r r r r r
|
r r r r r r r ÚMatchesÚresolvers.criterionr r r r& r_ r r r¡ Ú IterableViewr r r ú<module>r¨ s ðÝ "ã Ý "÷ ÷ ÷ ñ T]Ù T]Ù T]à
|
h r¨8°B©<Ð'7Ñ 8Ð8Ñ
|
9áÝ.ô ¨W°R¸°V©_ô ô?
|
G B¨¨B JÑ /õ ?ñ (Ø =°(Ð";ó Ðñ wÒ KÓ LEô?*GBKô ?*ôD%)gb (¨2¡,Ð .Ñ/°¸¸RÀ¸Ñ1Dô %)ôP8 B<ô ô:$H RLô $ó(*ð r
|
