🔐 Sid Gifari File Manager Pro
v8.0.5 | 2026-08-10 03:51:44 | PHP 8.2.33
📂
/ (Root)
/
opt
/
alt
/
python38
/
lib
/
python3.8
/
site-packages
/
pip
/
_vendor
/
resolvelib
/
__pycache__
📍 /opt/alt/python38/lib/python3.8/site-packages/pip/_vendor/resolvelib/__pycache__
🔄 Refresh
✏️
Editing: structs.cpython-38.pyc
Read Only
U ʗRe� � @ sb d dl Z ddlmZ G dd� de�ZG dd� dej�ZG dd � d e�ZG d d � d e�Zd d � Z dS )� N� )�collections_abcc @ sp e Zd ZdZdd� 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.c C s t � | _i | _i | _d S �N)�set� _vertices� _forwards� _backwards��self� r ��/builddir/build/BUILDROOT/alt-python38-pip-22.2.1-2.el8.x86_64/opt/alt/python38/lib/python3.8/site-packages/pip/_vendor/resolvelib/structs.py�__init__ s zDirectedGraph.__init__c C s t | j�S r )�iterr r r r r �__iter__ s zDirectedGraph.__iter__c C s t | j�S r )�lenr r r r r �__len__ s zDirectedGraph.__len__c C s || j kS r )r �r �keyr r r � __contains__ s zDirectedGraph.__contains__c C sB t � }t| j�|_dd� | j�� D �|_dd� | j�� D �|_|S )z$Return a shallow copy of this graph.c S s i | ]\}}|t |��qS r �r ��.0�k�vr r r � <dictcomp> s z&DirectedGraph.copy.<locals>.<dictcomp>c S s i | ]\}}|t |��qS r r r r r r r s )r r r r �itemsr )r �otherr r r �copy s zDirectedGraph.copyc C s: || j krtd��| j �|� t� | j|< t� | j|< dS )z Add a new vertex to the graph.z vertex existsN)r � ValueError�addr r r r r r r r s zDirectedGraph.addc C sT | 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 )r r �f�tr r r r! ' s zDirectedGraph.removec C s || j | ko|| j| kS r )r r �r r# r$ r r r � connected/ s zDirectedGraph.connectedc C s6 || j krt|��| j| �|� | j| �|� dS )zgConnect two existing vertices. Nothing happens if the vertices are already connected. N)r �KeyErrorr r r r% r r r �connect2 s zDirectedGraph.connectc c s, | j �� D ] \}}|D ]}||fV qq d S r )r r )r r# �childrenr$ r r r � iter_edges< s zDirectedGraph.iter_edgesc C s t | j| �S r )r r r r r r � iter_childrenA s zDirectedGraph.iter_childrenc C s t | j| �S r )r r r r r r � iter_parentsD s zDirectedGraph.iter_parentsN)�__name__� __module__� __qualname__�__doc__r r r r r r r! r& r( r* r+ r, r r r r r s r c @ sJ e Zd Zddd�Zdd� Zdd� ZeZdd � Zd d � Zd d � Z dd� Z dS )�IteratorMappingNc C s || _ || _|pi | _d S r )�_mapping� _accessor�_appends)r �mapping�accessor�appendsr r r r I s zIteratorMapping.__init__c C s d� | j| j| j�S )Nz!IteratorMapping({!r}, {!r}, {!r}))�formatr2 r3 r4 r r r r �__repr__N s �zIteratorMapping.__repr__c C s t | jp | j�S r )�boolr2 r4 r r r r �__bool__U s zIteratorMapping.__bool__c C s || j kp|| jkS r )r2 r4 r r r r r Z s z IteratorMapping.__contains__c C sN z| j | }W n" tk r0 t| j| � Y S X t�| �|�| j�|d��S )Nr )r2 r' r r4 � itertools�chainr3 �get)r r r r r r � __getitem__] s zIteratorMapping.__getitem__c s" � fdd�� j D �}t�� j|�S )Nc 3 s | ]}|� j kr|V qd S r �r2 �r r r r r � <genexpr>e s z+IteratorMapping.__iter__.<locals>.<genexpr>)r4 r< r= r2 �r �morer r r r d s zIteratorMapping.__iter__c s& t � fdd�� jD ��}t� j�| S )Nc 3 s | ]}|� j krd V qdS )r Nr@ rA r r r rB i s z*IteratorMapping.__len__.<locals>.<genexpr>)�sumr4 r r2 rC r r r r h s zIteratorMapping.__len__)N) r- r. r/ r r9 r; � __nonzero__r r? r r r r r r r1 H s r1 c @ s4 e Zd ZdZdd� 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. c C s || _ d S r ��_factory)r �factoryr r r r v s z _FactoryIterableView.__init__c C s d� t| �jt| �� ��S �Nz{}({}))r8 �typer- �listrI r r r r r9 y s z _FactoryIterableView.__repr__c C s, zt | �� � W n tk r& Y dS X dS )NFT)�nextrI � StopIterationr r r r r; | s z _FactoryIterableView.__bool__c C s | � � S r rH r r r r r � s z _FactoryIterableView.__iter__N� r- r. r/ r0 r r9 r; rF r r r r r rG m s rG c @ s4 e Zd ZdZdd� 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`. c C s || _ d S r )� _sequence)r �sequencer r r r � s z _SequenceIterableView.__init__c C s d� t| �j| j�S rK )r8 rL r- rR r r r r r9 � s z _SequenceIterableView.__repr__c C s t | j�S r )r: rR r r r r r; � s z _SequenceIterableView.__bool__c C s t | j�S r )r rR r r r r r � s z _SequenceIterableView.__iter__NrP r r r r rQ � s rQ c C s, t | �rt| �S t| tj�s$t| �} t| �S )zCBuild an iterable view from the value returned by `find_matches()`.)�callablerG � isinstancer �SequencerM rQ )�matchesr r r �build_iter_view� s rX ) r< �compatr �objectr �Mappingr1 rG rQ rX r r r r �<module> s B%
💾 Save Changes
❌ Cancel