X-Ph6UdZddlmZddlZddlZddlZddlZddlmZddl m Z m Z m Z m Z ddlmZddlmZmZmZmZmZmZmZmZddlmZdd lmZdd lmZdd l m!Z!dd l"m#Z#m$Z$m%Z%m&Z&m'Z'm(Z(m)Z)m*Z*dd l+m,Z,ddl-m.Z.m/Z/ddl0m1Z1m2Z2m3Z3ddl4m5Z5ddl6m7Z7m8Z8ddl9m:Z:m;Z;ddlm?Z?m@Z@ddlAmBZBddlCmDZDmEZEmFZFdZGdeHd<dZIGddZJd|d%ZKd}d+ZLd~d,ZMGd-d.e ZNGd/d0e ZOe eNeOfZPd1eHd2<dd:ZQdd>ZRdd@ZSddAZTddBZUddGZVddMZWddOZXddTZYddWZZddZZ[dd_Z\dddZ]ddgZ^ddhZ_ddlZ`ejadmkrdnZbdeHdo<n+ejcdpzejcdqzejddpzejddqzfZbdeHdo<dduZeddwZfddxZgdd{ZhdS)aRUpdate build by processing changes using fine-grained dependencies. Use fine-grained dependencies to update targets in other modules that may be affected by externally-visible changes in the changed modules. This forms the core of the fine-grained incremental daemon mode. This module is not used at all by the 'classic' (non-daemon) incremental mode. Here is some motivation for this mode: * By keeping program state in memory between incremental runs, we only have to process changed modules, not their dependencies. The classic incremental mode has to deserialize the symbol tables of all dependencies of changed modules, which can be slow for large programs. * Fine-grained dependencies allow processing only the relevant parts of modules indirectly affected by a change. Say, if only one function in a large module is affected by a change in another module, only this function is processed. The classic incremental mode always processes an entire file as a unit, which is typically much slower. * It's possible to independently process individual modules within an import cycle (SCC). Small incremental changes can be fast independent of the size of the related SCC. In classic incremental mode, any change within a SCC requires the entire SCC to be processed, which can slow things down considerably. Some terms: * A *target* is a function/method definition or the top level of a module. We refer to targets using their fully qualified name (e.g. 'mod.Cls.method'). Targets are the smallest units of processing during fine-grained incremental checking. * A *trigger* represents the properties of a part of a program, and it gets triggered/fired when these properties change. For example, '' refers to a module-level function. It gets triggered if the signature of the function changes, or if the function is removed, for example. Some program state is maintained across multiple build increments in memory: * The full ASTs of all modules are stored in memory all the time (this includes the type map). * A fine-grained dependency map is maintained, which maps triggers to affected program locations (these can be targets, triggers, or classes). The latter determine what other parts of a program need to be processed again due to a fired trigger. Here's a summary of how a fine-grained incremental program update happens: * Determine which modules have changes in their source code since the previous update. * Process changed modules one at a time. Perform a separate full update for each changed module, but only report the errors after all modules have been processed, since the intermediate states can generate bogus errors due to only seeing a partial set of changes. * Each changed module is processed in full. We parse the module, and run semantic analysis to create a new AST and symbol table for the module. Reuse the existing ASTs and symbol tables of modules that have no changes in their source code. At the end of this stage, we have two ASTs and symbol tables for the changed module (the old and the new versions). The latter AST has not yet been type checked. * Take a snapshot of the old symbol table. This is used later to determine which properties of the module have changed and which triggers to fire. * Merge the old AST with the new AST, preserving the identities of externally visible AST nodes for which we can find a corresponding node in the new AST. (Look at mypy.server.astmerge for the details.) This way all external references to AST nodes in the changed module will continue to point to the right nodes (assuming they still have a valid target). * Type check the new module. * Take another snapshot of the symbol table of the changed module. Look at the differences between the old and new snapshots to determine which parts of the changed modules have changed. The result is a set of fired triggers. * Using the dependency map and the fired triggers, decide which other targets have become stale and need to be reprocessed. * Create new fine-grained dependencies for the changed module. We don't garbage collect old dependencies, since extra dependencies are relatively harmless (they take some memory and can theoretically slow things down a bit by causing redundant work). This is implemented in mypy.server.deps. * Strip the stale AST nodes that we found above. This returns them to a state resembling the end of semantic analysis pass 1. We'll run semantic analysis again on the existing AST nodes, and since semantic analysis is not idempotent, we need to revert some changes made during semantic analysis. This is implemented in mypy.server.aststrip. * Run semantic analyzer passes 2 and 3 on the stale AST nodes, and type check them. We also need to do the symbol table snapshot comparison dance to find any changes, and we need to merge ASTs to preserve AST node identities. * If some triggers haven been fired, continue processing and repeat the previous steps until no triggers are fired. This is module is tested using end-to-end fine-grained incremental mode test cases (test-data/unit/fine-grained*.test). ) annotationsN)Sequence)CallableFinal NamedTupleUnion) TypeAlias)DEBUG_FINE_GRAINEDFAKE_ROOT_MODULE BuildManager BuildResultGraphState load_graphprocess_fresh_modules)FineGrainedDeferredNode) CompileError)FileSystemCache) BuildSource) DecoratorFuncDef ImportFromMypyFileOverloadedFuncDef SymbolNode SymbolTableTypeInfo)Options)semantic_analysis_for_sccsemantic_analysis_for_targets)SymbolSnapshotcompare_symbol_table_snapshotssnapshot_symbol_table) merge_asts)SavedAttributes strip_target)get_dependencies_of_targetmerge_dependencies)trigger_to_target) WILDCARD_TAG make_trigger) type_state)is_stdlib_file module_prefix split_targetirMAX_ITER)mypy_extensionstyping_extensionscBeZdZddZ dd d Zd!dZd"dZd#dZd$dZdS)%FineGrainedBuildManagerresultr returnNonec|j}||_|j|_t|j|_|j|_t |t|j|j |_ |j |_ d|_g|_d|j_g|_g|_g|_g|_dS)aYInitialize fine-grained build based on a batch build. Args: result: Result from the initialized build. The manager and graph will be taken over by this class. manager: State of the build (mutated by this class) graph: Additional state of the build (mutated by this class) NF)managergraphget_module_to_path_mapprevious_modulesfg_depsdepsr(load_fine_grained_depsr errorstargetsprevious_targets_with_errorscopyprevious_messagesblocking_errorstale cache_enabled triggeredchanged_modulesupdated_modulesprocessed_targets)selfr5r9s R/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/mypy/server/update.py__init__z FineGrainedBuildManager.__init__s. \ 6tz B BO 799:JKKTYWWW,3N,B,B,D,D),2M,>,>,@,@6:,. &+ "%'68*,,.FrIlist[tuple[str, str]]removed_modulesfollowedbool list[str]c |j||z}d|D}||_|s|jS|jjg|_g|_t||j z}d|D}|j dd d|Dz|j rCt|jr/|j dt|j zd}|jrT|j d|jd t|jg|z}|jd }d|_ ||||||}|\}\}} } | || f|_||_ | } n|st#|j|j|jt)|h|j |j}t|}|sB|jj|_ |jj} nt1| |j} | |_| S) aJUpdate previous build result by processing changed modules. Also propagate changes to other modules as needed, but only process those parts of other modules that are affected by the changes. Retain the existing ASTs and symbol tables of unaffected modules. Reuses original BuildManager and Graph. Args: changed_modules: Modules changed since the previous update/build; each is a (module id, path) tuple. Includes modified and added modules. Assume this is correct; it's not validated here. removed_modules: Modules that have been deleted since the previous update or removed from the build. followed: If True, the modules were found through following imports Returns: A list of errors. ch|]\}}|SrW.0module_s rM z1FineGrainedBuildManager.update..s???)&!v???rOch|]\}}|SrWrWrYidr[s rMr\z1FineGrainedBuildManager.update..s777eb!r777rOz==== update %s ====z, c3:K|]\}}t|VdSN)reprr^s rM z1FineGrainedBuildManager.update..s,-T-T52qd2hh-T-T-T-T-T-TrOz previous targets with errors: %sNzexisting blocker: r)rKclearrIrDr9find_module_cacherHrJdedupe_modulesrFlog_fine_grainedjoinrB is_verbosesortedrE update_one$propagate_changes_using_dependenciesr:r>setr@rA new_messages#sort_messages_preserving_file_orderrC) rLrIrQrR removed_set initial_setrEr5next_id next_pathblocker_messagesmessagess rMupdatezFineGrainedBuildManager.updates2 $$&&&)O;????? . *) ) &,,...!(4:)EFF77777  %% !DII-T-TO-T-T-T$T$T T     , DL1I1I  L ) )2VD<]5^5^^      ' L ) )*Wt?RST?U*W*W X X X,d.A-B_-TUUO!03N"&D $ __k>8FGM CO1gy3C+'. &:#, +#  #GLJIEEI5*###1"A"A&8< 8K8S8S8U8UD5#|2??AAHI$ L7xAWXX!)rOtargetstrc |jjt|j|j|jt t |j|hzg}|jj|_|jj |_ | |gS)zkTrigger a specific target explicitly. This is intended for use by the suggestions engine. ) r9r@resetrlr:r>rmrBrArnrCrDrv)rLrwrIs rMtriggerzFineGrainedBuildManager.trigger2s !!###> L J I EE EE  - 8   -1L,?,G,G,I,I)!%!4!A!A!C!C!H!H!J!J{{?B///rOcB|jjdS)zFlush AST cache. This needs to be called after each increment, or file changes won't be detected reliably. N)r9 ast_cacherd)rLs rM flush_cachez#FineGrainedBuildManager.flush_cacheFs! $$&&&&&rOrqset[str]rprE str | None?tuple[list[tuple[str, str]], tuple[str, str], list[str] | None]c  tj}|d\ } |kr2 |jvr) |vr%|jd d| |fdfS| | |v|}|\} \ }} fd|D}t | |z}tj} |jd d| |z dd t|d | |f| fS) aRProcess a module from the list of changed modules. Returns: Tuple with these items: - Updated list of pending changed modules as (module id, path) tuples - Module which was actually processed as (id, path) tuple - If there was a blocking error, the error messages from it rzskip z1 (module with blocking error not in import graph)Nc*g|]\}}|k ||fSrWrW)rYr_pathrrs rM z6FineGrainedBuildManager.update_one..qs&WWW("dwB:rOz update once: z in z.3fzs - z left)timepopr<r9rg update_modulerflen) rLrIrqrprErRt0rsr5 remainingrtt1rrs @rMrkz"FineGrainedBuildManager.update_oneNsM"Y[[,0033 ~ % %t444{** L ) )TTTT   #Wi$8$> >##GY;8NPXYY)endswith)rYr{s rMrz9FineGrainedBuildManager.update_module..s,XXXG@P@PQV@W@WXXXXrO triggered: )targets_with_errorsrK)update_isolated_timepropagate_time)&r9rgrJappendr-optionsabs_custom_typeshed_dirSENSITIVE_INTERNAL_MODULESr<r:ensure_deps_loadedr>ensure_trees_loadedrmodulesr#namesr@rzrKupdate_module_isolated isinstance BlockedUpdater; NormalUpdatecalculate_active_triggersrirjrHextendrBupdate_fine_grained_deps free_staterlrm add_statsrvrA)rLrZrrrRr9r<r:r old_snapshotssnapshotr5rr@treerrHfilteredt2s rMrz%FineGrainedBuildManager.update_module{s , %%&I6&I&I&IJJJ ##F+++ 4</G N N ,333~t+ +,0 649e444 GUVH555 Y[[>@ W_ $ $,VW_V5L5RSSH$,M& ! %%f---' D'#3UM8   fm , , 5.4 +FD)V$:5$A$AD !vtnf4 4&,/////(.%iY[[-g}vtnUU dl # # NXXyXXXH L ) )*Lx8H8H*L*L M M M i$*KKLLL U?? &M 2 249 = = = &M $ $ & & &9   I  H #"4    Y[[rBwrBwOOO )001G1G1I1IJJJ 6u = =64.$..rON)r5r r6r7)F)rIrPrQrPrRrSr6rT)rwrxr6rTr6r7) rIrPrqrrprrErrRrSr6r) rZrxrrxrrSrRrSr6r) __name__ __module__ __qualname__rNrvr{r~rkrrWrOrMr4r4s"/"/"/"/P aaaaaF0000(''''+G+G+G+GZZ/Z/Z/Z/Z/Z/rOr4r9r r:dict[str, State]initial Sequence[str]r6rTcPt|}t}g}|r|}||vs||vr||||jvrG||jpg}|||j|z||||S)aFind all the deps of the nodes in initial that haven't had their tree loaded. The key invariant here is that if a module is loaded, so are all of their dependencies. This means that when we encounter a loaded module, we don't need to explore its dependencies. (This invariant is slightly violated when dependencies are added, which can be handled by calling find_unloaded_deps directly on the new dependencies.) ) listrmraddr ancestorsr dependenciesr)r9r:rworklistseenunloadednoders rMfind_unloaded_depsrsG}}HUUDH "||~~ 4<<4u,,   w & &d -3I OOE$K4y@ A A A OOD ! ! ! " OrOrZrxr>dict[str, set[str]]r7c`||vr||jrdS|d}tt|D]h}d|d|dz}||vrB||js5t |||d||_idS)aEnsure that the dependencies on a module are loaded. Dependencies are loaded into the 'deps' dictionary. This also requires loading dependencies from any parent modules, since dependencies will get stored with parent modules when a module doesn't exist. N.T)fine_grained_deps_loadedsplitrangerrhr(r?)rZr>r:partsibases rMrrs5=A LL  E 3u::  88xxgAg'' 5==t!E= uT{AACCT J J J37E$K 0 88rOct|||}|ret|rC|dt |t |t |||dSdS)zDEnsure that the modules in initial and their deps have loaded trees.z4Calling process_fresh_modules on set of size {} ({})N)rrirgformatrrjr)r9r:r to_processs rMrrs$GUG<.restoreYs  B[  Y &/##w&&OB'[  Z &b u"I  rOcg|] }|j SrW)r_rYsts rMrz*update_module_isolated..os888bBE888rOc*g|]}|j|jfSrW)r_xpathrs rMrz*update_module_isolated..ys!???Rrx(???rOrcg|]\}}|SrWrWr^s rMrz*update_module_isolated..s333A333rOz--> z (newly imported)zfile must be at least parsed) semanal_timetypecheck_timefinish_passes_time)rrTr6r7)!rgfscacheisfile delete_moduler get_sourcesmissing_modulesremovegetrrrmodule_with_blockerrrurrrfind_relative_leaf_module parse_filerrrr_r@!replace_modules_with_new_variants type_checkerrztype_check_first_passtype_check_second_passdetect_possibly_undefined_vars finish_passesr)rZrr9r<r:rrRsourcesr new_moduleserrrIremaining_modulesstaternew_modules_dictrrt3rrrs ` ` @@@rMrr1s@0U  !9v!9!9::: ? ! !$ ' '4=4fdE7333FD"d333'/+;vtn=MxXXG (((&&v...K6""J##F++I           "KN U??f 7GUK8888 NNN&&&&88K8888999S4dB MMMMMMMM Nf (BCCC@?;???O ?a0%HH ~...+33!2333444  !C!C!C!CDDDD &ME  : ! !#A ! ! ! BL!%%(W^DDDD LLLVT+E E %I I9 "I4.I94I9rrPtuple[str, str]c|sJt|}d|D}|D];\}}||}tt|j|zdkr||fcS<|dS)aTFind a module in a list that directly imports no other module in the list. If no such module exists, return the lexicographically first module from the list. Always return one of the items in the modules list. NOTE: If both 'abc' and 'typing' have changed, an effect of the above rule is that we prefer 'abc', even if both are in the same SCC. This works around a false positive in 'typing', at least in tests. Args: modules: List of (module, path) tuples (non-empty) graph: Program import graph that contains all modules in the module list ch|]\}}|SrWrWrXs rMr\z,find_relative_leaf_module..s222YVQ&222rOr)rjrrmr)rr: module_setrZrrs rMrrs NNNWooG22'222J  f  s5%&&3 4 4 9 94<    : 1:rO module_idc|d|||vr||=||jvr|j|=|d}t|dkrPd|dd}||jvr*|j|}|d|jvr|j|d=|j|r|j |dSdS)Nzdelete module rr) rgrrrrhrrrrr)rrr:r9 components parent_idparents rMrrs ;i;;<<<E ) GO## OI &%%J :HHZ_--  ' '_Y/F"~--LB0d##/##I.....//rOct}g}|D]5\}}||vr,|||||f6|Sra)rmrr)rrr5r_rs rMrfrfsWUUD F&&D T>> HHRLLL MM2t* % % % MrOc>d|DS)Nc$i|] \}}||jSrWr)rYrZrs rM z*get_module_to_path_map..s A A A<64FDJ A A ArO)items)r:s rMr;r;s A A5;;== A A AArOrrrIlist[BuildSource]c g}|D]@\}}||r&|t||d|A|S)N)rR)rrr)rrrIrRrr_rs rMrrs\ G#KKD >>$   K NN;tRIII J J J NrOr$dict[str, dict[str, SymbolSnapshot]]rdict[str, MypyFile | None]rct}|D]m}||}|||i}||}|2t|t }||nt||j}t |||}|d} |D]} | d| dzkr:| dddvr||tz| d| dzkr7|| dddtz||z}od|DS)zDetermine activated triggers by comparing old and new symbol tables. For example, if only the signature of function m.f is different in the new symbol table, return {''}. Nrrr) __builtins____file__r __package____doc__rc,h|]}t|SrWr+rYnames rMr\z,calculate_active_triggers.."s 1 1 14L   1 1 1rO) rmrrr#rrr"countrCrr*rsplit) r9rrrr_ snapshot1new snapshot2diffpackage_nesting_levelitems rMrrseeE!!!%%b))   IIbMMMI"o ;-b+--@@I IIbMMMM-b#)<???   1 15 1 1 11rO old_modulesc|D]V}||}||}|r5|3t||j||j||j|<|||_WdS)aReplace modules with newly builds versions. Retain the identities of externally visible AST nodes in the old ASTs so that references to the affected modules from other modules will still be valid (unless something was deleted or replaced with an incompatible definition, in which case there will be dangling references that will be handled by propagate_changes_using_dependencies). N)rr$rrr)r9r:rrr_preserved_module new_modules rMrr%sy..&??2.. _  . 6 ')9)?ZM] ^ ^ ^"2GOB -E"IN ..rOrHup_to_date_modulesrrKc fd}g}|s|r|dz }|tkrtdtzt||||\} } } |fdt | D|D]s} t | } | _| |vr[| | vrt | | <|d| t|| \}}| |  |tt }| D]}tj |t | dD]"\} }| |vsJ|t|| |||z}#t }t }t|r%|d t||||S) aiTransitively rechecks targets based on triggers and the dependency map. Returns a list (module id, path) tuples representing modules that contain a target that needs to be reprocessed but that has not been parsed yet. Processed targets should be appended to processed_targets (used in tests only, to test the order of processing targets). rrz5Max number of iterations (%d) reached (endless loop?)c36K|]}||jfVdSrar)rYr_r:s rMrcz7propagate_changes_using_dependencies..]s. R R2"eBio!6 R R R R R RrONzprocess target with error: c|dSNrrW)xs rMz6propagate_changes_using_dependencies..ps AaDrOkeyr)r0 RuntimeErrorfind_targets_recursiverrjr.rmrg lookup_targetrvr,reset_subtype_caches_forrreprocess_nodesrir)r9r:r>rHr rrKnum_iterrtodor stale_protosrwr_ more_nodesr[infonodess ` rMrlrl=s$$H/1 %H*%HA  h  VYaabb b'= UIt-?( ( $h    R R R RAQAQ R R RRRR* , ,Fuf--B~",>">">T>>"uuDH(()Ov)O)OPPP -gv > > AR +++EE ! 6 6D  / 5 5 5 5  ..AAA ] ]IB///// %UDJ[\\ \II!UU!ee g   H  $ $%F4 ??%F%F G G GK %H*%HN rOtriggersGtuple[dict[str, set[FineGrainedDeferredNode]], set[str], set[TypeInfo]]ci}|}t}t}t} |rH||z}|} t}| D],} | drYt|t| } | rt | ||||| t|z z}qt|| } | | |vr| |jvs|j| jr| | | |vrt|| <| d| t|| \} }|r||||  | .|H|| |fS)zFind names of all targets that need to reprocessed, given some triggers. Returns: A tuple containing a: * Dictionary from module id to a set of stale targets. * A set of module ids for unparsed modules with stale targets. r r5r processedr0unloaded_filescurrentrwrdeferred stale_protos rMr*r*~s79FH%%I"%%%L"uuN #3X 55 3 3F  %% 3)%1B61J1JKK ?&y$>>>DHHVSUU33i??)%88 $ 222W_44y1C5 #&&y111F**(+F9%(()=V)=)=>>>(5gv(F(F%+2 $$[111y!((2222G #3J >< //rOnodesetset[FineGrainedDeferredNode]c||vr&|d|ztS|j|}t|j|j}d|D}t|j|j}dd} t|| } ||} | j } |j |j |j | jp| j|j |j |jt} | D].}t%||j}|| |/|j |j | | D]2}||kr*||jD]}|j |3i}| D]6}||jjt3|j|7t5||| ||t|j|j}|D]$}||vrt7||||||%||}|d |_d |_| | }|r2d }|| rd }|2|j j!r2|j"#||$t|j|j}tK|j||}d|D}tM|| ||| ||'||(|S)zQReprocess a set of nodes within a single module. Return fired triggers. z-%s not in graph (blocking errors or deleted?)c>i|]\}}||SrW)rC)rYrrs rMrz#reprocess_nodes..s&MMM+$4MMMrOrrr6intc|jjSra)rline)rs rMr(zreprocess_nodes..keysy~rOr'NrFTc,h|]}t|SrWrrs rMr\z"reprocess_nodes..s <<rK file_node old_symbolsold_symbols_snapshotr(r3rrrArrwr2 saved_attrsr= new_symbolsrcheckermorenew_symbols_snapshotchanged new_triggereds rMr-r-s  !PS\!\]]]uu  *I.y/A9?SSKMM9J9J9L9LMMMK01CY_UU 7 $ $ $E ) EmG N)) /1F1Z%JZ N$$Y^Y5LMMMeeG  !)TY77   KK    N**9>7CCC44 Y  i(5 4 4--d3333$&K11  !7888X]K0000!% "2E5+NNN/y/A9?SSKSS ;   y+d"3Y D@Q R R RI++--G MMOOOGG  $ $U + +D    ( ( * * < < > > D  #>  y!1!:!:!rr=rrYrnew_depsr{rAs rMrZrZ/s < <}#,,..Y$!G- tT8W-C  !) 0 0 < < GW OOGSUU + + 2 27 ; ; ; ; <#D)))))rOrw5tuple[list[FineGrainedDeferredNode], TypeInfo | None]cBdfd }j}t|}||gdfS|\}}|r|d}ng}||}d} d} |D]} t|tr|} t|t r|} t|t tfr | |jvr|gdfcS|j| jrgdfcS|j| j}t|tr| J|j kr|gdfSt| dg} d} |j r|} |j D]O\}}|j}t|tr.tdz|z\}}| |P| | fSt|t r|j}t|tt t$fs|gdfS|j kr|gdfSt|| gdfS)aLook up a target by fully-qualified name. The first item in the return tuple is a list of deferred nodes that needs to be reprocessed. If the target represents a TypeInfo corresponding to a protocol, return it as a second item in the return tuple, otherwise None. r6r7c:dddS)NzCan't find matching target for z (stale dependency?))rg)r9rwsrM not_foundz lookup_target..not_foundNs)  !_6!_!_!_`````rONrr)rr/rrrrrplugin_generatedrrIr is_protocolrrr+rrfuncr)r9rwrsrrrZrestrrfile active_classcr5 stale_inforsymnodemethodr[s`` rMr+r+DsaaaaaaaoG & ) )E } 4xLFD ZZ__  %foD DL  " " dH % % L dH % % D$8 455 $*9L9L IKKKt8OOO :a= ) t8OOOz!}!$!!"  =F " " IKKKt8O)$556&*   J!Z--// & &MD'>rOc0|jjdkptS)Nr)r verbosityr )r9s rMriris ? $ ) ?-??rOr&FuncDef | MypyFile | OverloadedFuncDefrct|tr||jkrdS|S|jr|jjd|jS|d|jS)a'Return the target name corresponding to a deferred node. Args: module: Must be module id of the module that defines 'node' Returns the target name, or None if the node is not a valid target in the given module (for example, if it's actually defined in another module). Nr)rrrIr2r)rZrs rMrPrPsh$!! + T] " "4 9 +i(664966 6**ty** *rOwin32)z /__init__.pyz /__init__.pyi INIT_SUFFIXESz __init__.pyz __init__.pyi refresh_fileCallable[[str, str], list[str]]list[str] | Nonecd}||tsdStj|} ||}n#t $rg}YnwxYw|D]} | dr.| ds| ddkrG| dd|dzz} t| } t|||| |vr|| D]} | | } | s't|| }|| |} | r| j| jJ|| j| j}| j}|sJ|jD]}t#|t$rh|j|kr]t'fd|jDr=| | jvr4| j| | j| |S)aLook for submodules that are now suppressed in target package. If a submodule a.b gets added, we need to mark it as suppressed in modules that contain "from a import b". Previously we assumed that 'a.b' is not a module but a regular name. This is only relevant when following imports normally. Args: module: target package in which to look for submodules path: path of the module refresh_file: function that reads the AST of a module (returns error messages) Return a list of errors from refresh_file() if it was called. If the return value is None, we didn't call refresh_file(). N)z.pyz.pyiz __init__.rrrc3*K|] \}}|kVdSrarW)rYrr[ shortnames rMrcz0refresh_suppressed_submodules..s,'S'SgdA (9'S'S'S'S'S'SrO)rrosrdirnamelistdirFileNotFoundErrorr8rrr+rrr.rr_importsrranyrsuppressed_set suppressedrr)rZrr>r:rrrupkgdirentriesfnam submoduler{depr dep_modulerimprs @rMrefresh_suppressed_submodulesrsH0H |4==77|t W__T " "F//&)) (D(D o.. {++ zz#!## JJsOOA& SL9, y)) 64/// d??G} D D #6!.uc!:!:J!- % * 5 5Dz) %z555#/<%*#E#E :DKKK#|DD%c:66D #& 0 0$''S'S'S'S'S'S'S$S$S!1$-U5I$I$I % 0 7 7 B B B % 4 8 8 C C C OsA A'&A'messagec^tjd|}|r|dSdS)Nz([^:]+):[0-9]+: (error|note): r)rematchgroup)rms rMextract_fnam_from_messagers1 2G<.7s !A$rOr')rrrr8rrrjr) rurnordermsgrgroupsr maybe_fnamrr5r(s rMroros A E(--  D%%E$K FAF A c(mm  qk7<<    AH %%6xAGGuTT-hq1uo>>F Q228<<GQ Xa[))) AH %%6xAGGuTT-hq1uo>>F Q228<<G  uyyQ//7888 Q c(mm  "F / / /F F U e MrO)r9r r:rrrr6rT)rZrxr>rr:rr6r7)r9r r:rrrr6r7)rZrxrrxr9r r<rr:rrrSrRrSr6r)rrPr:rr6r) rrxrrxr:rr9r r6r7)rrPr6rP)r:rr6r) rrrrrIrPrRrSr6r)r9r rr rr r6r) r9r r:rrr rr r6r7)r9r r:rr>rrHrr rrrrKrTr6rP) r9r r:rr4rr>rr rr6r5)r9r r:rrrxr?r@r>rrKrTr6r)rfrxrgrr6rh) rrxr3rjr:rr>rrrr6r7)r9r rwrxr6rp)r9r r6rS)rZrxrrr6r)rZrxrrr>rr:rrrrrr6r)rrxr6r)rrxr6rx)rurTrrTr6rT)ir __future__rrrsysrcollections.abcrtypingrrrrr2r r mypy.buildr r r r rrrr mypy.checkerr mypy.errorsr mypy.fscachermypy.modulefinderr mypy.nodesrrrrrrrr mypy.optionsrmypy.semanal_mainrr mypy.server.astdiffr!r"r#mypy.server.astmerger$mypy.server.aststripr%r&mypy.server.depsr'r(mypy.server.targetr)mypy.server.triggerr*r+mypy.typestater, mypy.utilr-r.r/r0rrr4rrrrrrrrrrfr;rrrrlr*r-rHrZr+rirPplatformrsepaltseprrrrorWrOrMrspppd#""""" $$$$$$555555555555555555                    100000$$$$$$(((((())))))                    ! VVVVVVVV ,+++++>>>>>>>>KKKKKKKK000000::::::::%%%%%%AAAAAAAAAAFk/k/k/k/k/k/k/k/\ 88888& : : : :.:J!}!<= ====uEuEuEuEp6////,BBBB    -2-2-2-2`....0>>>>B;0;0;0;0|^^^^B$*****K?K?K?K?\@@@@++++*<7