HOME


Mini Shell 1.0
DIR: /snap/certbot/4482/lib/python3.12/site-packages/pyparsing/__pycache__/
Upload File :
Current File : //snap/certbot/4482/lib/python3.12/site-packages/pyparsing/__pycache__/util.cpython-312.pyc
�

�S�g�2�	��ddlZddlmZmZddlZddlZddlZddlmZm	Z	m
Z
mZmZddl
Z
ed�Zede��ZGd�d�Zed	�
�deded
efd��Zed	�
�deded
efd��Zed	�
�deded
efd��ZGd�d�ZGd�d�ZGd�d�ZGd�de�Zded
efd�ZGd�d�Z	d(de	ee
efded
efd�Zde
d
e fd �Z!	d)d!e
ed"ed#ed
efd$�Z"d%ed&ed
efd'�Z#y)*�N)�	lru_cache�wraps)�Callable�Union�Iterable�TypeVar�cast�\�C)�boundc�r�eZdZUdZgZeeed<gZeeed<dZ	e
d��Ze
d��Ze
d��Z
y)	�__config_flagsz=Internal class for defining compatibility and debugging flags�
_all_names�_fixed_names�
configurationc�>�||jvrYtj|j�d|�d|j�dtt
||��j��d�d��y||jvrt|||�ytd|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�values   �~/build/snapcraft-certbot-29b1212f749eeba2f1dece1adfe9a83a/parts/certbot/install/lib/python3.12/site-packages/pyparsing/util.py�_setz__config_flags._sets����C�$�$�$��M�M��<�<�.��%���#�.�.�)9��c�'�#�u�BU�>V�>\�>\�>^�=_�+�-��
�

��C�N�N�"��C���&��x����'7�q��	�B�C�C�c�&�|j|d�S)NT�r$�r �names  r#�<lambda>z__config_flags.<lambda>#s��3�8�8�D�$�+?�r%c�&�|j|d�S)NFr'r(s  r#r*z__config_flags.<lambda>$s��C�H�H�T�5�,A�r%N)r�
__module__�__qualname__�__doc__r�listr�__annotations__rr�classmethodr$�enable�disable�r%r#rrsR��G��J��S�	�� �L�$�s�)� � �J��D��D��?�
@�F��A�B�Gr%r�)�maxsize�loc�strg�returnc�z�|}d|cxkrt|�krnn
||dz
dk(rdS||jdd|�z
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)r7r8�ss   r#�colr@'sG��	
�A��C� �#�a�&� �Q�s�Q�w�Z�4�%7�1�X�S�1�7�7�4�QR�TW�CX�=X�Xr%c�.�|jdd|�dzS)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.
    r<rr;)�count)r7r8s  r#�linenorC8s���:�:�d�A�s�#�a�'�'r%c�v�|jdd|�}|jd|�}|dk\r||dz|S||dzdS)zh
    Returns the line of text containing loc within a string, counting newlines as line separators.
    r<rr;N)r>�find)r7r8�last_cr�next_crs    r#�linerHFsM��
�j�j��q�#�&�G��i�i��c�"�G�*1�Q�,�4��!��g�&�O�D��1���<O�Or%c��eZdZd�Zy)�_UnboundedCachec�����i��j�t�x|_���fd�}�fd�}�fd�}d|_t	j
||�|_t	j
||�|_t	j
||�|_y)Nc����|��S�Nr4��_�key�	cache_get�not_in_caches  ��r#�getz%_UnboundedCache.__init__.<locals>.getV�����S�,�/�/r%c���|�|<yrMr4)rOrPr"�caches   �r#�set_z&_UnboundedCache.__init__.<locals>.set_Ys����E�#�Jr%c�&���j�yrM��clear�rOrVs �r#rZz'_UnboundedCache.__init__.<locals>.clear\�����K�K�Mr%)rS�objectrR�size�types�
MethodType�setrZ)�selfrSrWrZrVrQrRs    @@@r#�__init__z_UnboundedCache.__init__Qst������I�I�	�+1�8�3���L�	0�	�	���	��#�#�C��.����#�#�D�$�/����%�%�e�T�2��
r%N�rr,r-rcr4r%r#rJrJPs��3r%rJc��eZdZd�Zy)�
_FifoCachec�8������i��|_t�x|_��j��j���fd�}���fd�}�fd�}tj||�|_tj||�|_tj||�|_y)Nc����|��SrMr4rNs  ��r#rSz _FifoCache.__init__.<locals>.getmrTr%c���|�|<t���kDr*�tt����t���kDr�)yyrM)r=�next�iter)rOrPr"rV�	cache_popr^s   ���r#rWz!_FifoCache.__init__.<locals>.set_ps7����E�#�J��e�*�t�#��$�t�E�{�+�,��e�*�t�#r%c�&���j�yrMrYr[s �r#rZz"_FifoCache.__init__.<locals>.clearvr\r%)	r^r]rRrS�popr_r`rarZ)	rbr^rSrWrZrVrQrlrRs	 `   @@@@r#rcz_FifoCache.__init__fs}�������	�+1�8�3���L��I�I�	��I�I�	�	0�	-�	��#�#�C��.����#�#�D�$�/����%�%�e�T�2��
r%Nrdr4r%r#rfrfes��3r%rfc�.�eZdZdZd�Zd�Zd�Zd�Zd�Zy)�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�.�||_i|_i|_yrM)�	_capacity�_active�_memory)rb�capacitys  r#rczLRUMemo.__init__�s��!��������r%c��	|j|S#t$r:|jj|�|j|<|j|cYSwxYwrM)rs�KeyErrorrtrn�rbrPs  r#�__getitem__zLRUMemo.__getitem__�sQ��	%��<�<��$�$���	%� $��� 0� 0�� 5�D�L�L����<�<��$�$�	%�s��AA�Ac�Z�|jj|d�||j|<yrM)rtrnrs)rbrPr"s   r#�__setitem__zLRUMemo.__setitem__�s$��������d�#�!����S�r%c��	|jj|�}t|j�d|jdz}|D]}|jj|��||j|<y#t
$rYywxYw�Nr;)rsrnr/rtrrrw)rbrPr"�oldest_keys�
key_to_deletes     r#�__delitem__zLRUMemo.__delitem__�s���	&��L�L�$�$�S�)�E��t�|�|�,�-D����!�1C�/D�E�K�!,�
0�
���� � ��/�
0� %�D�L�L����
�	��	�s�A5�5	B�Bc�l�|jj�|jj�yrM)rsrZrt�rbs r#rZz
LRUMemo.clear�s"�������������r%N)	rr,r-r.rcryr{r�rZr4r%r#rprp~s ����
%�"�	&�r%rpc��eZdZdZd�Zy)�
UnboundedMemoz<
    A memoizing mapping that retains all deleted items
    c��yrMr4rxs  r#r�zUnboundedMemo.__delitem__�s��r%N)rr,r-r.r�r4r%r#r�r��s���
r%r�r?c��dD]}|j|t|z�}�|jdd�}|jdd�}t|�S)Nz\^-[]r<z\n�	z\t)�replace�_bslashr)r?�cs  r#�_escape_regex_range_charsr��sN��
�&��
�I�I�a��1��%��&�	�	�	�$���A�	�	�	�$���A��q�6�Mr%c�&�eZdZdZd�Zdedefd�Zy)�_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']))
    c�R�d|_tj�|_d|_y)Nr���)�prev�	itertoolsrB�counterr"r�s r#rcz_GroupConsecutive.__init__�s����	� ���(�����
r%�charr9c��t|�}||jc|_}||z
dkDrt|j�|_|jSr})�ordr�rjr�r")rbr��c_intr�s    r#�__call__z_GroupConsecutive.__call__�sB���D�	��������	�4��4�<�!���d�l�l�+�D�J��z�z�r%N)rr,r-r.rcr�intr�r4r%r#r�r��s��	��
�S��S�r%r��	re_escapec��dtdtfd�}dtdtfd�}|s|}g}tt|��}t|�dkDr�t	j
|t
���D]�\}}t|�x}}	tjt�5|�^}}	ddd�||	k(r|j||���W|	tt|�dz�k(r"|j||��||	������|j||��d	||	������n|D�
cgc]
}
||
���}}
d
j|�S#1swY��xYwcc}
w)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]'
    r�r9c��|dvrd|zS|S)Nz\^-][�\r4�r�s r#�escape_re_range_charz8_collapse_string_to_ranges.<locals>.escape_re_range_char�s����=�t�a�x�/�a�/r%c��|SrMr4r�s r#�no_escape_re_range_charz;_collapse_string_to_ranges.<locals>.no_escape_re_range_char�s���r%��rPNr;�-�)r�sortedrar=r��groupbyr�rj�
contextlib�suppressr�append�chrr��join)r?r�r�r��ret�s_charsrO�chars�first�lastr�s           r#�_collapse_string_to_rangesr��sb��@0��0��0��3��3���6��
�C� ��A���G�
�7�|�a��"�)�)�'�7H�7J�K�	�H�A�u� ��;�&�E�D��$�$�Z�0�
!� ���D�
!���}��
�
�/��6�7���S��Z�!�^�,�,��
�
�2�5�9�:�;O�PT�;U�:V�W�X�
�
�
�+�E�2�3�1�5I�$�5O�4P�Q��)	�<18�8�1�#�A�&�8��8�
�7�7�3�<��7
!�
!��29s�E�$E�E	�llc��g}g|�}|rK|jd�}t|t�rt|t�s||ddn|j	|�|r�K|S)Nr)rn�
isinstancerrr�)r�r��to_visit�is    r#�_flattenr�%sU��
�C���u�H�
��L�L��O���a��"�:�a��+=��H�R�a�L��J�J�q�M���Jr%�	word_list�	max_level�_levelc�b�dttfd�}|dk(r!djt|td���Sg}d}|t|��D�]O\}}|j|�d}d}d|vrd}|j
d�t	|�d	kDr�td
�|D��r)|j|�ddj|��d|����|||kr3tt|�||d	z�}	|j|�d
|	�d|�����|jtd��|j|�d
dj|��d|�����|rI|d}
t	|
�d	kDr|r|j|�d
|
�d|�����&|j|�|
�|�����?|j|���Rdj|�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
3��K�t|�dkDrHtj|d���D],\}}|t|D�cgc]}|dd��	c}td��f���.y|dd|dddgf��ycc}w�w)Nr;c��|ddSr}r4)r?s r#r*zOmake_compressed_re.<locals>.get_suffixes_from_common_prefixes.<locals>.<lambda>>s��a�PR�QR�e�r%r�T�rP�reverser)r=r�r�r�)r��prefix�suffixesr?s    r#�!get_suffixes_from_common_prefixesz=make_compressed_re.<locals>.get_suffixes_from_common_prefixes<s������x�=�1��$-�$5�$5�h�O�$T�
W� ����f�X�%>��a���e�%>�C�QU�V�V�V�
W��1�+�a�.�8�A�;�q�r�?�"3�3�3��&?�s�7A2�A-�-A2r�|Tr�r��?r;c3�8K�|]}t|�dk(���y�w)r;N)r=)�.0r?s  r#�	<genexpr>z%make_compressed_re.<locals>.<genexpr>Rs����1�1�3�q�6�Q�;�1�s��[�]�(�))
r/rr�r�r=r��remove�all�make_compressed_re�sort)r�r�r�r�r��sep�initialr��trailing�	suffix_re�suffixs           r#r�r�1s���4�D��I�4��A�~��x�x��y�c�4�@�A�A�
�C�
�C�>�v�i�?P�Q�$�����
�
�3������
��>��H��O�O�B���x�=�1���1��1�1��
�
�g�Y�a�����(9�':�!�H�:�F�G��I�%� 2��x�(�)�V�a�Z�!�I��J�J�'��!�I�;�a��z�B�C��M�M�c�4�M�8��J�J�'��!�C�H�H�X�,>�+?�q��
�K�L��!�!����v�;��?�x��J�J�'��!�F�8�1�X�J�?�@��J�J�'��6�(�8�*�=�>��
�
�7�#�;$�<�7�7�3�<�r%�compat_name�fnc�<��t�d���dgttj��j�ddk(rt���fd��}nt���fd��}d�j�d�|_||_�j|_t�tj�r�j|_n?t�t�r(t�d�r�jj|_nd|_�j |_t#t$|�S)	N�__func__rbr;c����|g|��i|��SrMr4)rb�args�kwargsr�s   �r#�_innerz replaced_by_pep8.<locals>._innerts���
�d�,�T�,�V�,�,r%c����|i|��SrMr4)r�r�r�s  �r#r�z replaced_by_pep8.<locals>._inner}s���
�t�&�v�&�&r%zDeprecated - use :class:`�`rc)rr/�inspect�	signature�
parametersrrr.r0r�r_�FunctionType�__kwdefaults__�type�hasattrrcr-r	r)r�r�r�s ` r#�replaced_by_pep8r�is����

��Z��	$�B�	�x�4��)�)�"�-�8�8�9�"�1�=�=�	�r��	-�
�	-�
�r��	'�
�	'�3�2�;�;�-�q�C�F�N�!�F�O��/�/�F���"�e�(�(�)� "� 1� 1���	�B��	�'�"�j�"9� "��� :� :��� $����/�/�F����6�?�r%)T)r�r;)$r��	functoolsrrr�r�r_�typingrrrrr	rr�r�rrr�rr@rCrHrJrfrp�dictr�r�r��boolr�r/r�r�r�r4r%r#�<module>r�s����&����;�;��

�b�'���C�x� ��C�C�2�3��
Y�S�
Y��
Y��
Y��
Y� �3��
(��
(�3�
(�3�
(��
(��3��P�c�P��P��P��P�3�3�*3�3�2%�%�P
�D�
��������459�Q��S�(�3�-�
� �Q�-1�Q��Q�h	��	�d�	�AB�5���}�5�),�5�:=�5��5�p%�#�%�1�%��%r%