X-PhM`UddlmZddlmZddlmZddlmZddlm Z m Z m Z ddl m ZddlmZddlmZmZmZmZmZdd lmZmZmZmZmZmZmZdd lm Z dd l!m"Z"m#Z#dd l$m%Z%dd l&m'Z'm(Z(m)Z)m*Z*m+Z+m,Z,m-Z-m.Z.m/Z/m0Z0m1Z1m2Z2m3Z3m4Z4ddl5m6Z6e eeefZ7de8d<Gdde Z9GddZ:eee;ed dZ?d!dZ@dS)") annotations) defaultdict)Iterator)contextmanager) NamedTupleOptionalUnion) TypeAlias)!remove_instance_last_known_values)Keyextract_var_from_literal_hashliteral literal_hashsubkeys) Expression IndexExpr MemberExprNameExprRefExprTypeInfoVar)Options) is_same_type is_subtype)make_simplified_union)AnyTypeInstanceNoneType PartialType ProperType TupleTypeType TypeOfAnyTypeType TypeVarType UnionType UnpackTypefind_unpack_in_listget_proper_type)fill_typevars_with_any _TypeAliasBindableExpressionc$eZdZUded<ded<dS) CurrentTyper"typeboolfrom_assignmentN)__name__ __module__ __qualname____annotations__K/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/mypy/binder.pyr.r.$s'JJJr7r.c$eZdZdZd dd Zdd Zd S)FrameaA Frame represents a specific point in the execution of a program. It carries information about the current types of expressions at that point, arising either from assignments to those expressions or the result of isinstance checks and other type narrowing operations. It also records whether it is possible to reach that point at all. We add a new frame wherenever there is a new scope or control flow branching. This information is not copied into a new Frame when it is pushed onto the stack, so a given Frame only has information about types that were assigned in that frame. Expressions are stored in dicts using 'literal hashes' as keys (type "Key"). These are hashable values derived from expression AST nodes (only those that can be narrowed). literal_hash(expr) is used to calculate the hashes. Note that this isn't directly related to literal types -- the concept predates literal types. Fidintconditional_framer0returnNonecL||_i|_d|_||_d|_dS)NF)r;types unreachabler=suppress_unreachable_warnings)selfr;r=s r8__init__zFrame.__init__@s.-/  !2-2***r7strc Hd|jd|jd|jd|jd S)NzFrame(z, ))r;rArBr=rDs r8__repr__zFrame.__repr__Gs5^^^4:^^1A^^TE[^^^^r7NF)r;r<r=r0r>r?)r>rF)r2r3r4__doc__rErJr6r7r8r:r:)sQ,33333______r7r:c.eZdZUdZdZded<dDd ZdEd ZdFdGdZdHdIdZ dJdKdZ dJdLdZ dddMd#Z dNd$Z dNd%ZdOd'ZdPd(ZdPd)ZdQd*ZdRd+ZdSd.ZdTd1ZedUd3ZdVd5ZdWd7ZdXd8ZdNd9ZdNd:Zed;dr?cd|_t|g|_g|_i|_i|_d|_t|_ g|_ g|_ |j |_ dS)NF)next_idr:_get_idframesoptions_on_return declarations dependencieslast_pop_changedset try_frames break_framescontinue_framesallow_redefinition_newbind_all)rDrPs r8rEzConditionalTypeBinder.__init__fsz T\\^^,,- 575724!&%(EE')*,  6 r7r<c0|xjdz c_|jS)NrR)rSrIs r8rTzConditionalTypeBinder._get_ids  |r7keyr value Key | Nonec||}n:|j|t|t |D]}|||dSN)rX setdefaultrZaddr_add_dependencies)rDrarbelts r8rhz'ConditionalTypeBinder._add_dependenciessq =EE   ( (cee 4 4 8 8 ? ? ?3<< / /C  " "3 . . . . / /r7Fr=r0r:ct||}|j||jg|S)z!Push a new frame into the binder.)r:rTrUappendrV)rDr=fs r8 push_framez ConditionalTypeBinder.push_framesL $,,.."3 4 4 1 %%b)))r7r/r"r1indexcLt|||j|j|<dSre)r.rUrA)rDrar/r1ros r8_putzConditionalTypeBinder._puts&(3D/(J(J E %%%r7CurrentType | Nonec|dkr|t|jz }t|ddD]0}||j|jvr|j|j|cS1dS)Nrrn)lenrUrangerA)rDrarois r8_getzConditionalTypeBinder._getsr 199 S%% %Eub"%% 1 1Adk!n***{1~+C0000+tr7Tr1exprrtypc>t|tttfsdSt |sdSt |}| Jd||jvr,t||j|<||| |||dS)zDirectly set the narrowed type of expression (if it supports it). This is used for isinstance() etc. Assignments should go through assign_type(). Nz/Internal error: binder tried to put non-literal) isinstancerrrrrrWget_declarationrhrq)rDryrzr1ras r8putzConditionalTypeBinder.puts $J ABB  Ft}}  F4   Q d' ' '%4T%:%:D c "  " "3 ' ' ' #sO,,,,,r7c*d|jd_dSNTrn)rUrBrIs r8rBz!ConditionalTypeBinder.unreachables&* B###r7c*d|jd_dSr)rUrCrIs r8rCz3ConditionalTypeBinder.suppress_unreachable_warningss8< B555r7 Type | Nonecxt|}| Jd||}|dS|jS)Nz/Internal error: binder tried to get non-literal)rrwr/)rDryrafounds r8getzConditionalTypeBinder.gets@4   Q # =4zr7c>td|jDS)Nc3$K|] }|jV dSrerB.0rls r8 z7ConditionalTypeBinder.is_unreachable..s$66Q1=666666r7anyrUrIs r8is_unreachablez$ConditionalTypeBinder.is_unreachables#66$+666666r7c>td|jDS)Nc3$K|] }|jV dSre)rCrs r8rzJConditionalTypeBinder.is_unreachable_warning_suppressed..s%HHq12HHHHHHr7rrIs r8!is_unreachable_warning_suppressedz7ConditionalTypeBinder.is_unreachable_warning_suppresseds!HHDKHHHHHHr7cft|}| Jd||dS)z0Remove all references to a Node from the binder.Nz0Internal error: binder tried cleanse non-literal)r _cleanse_key)rDryras r8cleansezConditionalTypeBinder.cleanses94   R #r7c<|jD]}||jvr|j|=dS)z/Remove all references to a key from the binder.N)rUrA)rDraframes r8rz"ConditionalTypeBinder._cleanse_keys5[ % %Eek!!K$ % %r7rU list[Frame]c  td|D}d|D}d}d|D}|D]@ |  fd|D}|j pt du}|rt d|Dr\d|D}|rtd |Dr|d }|J|jt |j }t|tr?tfd |d dDsttj | ng} |D] } | J| | j!t| d kr | d nt| t|t rt#|s|tt$rt'|r`tt(rKtt$r6t%jdjD} | |j kr|  t/ js| dd}B| |jd_|S)zUpdate the frame to reflect that each key will be updated as in one of the frames. Return whether any item changes. If a key is declared as AnyType, only update it if all the options are the same. c3&K|] }|j V dSrerrs r8rz.s'>>! ->>>>>>r7c g|] }|j | Sr6rrs r8 z=ConditionalTypeBinder.update_from_options..s9991=9!999r7Fc&h|]}|jD]}|Sr6)rA)rrlras r8 z.s'777qw777777r7cFg|]}|jSr6)rAr)rrl current_valueras r8rz=ConditionalTypeBinder.update_from_options..s)PPPA C ? ?PPPr7Nc3K|]}|duV dSrer6rxs r8rz.s&$I$I1Q$Y$I$I$I$I$I$Ir7cg|]}||Srer6rs r8rz=ConditionalTypeBinder.update_from_options..sMMMaq}}}}r7c3.K|]}|duo|j VdSrerxrs r8rz.sB%%<= 7a&7"7%%%%%%r7rc3JK|]}|duot|jVdSre)rr/)rtr/s r8rz. sIEFATM@l4&@&@r7rR) source_anycVg|]&}tt|t$|'Sr6r|r)r)rrs r8rz=ConditionalTypeBinder.update_from_options..0s1bbb1*_UVEWEWY`:a:abQbbbr7Trxrn)allrwr_r rr/r)rWrr|rr#from_another_anyrkrtrr%rr&collapse_variadic_unionr make_unionitemsrrqrUrB)rDrU all_reachablechangedkeysresulting_values old_semantics current_typedeclaration_typepossible_typesr simplifiedrrar/s @@@r8update_from_optionsz)ConditionalTypeBinder.update_from_optionssF>>v>>>>> 99V99977V777M M C IIcNNMPPPPPPPP  !% -[1Ns1S1SW[1[M $I$I8H$I$I$I!I!I MM+;MMM  %%AQ%%%"" +A.L+++$D.t/@/D/DS/I/IJJ *G44+ .JZ[\[][]J^\#9#=JZ[[!#)22A==="))!&1111~&&!++*!,DD0@@D!"2K@@0.JJ0 0"$ 22=6t<<% .&tZ88 .'tY77 .&/%9bb bbb&& &):3)???#-D$L}?Q,R,R$ #tT :::*0j B#r7can_skip fall_throughc|dkr|| |j}|j}|r!|d|jd|||_|S)zcPop a frame and return it. See frame_context() for documentation of fall_through. rrn) allow_jumprUpoprVinsertrrY)rDrrresultrPs r8 pop_framezConditionalTypeBinder.pop_frame<s !   OO\M * * *""(,,..  / NN1dk"o . . . $ 8 8 A A r7Iterator[Assigns]c#|Kd}|j|j}tt|_|jV||_dS)aPush a new map to collect assigned types in multiassign from union. If this map is not None, actual binding is deferred until all items in the union are processed (a union of collected items is later bound manually by the caller). N)rOrlist)rDold_assignmentss r8accumulate_type_assignmentsz1ConditionalTypeBinder.accumulate_type_assignmentsOsK  ,"3O +D 1 1#### /r7 declared_typecFt|j$|j||fdSt|tt t fsdSt|sdS|||dSt|sdSt|}t}t|trt|tr>t|j tr$|j jr||n_t|t"rUt%d|jDr7fd|jD}||t#|nt|t"r5t%d|jDr||n|||nt|trit|tr=t|j tr#|j jr||n-|||n|||jD]}||dS)aNarrow type of expression through an assignment. Do nothing if the expression doesn't support narrowing. When not narrowing though an assignment (isinstance() etc.), use put() directly. This omits some special-casing logic for assignments. Nc3ZK|]&}tt|tV'dSrer|r)rritems r8rz4ConditionalTypeBinder.assign_type..sE;;@D ?400(;;;;;;;;r7c\g|](}tt|trn|)Sr6r)rrr/s r8rz5ConditionalTypeBinder.assign_type..sD't'<'.sE;;?C ?400'::;;;;;;r7)r rOrkr|rrrrinvalidate_dependenciesrr)rrnoder is_inferredr~r&rrr[r)rDryr/r p_declaredp_type new_itemsrvs ` r8 assign_typez!ConditionalTypeBinder.assign_type^s166  ,  !$ ' . .m/D E E E F$J ABB  Ft}}  F $$T***   F$ ..  F$]33  && fg & &" !$(( .Z 3-G-G .DILa .t$$$$J 22 .s;;HRHX;;;88 .  * 0 y334444J 22 .s;;GQGW;;;88 . t$$$$}----  G , , !$(( .Z 3-G-G .DILa .t$$$$}---- HHT4   A OOA      r7r,ct|}|J|j|tD]}||dS)aInvalidate knowledge of types that include expr, but not expr itself. For example, when expr is foo.bar, invalidate foo.bar.baz. It is overly conservative: it invalidates globally, including in code paths unreachable from here. N)rrXrrZr)rDryradeps r8rz-ConditionalTypeBinder.invalidate_dependenciessa4  $((cee44 # #C   c " " " " # #r7cF|dkr|t|jz }t|}|j|dzdD]/}|j|j|jrd|_0|j||dS)NrrRT) rtrVr:rTrUrAupdaterBrk)rDrorrls r8rz ConditionalTypeBinder.allow_jumps 199 S/00 0Edllnn%%UQY[[) ) )A K  qw ' ' '} )$(! u%,,U33333r7cn||jd|dSNrn)rr\rBrIs r8 handle_breakz"ConditionalTypeBinder.handle_breaks4 )"-... r7cn||jd|dSr)rr]rBrIs r8handle_continuez%ConditionalTypeBinder.handle_continues4 ,R0111 r7rRr)r break_framecontinue_framer= try_framerrrIterator[Frame]c#Kt|jdksJ|r/|jt|j|z |r/|jt|j|z |r/|jt|jdz ||}|r|d|V| |||r|j |r|j |r1|j t|jdz dSdS)a4Return a context manager that pushes/pops frames on enter/exit. If can_skip is True, control flow is allowed to bypass the newly-created frame. If fall_through > 0, then it will allow control flow that falls off the end of the frame to escape to its ancestor `fall_through` levels higher. Otherwise control flow ends at the end of the frame. If break_frame > 0, then 'break' statements within this frame will jump out to the frame break_frame levels higher than the frame created by this call to frame_context. Similarly for continue_frame and 'continue' statements. If try_frame is true, then execution is allowed to jump at any point within the newly created frame (or its descendants) to its parent (i.e., to the frame that was on top before this call to frame_context). After the context manager exits, self.last_pop_changed indicates whether any types changed in the newly-topmost frame as a result of popping this frame. rRrnN) rtrUr\rkr]r[rgrmrrrremove)rDrrrrr=r new_frames r8 frame_contextz#ConditionalTypeBinder.frame_contextsoF4;!####  E   $ $S%5%5 %C D D D  K  ' 'DK(8(8>(I J J J  6 O  DK 0 01 4 5 5 5OO$566  OOB    x...  $   ! ! # # #  '  $ $ & & &  9 O " "3t{#3#3a#7 8 8 8 8 8 9 9r7c#Kt|jdksJ|V|ddt|jdksJdS)zqA variant of frame_context for use at the top level of a namespace (module, function, or class). rRTrN)rtrUrmrrIs r8top_frame_contextz'ConditionalTypeBinder.top_frame_contextsn 4;1$$$$oo tQ4;1$$$$$$r7)rPrr>r?)r>r<re)rar rbrcr>r?rK)r=r0r>r:)rn) rar r/r"r1r0ror<r>r?)rar ror<r>rr)ryrrzr"r1r0r>r?)r>r?)ryrr>r)r>r0)ryrr>r?)rar r>r?)rUrr>r0)rr0rr<r>r:)r>r)ryrr/r"rrr>r?)ryr,r>r?)ror<r>r?)rr0rr<rr<rr<r=r0rr0r>r)r>r)r2r3r4rLrOr5rErTrhrmrqrwr~rBrCrrrrrrrrrrrrrrrrr6r7r8rNrNNs*(,++++%7%7%7%7N/////KKKKKKO------ ++++====7777 IIII %%%% ]]]]~& 0 0 0^ 0MMMM^ # # # # 4 4 4 4 "'7979797979^79r%%%^%%%r7rNryr>rc<t|trt|jtr1|jj}tt |t s|Sn;t|jtr!tt|jSdS)zGet the declared or inferred type of a RefExpr expression. Return None if there is no type or the expression is not a RefExpr. This can return None if the type hasn't been inferred yet. N) r|rrrr/r)rrr$r*)ryr/s r8r}r}s $  ? di % % ?9>Dod33[AA     8 , , ?249==>> > 4r7rzr&r"cg}g}|jD]Q}t|}t|tr||<||Rt |dkr|St |d}|d}|d}t|j}||S|j|}t|tsJt|j } t| ts|S| j j dksJ|j|dzd} t |jt | kr|S| r#|jt |  d| kr|S| r|jdt |  } n|j} | j d} t|ddD]!\} }|j| | g| dzzz| zkr|cS"|j| | gt |jdz zz|gz| zkr|St |jdkr| }nt| |gz| z|j}t!j|g|zS) aSimplify a union involving variadic tuple if possible. This will collapse a type like e.g. tuple[X, Z] | tuple[X, Y, Z] | tuple[X, Y, Y, *tuple[Y, ...], Z] back to tuple[X, *tuple[Y, ...], Z] which is equivalent, but much simpler form of the same type. rRc*t|jSre)rtr)rs r8z)collapse_variadic_union..7sCLLr7)rarrnNzbuiltins.tuple)fallback)rr)r|r!rkrtsortedr(r'r/rfullnameargs enumerate copy_modifiedpartial_fallbackr&r)rz tuple_items other_itemsrp_tfirstlast unpack_indexunpackunpackedsuffixprefixargrvitrs r8rr#sKK Y""a   c9 % % "   s # # # #   q ! ! ! ! ;1 *@*@AAAK NE r?D&tz22L Z %F fj ) ))))v{++H h ) ) = !%5 5 5 5 5 Z q(** +F 5;#f++%%  %+s6{{lnn-77  ^F |^, - C;qt,--2 8vQ/&8 8 8JJJ 9 zVses39~~'9::fXENNN  5;1#1133 v069DDYZZZ   { : ; ;;r7N)ryr,r>r)rzr&r>r")A __future__r collectionsrcollections.abcr contextlibrtypingrrr typing_extensionsr r+mypy.erasetyper mypy.literalsr r rrr mypy.nodesrrrrrrr mypy.optionsr mypy.subtypesrr mypy.typeopsr mypy.typesrrrrr r!r"r#r$r%r&r'r(r) mypy.typevarsr*r,r5r.r:rtupleAssignsrNr}rr6r7r8rs"""""""######$$$$$$%%%%%%..........555555<<<<<<\\\\\\\\\\\\\\ZZZZZZZZZZZZZZZZZZ 22222222...... 100000!&y*h'F!GGGGG* ________D j$uT8D>-A'B"CC DB%B%B%B%B%B%B%B%J     9<9<9<9<9<9