�
�|�fP � �j � S SK Jr S SKrSSKJr SSKJr \R " S5 rS r \" \ 5 r
g) � )� OrderedDictN� )�base� )�moduleFactoryFactoryz
{([^}]*)}(.*)c � ^� U nUR S5 R m " U4S jS[ R 5 n[ 5 $ )N�asdc �8 >� \ rS rSrSrU 4S jrS rS rS rSr g) �#getETreeBuilder.<locals>.TreeWalker� a� 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 �P >� [ U[ 5 ( a) Uu n p4US; a [ R [ X$5 4$ Un[ US5 ( d UR
5 nUR S; a [ R 4$ UR S:X a< [ R UR UR S5 UR S5 4$ UR T :X a [ R UR 4$ [ UR [ 5 ( d [ UR 5 5 e[ R! UR 5 nU( a UR# 5 u pgOS nUR n[% 5 n[' UR( R+ 5 5 HM u p�[ R! U 5 nU( a& X�UR- S5 UR- S5 4' MG X�S U 4' MO [ R. XgU[1 U5 =( d UR 4$ ) N��text�tail�tag)�
DOCUMENT_ROOT�DOCUMENT_FRAGMENTz
<!DOCTYPE>�publicId�systemIdr r )�
isinstance�tupler �TEXT�getattr�hasattr�getrootr �DOCUMENT�DOCTYPEr �get�COMMENT�str�type�
tag_regexp�match�groupsr �list�attrib�items�group�ELEMENT�len) �self�node�elt�_�flagr# � namespacer �attrs�name�value�ElementTreeCommentTypes ��</usr/lib/python3/dist-packages/html5lib/treewalkers/etree.py�getNodeDetails�2getETreeBuilder.<locals>.TreeWalker.getNodeDetails s� �� ��$��&�&�"&���Q���+�+� �9�9�g�c�&8�8�8� �D��4��'�'��|�|�~���x�x�A�A� �
�
�'�'����\�)� � � �d�i�i� ����,�d�h�h�z�.B�D� D� ��� 3�3��|�|�T�Y�Y�.�.� "�$�(�(�C�0�0�@�$�t�x�x�.�@�0�"�(�(����2���%*�\�\�^�N�I�s� $�I� �(�(�C�#�
��#'�� � �(9�(9�(;�#<�K�D� &� ,� ,�T� 2�E� �BG�u�{�{�1�~�u�{�{�1�~� >�?�.3�t�T�l�+� $=� � � �i� �s�4�y� 5�D�I�I�7� 7� c �� � [ U[ 5 ( a Uu p#pEO US / S 4u p#pEUS; a g UR ( a X#US4$ [ U5 ( a UR U5 US SUS 4$ g )Nr r r )r r r r* �append�r+ r, �element�key�parentsr/ s r5 �
getFirstChild�1getETreeBuilder.<locals>.TreeWalker.getFirstChildE sy � ��$��&�&�.2�+��g�t�.2�D�"�d�.B�+��g��'�'���<�<�"��&�8�8���\�\��N�N�7�+�"�1�:�q�'�4�7�7� r8 c �$ � [ U[ 5 ( a Uu p#pEOg US:X a+ [ U5 ( a UR U5 US SUS 4$ g UR ( a US:w a X#US4$ U[ US 5 S-
: a US US- US- US 4$ g )Nr r r ���r )r r r* r: r r; s r5 �getNextSibling�2getETreeBuilder.<locals>.TreeWalker.getNextSiblingV s� � ��$��&�&�.2�+��g�t���v�~��w�<�<��N�N�7�+�"�1�:�q�'�4�7�7� ��<�<�D�F�N�"��&�8�8��3�w�r�{�+�a�/�/�"�2�;�s�Q�w�/��q��'�4�G�G� r8 c � � [ U[ 5 ( a Uu p#pEOg US:X a U( d U$ X#US 4$ UR 5 nU( d U$ [ US 5 R U5 S:X d eU[ US 5 R U5 US 4$ )Nr rB r )r r �popr% �count�index)r+ r, r< r= r> r/ �parents r5 �
getParentNode�1getETreeBuilder.<locals>.TreeWalker.getParentNodej s� � ��$��&�&�.2�+��g�t���v�~� �"�N�"��$�6�6� ��� �� �!�M� ��� �,�2�2�6�:�a�?�?�?�!�4��� �#4�#:�#:�6�#B�G�T�Q�Qr8 � N)
�__name__�
__module__� __qualname__�__firstlineno__�__doc__r6 r? rC rJ �__static_attributes__)r4 s �r5 �
TreeWalkerr s �� � �& 7�P �" �( Rr8 rS )�Commentr r �NonRecursiveTreeWalker�locals)�ElementTreeImplementation� ElementTreerS r4 s @r5 �getETreeBuilderrY s? �� �+�K� (� 0� 0�� 7� ;� ;��lR�T�0�0� lR�\ �8�Or8 ) � collectionsr �re� r �_utilsr �compiler" rY �getETreeModulerL r8 r5 �<module>r` s2 �� #� � � )�
�Z�Z��
(�
�r�j &�o�6�r8