Nsw d dl Z ddlmZ G d de Z G d dej Z G d d e Z G d
d e Zd Z dS )
N )collections_abcc Z e Zd ZdZd Zd Zd Zd Zd Zd Z d Z
d Z d
Z d Z
d Zd
ZdS )
DirectedGraphz&A graph structure with directed edges.c H t | _ i | _ i | _ d S N)set _vertices _forwards
_backwardsselfs /builddir/build/BUILDROOT/alt-python311-pip-21.3.1-4.el9.x86_64/opt/alt/python311/lib/python3.11/site-packages/pip/_vendor/resolvelib/structs.py__init__zDirectedGraph.__init__ s c * t | j S r )iterr
r
s r __iter__zDirectedGraph.__iter__ DN###r c * t | j S r )lenr
r
s r __len__zDirectedGraph.__len__ s 4>"""r c || j v S r )r
r keys r __contains__zDirectedGraph.__contains__ s dn$$r 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 .0kvs r
z&DirectedGraph.copy.. s$ HHHA1c!ffHHHr c 4 i | ]\ }}|t | S r r r! s r r% z&DirectedGraph.copy.. s$ JJJ$!QAs1vvJJJr )r r r
r itemsr )r others r copyzDirectedGraph.copy sh 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 r, zDirectedGraph.add 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 )r r fts r r. zDirectedGraph.remove' s c""" ##C(( + +A OA % %c * * * * $$S)) * *A N1 $ $S ) ) ) ) * *r c > || j | v o|| j | v S r )r r r r0 r1 s r connectedzDirectedGraph.connected/ 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 r, r r3 s r connectzDirectedGraph.connect2 sY
DN " "1++ q a q!!!!!r c # ^ K | j D ]\ }}|D ]}||fV d S r )r r' )r r0 childrenr1 s r
iter_edgeszDirectedGraph.iter_edges< sT >//11 KAx
d
r c 6 t | j | S r )r r r s r
iter_childrenzDirectedGraph.iter_childrenA s DN3'(((r c 6 t | j | S r )r r r s r iter_parentszDirectedGraph.iter_parentsD s DOC()))r N)__name__
__module__ __qualname____doc__r r r r r) r, r. r4 r7 r: r< r> r r r r r s 00
$ $ $# # #% % % % % %* * *B B B" " "
) ) )* * * * *r r c > e Zd Zd dZd Zd ZeZd Zd Zd Z d Z
dS )
IteratorMappingNc 4 || _ || _ |pi | _ d S r )_mapping _accessor_appends)r mappingaccessorappendss r r zIteratorMapping.__init__I s
!
2
r c N d | j | j | j S )Nz!IteratorMapping({!r}, {!r}, {!r}))formatrF rG rH r
s r __repr__zIteratorMapping.__repr__N s) 299 M N M
r c 8 t | j p| j S r )boolrF rH r
s r __bool__zIteratorMapping.__bool__U s DM2T]333r c & || j v p|| j v S r )rF rH r s r r z IteratorMapping.__contains__Z s dm#;sdm';;r c | j | }n*# t $ r t | j | cY S w xY wt j | | | j |d S )Nr )rF r6 r rH itertoolschainrG get)r r# r$ s r __getitem__zIteratorMapping.__getitem__] s{ *
a AA * * *
a()) ) ) ) *t~~a 0 0$-2C2CAr2J2JKKKs
$77c ^ fd j D }t j j | S )Nc 3 . K | ]}|j v |V d S r rF r" r# r s r z+IteratorMapping.__iter__..e s/ CCaAT],B,B,B,B,B,BCCr )rH rT rU rF r mores ` r r zIteratorMapping.__iter__d s2 CCCC4=CCCt}d333r c r t fd j D }t j |z S )Nc 3 . K | ]}|j v d V dS )r NrZ r[ s r r\ z*IteratorMapping.__len__..i s/ FFq
/E/E1/E/E/E/EFFr )sumrH r rF r] s ` r r zIteratorMapping.__len__h s< FFFFdmFFFFF4=!!D((r r ) r? r@ rA r rN rQ __nonzero__r rW r r r r r rD rD H s & & & &
4 4 4 K< < <L L L4 4 4) ) ) ) )r rD c . e Zd ZdZd Zd Zd ZeZd ZdS )_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 S r _factory)r factorys r r z _FactoryIterableView.__init__v s
r c d t | j t | S Nz{}({}))rM typer? listrg r
s r rN z _FactoryIterableView.__repr__y s/ tDzz 2D 4I4IJJJr c n t | n# t $ r Y dS w xY wdS )NFT)nextrg
StopIterationr
s r rQ z _FactoryIterableView.__bool__| sG ! ! ! ! 55 ts !$
22c * | S r rf r
s r r z _FactoryIterableView.__iter__ s }} r N r? r@ rA rB r rN rQ rb r r r r rd rd m sd K K K K r rd c . e Zd ZdZd Zd Zd ZeZd ZdS )_SequenceIterableViewzWrap an iterable returned by find_matches().
This is essentially just a proxy to the underlying sequence that provides
the same interface as `_FactoryIterableView`.
c || _ d S r ) _sequence)r sequences r r z _SequenceIterableView.__init__ s
!r c \ d t | j | j S rj )rM rk r? ru r
s r rN z _SequenceIterableView.__repr__ s! tDzz 2DNCCCr c * t | j S r )rP ru r
s r rQ z _SequenceIterableView.__bool__ r r c * t | j S r )r ru r
s r r z _SequenceIterableView.__iter__ r r Nrq r r r rs rs sd " " "D D D$ $ $ K$ $ $ $ $r rs c t | rt | S t | t j st | } t
| S )zCBuild an iterable view from the value returned by `find_matches()`.)callablerd
isinstancer Sequencerl rs )matchess r build_iter_viewr sN -#G,,, g 7 8 8 w-- ) ))r )
rT compatr objectr MappingrD rd rs r r r r r s # # # # # #?* ?* ?* ?* ?*F ?* ?* ?*D") ") ") ") ")o- ") ") ")J 6 8$ $ $ $ $F $ $ $,* * * * *r