관리-도구
편집 파일: __init__.cpython-38.pyc
U ʗRe�\ � @ s� d dl Z d dlmZ d dlZd dlmZmZmZmZmZm Z m Z m Z d dl m Z d dlmZ d dlZdZe e�Zeddefd eje j fd efg�Zed �ZG d d � d e j�ZG dd� de j�ZG dd� dee �Z ee ed�dd�Z ded�dd�Z d0ej eje ee!e!ee d�d d �Z"ee ej e!d �d d �Z#G d!d"� d"�Z$G d#d$� d$�Z%ej e!d%�d&d'�Z&d(d)� Z'e ej d*�d+d,�Z(e'd1ej eje e%eeee!e!eje d-� d.d/��Z)dS )2� N)� pyparsing)�List� NamedTuple�Generic�TypeVar�Dict�Callable�Set�Iterable)�Template)�StringIOaM <!DOCTYPE html> <html> <head> {% if not head %} <style type="text/css"> .railroad-heading { font-family: monospace; } </style> {% else %} {{ head | safe }} {% endif %} </head> <body> {{ body | safe }} {% for diagram in diagrams %} <div class="railroad-group"> <h1 class="railroad-heading">{{ diagram.title }}</h1> <div class="railroad-description">{{ diagram.text }}</div> <div class="railroad-svg"> {{ diagram.svg }} </div> </div> {% endfor %} </body> </html> � 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 f|�� }t j|d�}t� j|| jd� d S )N� ��item��label)�railroad�Choice�len� OneOrMore�super�__init__� all_label)�self�itemsZ choice_itemZone_or_more_item�� __class__� ��/builddir/build/BUILDROOT/alt-python38-pip-22.2.1-2.el8.x86_64/opt/alt/python38/lib/python3.8/site-packages/pip/_vendor/pyparsing/diagram/__init__.pyr I s zEachItem.__init__)�__name__� __module__� __qualname__�__doc__r r � __classcell__r# r# r! r$ r > s r c s& e Zd ZdZed�� fdd� Z� ZS )� AnnotatedItemzC Simple subclass of Group that creates an annotation label r c s" t � j||rd�|�n|d� d S )Nz[{}]�r r )r r �format)r r r r! r# r$ r T s zAnnotatedItem.__init__)r% r& r' r( �strr r) r# r# r! r$ r* O s r* c @ s` e Zd ZdZedef eed�dd�Ze edef dd�dd ��Z e d d � �Z ed �d d�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 �Nr/ )r r0 r1 r2 r# r# r$ r a s zEditablePartial.__init__�EditablePartial[T])r0 �returnc 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) r/ )r. �list)�clsr0 r1 r2 r# r# r$ � from_callf s zEditablePartial.from_callc C s | j d S )Nr )r2 �r r# r# r$ r n s zEditablePartial.name�r5 c C sH | j �� }| j�� }t�| j�}|j| jkr<||�|j�7 }| j||�S )z< Evaluate the partial and return the result )r1 �copyr2 �inspect�getfullargspecr0 �varargs�pop)r r1 r2 Zarg_specr# r# r$ �__call__r s zEditablePartial.__call__N)r% r& r' r( r r r6 �dictr � classmethodr8 �propertyr r@ r# r# r# r$ r. X s r. )�diagramsr5 c K sp g }| D ]R}|j dkrqt� }|j �|j� |j}|jdkrD|d7 }|�|d|�� d�� qtj f d|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 Nr z (root)� )�title�text�svgrD ) r r ZwriteSvg�writer r �append�getvalue�template�render)rD r2 �datar �iorF r# r# r$ �railroad_to_html� s rP r4 )�partialr5 c C sd t | t�r(t| j�| _t| j�| _| � S t | t�r@dd� | D �S t | t�r\dd� | �� D �S | S dS )zS Recursively resolves a collection of Partials into whatever type they are c S s g | ] }t |��qS r# ��resolve_partial)�.0�xr# r# r$ � <listcomp>� s z#resolve_partial.<locals>.<listcomp>c S s i | ]\}}|t |��qS r# rR )rT �keyrU r# r# r$ � <dictcomp>� s z#resolve_partial.<locals>.<dictcomp>N)� isinstancer. rS r1 r2 r6 rA r )rQ r# r# r$ rS � s rS � F)�element�diagram_kwargs�vertical�show_results_names� show_groupsr5 c C s� t |pi d�}t| |d|||d� t| �}||krV| jsBd|| _|| j||dd� t|j�� �}t |�dkr�t � }g } |D ]:} | jdkr�q~| jdk r~| j|kr~|� | j� | � | � q~d d � | D �} nd d � |D �} t | d d � d�S )a� 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 :param show_groups - bool to indicate whether groups should be highlighted with an unlabeled surrounding box �r\ N)�lookup�parentr] r^ r_ rE T)�forcer z...c S s g | ] }t |��qS r# rR �rT rQ r# r# r$ rV � s z to_railroad.<locals>.<listcomp>c S s g | ] }t |��qS r# rR rd r# r# r$ rV � s c S s | j S r3 �r )Zdiagr# r# r$ �<lambda>� � z to_railroad.<locals>.<lambda>�rW )�ConverterState�_to_diagram_element�id� customNamer �mark_for_extractionr6 rD �valuesr �set�addrJ �sorted) r[ r\ r] r^ r_ ra Zroot_idZdiags�seenZ deduped_diags�d�resolvedr# r# r$ � to_railroad� s6 � ru )� specification�exprsr5 c C s | dkr dS t t|��| kS dS )zF Returns true if we should return a vertical list of elements NF)r �_visible_exprs)rv rw r# r# r$ �_should_vertical� s ry c @ sH e Zd ZdZd ejeeeee j e d�dd�Z d edee d�d d �Z dS ) � ElementStatez< State recorded for an individual pyparsing Element N)r[ � convertedrb �numberr � parent_indexc C s4 || _ || _|| _|| _|| _|| _d| _d| _d S )NF)r[ r r{ rb r| r} �extract�complete)r r[ r{ rb r| r r} r# r# r$ r � s zElementState.__init__Fri )�el_id�stater rc c C sT d| _ | js2|r|| _n| jjr,| jj| _nd| _|sF| jrPt| j�rP|�|� 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 TrE N)r~ r r[ rl r �_worth_extracting�extract_into_diagram)r r� r� r rc r# r# r$ rm s z ElementState.mark_for_extraction)NN)NF)r% r& r' r( r � ParserElementr. �intr- �typing�Optionalr �boolrm r# r# r# r$ rz � s& �� � �rz c @ s� e Zd ZdZdeje d�dd�Zee d�dd�Z ee d �d d �Z ed �d d�Z ed �dd�Z ed�dd�Zed�dd�Zed�dd�ZdS )ri zR Stores some state that persists between recursions into the element tree Nr` c C s. i | _ i | _d| _d| _|p i | _t� | _d S )Nr r )�_element_diagram_statesrD � unnamed_indexr r\ ro Zextracted_diagram_names)r r\ r# r# r$ r . s zConverterState.__init__)rW �valuec C s || j |< d S r3 �r� )r rW r� r# r# r$ � __setitem__; s zConverterState.__setitem__)rW r5 c C s | j | S r3 r� �r rW r# r# r$ � __getitem__> s zConverterState.__getitem__rh c C s | j |= d S r3 r� r� r# r# r$ � __delitem__A s zConverterState.__delitem__c C s || j kS r3 r� r� r# r# r$ � __contains__D s zConverterState.__contains__r: c C s | j d7 _ | j S )zT Generate a number used in the name of an otherwise unnamed diagram r )r� r9 r# r# r$ �generate_unnamedG s z ConverterState.generate_unnamedc C s | j d7 _ | j S )z; Generate a number used to index a diagram r re r9 r# r# r$ �generate_indexN s z ConverterState.generate_index)r� c C s� | | }|j rXtjtj|jd�}d|j jkr:||j jd< n d|j jkrX||j jd |j< |jj tj krt|jjd }n|j}tjt |jtjtj |f| 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 �rG r r )r r r N)rb r. r8 r � NonTerminalr r2 r} r{ r0 �Groupr ZDiagramr\ r| rD )r r� �position�ret�contentr# r# r$ r� U s, ��� z#ConverterState.extract_into_diagram)N)r% r& r' r( r� r� rA r r� rz r� r� r� r� r� r� r� r# r# r# r$ ri ) s ri )r[ r5 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 r3 )�recurse)rT �childr# r# r$ � <genexpr>} s z$_worth_extracting.<locals>.<genexpr>)r� �any)r[ �childrenr# r# r$ r� w s r� c s6 dt jtjt tttttttjt d� � fdd� }|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 F� r[ rb ra r] r � name_hintr^ r_ r5 c sT � | |||||||�}|rP|d k rP| j } | rP| | jr8dnd7 } tjtj|| d�}|S )NrE �*r+ )� resultsName� modalResultsr. r8 r r� ) r[ rb ra r] r r� r^ r_ r� �element_results_name��fnr# r$ �_inner� s( � �z0_apply_diagram_item_enhancements.<locals>._inner)NNr NFF) r r� r� r� r. ri r� r- r� )r� r� r# r� r$ � _apply_diagram_item_enhancements� s$ ��"r� �rw c s$ t jt jt jjf� � fdd�| D �S )Nc s& g | ] }|j s|jst|� �s|�qS r# )rl r� rY �rT �e�Znon_diagramming_exprsr# r$ rV � s �z"_visible_exprs.<locals>.<listcomp>)r �ParseElementEnhance� PositionToken�And� _ErrorStopr� r# r� r$ rx � s � �rx r� c C s8 | � � }|p| jp| jj} t| �} | j} | jsnt| tjf�rn|rn|d jsP| } nd} t | j ||||| ||d�S t | �r�| |kr�|| } | j | ||d� t jtj| jd�}|S | |jkr�t jtj|j| jd d�}|S t| tj��rV|s�dS ttdd� |D ���d k�r$t jtjd tt|��d �}n.t||��rBt jtjg d �}nt jtjg d �}�nBt| tj tj f��r�|�stdS t||��r�t jtj dg d �}nt jtj g d �}�n�t| tj ��r�|�s�dS t jt!g d �}�n�t| tj"��r�t jt#d d d�}�n�t| tj$��rt jt#dd d�}�n�t| tj%��r8t jt#dd d�}�n`t| tj&��rt|�r^t jt#d d d�}nt jtj&d d d�}�n$t| tj'��r�t jt#t(| �j�)� d d�}n�t| tj*��r�t jtj+d d�}n�t| tj��r�t jtjd d�}n�t| tj,��r�t jtj,d d�}n�t| tj&��r t jtj&d| d�}nxt| tj-��r<| j�s<d}n\t|�d k�r\t jtjg d �}n<t|�dk�r�| �s�t jtj&d | d�}nt �tj.| j/�}|}|dk�r�dS t0| ||||�1� d�|| < | j�r�|| � | || j� d}|D ]�}d|jk�r|jd �2|d� t |||||||d�}|dk �rbd|jk�r>||jd< n"d|jk�rz||jd |< |d 7 }nd|jk�r�|jd |= �q�|�r�d|jk�r�t|jd �dk�s�d|jk�r�|jd dk�r�t �tj.| �}| |k�r�d|| _3| |k�r4|| j4�r4|| j3�r4|�5| � |dk �r4t jtj|j| jd d�}|S )ay 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 :param show_groups: bool flag indicating whether to show groups using bounding box r N)rb ra r] r r� r^ r_ )r r� r c s s | ]}|j |jfV qd S r3 )r r� r� r# r# r$ r� s z&_to_diagram_element.<locals>.<genexpr>r rE )r �repeat)r ZNOT)r r Z LOOKAHEADZ LOOKBEHINDr r+ )r[ r{ rb r} r| r )rb ra r] r r^ r_ r T)6r� rl r" r% rk r� rY r �Locatedrj �exprr� rm r. r8 r r� r rD r2 r� r ro r r- ry �Stack�Sequence�Or� MatchFirstr ZHorizontalChoice�Eachr �NotAnyr* � FollowedBy� PrecededByr� �TokenConverter�type�lower�Optr� � ZeroOrMore�EmptyZTerminal� defaultNamerz r� �insertr r~ r� )r[ rb ra r] r r� r^ r_ rw r r� r� Zpropagated_nameZ looked_upr� Zterminal�ir� r r# r# r$ rj � s$ �� � � � � � � � ��� � " �rj )NrZ FF)NNr NFF)*r � pip._vendorr r� r r r r r r r r Zjinja2r rO r r< Zjinja2_template_sourcerL r- r� Z DiagramItemr� r r r� r r* r. rP rS r� rA r� ru ry rz ri r� r� rx rj r# r# r# r$ �<module> sr ( � * �� ; � >N , ��