File: //usr/local/lib/python3.10/dist-packages/pip/_vendor/resolvelib/__pycache__/structs.cpython-310.pyc
o
��h � @ s^ 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 Zerfdd lmZ G d
d � d e eeef �ZG d d
� d
e eeeef �Zned ddg�Zed
g d��ZG dd� dee �ZG dd� de ee
e f eeeef �ZG dd� de e �ZG dd� de e �Zd 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 �I/usr/local/lib/python3.10/dist-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 ZdZd&dd�Zd'dd�Zd(d
d �Zd)dd�Zd*dd�Zd+dd�Z d+dd�Z
d,dd�Z d-d d �Z d.d d �Z
d/d!d"�Zd/d#d$�Zd%S )0�
DirectedGraphz&A graph structure with directed edges.�return�Nonec C s t � | _i | _i | _d S �N)�set� _vertices� _forwards�
_backwards��selfr r r �__init__0 s
zDirectedGraph.__init__� Iterator[KT]c C �
t | j�S r$ )�iterr& r) r r r �__iter__5 �
zDirectedGraph.__iter__�intc C r- r$ )�lenr& r) r r r �__len__8 r0 zDirectedGraph.__len__�keyr �boolc C s
|| j v S r$ )r& �r* r4 r r r � __contains__; r0 zDirectedGraph.__contains__�DirectedGraph[KT]c C sF t | �� }t| j�|_dd� | j�� D �|_dd� | j�� D �|_|S )z$Return a shallow copy of this graph.c S � i | ] \}}|t |��qS r �r% ��.0�k�vr r r �
<dictcomp>B � z&DirectedGraph.copy.<locals>.<dictcomp>c S r9 r r: r; r r r r? C r@ )�typer% r& r' �itemsr( )r* �otherr r r �copy> s
zDirectedGraph.copyc C s: || j v r td��| 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 rF 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* r4 �f�tr r r rG N s �zDirectedGraph.removerI rJ c C s || j | v o
|| j| v S r$ )r( r' �r* rI rJ r r r � connectedV s zDirectedGraph.connectedc C s6 || j vr t|��| j| �|� | j| �|� dS )zgConnect two existing vertices.
Nothing happens if the vertices are already connected.
N)r& �KeyErrorr' rF r( rK r r r �connectY s
zDirectedGraph.connect�Iterator[tuple[KT, KT]]c c s. � | j �� D ]\}}|D ]}||fV q qd S r$ )r' rB )r* rI �childrenrJ r r r �
iter_edgesc s � ��zDirectedGraph.iter_edgesc C � t | j| �S r$ )r. r' r6 r r r �
iter_childrenh � zDirectedGraph.iter_childrenc C rR r$ )r. r( r6 r r r � iter_parentsk rT zDirectedGraph.iter_parentsN)r" r# �r" r, �r" r1 )r4 r r" r5 )r" r8 )r4 r r" r# )rI r rJ r r" r5 )rI r rJ r r" r# )r" rO )r4 r r" r, )r r r r r+ r/ r3 r7 rD rF rG rL rN rQ rS rU r r r r r! - s
r! c @ sV e Zd Z d!d"d
d �Zd#d
d�Zd$dd�Zd%dd�Zd&dd�Zd'd d �Zd(d d �Z dS ))�IteratorMappingNr �Mapping[KT, RT]�accessor� Callable[[RT], Iterable[CT]]�appends� Mapping[KT, Iterable[CT]] | Noner" r# c C s || _ || _|p i | _d S r$ )�_mapping� _accessor�_appends)r* r rZ r\ r r r r+ p s zIteratorMapping.__init__�strc C s d� | j| j| j�S )Nz!IteratorMapping({!r}, {!r}, {!r}))�formatr^ r_ r` r) r r r �__repr__z s
�zIteratorMapping.__repr__r5 c C s t | jp| j�S r$ )r5 r^ r` r) r r r �__bool__� s zIteratorMapping.__bool__r4 �objectc C s || j v p || jv S r$ )r^ r` r6 r r r r7 � s z IteratorMapping.__contains__r= r � Iterator[CT]c C sL z| j | }W n ty t| j| � Y S w t�| �|�| j�|d��S )Nr )r^ rM r. r` � itertools�chainr_ �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$ �r^ �r< r= r) r r � <genexpr>� � � z+IteratorMapping.__iter__.<locals>.<genexpr>)r` rg rh r^ �r* �morer r) r r/ � s zIteratorMapping.__iter__r1 c s& t � fdd�� jD ��}t� j�| S )Nc 3 s � | ]
}|� j vrd V qdS )r Nrk rl r) r r rm � rn z*IteratorMapping.__len__.<locals>.<genexpr>)�sumr` r2 r^ ro r r) r r3 � s zIteratorMapping.__len__r$ )r rY rZ r[ r\ r] r" r# �r" ra �r" r5 )r4 re r" r5 )r= r r" rf rV rW )
r r r r+ rc rd r7 rj r/ r3 r r r r rX o s �
rX c @ s8 e Zd ZdZddd�Zdd d
�Zdd d
�Zddd�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.
�factory�Callable[[], Iterable[RT]]r" r# c C s || _ d | _d S r$ )�_factory� _iterable)r* ru r r r r+ � s
z _FactoryIterableView.__init__ra c C s t | �j� dt| �� d�S �N�(�))rA r �listr) r r r rc � s z _FactoryIterableView.__repr__r5 c C s( z t t| �� W dS ty Y dS w )NFT)�nextr. �
StopIterationr) r r r rd � s ��z _FactoryIterableView.__bool__� Iterator[RT]c C s, | j d u r | �� n| j }t�|�\| _ }|S r$ )rx rw rg �tee)r* �iterable�currentr r r r/ � s z _FactoryIterableView.__iter__N)ru rv r" r# rr rs �r" r �r r r r r+ rc rd r/ r r r r rt � s
rt c @ s8 e Zd ZdZddd�Zddd �Zdd d �Zddd�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`.
�sequence� Sequence[RT]c C s
|| _ d S r$ )� _sequence)r* r� r r r r+ � r0 z _SequenceIterableView.__init__r" ra c C s t | �j� d| j� d�S ry )rA r r� r) r r r rc � s z _SequenceIterableView.__repr__r5 c C r- r$ )r5 r� r) r r r rd � r0 z _SequenceIterableView.__bool__r c C r- r$ )r. r� r) r r r r/ � r0 z _SequenceIterableView.__iter__N)r� r� rr rs r� r� r r r r r� � s
r� �matches� Matches[CT]r" � Iterable[CT]c C s* t | �rt| �S t| t�st| �} t| �S )zCBuild an iterable view from the value returned by `find_matches()`.)�callablert �
isinstancer r| r� )r� r r r �build_iter_view� s
r� )r� r� r" r� ) �
__future__r rg � collectionsr �typingr r r r r r r
r r r
r r r �Matches�resolvers.criterionr r r r! rX rt r� r� � IterableViewr r r r �<module> s, 0
�(B(