Hacked By AnonymousFox
�
�܋f� � �D � d Z ddlmZ ddlZddlmZmZ ddlmZ ddl m
Z
ddl m Z m
Z
mZ ddlmZ ej d k rdd
l mZ ndd
lmZ e
e
j e
j e
j e
j f Z G d � d e� � Z G d
� de� � Zd!d�Z e ef� � Z d"d�Z d#d$d �Z dS )%zHClasses representing different types of constraints on inference values.� )� annotationsN)�ABC�abstractmethod)�Iterator)�Union)�bases�nodes�util)�InferenceResult)� � )�Selfc �^ � e Zd ZdZdd�Zee ddd�� � � � Zedd�� � ZdS )�
Constraintz-Represents a single constraint on a variable.�node� nodes.NodeNG�negate�bool�return�Nonec �$ � || _ || _ d S )N�r r )�selfr r s �c/builddir/build/BUILD/cloudlinux-venv-1.0.6/venv/lib/python3.11/site-packages/astroid/constraint.py�__init__zConstraint.__init__ s � ��� �7� �� �Q�Q� F�cls�
type[Self]�
_NameNodes�expr� Self | Nonec � � dS )z�Return a new constraint for node matched from expr, if expr matches
the constraint pattern.
If negate is True, negate the constraint.
N� )r r r r s r �matchzConstraint.match! � � � � r �inferredr c � � dS )�HReturn True if this constraint is satisfied by the given inferred value.Nr# �r r& s r � satisfied_byzConstraint.satisfied_by, r% r N)r r r r r r �F�
r r r r r r r r r r! �r& r r r ) �__name__�
__module__� __qualname__�__doc__r � classmethodr r$ r* r# r r r r s� � � � � � �7�7�R� R� R� R� ��NS� � � � � �^� �[� � �W� W� W� �^�W� W� Wr r c �b � e Zd ZU dZ ej d� � Zded< e ddd�� � Z dd�Z
dS )�NoneConstraintz4Represents an "is None" or "is not None" constraint.Nz nodes.Const�
CONST_NONEFr r r r r r r r r r! c �& � t |t j � � rvt |j � � dk r^|j }|j d \ }}|dv rCt
||� � r3t
|| j � � r |dk r|p|dk o| } | ||�� � S dS )z�Return a new constraint for node matched from expr, if expr matches
the constraint pattern.
Negate the constraint based on the value of negate.
� r > �is�is notr8 r9 r N)�
isinstancer �Compare�len�ops�left�_matchesr5 )r r r r r> �op�rights r r$ zNoneConstraint.match6 s� � � �d�E�M� *� *� 5�s�4�8�}�}��/A�/A��9�D� ��� �I�B���%�%�%���t�$�$� &�)1�%�� �)H�)H� &� ��*�/��S�R�8�^�5R�F�
���s��V�4�4�4�4��tr r& r c �t � t |t j � � rdS | j t || j � � z S )r( T)r: r
�UninferableBaser r? r5 r) s r r* zNoneConstraint.satisfied_byJ s9 � � �h�� 4� 5� 5� ��4� �{�X�h��� @� @�@�@r r+ r, r- ) r. r/ r0 r1 r �Constr5 �__annotations__r2 r$ r* r# r r r4 r4 1 sy � � � � � � �>�>� )�e�k�$� /� /�J�/�/�/�/��NS�� � � � �[��&A� A� A� A� A� Ar r4 r r �frame�nodes.LocalsDictNodeNGr � dict[nodes.If, set[Constraint]]c �T � | }i }|��||ur�|j }t |t j � � rt|� |� � \ }}d}|dk r#t t
| |j � � � � }n*|dk r$t t
| |j d�� � � � }|r|||< |}|�||u��|S )aH Returns the constraints for the given expression.
The returned dictionary maps the node where the constraint was generated to the
corresponding constraint(s).
Constraints are computed statically by analysing the code surrounding expr.
Currently this only supports constraints generated from if conditions.
N�body�orelseT)�invert)�parentr: r �If� locate_child�set�_match_constraint�test)r rF � current_node�constraints_mappingrM �branch�_� constraintss r �get_constraintsrX T s� � � )-�L�;=��
�
"�|�5�'@�'@� �$�� �f�e�h� '� '� :� �+�+�L�9�9�I�F�A�26�K��� � � !�"3�D�&�+�"F�"F� G� G� � ��8�#�#� !�"3�D�&�+�d�"S�"S�"S� T� T� ��
:�.9�#�F�+� � � �
"�|�5�'@�'@� � r �node1�nodes.NodeNG | bases.Proxy�node2r r c �� � t | t j � � r*t |t j � � r| j |j k S t | t j � � rDt |t j � � r*| j |j k ot
| j |j � � S t | t j � � r*t |t j � � r| j |j k S dS )z$Returns True if the two nodes match.F)
r: r �Name�name� Attribute�attrnamer? r rD �value)rY r[ s r r? r? v s� � ��%���$�$� (��E�5�:�)F�)F� (��z�U�Z�'�'��%�� �)�)� U�j����.P�.P� U��~�� �/�T�H�U�Z���4T�4T�T��%���%�%� *�*�U�E�K�*H�*H� *��{�e�k�)�)� �5r Fr rL �Iterator[Constraint]c # �X K � t D ] }|� | ||� � }|r|V � � dS )z3Yields all constraint patterns for node that match.N)�ALL_CONSTRAINT_CLASSESr$ )r r rL �constraint_cls�
constraints r rQ rQ � sM � � � � 1� � ��#�)�)�$��f�=�=�
� � � � � � �� � r )r r rF rG r rH )rY rZ r[ r r r r+ )r r r r rL r r rb ) r1 �
__future__r �sys�abcr r �collections.abcr �typingr �astroidr r r
�astroid.typingr � version_infor �typing_extensions�
AssignAttrr_ �
AssignNamer] r r r4 rX � frozensetrd r? rQ r# r r �<module>rs s� ��
O� N� "� "� "� "� "� "�
�
�
�
� #� #� #� #� #� #� #� #� $� $� $� $� $� $� � � � � � � &� &� &� &� &� &� &� &� &� &� *� *� *� *� *� *���w� � ��������&�&�&�&�&�&�
�5�#�U�_�e�6F��
�R�
S�
�W� W� W� W� W�� W� W� W�2 A� A� A� A� A�Z� A� A� A�F � � � �< #��N�#4�5�5� � %� � � � � :?� � � � � � � r
Hacked By AnonymousFox1.0, Coded By AnonymousFox