Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pyparsing/__pycache__/util.cpython-39.pyc
Ðазад
a a�h8 � @ s� d dl Z d dlZd dlmZmZ d dlZd dlZd dlZd dlm Z m Z m Z m Z m Z d dlZed�Ze de d�ZG dd� d�Zed d �eeed �d d ��Zed d �eeed �dd��Zed d �eeed �dd��ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� de�Z eed�dd �Z G d d � d �Z d/e ee e f e ed �d!d"�Z e e!d#�d$d%�Z"d0d d'd(�e e ee eed)�d*d+�Z#eeed,�d-d.�Z$dS )1� N)� lru_cache�wraps)�Callable�Union�Iterable�TypeVar�cast�\ �C)�boundc @ sZ e Zd ZU dZg Zee ed< g Zee ed< dZ e dd� �Z e dd� �Z e d d� �Z d S ) �__config_flagsz=Internal class for defining compatibility and debugging flags� _all_names� _fixed_names� configurationc C sx || j v rFtj| j� d|� d| j� dtt| |���� � d�dd� d S || jv r^t | ||� nt d| j� d|����d S )N�.� z is z and cannot be overridden� )� stacklevelzno such ) r �warnings�warn�__name__� _type_desc�str�getattr�upperr �setattr� ValueError)�clsZdname�value� r �~/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pyparsing/util.py�_set s ,� z__config_flags._setc C s | � |d�S )NT�r! �r �namer r r �<lambda>$ � z__config_flags.<lambda>c C s | � |d�S )NFr" r# r r r r% % r& N)r � __module__� __qualname__�__doc__r �listr �__annotations__r r � classmethodr! �enable�disabler r r r r s r � )�maxsize)�loc�strg�returnc C sF |}d| k r t |�k r4n n|| d dkr4dS | |�dd| � S )a� Returns current column within a string, counting newlines as line separators. The first column is number 1. Note: the default parsing behavior is to expand tabs in the input string before starting the parsing process. See :class:`ParserElement.parse_string` for more information on parsing strings containing ``<TAB>`` s, and suggested methods to maintain a consistent view of the parsed string, the parse location, and line and column positions within the parsed string. r � � )�len�rfind)r1 r2 �sr r r �col( s r9 c C s |� dd| �d S )a� Returns current line number within a string, counting newlines as line separators. The first line is number 1. Note - the default parsing behavior is to expand tabs in the input string before starting the parsing process. See :class:`ParserElement.parse_string` for more information on parsing strings containing ``<TAB>`` s, and suggested methods to maintain a consistent view of the parsed string, the parse location, and line and column positions within the parsed string. r5 r r4 )�count)r1 r2 r r r �lineno9 s r; c C sB |� dd| �}|�d| �}|dkr2||d |� S ||d d� S )zh Returns the line of text containing loc within a string, counting newlines as line separators. r5 r r4 N)r7 �find)r1 r2 Zlast_crZnext_crr r r �lineG s r= c @ s e Zd Zdd� ZdS )�_UnboundedCachec sp i � � j �t� | _���fdd�}� fdd�}� fdd�}d | _t�|| �| _ t�|| �| _t�|| �| _d S )Nc s � |��S �Nr ��_�key�� cache_get� not_in_cacher r �getW s z%_UnboundedCache.__init__.<locals>.getc s |� |< d S r? r �rA rB r ��cacher r �set_Z s z&_UnboundedCache.__init__.<locals>.set_c s � � � d S r? ��clear�rA rH r r rL ] s z'_UnboundedCache.__init__.<locals>.clear)rF �objectrE �size�types� MethodType�setrL )�selfrF rJ rL r )rI rD rE r �__init__R s z_UnboundedCache.__init__N�r r' r( rT r r r r r> Q s r> c @ s e Zd Zdd� ZdS )� _FifoCachec sz i � �| _ t� | _�� j�� j���fdd�}� ��fdd�}� fdd�}t�|| �| _t�|| �| _t�|| �| _d S )Nc s � |��S r? r r@ rC r r rF n s z _FifoCache.__init__.<locals>.getc s* |� |< t � ��kr&�tt� ��� qd S r? )r6 �next�iterrG )rI � cache_poprO r r rJ q s z!_FifoCache.__init__.<locals>.set_c s � � � d S r? rK rM rH r r rL w s z"_FifoCache.__init__.<locals>.clear) rO rN rE rF �poprP rQ rR rL )rS rO rF rJ rL r )rI rD rY rE rO r rT g s z_FifoCache.__init__NrU r r r r rV f s rV c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd S ) �LRUMemoz� A memoizing mapping that retains `capacity` deleted items The memo tracks retained items by their access order; once `capacity` items are retained, the least recently used item is discarded. c C s || _ i | _i | _d S r? )� _capacity�_active�_memory)rS �capacityr r r rT � s zLRUMemo.__init__c C s@ z | j | W S ty: | j�|�| j|< | j| Y S 0 d S r? )r] �KeyErrorr^ rZ �rS rB r r r � __getitem__� s zLRUMemo.__getitem__c C s | j �|d � || j|< d S r? )r^ rZ r] )rS rB r r r r � __setitem__� s zLRUMemo.__setitem__c C sb z| j �|�}W n ty" Y n<0 t| j�d | jd � }|D ]}| j�|� qB|| j|< d S �Nr4 )r] rZ r` r* r^ r\ )rS rB r Z oldest_keysZ key_to_deleter r r � __delitem__� s zLRUMemo.__delitem__c C s | j �� | j�� d S r? )r] rL r^ �rS r r r rL � s z LRUMemo.clearN) r r' r( r) rT rb rc re rL r r r r r[ s r[ c @ s e Zd ZdZdd� ZdS )� UnboundedMemoz< A memoizing mapping that retains all deleted items c C s d S r? r ra r r r re � s zUnboundedMemo.__delitem__N)r r' r( r) re r r r r rg � s rg )r8 r3 c C s: dD ]}| � |t| �} q| � dd�} | � dd�} t| �S )Nz\^-[]r5 z\n� z\t)�replace�_bslashr )r8 �cr r r �_escape_regex_range_chars� s rl c @ s. e Zd ZdZdd�dd�Zeed�dd�ZdS ) �_GroupConsecutiveaQ Used as a callable `key` for itertools.groupby to group characters that are consecutive: itertools.groupby("abcdejkmpqrs", key=IsConsecutive()) yields: (0, iter(['a', 'b', 'c', 'd', 'e'])) (1, iter(['j', 'k'])) (2, iter(['m'])) (3, iter(['p', 'q', 'r', 's'])) N)r3 c C s d| _ t�� | _d| _d S )Nr ���)�prev� itertoolsr: �counterr rf r r r rT � s z_GroupConsecutive.__init__)�charr3 c C s4 t |�}|| j | _}|| dkr.t| j�| _| jS rd )�ordro rW rq r )rS rr Zc_intro r r r �__call__� s z_GroupConsecutive.__call__)r r' r( r) rT r �intrt r r r r rm � s rm T)r8 � re_escaper3 c s" t t d�dd�� t t d�dd�}|s(|� g }tt| ��}t|�dk�rtj|t� d�D ]�\}}t|� }}t� t �� |�^ }}W d � n1 s�0 Y ||kr�|� � |�� qV|t t |�d �kr�|� � |�� � |�� �� qV|� � |�� d � |�� �� qVn� fd d �|D �}d �|�S )a Take a string or list of single-character strings, and return a string of the consecutive characters in that string collapsed into groups, as might be used in a regular expression '[a-z]' character set: 'a' -> 'a' -> '[a]' 'bc' -> 'bc' -> '[bc]' 'defgh' -> 'd-h' -> '[d-h]' 'fdgeh' -> 'd-h' -> '[d-h]' 'jklnpqrtu' -> 'j-lnp-rtu' -> '[j-lnp-rtu]' Duplicates get collapsed out: 'aaa' -> 'a' -> '[a]' 'bcbccb' -> 'bc' -> '[bc]' 'defghhgf' -> 'd-h' -> '[d-h]' 'jklnpqrjjjtu' -> 'j-lnp-rtu' -> '[j-lnp-rtu]' Spaces are preserved: 'ab c' -> ' a-c' -> '[ a-c]' Characters that are significant when defining regex ranges get escaped: 'acde[]-' -> r'\-\[\]ac-e' -> r'[\-\[\]ac-e]' )rk r3 c S s | dv rd| S | S )Nz\^-][�\r �rk r r r �escape_re_range_char� s z8_collapse_string_to_ranges.<locals>.escape_re_range_charc S s | S r? r rx r r r �no_escape_re_range_char� s z;_collapse_string_to_ranges.<locals>.no_escape_re_range_char� �rB Nr4 �-c s g | ] }� |��qS r r )�.0rk �ry r r � <listcomp>! r& z._collapse_string_to_ranges.<locals>.<listcomp>� )r �sortedrR r6 rp �groupbyrm rW � contextlib�suppressr �append�chrrs �join) r8 rv rz �retZs_charsrA �chars�first�lastr r r �_collapse_string_to_ranges� s( ( � r� )�llr3 c C sL g }g | �}|rH|� d�}t|t�r<t|t�s<||d d�< q |�|� q |S )Nr )rZ � isinstancer r r� )r� r� Zto_visit�ir r r �_flatten& s r� r{ r4 ��non_capturing_groups�_level)� word_list� max_levelr� r� r3 c C s� t t d�dd�}|dkr8| s&td��d| v r@td��n| s@dS t i �| ��} |dkr�td d � | D ��r�d �td d � | D �tdd��S dd�dd � | D ��� d�S g }d}|r�dnd}|t| ��D �]�\}} |�|� d }t � |�}d} d| v �r d} | � d� t| �dk�rt dd � | D ���rN|�|� dd�dd � | D ��� d| � �� n�||k �r�t t| �|||d d�} |�|� d|� | � d| � �� n|t dd � | D ���r�|�|� dd�dd � | D ��� d| � �� n<| jtdd� |�|� d|� d �d d � | D ��� d| � �� q�| �rnt � | d �} t| �dk�rV| �rV|�|� d|� | � d| � �� n|�|� | � | � �� q�|�|� q�d�|�S ) z� Create a regular expression string from a list of words, collapsing by common prefixes and optional suffixes. Calls itself recursively to build nested sublists for each group of suffixes that have a shared prefix. )�namelistc s sl t | �dkrHtj| dd� d�D ]&\}}|tdd� |D �t dd�fV q n | d d | d dd � gfV d S ) Nr4 c S s | d d� S rd r )r8 r r r r% C r& zOmake_compressed_re.<locals>.get_suffixes_from_common_prefixes.<locals>.<lambda>r| c S s g | ]}|d d� �qS �r4 Nr �r~ r8 r r r r� D r& zQmake_compressed_re.<locals>.get_suffixes_from_common_prefixes.<locals>.<listcomp>T�rB �reverser )r6 rp r� r� )r� �prefix�suffixesr r r �!get_suffixes_from_common_prefixesA s "z=make_compressed_re.<locals>.get_suffixes_from_common_prefixesr4 z&no words given to make_compressed_re()r� z%word list cannot contain empty stringr c s s | ]}t |�d kV qdS r� �r6 �r~ �wdr r r � <genexpr>W r& z%make_compressed_re.<locals>.<genexpr>�|c S s g | ]}t �|��qS r ��re�escaper� r r r r� Y r& z&make_compressed_re.<locals>.<listcomp>Tr� �[c s s | ]}t |�V qd S r? �rl r� r r r r� \ r& �]z?:�?c s s | ]}t |�d kV qdS r� r� r� r r r r� n r& c s s | ]}t |�V qd S r? r� r� r r r r� p r& r� �(�)c s s | ]}t |�d kV qdS r� r� r� r r r r� | r& c s s | ]}t |�V qd S r? r� r� r r r r� ~ r& c s s | ]}t �|�V qd S r? r� r� r r r r� � r& )r* r r �fromkeys�anyr� r� r6 r� r� r� �remove�all�make_compressed_re�sort) r� r� r� r� r� r� �sepZncgroup�initialr� ZtrailingZ suffix_re�suffixr r r r� 2 sl � "� � "�&� r� )� compat_name�fnr3 c s� t � d� �� dgtt�� �j�d d� kr@t� �� fdd��}nt� �� fdd��}d� j� d�|_| |_� j|_t � t j �r�� j |_ n&t � t �r�t� d �r�� jj |_ nd |_ � j|_tt|�S ) N�__func__rS r4 c s � | g|�R i |��S r? r )rS �args�kwargs�r� r r �_inner� s z replaced_by_pep8.<locals>._innerc s � | i |��S r? r )r� r� r� r r r� � s zDeprecated - use :class:`�`rT )r r* �inspect� signature� parametersr r r) r+ r� rP � FunctionType�__kwdefaults__�type�hasattrrT r( r r )r� r� r� r r� r �replaced_by_pep8� s r� )T)r{ )%r� r� � functoolsr r r� rp rP �typingr r r r r r r� rj r r ru r r9 r; r= r> rV r[ �dictrg rl rm �boolr� r* r� r� r� r r r r �<module> sP ( �� T ��� _
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка