ROOTPLOIT
Server: Apache
System: Linux info 3.0 #1337 SMP Tue Jan 01 00:00:00 CEST 2000 all GNU/Linux
User: ws67150586 (67150586)
PHP: 8.3.36
Disabled: NONE
Upload Files
File: //kunden/kunden/kunden/lib/python3/dist-packages/mercurial/__pycache__/filesetlang.cpython-313.pyc
�

6�h;)����SSKJr SSKJr SSKJrJrJr SrSr	Sr
SrS	S
SSSS
S
SSSSSSSSS.r1Skr
0rSrSrSrSrSrSrSrSrSrSrSrS rS!rS"rS#rS$rS%rS&r g')(�)�annotations�)�_)�error�parser�pycompatg�?��
�2)�N)�groupr�))�funcrrN)�NN)�kindpatrN)�N)�negate�)�minusrN)r
N)�notr
NN)rNN)�andrN)�NN)�orrN)�NN)�listrN)rNNNN)r�symbolNNN)r�stringNNN)�(�:�-r�!r�&r�|�+�,rrr�end>rrrs
.*{}[]?/\_c#�~# �S[U5p![R"U5nX:Ga�XnUR5(aGObUS;a	USU4v� GOSUS;dUS:Xa�XUS-S;a�US:Xa
US-
nXnSnO[R
nUS-
nUnX:a2XnUS	:XaUS-
nMXc:XaS
U"XU5U4v� O�US-
nX:aM2[R"[S5U5eUR5(dU[;d[U5S:�amUnUS-
nX:a?XnUR5(dU[;d[U5S:�dOUS-
nX:aM?XUnU[;aUSU4v� OS
Xu4v� US-nO [R"[S5U5eUS-
nX:aGM�SSU4v� g7f)Nrs	(),-:|&+!s"'�rr)sr'sr"rc��U$�N���xs �7/usr/lib/python3/dist-packages/mercurial/filesetlang.py�<lambda>�tokenize.<locals>.<lambda>Cs��1��\rsunterminated string�rssyntax errorr&)
�lenr�bytestr�isspacer�unescapestrr�
ParseErrorr�isalnum�	globchars�ord�keywords)�program�pos�l�c�decode�s�d�syms        r.�tokenizerE2s����
��G������w�'�G�

�'��L���9�9�;�;��
�,�
��d�C�.� �
��K��D�y��c�A�g�&�.�8��D�y��q����L��$���+�+���1�H�C��A��'��L����:��1�H�C���6�$�f�W�s�^�&<�a�@�@���q����'��&�&�q�)?�'@�!�D�D�
�Y�Y�[�[�A��N�c�!�f�s�l��A��1�H�C��'��L���	�	���q�I�~��Q��#����q���	�'�
�C�.�C��h���D�!�n�$� �#�)�)��1�H�C��"�"�1�_�#5�s�;�;��q���_�'�`�4��
��s�C	F=�
BF=�&AF=�5F=c��[R"[5nUR[U55up#U[	U5:wa [
R"[S5U5e[R"USS15$)Ns
invalid tokenrr)	r�elements�parserEr4rr8r�simplifyinfixops)�expr�p�treer>s    r.rHrHhsa���
�
�h��A�������'�I�D�
�c�$�i�����q�!1�2�C�8�8��"�"�4�'�5�)9�:�:r1c�j�U(aUSS:XaUS$[R"[S55e)Nrrrsnot a symbol)rr8rr,s r.�	getsymbolrNps/���Q�q�T�Y�
���t��
�
�
�1�_�-�
.�.r1c�j�U(aUSS:Xd	USS:XaUS$[R"U5e)Nrrrr)rr8)r-�errs  r.�	getstringrQvs5���a��d�i��1�Q�4�9�#4���t��
�
�
�3�
�r1c��[U5n[X5nXB;a"[R"[	S5U-5eSXE4-$)Nsinvalid pattern kind: %ss%s:%s)rNrQrr8r)r-�y�allkindsrP�kind�pats      r.�
getkindpatrW|sD���Q�<�D�
�A�
�C������q�!<�=��D�E�E��t�k�!�!r1c�^�U(aUSS:Xa[USUSX5$[X5$)Nrrrr)rWrQ)r-rTrPs   r.�
getpatternrY�s2���Q�q�T�Z�
��!�A�$��!��h�4�4��Q��r1c�H�U(d/$USS:Xa[USS5$U/$)Nrrr)�listr,s r.�getlistr\�s,����	���t�w���A�a�b�E�{��
�3�Jr1c��[U5n[U5U:d[U5U:�a[R"U5eU$r*)r\r4rr8)r-�min�maxrPr?s     r.�getargsr`�s6����
�A�
�1�v��|�s�1�v��|����s�#�#��Hr1c�b�UcU$USnUS;aU$US:Xa#[US5 [US5nXSU4$US:Xa[US5$US:Xa[R"[	S55eUS	:Xa[US5nX4$US
:Xa [US5n[US5nXU4$US:Xa[S
USS	US445$US;a[S
USS55nU4U-$US:Xa#[US5 [US5nXSU4$[R"SU-5e)Nr�rrrrrr
rs)can't use negate operator in this contextrrr�rrc3�8# �UHn[U5v� M g7fr*)�_analyze��.0rSs  r.�	<genexpr>�_analyze.<locals>.<genexpr>�s���.��1�8�A�;�;����r�invalid operator %r)rNrerr8r�tuple�ProgrammingError)r-�op�t�ta�tb�tss      r.rere�s^���y���	
�1��B�	�
#�#���	�Z���!�A�$���Q�q�T�N���a�D�!�}��	�X�~���!��~��	�Y�����q�!M�N�O�O�	�V�|��Q�q�T�N���w��	�V�|�
�a��d�^��
�a��d�^����|��	�X�~����1����!��~�6�7�7�	�
��
�.��!�"��.�
.���u�r�z��	�W�}��!�A�$��
�a��d�^���a�D�"�~��
�
 �
 �!7�"�!<�
=�=r1c��UcSU4$USnUS;aSU4$US:Xa[US5up#X!U44$US:XaQ[US5upE[US5upgXF-nU(a!U(aUS	XU4S
SRU5444$X�XW44$US:XaY[S
USS56up�[U	S5n[SU	55S:�aUS	U4U
-S
SRU5444$X�4U
-4$US:Xa&[SUSS56up�[U	S5U4U
-4$US:Xa[[	US5n[US5upE[[RU5SS5(aU4S	XSU4S
U444$SXSU44$[R"SU-5e)aYInsert 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�rrrrrrr�
withstatusr� rc3�8# �UHn[U5v� M g7fr*��_insertstatushintsrfs  r.rh�%_insertstatushints.<locals>.<genexpr>�����<�e��)�!�,�,�e�rjc3�8# �UHn[U5v� M g7fr*)�bool)rg�hs  r.rhrz�s���#��1�t�A�w�w��rjrc3�8# �UHn[U5v� M g7fr*rxrfs  r.rhrz�r{rjr�_callstatusFrk)
ry�join�zip�sumrN�getattr�symbols�getrrm)r-rnr~ro�harp�hbrq�hr�hsrr�fs            r.ryry�s���	�y��1�u��	
�1��B�	�
/�/��1�u��	�V�|�!�!�A�$�'����q�'�z��	�V�|�#�A�a�D�)���#�A�a�D�)���
�W��
�"��
���|�i����2��5O�P�P�P���<���	�U�{��<�a���e�<�=���
��R�[���#��#�#�a�'��
��u�r�z�I�t�y�y��}�3M�N�N�N��5�2�:�~��	�W�}��<�a���e�<�=����2�r�{�R�E�B�J�&�&�	�W�}��a��d�O��#�A�a�D�)����7�;�;�q�>�=�%�8�8��4�-�"��d�B��)�Q��H�H�H��B�!��b�>�!�!�
�
 �
 �!7�"�!<�
=�=r1c�^�UcU$USnUS:Xa*T(a[UST5$[USSS9nX#US4$US;aU$US	:Xa[UST5nX#4$US
:Xa"[UST5n[UST5nX$U4$US;a[U4SjUSS55nU4U-$US
:Xa[USSS9nX SU4$[R"SU-5e)zkRemove redundant status hint nodes (second path)

This is the top-down path to eliminate inner hint nodes.
NrrurT��instatusrrtrrrcc3�<># �UHn[UT5v� M g7fr*)�_mergestatushints)rgrSr�s  �r.rh�$_mergestatushints.<locals>.<genexpr>s����A�5�a�$�Q��1�1�5�s�rFrk)r�rlrrm)r-r�rnrorprqrrs `     r.r�r��s���
	�y���	
�1��B�	�]���$�Q�q�T�8�4�4��a��d�T�2���q��t�}��	�
/�/���	�V�|��a��d�H�-���w��	�V�|�
�q��t�X�
.��
�q��t�X�
.����|��	�
��
�A�1�Q�R�5�A�
A���u�r�z��	�W�}�
�q��t�e�
4���a�D�"�~��
�
 �
 �!7�"�!<�
=�=r1c�F�[U5n[U5up![USS9$)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.
Fr�)reryr�)r-ro�_hs   r.�analyzer�	s&��	���A��q�!�E�B��Q��/�/r1c�0�UbUSS:XaSXS4$XU4$)Nrrrrr+)rnrprqs   r.�_optimizeandopsr�s*��	�~�"�Q�%�6�/��"��e�$�$��B�<�r1c�2�///p2nUHQn[U5upVUbUSS;aURU5 M/URU5 URU5 MS U(a2UR[5 URS[U5-5 X4$)Nrrt)spatterns)�	_optimize�append�WEIGHT_CHECK_FILENAMErl)�xs�wsrr�ssr-�wros       r.�_optimizeunionr�s����R��B�B�
����|����=�Q�q�T�%G�G��I�I�a�L��
�	�	�!��
�	�	�!��
�
�
�	�	�'�(�
�	�	�.�5��9�,�-�
�6�Mr1c�n^
�UcSU4$USnUS:Xa[US5up#X!X0S44$US;a[U4$US:Xa[US5up#X!USU44$US:Xa[US5up#X!U44$US:XaA[US5upE[US5upgXF::aU[XU54$U[XU54$US	:Xab[USS5um
n[	U5S:Xa
T
SUS4$[S
[
[U5U
4SjS955n[T
5U4U-4$US
:Xa&[SUSS56um
n[T
5U4U-4$US:XaI[US5n	[[RU	5SS5n[US5upEX$-XSU44$[R "SU-5e)Nrrurrrbrrrrc3�*# �UH	oSv� M g7f)rNr+)rg�its  r.rh�_optimize.<locals>.<genexpr>Fs���
�K�b�q�E�K�s�c�>�TUS$)Nrr+)r�r�s �r.r/�_optimize.<locals>.<lambda>Gs
����B�q�E�r1)�keyrc3�8# �UHn[U5v� M g7fr*�r�rfs  r.rhr�Ks���3�U��y��|�|�U�rjr�_weightrk)r�r�r�r�r4rl�sorted�	enumerater_r�r�rNr�r�r�rrm)r-rnr�ro�warp�wbrqrrr�r�s          @r.r�r�+s�����y��!�t��	
�1��B�	�]����1������q�A�$�-���	�
#�#�$�a�'�'�	�Z����1������q��t�Q�-���	�V�|���1������q�'�z��	�V�|��1�Q�4�����1�Q�4����
�8���r�r�2�2�2���r�r�2�2�2�	�U�{���!�"��&���B��r�7�a�<��a�5�"�Q�%�<��
�
�"�9�R�=�6J�K�
�
���2�w����
�"�"�	�W�}��3�Q�q�r�U�3�4���B��2�w����
�"�"�	�W�}��a��d�O���G�K�K��N�I�q�1���1�Q�4�����v��a�D�"�~�%�%�
�
 �
 �!7�"�!<�
=�=r1c� �[U5upU$)zkReorder/rewrite evaluatable tree for optimization

All pseudo operations should be transformed beforehand.
r�)r-�_wros   r.�optimizer�Us��

�a�L�E�B��Hr1c�0�[R"US5$)N)rr)r�prettyformat)rLs r.r�r�^s�����t�%;�<�<r1N)!�
__future__r�i18nr�rrrr��WEIGHT_READ_CONTENTS�
WEIGHT_STATUS�WEIGHT_STATUS_THOROUGHrGr<r�r:rErHrNrQrWrYr\r`reryr�r�r�r�r�r�r�r+r1r.�<module>r�s���#���������
���D�
2�
9�0�
.�.�
,�,�
+�
+�
-�
%�/�/�'�!��&#��
���	�3�l;�/� �"���
�>�D)>�X>�D	0��
� '>�T
�=r1