g6]] L 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 Zer6dd 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 Zd d Z e Z dS ) ) annotationsN)
namedtuple)
TYPE_CHECKINGCallableGenericIterableIteratorMapping
NamedTupleSequenceTypeVarUnionKTRTCT ) Criterionc $ e Zd ZU ded< ded< dS )RequirementInformationr requirementz CT | NoneparentN)__name__
__module__ __qualname____annotations__ p/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/pip/_vendor/resolvelib/structs.pyr r s' r r c 2 e Zd ZU dZded< ded< ded< dS ) 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 r e Zd ZdZddZddZd dZd d Zd dZd dZ d dZ
d dZ d!dZ d"dZ
d#dZd#dZdS )$
DirectedGraphz&A graph structure with directed edges.returnNonec H t | _ i | _ i | _ d S N)set _vertices _forwards
_backwardsselfs r __init__zDirectedGraph.__init__0 s "%%%,.-/r Iterator[KT]c * t | j S r* )iterr, r/ s r __iter__zDirectedGraph.__iter__5 DN###r intc * t | j S r* )lenr, r/ s r __len__zDirectedGraph.__len__8 s 4>"""r keyr boolc || j v S r* )r, r0 r; s r __contains__zDirectedGraph.__contains__; s dn$$r DirectedGraph[KT]c t | }t | j |_ d | j D |_ d | j D |_ |S )z$Return a shallow copy of this graph.c 4 i | ]\ }}|t | S r r+ .0kvs r
z&DirectedGraph.copy..B s$ HHHA1c!ffHHHr c 4 i | ]\ }}|t | S r rC rD s r rH z&DirectedGraph.copy..C s$ JJJ$!QAs1vvJJJr )typer+ r, r- itemsr. )r0 others r copyzDirectedGraph.copy> sp T
dn--HH 1E1E1G1GHHHJJ$/2G2G2I2IJJJ r c || j v rt d | j | t | j |< t | j |< dS )z Add a new vertex to the graph.z
vertex existsN)r,
ValueErroraddr+ r- r. r> s r rP zDirectedGraph.addF sY $. _-- - 3 !ees "uu r c . | j | | j | D ]"}| j | | #| j | D ]"}| j | | #dS )zCRemove a vertex from the graph, disconnecting all edges from/to it.N)r, remover- popr. )r0 r; fts r rR zDirectedGraph.removeN s c""" ##C(( + +A OA % %c * * * * $$S)) * *A N1 $ $S ) ) ) ) * *r rT rU c > || j | v o|| j | v S r* )r. r- r0 rT rU s r connectedzDirectedGraph.connectedV s% DOA&&A1q0A+AAr c || j vrt | | j | | | j | | dS )zgConnect two existing vertices.
Nothing happens if the vertices are already connected.
N)r, KeyErrorr- rP r. rW s r connectzDirectedGraph.connectY sY
DN " "1++ q a q!!!!!r Iterator[tuple[KT, KT]]c # ^ K | j D ]\ }}|D ]}||fV d S r* )r- rK )r0 rT childrenrU s r
iter_edgeszDirectedGraph.iter_edgesc sT >//11 KAx
d
r c 6 t | j | S r* )r4 r- r> s r
iter_childrenzDirectedGraph.iter_childrenh s DN3'(((r c 6 t | j | S r* )r4 r. r> s r iter_parentszDirectedGraph.iter_parentsk s DOC()))r N)r' r( r' r2 r' r7 )r; r r' r< )r' r@ )r; r r' r( )rT r rU r r' r< )rT r rU r r' r( )r' r\ )r; r r' r2 )r r r r$ r1 r5 r: r? rM rP rR rX r[ r_ ra rc r r r r& r& - s 000 0 0 0
$ $ $ $# # # #% % % % % % % %* * * *B B B B" " " "
) ) ) )* * * * * *r r& c J e Zd Z ddd
Zd d Zd dZd dZd dZd dZd!dZ dS )"IteratorMappingNr! Mapping[KT, RT]accessor Callable[[RT], Iterable[CT]]appends Mapping[KT, Iterable[CT]] | Noner' r( c 4 || _ || _ |pi | _ d S r* )_mapping _accessor_appends)r0 r! ri rk s r r1 zIteratorMapping.__init__p s!
!3:=b
r strc N d | j | j | j S )Nz!IteratorMapping({!r}, {!r}, {!r}))formatrn ro rp r/ s r __repr__zIteratorMapping.__repr__z s) 299 M N M
r r< c 8 t | j p| j S r* )r< rn rp r/ s r __bool__zIteratorMapping.__bool__ s DM2T]333r r; objectc & || j v p|| j v S r* )rn rp r> s r r? z IteratorMapping.__contains__ s dm#;sdm';;r rF r Iterator[CT]c | j | }n*# t $ r t | j | cY S w xY wt j | | | j |d S )Nr )rn rZ r4 rp itertoolschainro get)r0 rF rG s r __getitem__zIteratorMapping.__getitem__ s{ *
a AA * * *
a()) ) ) ) *t~~a 0 0$-2C2CAr2J2JKKKs
$77r2 c ^ fd j D }t j j | S )Nc 3 . K | ]}|j v |V d S r* rn rE rF r0 s r z+IteratorMapping.__iter__.. s/ CCaAT],B,B,B,B,B,BCCr )rp r{ r| rn r0 mores ` r r5 zIteratorMapping.__iter__ s2 CCCC4=CCCt}d333r r7 c r t fd j D }t j |z S )Nc 3 . K | ]}|j v d V dS )r Nr r s r r z*IteratorMapping.__len__.. s/ FFq
/E/E1/E/E/E/EFFr )sumrp r9 rn r s ` r r: zIteratorMapping.__len__ s< FFFFdmFFFFF4=!!D((r r* )r! rh ri rj rk rl r' r( r' rq r' r< )r; rw r' r< )rF r r' ry rd re )
r r r r1 rt rv r? r~ r5 r: r r r rg rg o s
59 A A A A A
4 4 4 4< < < <L L L L4 4 4 4) ) ) ) ) )r rg c 2 e Zd ZdZddZddZdd
Zdd Zd
S )_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.
factoryCallable[[], Iterable[RT]]r' r( c " || _ d | _ d S r* )_factory _iterable)r0 r s r r1 z _FactoryIterableView.__init__ s
.2r rq c P t | j dt | dS N())rJ r listr/ s r rt z _FactoryIterableView.__repr__ s( t**%55T
5555r r< c d t t | n# t $ r Y dS w xY wdS )NFT)nextr4
StopIterationr/ s r rv z _FactoryIterableView.__bool__ sE d 55 ts
-- Iterator[RT]c | j | n| j }t j | \ | _ }|S r* )r r r{ tee)r0 iterablecurrents r r5 z _FactoryIterableView.__iter__ s7 &*n&<4==???$."+-"9"9 r N)r r r' r( r r r' r r r r r$ r1 rt rv r5 r r r r r sn 3 3 3 36 6 6 6 r r c 2 e Zd ZdZd
dZddZdd Zdd Zd S )_SequenceIterableViewzWrap an iterable returned by find_matches().
This is essentially just a proxy to the underlying sequence that provides
the same interface as `_FactoryIterableView`.
sequence Sequence[RT]c || _ d S r* ) _sequence)r0 r s r r1 z _SequenceIterableView.__init__ s
!r r' rq c @ t | j d| j dS r )rJ r r r/ s r rt z _SequenceIterableView.__repr__ s$ t**%999999r r< c * t | j S r* )r< r r/ s r rv z _SequenceIterableView.__bool__ r6 r r c * t | j S r* )r4 r r/ s r r5 z _SequenceIterableView.__iter__ r6 r N)r r r r r r r r r r r sn " " " ": : : :$ $ $ $$ $ $ $ $ $r r matches Matches[CT]r' Iterable[CT]c t | rt | S t | t st | } t | S )zCBuild an iterable view from the value returned by `find_matches()`.)callabler
isinstancer r r )r s r build_iter_viewr sK -#G,,, gx ( ( w-- ) ))r )r r r' r )
__future__r r{ collectionsr typingr r r r r r
r r r
r r r r Matchesresolvers.criterionr r r r& rg r r r IterableViewr r r r s " " " " " " " " " " " "
WT]] WT]] WT]]
hr8B<'7 88
9 M...... WRV_ ? ? ? ? ?
GBBJ / ? ? ? ? (Z =(";
Jw K K K L LE?* ?* ?* ?* ?*GBK ?* ?* ?*D%) %) %) %) %)gb(2, ./R1D %) %) %)P 8B< :$ $ $ $ $HRL $ $ $(* * * * r