| isis notr8 r9 r N)
isinstancer Comparelenopsleft_matchesr5 )r r r r r> oprights r r$ zNoneConstraint.match6 s dEM * * 5s48}}/A/A9D IB%%%t$$ &)1% )H)H & */SR8^5RF
sV4444tr 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 {Xh @ @@@r r+ r, r- ) r. r/ r0 r1 r Constr5 __annotations__r2 r$ r* r# r r r4 r4 1 sy >> )ek$ / /J////NS [&A A A A A Ar r4 r r framenodes.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.
NbodyorelseT)invert)parentr: r If locate_childset_match_constrainttest)r rF current_nodeconstraints_mappingrM branch_ constraintss r get_constraintsrX T s )-L;=
"|5'@'@ $ feh ' ' : ++L99IFA26K !"3D&+"F"F G G 8## !"3D&+d"S"S"S T T
:.9#F+
"|5'@'@ r node1nodes.NodeNG | bases.Proxynode2r 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 Namename Attributeattrnamer? r rD value)rY r[ s r r? r? v s %$$ (E5:)F)F (zUZ''% )) Uj.P.P U~ /THUZ4T4TT%%% **UEK*H*H *{ek)) 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 sysabcr 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 rs s
O N " " " " " "
# # # # # # # # $ $ $ $ $ $ & & & & & & & & & & * * * * * *w &&&&&&
5#U_e6F
R
S
W W W W W W W W2 A A A A AZ A A AF < #N#455 % :? r