Файловый менеджер - Редактировать - /usr/lib/python3/dist-packages/pip/_vendor/pyparsing/diagram/__pycache__/__init__.cpython-310.pyc
Ðазад
o !��h�V � @ s d dl Z d dlmZ d dlmZ d dlmZmZmZm Z m Z m Z m Z m Z mZ d dlmZ d dlmZ d dlZeeed�dd ��Zee�� �ZW d � n1 sPw Y ed d efd ee j fd efg�Z e d�Z G dd� de j �Z G dd� de j �Z G dd� de e �Z!dee defdd�Z"ddde fdd �Z# d8d ej$d ee% d!ed"e&dee f d#d$�Z'd%ed&eej$ de&fd'd(�Z(G d)d*� d*�Z)G d+d,� d,�Z*d ej$de&fd-d.�Z+d/d0� Z,d&eej$ fd1d2�Z-e, d9d ej$d3ee! d4e*d!ed ed5ed"e&dee! fd6d7��Z.dS ):� N)� pyparsing)�resource_filename) �List�Optional� NamedTuple�Generic�TypeVar�Dict�Callable�Set�Iterable)�Template)�StringIOztemplate.jinja2zutf-8)�encoding� NamedDiagram�name�diagram�index�Tc s$ e Zd ZdZdZ� fdd�Z� ZS )�EachItemz� Custom railroad item to compose a: - Group containing a - OneOrMore containing a - Choice of the elements in the Each with the group label indicating that all must be matched z[ALL]c s< t jt|�d g|�R � }t j|d�}t� j|| jd� d S )N� ��item)�label)�railroad�Choice�len� OneOrMore�super�__init__� all_label)�self�items� choice_item�one_or_more_item�� __class__� �H/usr/lib/python3/dist-packages/pip/_vendor/pyparsing/diagram/__init__.pyr - s zEachItem.__init__)�__name__� __module__� __qualname__�__doc__r r � __classcell__r' r' r% r( r " s r c s& e Zd ZdZdef� fdd� Z� ZS )� AnnotatedItemzC Simple subclass of Group that creates an annotation label r c s t � j|d�|�d� d S )Nz[{}]�r r )r r �format)r! r r r% r' r( r 8 s zAnnotatedItem.__init__)r) r* r+ r, �strr r- r' r' r% r( r. 3 s r. c @ sf e Zd ZdZdedef dedefdd�Ze dedef dd fd d ��Z e d d � �Z defdd�Z dS )�EditablePartialz� Acts like a functools.partial, but can be edited. In other words, it represents a type that hasn't yet been constructed. �func.�args�kwargsc C s || _ || _|| _d S �N�r3 r4 r5 )r! r3 r4 r5 r' r' r( r E s zEditablePartial.__init__�return�EditablePartial[T]c O s t |t|�|d�S )z� If you call this function in the same way that you would call the constructor, it will store the arguments as you expect. For example EditablePartial.from_call(Fraction, 1, 3)() == Fraction(1, 3) r7 )r2 �list)�clsr3 r4 r5 r' r' r( � from_callJ s zEditablePartial.from_callc C s | j d S )Nr )r5 �r! r' r' r( r R s zEditablePartial.namec C sL | j �� }| j�� }t�| j�}|j| jv r ||�|j�7 }| j|i |��S )z< Evaluate the partial and return the result )r4 �copyr5 �inspect�getfullargspecr3 �varargs�pop)r! r4 r5 �arg_specr' r' r( �__call__V s zEditablePartial.__call__N)r) r* r+ r, r r r: �dictr � classmethodr< �propertyr rD r' r' r' r( r2 < s r2 �diagramsr8 c K sd g }| D ]#}t � }|j�|j� |j}|jdkr |d7 }|�|d|�� d�� qtj dd|i|��S )z� Given a list of NamedDiagram, produce a single HTML string that visualises those diagrams :params kwargs: kwargs to be passed in to the template r z (root)� )�title�text�svgrH Nr' ) r r �writeSvg�writer r �append�getvalue�template�render)rH r5 �datar �iorJ r' r' r( �railroad_to_htmlf s rU �partialr9 c C s` t | t�rt| j�| _t| j�| _| � S t | t�r dd� | D �S t | t�r.dd� | �� D �S | S )zS Recursively resolves a collection of Partials into whatever type they are c S � g | ]}t |��qS r' ��resolve_partial)�.0�xr' r' r( � <listcomp>� � z#resolve_partial.<locals>.<listcomp>c S s i | ] \}}|t |��qS r' rX )rZ �keyr[ r' r' r( � <dictcomp>� s z#resolve_partial.<locals>.<dictcomp>)� isinstancer2 rY r4 r5 r: rE r" )rV r' r' r( rY w s rY � F�element�diagram_kwargs�vertical�show_results_namesc C s� t |pi d�}t| |d||d� t| �}||v r*| js d|| _|| j||dd� t|j�� �}t |�dkrdt � }g }|D ] } | jdkrFq>| jdur[| j|vr[|� | j� |� | � q>d d � |D �} nd d � |D �} t | d d � d�S )aO Convert a pyparsing element tree into a list of diagrams. This is the recommended entrypoint to diagram creation if you want to access the Railroad tree before it is converted to HTML :param element: base element of the parser being diagrammed :param diagram_kwargs: kwargs to pass to the Diagram() constructor :param vertical: (optional) - int - limit at which number of alternatives should be shown vertically instead of horizontally :param show_results_names - bool to indicate whether results name annotations should be included in the diagram )rc N)�lookup�parentrd re rI T)�forcer z...c S rW r' rX �rZ rV r' r' r( r\ � r] z to_railroad.<locals>.<listcomp>c S rW r' rX ri r' r' r( r\ � r] c S s | j S r6 �r )�diagr' r' r( �<lambda>� s z to_railroad.<locals>.<lambda>)r^ )�ConverterState�_to_diagram_element�id� customNamer �mark_for_extractionr: rH �valuesr �set�addrO �sorted) rb rc rd re rf �root_id�diags�seen� deduped_diags�d�resolvedr' r' r( � to_railroad� s6 � �r| � specification�exprsc C s | du rdS t t|��| kS )zF Returns true if we should return a vertical list of elements NF)r �_visible_exprs)r} r~ r' r' r( �_should_vertical� s r� c @ s\ e Zd ZdZ ddejdedededede e f d d �Z dd ed ddede fdd�Z dS )� ElementStatez< State recorded for an individual pyparsing Element Nrb � convertedrg �numberr � parent_indexc C s4 || _ || _|| _|| _|| _|| _d| _d| _d S �NF)rb r r� rg r� r� �extract�complete)r! rb r� rg r� r r� r' r' r( r � s zElementState.__init__F�el_id�staterm rh c C s\ d| _ | js|r || _n | jjr| jj| _nd| _|s#| jr*t| j�r,|�|� dS dS dS )a� Called when this instance has been seen twice, and thus should eventually be extracted into a sub-diagram :param el_id: id of the element :param state: element/diagram state tracker :param name: name to use for this element's text :param force: If true, force extraction now, regardless of the state of this. Only useful for extracting the root element when we know we're finished TrI N)r� r rb rp r� �_worth_extracting�extract_into_diagram)r! r� r� r rh r' r' r( rq � s �z ElementState.mark_for_extraction)NNr� ) r) r* r+ r, r � ParserElementr2 �intr1 r r �boolrq r' r' r' r( r� � s6 ������ ������r� c @ s� e Zd ZdZddee fdd�Zdedefdd �Z ded efd d �Z defd d�Z defdd�Z d efdd�Z d efdd�Zdefdd�ZdS )rm zR Stores some state that persists between recursions into the element tree Nrc c C s. i | _ i | _d| _d| _|pi | _t� | _d S )Nr r )�_element_diagram_statesrH � unnamed_indexr rc rs �extracted_diagram_names)r! rc r' r' r( r s zConverterState.__init__r^ �valuec C s || j |< d S r6 �r� )r! r^ r� r' r' r( � __setitem__ s zConverterState.__setitem__r8 c C s | j | S r6 r� �r! r^ r' r' r( � __getitem__ � zConverterState.__getitem__c C s | j |= d S r6 r� r� r' r' r( � __delitem__ s zConverterState.__delitem__c C s || j v S r6 r� r� r' r' r( � __contains__" r� zConverterState.__contains__c C � | j d7 _ | j S )zT Generate a number used in the name of an otherwise unnamed diagram r )r� r= r' r' r( �generate_unnamed% � z ConverterState.generate_unnamedc C r� )z; Generate a number used to index a diagram r rj r= r' r' r( �generate_index, r� z ConverterState.generate_indexr� c C s� | | }|j r,tjtj|jd�}d|j jv r ||j jd< nd|j jv r,||j jd |j< |jj tj kr:|jjd }n|j}tjt |jtjtj |fi | j ��|jd�| j|< | |= dS )z� Used when we encounter the same token twice in the same tree. When this happens, we replace all instances of that token with a terminal, and create a new subdiagram for the token �rK r r" )r r r N)rg r2 r< r � NonTerminalr r5 r� r� r3 �Groupr �Diagramrc r� rH )r! r� �position�ret�contentr' r' r( r� 3 s* �� � z#ConverterState.extract_into_diagramr6 )r) r* r+ r, r rE r r� r� r� r� r� r� r� r� r� r' r' r' r( rm s rm c C s | � � }tdd� |D ��S )z� Returns true if this element is worth having its own sub-diagram. Simply, if any of its children themselves have children, then its complex enough to extract c s s � | ]}|� � V qd S r6 )�recurse)rZ �childr' r' r( � <genexpr>[ s � z$_worth_extracting.<locals>.<genexpr>)r� �any)rb �childrenr' r' r( r� U s r� c sH ddt jdtt dtdtdtd td td tt f� fd d � }|S )z� decorator to ensure enhancements to a diagram item (such as results name annotations) get applied on return from _to_diagram_element (we do this since there are several returns in _to_diagram_element) Nr Frb rg rf rd r � name_hintre r8 c sR � | ||||||�}|r'|d ur'| j }|r'|| jrdnd7 }tjtj||d�}|S )NrI �*r/ )� resultsName� modalResultsr2 r< r r� ) rb rg rf rd r r� re r� �element_results_name��fnr' r( �_innere s" � �z0_apply_diagram_item_enhancements.<locals>._inner�NNr NF)r r� r r2 rm r� r1 r� )r� r� r' r� r( � _apply_diagram_item_enhancements^ s. ��������� r� c s$ t jt jt jjf� � fdd�| D �S )Nc s& g | ]}|j s|jst|� �s|�qS r' )rp r� r` �rZ �e��non_diagramming_exprsr' r( r\ � s ����z"_visible_exprs.<locals>.<listcomp>)r �ParseElementEnhance� PositionToken�And� _ErrorStop)r~ r' r� r( r � s � �r rg rf r� c C s� | � � }|p | jp | jj}t| �} | j} | js8t| tjtj f�r8|r8|d js*|} nd} t | j ||||| |d�S t | �rl| |v rW|| } | j | ||d� tjtj| jd�} | S | |jv rltjtj|j| jd d�} | S t| tj�r�|svdS ttdd� |D ���d kr�tjtjd tt|��d �} n�t||�r�tjtjg d �} n�tjtj g d �} n�t| tj tj f�r�|s�dS t||�r�tjtj dg d �} n�tjtj g d �} n�t| tj!�r�|s�dS tjt"g d �} n�t| tj#�r�tjt$d d d�} n�t| tj%�r�tjt$dd d�} n�t| tj&��r tjt$dd d�} n}t| tj'��r tjtj(d d�} nmt| tj��r-tjtjd d�} n]t| tj)��r=tjtj)d d�} nMt| tj*��rNtjtj*d| d�} n<t| tj+��r\| j�s\d} n.t|�d k�rltjtj g d �} n t|�dk�r�| �s�tjtj*d |d�} n t�tj,| j-�}|} | du �r�dS t.| | |||�/� d�|| < | j�r�|| � | || j� d}|D ]M}d| jv �r�| jd �0|d� t || ||||d�}|du�r�d| jv �r�|| jd< �q�d| jv �r�|| jd |< |d 7 }�q�d| jv �r�| jd |= �q�| �r&d| jv �rt| jd �dk�s d| jv �r&| jd du �r&t�tj,|�} | |v �r0d|| _1| |v �rY|| j2�rY|| j1�rY|�3| � | du�rYtjtj|j| jd d�} | S )a" Recursively converts a PyParsing Element to a railroad Element :param lookup: The shared converter state that keeps track of useful things :param index: The index of this element within the parent :param parent: The parent of this element in the output tree :param vertical: Controls at what point we make a list of elements vertical. If this is an integer (the default), it sets the threshold of the number of items before we go vertical. If True, always go vertical, if False, never do so :param name_hint: If provided, this will override the generated name :param show_results_names: bool flag indicating whether to add annotations for results names :returns: The converted version of the input element, but as a Partial that hasn't yet been constructed r N)rg rf rd r r� re )r r� r c s s � | ] }|j |jfV qd S r6 )r r� r� r' r' r( r� � s � z&_to_diagram_element.<locals>.<genexpr>r rI )r �repeat)r" �NOT)r r � LOOKAHEAD� LOOKBEHINDr r/ )rb r� rg r� r� r" )rg rf rd r re r T)4r� rp r& r) ro r� r` r �TokenConverter�Locatedrn �exprr� rq r2 r< r r� r rH r5 r� r rs r r1 r� �Stack�Sequence�Or� MatchFirstr �HorizontalChoice�Eachr �NotAnyr. � FollowedBy� PrecededBy�Optr � ZeroOrMorer� �Empty�Terminal� defaultNamer� r� �insertr� r� r� )rb rg rf rd r r� re r~ r r� r� �propagated_name� looked_upr� �terminal�ir� r r' r' r( rn � s� �� � � � � � � � � " �rn )Nra Fr� )/r � pip._vendorr �pip._vendor.pkg_resourcesr �typingr r r r r r r r r �jinja2r rT r r? �openr) �fp�readrQ r1 � DiagramItemr� r r r� r r. r2 rU rY r� rE r� r| r� r� rm r� r� r rn r' r' r' r( �<module> s� , �� *����� �6�� � >N * ���������
| ver. 1.1 | |
.
| PHP 8.4.18 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка