|
Server : Apache System : Linux iad1-shared-b8-43 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64 User : dh_edsupp ( 6597262) PHP Version : 8.2.26 Disable Function : NONE Directory : /lib/python3/dist-packages/mercurial/__pycache__/ |
Upload File : |
o
�]Lb]) � @ s d dl mZ ddlmZ ddlmZ ddlmZmZmZ dZ dZ
dZ d Z d
d d d
d
ddddddddddd�Z
h d�Zi ZdZdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Z d/d0� Z d1d2� Z d3d4� Z d5d6� Z d7d8� Z!d9S ):� )�absolute_import� )�_)�getattr)�error�parser�pycompatg �?� �
�2 )� N)� groupr � ))� funcr r N)� NN)� kindpatr N)� N)� negate� )� minusr N)r
N)� notr
NN)r NN)� andr N)� NN)� orr N)� NN)� listr N)r NNNN)r � symbolNNN)r � stringNNN)� (� :� -r � !r � &r � |� +� ,r r r � end> r r r s
.*{}[]?/\_c c s� � dt | �}}t�| �} ||k r�| | }|�� rn�|dv r%|d |fV n�|dv s7|dkr�| ||d � dv r�|dkrH|d7 }| | }dd � }ntj}|d7 }|}||k r{| | }|d
krb|d7 }qQ||krsd || ||� �|fV n|d7 }||k sUt�td �|��nW|� � s�|t
v s�t |�d
kr�|}|d7 }||k r�| | }|� � s�|t
v s�t |�d
ks�n|d7 }||k s�| ||� }|t v r�|d |fV nd||fV |d8 }nt�td�|��|d7 }||k sdd |fV d S )Nr s (),-:|&+!s "'� rr )s r's r"r c S s | S �N� ��xr) r) �7/usr/lib/python3/dist-packages/mercurial/filesetlang.py�<lambda>D s ztokenize.<locals>.<lambda>� \r s unterminated string� r s syntax errorr& )
�lenr �bytestr�isspacer � unescapestrr �
ParseErrorr �isalnum� globchars�ord�keywords)�program�pos�l�c�decode�s�d�symr) r) r, �tokenize3 sb �
�
� �
�0rA c C sH t � t�}|�t| ��\}}|t| �kr t�td�|��t �|ddh�S )Ns
invalid tokenr r ) r �elements�parserA r0 r r4 r �simplifyinfixops)�expr�p�treer: r) r) r, rC i s
rC c C s& | r | d dkr | d S t �td���)Nr r r s not a symbol)r r4 r r* r) r) r, � getsymbolq s rH c C s. | r| d dks| d dkr| d S t �|��)Nr r r r )r r4 )r+ �errr) r) r, � getstringw s
rJ c C s8 t | �}t||�}||vrt�td�| ��d||f S )Ns invalid pattern kind: %ss %s:%s)rH rJ r r4 r )r+ �y�allkindsrI �kind�patr) r) r, �
getkindpat} s
rO c C s0 | r| d dkrt | d | d ||�S t| |�S )Nr r r r )rO rJ )r+ rL rI r) r) r, �
getpattern� s
rP c C s* | sg S | d dkrt | dd � �S | gS )Nr r r )�listr* r) r) r, �getlist� s
rR c C s. t | �}t|�|k st|�|krt�|��|S r( )rR r0 r r4 )r+ �min�maxrI r; r) r) r, �getargs� s
rU c C sH | d u r| S | d }|dv r| S |dkr't | d � t| d �}|| d |fS |dkr1t| d �S |dkr<t�td���|d krJt| d �}||fS |d
kr_t| d �}t| d �}|||fS |d krptd
| d d | d ff�S |d v r�td
d� | dd � D ��}|f| S |dkr�t | d � t| d �}|| d |fS t�d| ��)Nr � r r r r r r
r s) can't use negate operator in this contextr r r � r r c s � � | ]}t |�V qd S r( )�_analyze��.0rK r) r) r, � <genexpr>� � � z_analyze.<locals>.<genexpr>r � invalid operator %r)rH rY r r4 r �tuple�ProgrammingError)r+ �op�t�ta�tb�tsr) r) r, rY � s<
rY c C s� | du rd| fS | d }|dv rd| fS |dkr&t | d �\}}|||ffS |dkrXt | d �\}}t | d �\}}|| }|rQ|rQ|d |||fd
d �|�fffS ||||ffS |d kr�td
d� | dd� D �� \} }
t| d�}tdd� | D ��dkr�|d |f|
d
d �|�fffS ||f|
fS |dkr�tdd� | dd� D �� \} }
t| d�|f|
fS |dkr�t| d �} t | d �\}}tt�| �dd�r�| fd || d |fd
| fffS d|| d |ffS t� d| ��)am Insert hint nodes where status should be calculated (first path)
This works in bottom-up way, summing up status names and inserting hint
nodes at 'and' and 'or' as needed. Thus redundant hint nodes may be left.
Returns (status-names, new-tree) at the given subtree, where status-names
is a sum of status names referenced in the given subtree.
Nr) r � r r r r r r r �
withstatusr � r c s rX r( ��_insertstatushintsrZ r) r) r, r\ � r] z%_insertstatushints.<locals>.<genexpr>c s rX r( )�bool)r[ �hr) r) r, r\ � r] r c s rX r( ri rZ r) r) r, r\ � r] r � _callstatusFr^ )
rj �join�zip�sumrH r �symbols�getr r` ) r+ ra rl rb �harc �hbrd �hr�hsre �fr) r) r, rj � s>
rj c s | du r| S | d }|dkr&� rt | d � �S t | d dd�}||| d fS |dv r,| S |d kr;t | d � �}||fS |d
krRt | d � �}t | d � �}|||fS |d v rjt� fd d
�| dd� D ��}|f| S |dkr}t | d dd�}|| d |fS t�d| ��)zsRemove redundant status hint nodes (second path)
This is the top-down path to eliminate inner hint nodes.
Nr rg r T��instatusr rf r r rW c 3 s � | ]}t |� �V qd S r( )�_mergestatushintsrZ rx r) r, r\ s � z$_mergestatushints.<locals>.<genexpr>r Fr^ )rz r_ r r` )r+ ry ra rb rc rd re r) rx r, rz � s0
rz c C s t | �}t|�\}}t|dd�S )z�Transform raw parsed tree to evaluatable tree which can be fed to
optimize() or getmatch()
All pseudo operations should be mapped to real operations or functions
defined in methods or symbols table respectively.
Frx )rY rj rz )r+ rb �_hr) r) r, �analyze
s r| c C s, |d ur|d dkrd||d fS | ||fS )Nr r r r r) )ra rc rd r) r) r, �_optimizeandops s
r} c C s� g g g }}}| D ]"}t |�\}}|d ur"|d dv r"|�|� q
|�|� |�|� q
|r=|�t� |�dt|� � ||fS )Nr rf )s patterns)� _optimize�append�WEIGHT_CHECK_FILENAMEr_ )�xs�wsre �ssr+ �wrb r) r) r, �_optimizeunion s
r� c
s� | d u rd| fS | d }|dkr!t | d �\}}|||| d ffS |dv r)t| fS |dkr>t | d �\}}||| d |ffS |dkrPt | d �\}}|||ffS |dkrxt | d �\}}t | d �\}}||krp|t|||�fS |t|||�fS |d kr�t| dd � �\� }t|�dkr�� d |d fS td
d � tt|�� fd d
�d�D ��}t� �|f| fS |dkr�t dd � | dd � D �� \� }t
� �|f| fS |dkr�t | d �} t t
�| �dd�}t | d �\}}|| || d |ffS t�d| ��)Nr rg r r rV r r r r c s s � | ]}|d V qdS )r Nr) )r[ �itr) r) r, r\ G s �
�z _optimize.<locals>.<genexpr>c s � | d S )Nr r) )r� �r� r) r, r- H s z_optimize.<locals>.<lambda>)�keyr c s rX r( �r~ rZ r) r) r, r\ L r] r �_weightr^ )r~ r� r} r� r0 r_ �sorted� enumeraterT ro rp rH r rq rr r r` )
r+ ra r� rb �warc �wbrd re rw r) r� r, r~ , sJ � r~ c C s t | �\}}|S )zsReorder/rewrite evaluatable tree for optimization
All pseudo operations should be transformed beforehand.
r� )r+ �_wrb r) r) r, �optimizeV s r� c C s t �| d�S )N)r r )r � prettyformat)rG r) r) r, r� _ s r� N)"�
__future__r �i18nr r r � r r r� �WEIGHT_READ_CONTENTS�
WEIGHT_STATUS�WEIGHT_STATUS_THOROUGHrB r8 rq r6 rA rC rH rJ rO rP rR rU rY rj rz r| r} r� r~ r� r� r) r) r) r, �<module> sX �6"," *