o
�J�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
�d ed ed
efdd��Zed d
�d ed ed
efdd��Zed d
�d ed ed
efdd��ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� de�Z d ed
efd d �Z G d d � d �Z !d5d e
ee e f d"e d
efd#d$�Z d%e d
e!fd&d'�Z" (d6d!d)d*�d+e e d,ed-e d.ed
ef
d/d0�Z#d1ed2ed
efd3d4�Z$dS )7� 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 sv || j v r#tj| j� d|� d| j� dtt| |���� � d�dd� d S || jv r0t | ||� d S t
d| j� d|����)N�.� z is z and cannot be overridden� )�
stacklevelzno such ) r �warnings�warn�__name__�
_type_desc�str�getattr�upperr
�setattr�
ValueError)�cls�dname�value� r �LC:\pinokio\api\whisper-webui.git\app\env\lib\site-packages\pyparsing\util.py�_set s
,�
z__config_flags._setc C � | � |d�S )NT�r" �r �namer r r! �<lambda>$ � z__config_flags.<lambda>c C r# )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 rt |�k rn n
|| d dkrdS | |�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)r3 r4 �sr r r! �col( s
Br; 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.
r7 r r6 )�count)r3 r4 r r r! �lineno9 s r= c C sB |� dd| �}|�d| �}|dkr||d |� S ||d d� S )zh
Returns the line of text containing loc within a string, counting newlines as line separators.
r7 r r6 N)r9 �find)r3 r4 �last_cr�next_crr r r! �lineG s (rA c @ � e Zd Zdd� ZdS )�_UnboundedCachec sp i � � j �t� | _���fdd�}� fdd�}� fdd�}d | _t�|| �| _ t�|| �| _t�|| �| _d S )Nc �
� |��S �Nr ��_�key�� cache_get� not_in_cacher r! �getW �
z%_UnboundedCache.__init__.<locals>.getc s |� |< d S rE r �rG rH r ��cacher r! �set_Z � z&_UnboundedCache.__init__.<locals>.set_c � � � � d S rE ��clear�rG rO r r! rU ] rR z'_UnboundedCache.__init__.<locals>.clear)rL �objectrK �size�types�
MethodType�setrU )�selfrL rQ rU r )rP rJ rK r! �__init__R s z_UnboundedCache.__init__N�r r) r* r] r r r r! rC Q � rC c @ rB )�
_FifoCachec sz i � �| _ t� | _�� j�� j���fdd�}� ��fdd�}� fdd�}t�|| �| _t�|| �| _t�|| �| _d S )Nc rD rE r rF rI r r! rL n rM z _FifoCache.__init__.<locals>.getc s8 |� |< t � ��kr�tt� ��� t � ��ks
d S d S rE )r8 �next�iterrN )rP � cache_poprX r r! rQ q s �z!_FifoCache.__init__.<locals>.set_c rS rE rT rV rO r r! rU w rR z"_FifoCache.__init__.<locals>.clear) rX rW rK rL �poprY rZ r[ rU )r\ rX rL rQ rU r )rP rJ rc rK rX r! r] g s z_FifoCache.__init__Nr^ r r r r! r` f r_ r` 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 rE )� _capacity�_active�_memory)r\ �capacityr r r! r] � s
zLRUMemo.__init__c C s< z| j | W S ty | j�|�| j|< | j| Y S w rE )rg �KeyErrorrh rd �r\ rH r r r! � __getitem__� s �zLRUMemo.__getitem__c C s | j �|d � || j|< d S rE )rh rd rg )r\ rH r r r r! � __setitem__� s zLRUMemo.__setitem__c C sd z| j �|�}W n
ty Y d S w t| j�d | jd � }|D ]}| j�|� q"|| j|< d S �Nr6 )rg rd rj r, rh rf )r\ rH r Z oldest_keysZ
key_to_deleter r r! � __delitem__� s �zLRUMemo.__delitem__c C s | j �� | j�� d S rE )rg rU rh �r\ r r r! rU � s
z
LRUMemo.clearN) r r) r* r+ r] rl rm ro rU r r r r! re s re c @ s e Zd ZdZdd� ZdS )�
UnboundedMemoz<
A memoizing mapping that retains all deleted items
c C s d S rE r rk r r r! ro � � zUnboundedMemo.__delitem__N)r r) r* r+ ro r r r r! rq � s rq r: c C s: dD ]
}| � |t| �} q| � dd�} | � dd�} t| �S )Nz\^-[]r7 z\n� z\t)�replace�_bslashr )r: �cr r r! �_escape_regex_range_chars� s
rw c @ s, e Zd ZdZd dd�Zdedefdd�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']))
r5 Nc C s d| _ t�� | _d| _d S )Nr �����)�prev� itertoolsr< �counterr rp r r r! r] � s
z_GroupConsecutive.__init__�charc C s4 t |�}|| j| _}|| dkrt| j�| _| jS rn )�ordrz ra r| r )r\ r} �c_intrz r r r! �__call__� s
z_GroupConsecutive.__call__)r5 N)r r) r* r+ r] r �intr� r r r r! rx � s
rx T� re_escapec s$ dt dt fdd�� dt dt fdd�}|s|� g }tt| ��}t|�dkr�tj|t� d�D ]V\}}t|� }}t� t
��
|�^ }}W d � n1 sKw Y ||kr\|� � |�� q,|t t
|�d
�krt|� � |�� � |�� �� q,|� � |�� d � |�� �� q,n � 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]'
rv r5 c S s | dv rd| S | S )Nz\^-][�\r �rv r r r! �escape_re_range_char� s z8_collapse_string_to_ranges.<locals>.escape_re_range_charc S s | S rE r r� r r r! �no_escape_re_range_char� rr z;_collapse_string_to_ranges.<locals>.no_escape_re_range_char� �rH Nr6 �-c s g | ]}� |��qS r r )�.0rv �r� r r! �
<listcomp>! s z._collapse_string_to_ranges.<locals>.<listcomp>� )r �sortedr[ r8 r{ �groupbyrx ra �
contextlib�suppressr �append�chrr~ �join) r: r� r� �retZs_charsrG �chars�first�lastr r� r! �_collapse_string_to_ranges� s, � ��
r� �llc C sN g }g | �}|r%|� d�}t|t�r t|t�s ||d d�< n|�|� |s|S )Nr )rd �
isinstancer r r� )r� r� �to_visit�ir r r! �_flatten& s
�r� r� r6 ��non_capturing_groups�_level� word_list� max_levelr� r� c
C sz dt t fdd�}|dkr | std��d| v rtd��n| s dS t i �| ��} |dkrQtd d
� | D ��rCd �td d
� | D �tdd��S dd�dd
� | D ��� d�S g }d}|rYdnd}|t| ��D ]�\}} |�|� d }t �
|�}d}
d| v r~d}
| � d� t| �dk�rt dd
� | D ��r�|�|� dd�dd
� | D ��� d|
� �� qa||k r�t
t| �|||d d�} |�|� d|� | � d|
� �� qat dd
� | D ��r�|�|� dd�dd
� | D ��� d|
� �� qa| jtdd� |�|� d|� d �d d
� | D ��� d|
� �� qa| �r2t �
| d �} t| �dk�r&|
�r&|�|� d|� | � d|
� �� qa|�|� | � |
� �� qa|�|� qad�|�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 sp � t | �dkr&tj| dd� d�D ]\}}|tdd� |D �t dd�fV qd S | d d | d dd � gfV d S )
Nr6 c S s | d d� S rn r )r: 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 �r6 Nr �r� r: r r r! r� D s zQmake_compressed_re.<locals>.get_suffixes_from_common_prefixes.<locals>.<listcomp>T�rH �reverser )r8 r{ r� r� )r� �prefix�suffixesr r r! �!get_suffixes_from_common_prefixesA s � �$z=make_compressed_re.<locals>.get_suffixes_from_common_prefixesr6 z&no words given to make_compressed_re()r� z%word list cannot contain empty stringr c s s � | ] }t |�d kV qdS r� �r8 �r� �wdr r r! � <genexpr>W � � z%make_compressed_re.<locals>.<genexpr>�|c S s g | ]}t �|��qS r ��re�escaper� r r r! r� Y s z&make_compressed_re.<locals>.<listcomp>Tr� �[c s � � | ]}t |�V qd S rE �rw r� r r r! r� \ � � �]z?:�?c s � � | ] }t |�d kV qdS r� r� r� r r r! r� n r� c s r� rE r� r� r r r! r� p r� r� �(�)c s r� r� r� r� r r r! r� | r� c s r� rE r� r� r r r! r� ~ r� c s s � | ]}t �|�V qd S rE r� r� r r r! r� � s � )r, r r �fromkeys�anyr� r� r8 r� r� r� �remove�all�make_compressed_re�sort)
r� r� r� r� r� r� �sepZncgroup�initialr� �trailingZ suffix_re�suffixr r r! r� 2 sn ��
"�� "�&�
r� � compat_name�fnc s� t � d� �� dgtt�� �j�d d� kr t� �� fdd��}n
t� �� fdd��}d� j� d�|_| |_� j|_t � t
j �rD� j |_ nt � t
�rTt� d �rT� jj |_ nd |_ � j|_tt|�S )
N�__func__r\ r6 c s � | g|�R i |��S rE r )r\ �args�kwargs�r� r r! �_inner� s z replaced_by_pep8.<locals>._innerc s � | i |��S rE r )r� r� r� r r! r� � s zDeprecated - use :class:`�`r] )r r, �inspect� signature�
parametersr r r+ r- r� rY � FunctionType�__kwdefaults__�type�hasattrr] r* r r
)r� r� r� r r� r! �replaced_by_pep8� s
r� )T)r� )%r� r� � functoolsr r r� r{ rY �typingr r r r r r r� ru r
r r� r r; r= rA rC r` re �dictrq rw rx �boolr� r, r� r� r� r r r r! �<module> s`
( ���
�T������
�_