Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pip/_vendor/resolvelib/__pycache__/structs.cpython-39.pyc
Ðазад
a "�h � @ sd d dl mZ d dlZd dlmZ d dlmZmZmZm Z m Z m Z m Z m Z mZmZ ed�Zed�Zed�Zee e eg e e f f Zer�dd lmZ G d d � d e eeef �ZG d d � d e eeeef �Zn ed ddg�Zed g d��ZG dd� dee �ZG dd� de ee e f eeeef �ZG dd� de e �ZG dd� de e �Zddd�d d �Z e Z dS ) � )� annotationsN)� namedtuple) � TYPE_CHECKING�Callable�Generic�Iterable�Iterator�Mapping� NamedTuple�Sequence�TypeVar�Union�KT�RT�CT� )� Criterionc @ s e Zd ZU ded< ded< dS )�RequirementInformationr � requirementz CT | None�parentN)�__name__� __module__� __qualname__�__annotations__� r r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pip/_vendor/resolvelib/structs.pyr s r c @ s* 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 c @ s� e Zd ZdZdd�dd�Zdd�dd�Zd d�d d �Zd d d�dd�Zdd�dd�Zd dd�dd�Z d dd�dd�Z d d d d�dd�Z d d dd�dd �Z d d�d d �Z d dd�d d!�Zd dd�d"d#�Zd$S )%� DirectedGraphz&A graph structure with directed edges.�None��returnc C s t � | _i | _i | _d S �N)�set� _vertices� _forwards� _backwards��selfr r r �__init__0 s zDirectedGraph.__init__� Iterator[KT]c C s t | j�S r% )�iterr' r* r r r �__iter__5 s zDirectedGraph.__iter__�intc C s t | j�S r% )�lenr' r* r r r �__len__8 s zDirectedGraph.__len__r �bool��keyr$ c C s || j v S r% )r' �r+ r5 r r r � __contains__; s zDirectedGraph.__contains__zDirectedGraph[KT]c C sF 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>B � z&DirectedGraph.copy.<locals>.<dictcomp>c S s i | ]\}}|t |��qS r r8 r9 r r r r= C r> )�typer& r' r( �itemsr) )r+ �otherr r r �copy> s zDirectedGraph.copyc C s: || j v rtd��| j �|� t� | j|< t� | j|< dS )z Add a new vertex to the graph.z vertex existsN)r' � ValueError�addr& r( r) r6 r r r rD F 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+ r5 �f�tr r r rE N s zDirectedGraph.remove)rG rH r$ c C s || j | v o|| j| v S r% )r) r( �r+ rG rH r r r � connectedV s zDirectedGraph.connectedc C s6 || j vrt|��| j| �|� | j| �|� dS )zgConnect two existing vertices. Nothing happens if the vertices are already connected. N)r' �KeyErrorr( rD r) rI r r r �connectY s zDirectedGraph.connectzIterator[tuple[KT, KT]]c c s, | j �� D ] \}}|D ]}||fV qq d S r% )r( r@ )r+ rG �childrenrH r r r � iter_edgesc s zDirectedGraph.iter_edgesc C s t | j| �S r% )r. r( r6 r r r � iter_childrenh s zDirectedGraph.iter_childrenc C s t | j| �S r% )r. r) r6 r r r � iter_parentsk s zDirectedGraph.iter_parentsN)r r r r r, r/ r2 r7 rB rD rE rJ rL rN rO rP r r r r r! - s r! c @ sz e Zd Zd ddddd�dd�Zd d �d d �Zd d �dd�Zdd d�dd�Zddd�dd�Zdd �dd�Zd d �d d �Z dS ) �IteratorMappingNzMapping[KT, RT]z Callable[[RT], Iterable[CT]]z Mapping[KT, Iterable[CT]] | Noner" )r �accessor�appendsr$ c C s || _ || _|pi | _d S r% )�_mapping� _accessor�_appends)r+ r rR rS r r r r, p s zIteratorMapping.__init__�strr# c C s d� | j| j| j�S )Nz!IteratorMapping({!r}, {!r}, {!r}))�formatrT rU rV r* r r r �__repr__z s �zIteratorMapping.__repr__r3 c C s t | jp | j�S r% )r3 rT rV r* r r r �__bool__� s zIteratorMapping.__bool__�objectr4 c C s || j v p|| jv S r% )rT rV r6 r r r r7 � s z IteratorMapping.__contains__r z Iterator[CT])r; r$ c C sL z| j | }W n ty. t| j| � Y S 0 t�| �|�| j�|d��S )Nr )rT rK r. rV � itertools�chainrU �get)r+ r; r< r r r � __getitem__� s zIteratorMapping.__getitem__r- c s" � fdd�� j D �}t�� j|�S )Nc 3 s | ]}|� j vr|V qd S r% �rT �r: r; r* r r � <genexpr>� r> z+IteratorMapping.__iter__.<locals>.<genexpr>)rV r\ r] rT �r+ �morer r* r r/ � s zIteratorMapping.__iter__r0 c s& t � fdd�� jD ��}t� j�| S )Nc 3 s | ]}|� j vrd V qdS )r Nr` ra r* r r rb � r> z*IteratorMapping.__len__.<locals>.<genexpr>)�sumrV r1 rT rc r r* r r2 � s zIteratorMapping.__len__)N) r r r r, rY rZ r7 r_ r/ r2 r r r r rQ o s � rQ c @ sJ e Zd ZdZddd�dd�Zdd�d d �Zd d�d d �Zdd�dd�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. zCallable[[], Iterable[RT]]r" )�factoryr$ c C s || _ d | _d S r% )�_factory� _iterable)r+ rg r r r r, � s z _FactoryIterableView.__init__rW r# c C s t | �j� dt| �� d�S �N�(�))r? r �listr* r r r rY � s z _FactoryIterableView.__repr__r3 c C s* zt t| �� W n ty$ Y dS 0 dS )NFT)�nextr. � StopIterationr* r r r rZ � s z _FactoryIterableView.__bool__� Iterator[RT]c C s, | j d u r| �� n| j }t�|�\| _ }|S r% )ri rh r\ �tee)r+ �iterable�currentr r r r/ � s z _FactoryIterableView.__iter__N�r r r r r, rY rZ r/ r r r r rf � s rf c @ sH e Zd ZdZdd�dd�Zdd�dd �Zd d�d d �Zd d�dd�ZdS )�_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`. z Sequence[RT])�sequencec C s || _ d S r% )� _sequence)r+ rv r r r r, � s z _SequenceIterableView.__init__rW r# c C s t | �j� d| j� d�S rj )r? r rw r* r r r rY � s z _SequenceIterableView.__repr__r3 c C s t | j�S r% )r3 rw r* r r r rZ � s z _SequenceIterableView.__bool__rp c C s t | j�S r% )r. rw r* r r r r/ � s z _SequenceIterableView.__iter__Nrt r r r r ru � s ru z Matches[CT]z Iterable[CT])�matchesr$ c C s* t | �rt| �S t| t�s"t| �} t| �S )zCBuild an iterable view from the value returned by `find_matches()`.)�callablerf � isinstancer rm ru )rx r r r �build_iter_view� s r{ ) � __future__r r\ � collectionsr �typingr r r r r r r r r r r r r �MatchesZresolvers.criterionr r r r! rQ rf ru r{ � IterableViewr r r r �<module> s* 0 �B((
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка