← Back
Editing: tree.cpython-311.pyc
� �|�e6 � �8 � d Z ddlZddlmZ G d� d� � ZdS )zT A class for storing a tree graph. Primarily used for filter constructs in the ORM. � N)� make_hashablec �t � e Zd ZdZdZdd�Zedd�� � Zd� Zd� Z d � Z d � Z d � Z d � Z d � Zd� Zdd�Zd� ZdS )�Nodez� A single internal node in the tree graph. A Node should be viewed as a connection (the root) with the children being either leaf nodes or other Node instances. �DEFAULTNFc �V � |r |dd� ng | _ |p| j | _ || _ dS )z@Construct a new Node. If no connector is given, use the default.N)�children�default� connector�negated)�selfr r r s �3/usr/lib/python3/dist-packages/django/utils/tree.py�__init__z Node.__init__ s3 � �'/�7����� � �R�� �"�2�d�l��� �� � � � c �6 � t |||� � }| |_ |S )a� Create a new instance of this class when new Nodes (or subclasses) are needed in the internal code in this class. Normally, it just shadows __init__(). However, subclasses with an __init__ signature that aren't an extension of Node.__init__ might need to implement this method to allow a Node to create a new instance of them (if they have any extra setting up to do). )r � __class__)�clsr r r �objs r � _new_instancezNode._new_instance s! � � �8�Y��0�0���� �� r c �t � | j rdnd}|| j d� d� | j D � � � � fz S )Nz(NOT (%s: %s))z(%s: %s)z, c 3 �4 K � | ]}t |� � V � �d S �N)�str)�.0�cs r � <genexpr>z Node.__str__.<locals>.<genexpr>- s( � � � �4S�4S��S��V�V�4S�4S�4S�4S�4S�4Sr )r r �joinr )r �templates r �__str__z Node.__str__+ sC � �'+�|�C�#�#����4�>�4�9�9�4S�4S�T�]�4S�4S�4S�+S�+S�T�T�Tr c �( � d| j j �d| �d�S )N�<z: �>)r �__name__�r s r �__repr__z Node.__repr__/ s � � � !�^� 4� 4� 4�d�d�d�;�;r c � � t | j | j �� � }| j |_ t j | j |� � |_ |S )N)r r )r r r r �copy�deepcopyr )r �memodictr s r � __deepcopy__zNode.__deepcopy__2 s; � ��T�^�T�\�B�B�B�� ��� ��}�T�]�H�=�=�� �� r c �* � t | j � � S )z,Return the number of children this node has.)�lenr r# s r �__len__z Node.__len__8 s � ��4�=�!�!�!r c �* � t | j � � S )z-Return whether or not this node has children.)�boolr r# s r �__bool__z Node.__bool__< s � ��D�M�"�"�"r c � � || j v S )z:Return True if 'other' is a direct child of this instance.)r �r �others r � __contains__zNode.__contains__@ s � ��� �%�%r c �~ � | j |j k o-| j | j f|j |j fk o| j |j k S r )r r r r r1 s r �__eq__z Node.__eq__D sC � � �N�e�o� -� ,� �^�T�\� *�u��� �.N� N� ,� �M�U�^� +� r c �n � t | j | j | j gt | j � � �R � � S r )�hashr r r r r r# s r �__hash__z Node.__hash__K s1 � ��T�^�T�^�T�\�a�M�RV�R_�D`�D`�a�a�b�b�br Tc �� � | j |k r || j v r|S |s | j � |� � |S | j |k rwt |t � � rF|j s?|j |k st |� � dk r!| j � |j � � | S | j � |� � |S | � | j | j | j � � }|| _ ||g| _ |S )a/ Combine this tree and the data represented by data using the connector conn_type. The combine is done by squashing the node other away if possible. This tree (self) will never be pushed to a child node of the combined tree, nor will the connector or negated properties change. Return a node which can be used in place of data regardless if the node other got squashed or not. If `squash` is False the data is prepared and added as a child to this tree without further logic. � ) r r �append� isinstancer r r+ �extendr )r �data� conn_type�squashr s r �addzNode.addN s� � � �>�Y� &� &�4�4�=�+@�+@��K�� � �M� � �� &� &� &��K� �>�Y� &� &��4��&�&� �t�|� ��^�y�0�0�C��I�I��N�N� � �$�$�T�]�3�3�3�� � � �$�$�T�*�*�*�� ��$�$�T�]�D�N�%)�\�3� 3�C� &�D�N� �$�K�D�M��Kr c � � | j | _ dS )z'Negate the sense of the root connector.N)r r# s r �negatez Node.negatez s � � �<�'�� � � r )NNF)T)r" � __module__� __qualname__�__doc__r r � classmethodr r r$ r) r, r/ r3 r5 r8 rA rC � r r r r s� � � � � � �� � �G� � � � � � � � � �[� �U� U� U�<� <� <�� � � "� "� "�#� #� #�&� &� &� � � �c� c� c�*� *� *� *�X(� (� (� (� (r r )rF r& �django.utils.hashabler r rH r r �<module>rJ sh ��� � � � � � /� /� /� /� /� /�q(� q(� q(� q(� q(� q(� q(� q(� q(� q(r
Save File
Cancel