B oºˆdcã@sbddlZddlmZGdd„deƒZGdd„dejƒZGdd „d eƒZGd d „d eƒZd d „Z dS)éNé)Úcollections_abcc@speZdZdZdd„Zdd„Zdd„Zdd „Zd d „Zd d „Z dd„Z dd„Z dd„Z dd„Z dd„Zdd„ZdS)Ú DirectedGraphz&A graph structure with directed edges.cCstƒ|_i|_i|_dS)N)ÚsetÚ _verticesÚ _forwardsÚ _backwards)Úself©r úP/var/www/html/venv/lib/python3.7/site-packages/pip/_vendor/resolvelib/structs.pyÚ__init__ szDirectedGraph.__init__cCs t|jƒS)N)Úiterr)r r r r Ú__iter__szDirectedGraph.__iter__cCs t|jƒS)N)Úlenr)r r r r Ú__len__szDirectedGraph.__len__cCs ||jkS)N)r)r Úkeyr r r Ú __contains__szDirectedGraph.__contains__cCsBtƒ}t|jƒ|_dd„|j ¡Dƒ|_dd„|j ¡Dƒ|_|S)z$Return a shallow copy of this graph.cSsi|]\}}t|ƒ|“qSr )r)Ú.0ÚkÚvr r r ú sz&DirectedGraph.copy..cSsi|]\}}t|ƒ|“qSr )r)rrrr r r rs)rrrrÚitemsr)r Úotherr r r Úcopys  zDirectedGraph.copycCs:||jkrtdƒ‚|j |¡tƒ|j|<tƒ|j|<dS)zAdd a new vertex to the graph.z vertex existsN)rÚ ValueErrorÚaddrrr)r rr r r rs    zDirectedGraph.addcCs\|j |¡x$|j |¡D]}|j| |¡qWx$|j |¡D]}|j| |¡q@WdS)zCRemove a vertex from the graph, disconnecting all edges from/to it.N)rÚremoverÚpopr)r rÚfÚtr r r r's  zDirectedGraph.removecCs||j|ko||j|kS)N)rr)r rrr r r Ú connected/szDirectedGraph.connectedcCs6||jkrt|ƒ‚|j| |¡|j| |¡dS)zgConnect two existing vertices. Nothing happens if the vertices are already connected. N)rÚKeyErrorrrr)r rrr r r Úconnect2s zDirectedGraph.connectccs4x.|j ¡D] \}}x|D]}||fVqWq WdS)N)rr)r rÚchildrenrr r r Ú iter_edges<s zDirectedGraph.iter_edgescCst|j|ƒS)N)r r)r rr r r Ú iter_childrenAszDirectedGraph.iter_childrencCst|j|ƒS)N)r r)r rr r r Ú iter_parentsDszDirectedGraph.iter_parentsN)Ú__name__Ú __module__Ú __qualname__Ú__doc__r rrrrrrr r"r$r%r&r r r r rs rc@sJeZdZddd„Zdd„Zdd„ZeZdd „Zd d „Zd d „Z dd„Z dS)ÚIteratorMappingNcCs||_||_|pi|_dS)N)Ú_mappingÚ _accessorÚ_appends)r ÚmappingÚaccessorÚappendsr r r r IszIteratorMapping.__init__cCsd |j|j|j¡S)Nz!IteratorMapping({!r}, {!r}, {!r}))Úformatr,r-r.)r r r r Ú__repr__NszIteratorMapping.__repr__cCst|jp |jƒS)N)Úboolr,r.)r r r r Ú__bool__UszIteratorMapping.__bool__cCs||jkp||jkS)N)r,r.)r rr r r rZszIteratorMapping.__contains__cCsJy|j|}Wntk r,t|j|ƒSXt | |¡|j |d¡¡S)Nr )r,r!r r.Ú itertoolsÚchainr-Úget)r rrr r r Ú __getitem__]s zIteratorMapping.__getitem__cs"‡fdd„ˆjDƒ}t ˆj|¡S)Nc3s|]}|ˆjkr|VqdS)N)r,)rr)r r r ú esz+IteratorMapping.__iter__..)r.r6r7r,)r Úmorer )r r rdszIteratorMapping.__iter__cs&t‡fdd„ˆjDƒƒ}tˆjƒ|S)Nc3s|]}|ˆjkrdVqdS)rN)r,)rr)r r r r:isz*IteratorMapping.__len__..)Úsumr.rr,)r r;r )r r rhszIteratorMapping.__len__)N) r'r(r)r r3r5Ú __nonzero__rr9rrr r r r r+Hs r+c@s4eZdZdZdd„Zdd„Zdd„ZeZdd „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. cCs||_d|_dS)N)Ú_factoryÚ _iterable)r Úfactoryr r r r vsz_FactoryIterableView.__init__cCsd t|ƒjt|ƒ¡S)Nz{}({}))r2Útyper'Úlist)r r r r r3zsz_FactoryIterableView.__repr__cCs*ytt|ƒƒWntk r$dSXdS)NFT)Únextr Ú StopIteration)r r r r r5}s z_FactoryIterableView.__bool__cCs,|jdkr| ¡n|j}t |¡\|_}|S)N)r@r?r6Útee)r ÚiterableÚcurrentr r r r†sz_FactoryIterableView.__iter__N) r'r(r)r*r r3r5r=rr r r r r>ms r>c@s4eZdZdZdd„Zdd„Zdd„ZeZdd „Zd S) Ú_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`. cCs ||_dS)N)Ú _sequence)r Úsequencer r r r •sz_SequenceIterableView.__init__cCsd t|ƒj|j¡S)Nz{}({}))r2rBr'rJ)r r r r r3˜sz_SequenceIterableView.__repr__cCs t|jƒS)N)r4rJ)r r r r r5›sz_SequenceIterableView.__bool__cCs t|jƒS)N)r rJ)r r r r r sz_SequenceIterableView.__iter__N) r'r(r)r*r r3r5r=rr r r r rIŽs rIcCs,t|ƒrt|ƒSt|tjƒs$t|ƒ}t|ƒS)zCBuild an iterable view from the value returned by `find_matches()`.)Úcallabler>Ú isinstancerÚSequencerCrI)Úmatchesr r r Úbuild_iter_view¤s  rP) r6ÚcompatrÚobjectrÚMappingr+r>rIrPr r r r Ús  B%!