관리-도구
편집 파일: etree.cpython-311.pyc
� �Re� � � � d dl mZmZmZ d dlmZ d dlZd dlmZ ddl m Z ddl m Z ej d � � Zd � Z e e� � ZdS ) � )�absolute_import�division�unicode_literals)� OrderedDictN)� string_types� )�base� )�moduleFactoryFactoryz {([^}]*)}(.*)c � �� | }|� d� � j � G �fd�dt j � � }t � � S )N�asdc �0 �� e Zd ZdZ� fd�Zd� Zd� Zd� ZdS )�#getETreeBuilder.<locals>.TreeWalkera� Given the particular ElementTree representation, this implementation, to avoid using recursion, returns "nodes" as tuples with the following content: 1. The current element 2. The index of the element relative to its parent 3. A stack of ancestor elements 4. A flag "text", "tail" or None to indicate if the current node is a text node; either the text or tail of the current element (1) c � �� t |t � � r)|\ }}}}|dv r t j t ||� � fS |}t |d� � s|� � � }|j dv r t j fS |j dk r;t j |j |� d� � |� d� � fS |j � k rt j |j fS t |j t � � s J t |j � � � � �t � |j � � }|r|� � � \ }}n d }|j }t% � � }t' |j � � � � � D ]V\ } } t � | � � }|r.| ||� d� � |� d� � f< �O| |d | f< �Wt j |||t1 |� � p|j fS ) N��text�tail�tag)� DOCUMENT_ROOT�DOCUMENT_FRAGMENTz <!DOCTYPE>�publicId�systemIdr r )� isinstance�tupler �TEXT�getattr�hasattr�getrootr �DOCUMENT�DOCTYPEr �get�COMMENTr �type� tag_regexp�match�groupsr �list�attrib�items�group�ELEMENT�len) �self�node�elt�_�flagr% � namespacer �attrs�name�value�ElementTreeCommentTypes ���/builddir/build/BUILDROOT/alt-python311-pip-21.3.1-3.el8.x86_64/opt/alt/python311/lib/python3.11/site-packages/pip/_vendor/html5lib/treewalkers/etree.py�getNodeDetailsz2getETreeBuilder.<locals>.TreeWalker.getNodeDetails s� �� ��$��&�&� �"&���Q��4��+�+�+� �9�g�c�4�&8�&8�8�8� �D��4��'�'� &��|�|�~�~���x�A�A�A� � �'�'���\�)�)� � �d�i� ����,�,�d�h�h�z�.B�.B�D� D� �� 3�3�3��|�T�Y�.�.� "�$�(�L�9�9�I�I�4���>�>�I�I�I�"�(�(���2�2��� #�%*�\�\�^�^�N�I�s�s� $�I� �(�C�#� � ��#'�� �(9�(9�(;�(;�#<�#<� 4� 4�K�D�%� &� ,� ,�T� 2� 2�E� � 4�BG��u�{�{�1�~�~�u�{�{�1�~�~� >�?�?�.3��t�T�l�+�+� � �i�� �s�4�y�y� 5�D�I�7� 7� c �� � t |t � � r|\ }}}}n |d g d f\ }}}}|dv rd S |j r|||dfS t |� � r!|� |� � |d d|d fS d S )Nr r r )r r r r, �append�r- r. �element�key�parentsr1 s r7 � getFirstChildz1getETreeBuilder.<locals>.TreeWalker.getFirstChildH s� � ��$��&�&� C�.2�+���g�t�t�.2�D�"�d�.B�+���g�t��'�'�'��t��<� �"�C��&�8�8���\�\� ��N�N�7�+�+�+�"�1�:�q�'�4�7�7� �4r9 c �B � t |t � � r|\ }}}}nd S |dk r2t |� � r!|� |� � |d d|d fS d S |j r |dk r|||dfS |t |d � � dz k r|d |dz |dz |d fS d S )Nr r r ���r )r r r, r; r r< s r7 �getNextSiblingz2getETreeBuilder.<locals>.TreeWalker.getNextSiblingY s� � ��$��&�&� �.2�+���g�t�t��t��v�~�~��w�<�<� ��N�N�7�+�+�+�"�1�:�q�'�4�7�7� �4��<� �D�F�N�N�"�C��&�8�8��3�w�r�{�+�+�a�/�/�/�"�2�;�s�Q�w�/��q��'�4�G�G� �4r9 c �D � t |t � � r|\ }}}}nd S |dk r |s|S |||d fS |� � � }|s|S t |d � � � |� � dk sJ �|t |d � � � |� � |d fS )Nr rB r )r r �popr' �count�index)r- r. r= r> r? r1 �parents r7 � getParentNodez1getETreeBuilder.<locals>.TreeWalker.getParentNodem s� � ��$��&�&� �.2�+���g�t�t��t��v�~�~� � 7�"�N�"�C��$�6�6� ��� � �� � R�!�M� ��� �,�,�2�2�6�:�:�a�?�?�?�?�!�4��� �#4�#4�#:�#:�6�#B�#B�G�T�Q�Qr9 N)�__name__� __module__� __qualname__�__doc__r8 r@ rC rI )r6 s �r7 � TreeWalkerr sk �� � � � � � � �& 7� & 7� & 7� & 7� & 7�P � � �" � � �( R� R� R� R� Rr9 rN )�Commentr r �NonRecursiveTreeWalker�locals)�ElementTreeImplementation� ElementTreerN r6 s @r7 �getETreeBuilderrT sv �� �+�K� (� 0� 0�� 7� 7� ;��lR� lR� lR� lR� lR� lR� lR�T�0� lR� lR� lR�\ �8�8�Or9 )� __future__r r r � collectionsr �re�pip._vendor.sixr � r �_utilsr �compiler$ rT �getETreeModule� r9 r7 �<module>r^ s� �� B� B� B� B� B� B� B� B� B� B� #� #� #� #� #� #� � � � � (� (� (� (� (� (� � � � � � � )� )� )� )� )� )� �R�Z�� (� (� �r� r� r�j &�%�o�6�6���r9