a ˆljºã@sbddlZddlmZGdd„deƒZGdd„dejƒZGdd „d eƒZGd d„deƒZdd „Z dS)éNé)Úcollections_abcc@speZdZdZdd„Zdd„Zdd„Zdd „Zd d„Zdd „Z dd„Z dd„Zdd„Zdd„Z dd„Zdd„ZdS)Ú DirectedGraphz&A graph structure with directed edges.cCstƒ|_i|_i|_dS©N)ÚsetÚ _verticesÚ _forwardsÚ _backwards©Úself©rúB/usr/lib/python3.9/site-packages/pip/_vendor/resolvelib/structs.pyÚ__init__ szDirectedGraph.__init__cCs t|jƒSr)Úiterrr rrr Ú__iter__szDirectedGraph.__iter__cCs t|jƒSr)Úlenrr rrr Ú__len__szDirectedGraph.__len__cCs ||jvSr)r©rÚkeyrrr Ú__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Úvrrr Ú óz&DirectedGraph.copy..cSsi|]\}}|t|ƒ“qSrrrrrr rr)rrrrÚitemsr )rÚotherrrr Úcopys zDirectedGraph.copycCs:||jvrtdƒ‚|j |¡tƒ|j|<tƒ|j|<dS)zAdd a new vertex to the graph.z vertex existsN)rÚ ValueErrorÚaddrrr rrrr r!s zDirectedGraph.addcCsT|j |¡|j |¡D]}|j| |¡q|j |¡D]}|j| |¡q:dS)zCRemove a vertex from the graph, disconnecting all edges from/to it.N)rÚremoverÚpopr )rrÚfÚtrrr r"'s zDirectedGraph.removecCs||j|vo||j|vSr)r r©rr$r%rrr Ú connected/szDirectedGraph.connectedcCs6||jvrt|ƒ‚|j| |¡|j| |¡dS)zgConnect two existing vertices. Nothing happens if the vertices are already connected. N)rÚKeyErrorrr!r r&rrr Úconnect2s zDirectedGraph.connectccs,|j ¡D]\}}|D]}||fVqq dSr)rr)rr$Zchildrenr%rrr Ú iter_edges<szDirectedGraph.iter_edgescCst|j|ƒSr)rrrrrr Ú iter_childrenAszDirectedGraph.iter_childrencCst|j|ƒSr)rr rrrr Úiter_parentsDszDirectedGraph.iter_parentsN)Ú__name__Ú __module__Ú__qualname__Ú__doc__rrrrrr!r"r'r)r*r+r,rrrr rs rc@sJeZdZddd„Zdd„Zdd„ZeZdd „Zd d„Zdd „Z dd„Z dS)ÚIteratorMappingNcCs||_||_|pi|_dSr)Ú_mappingÚ _accessorÚ_appends)rÚmappingZaccessorZappendsrrr rIszIteratorMapping.__init__cCsd |j|j|j¡S)Nz!IteratorMapping({!r}, {!r}, {!r}))Úformatr2r3r4r rrr Ú__repr__Ns ýzIteratorMapping.__repr__cCst|jp|jƒSr)Úboolr2r4r rrr Ú__bool__UszIteratorMapping.__bool__cCs||jvp||jvSr)r2r4rrrr rZszIteratorMapping.__contains__cCsLz|j|}Wn ty.t|j|ƒYS0t | |¡|j |d¡¡S)Nr)r2r(rr4Ú itertoolsÚchainr3Úget)rrrrrr Ú__getitem__]s zIteratorMapping.__getitem__cs"‡fdd„ˆjDƒ}t ˆj|¡S)Nc3s|]}|ˆjvr|VqdSr©r2©rrr rr Ú erz+IteratorMapping.__iter__..)r4r:r;r2©rZmorerr r rdszIteratorMapping.__iter__cs&t‡fdd„ˆjDƒƒ}tˆjƒ|S)Nc3s|]}|ˆjvrdVqdS)rNr>r?r rr r@irz*IteratorMapping.__len__..)Úsumr4rr2rArr r rhszIteratorMapping.__len__)N)r-r.r/rr7r9Ú__nonzero__rr=rrrrrr r1Hs r1c@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 ||_dSr©Ú_factory)rÚfactoryrrr rvsz_FactoryIterableView.__init__cCsd t|ƒjt| ¡ƒ¡S©Nz{}({}))r6Útyper-ÚlistrFr rrr r7ysz_FactoryIterableView.__repr__cCs*zt| ¡ƒWnty$YdS0dS)NFT)ÚnextrFÚ StopIterationr rrr r9|s z_FactoryIterableView.__bool__cCs| ¡SrrEr rrr r…sz_FactoryIterableView.__iter__N© r-r.r/r0rr7r9rCrrrrr rDmsrDc@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 ||_dSr)Ú _sequence)rZsequencerrr rsz_SequenceIterableView.__init__cCsd t|ƒj|j¡SrH)r6rIr-rOr rrr r7“sz_SequenceIterableView.__repr__cCs t|jƒSr)r8rOr rrr r9–sz_SequenceIterableView.__bool__cCs t|jƒSr)rrOr rrr r›sz_SequenceIterableView.__iter__NrMrrrr rN‰srNcCs,t|ƒrt|ƒSt|tjƒs$t|ƒ}t|ƒS)zCBuild an iterable view from the value returned by `find_matches()`.)ÚcallablerDÚ isinstancerÚSequencerJrN)Úmatchesrrr Úbuild_iter_viewŸs rT) r:ÚcompatrÚobjectrÚMappingr1rDrNrTrrrr ÚsB%