o tBh#@szUdZddlmZddlmZddlmZddlmZm Z ddl m Z ddl m Z ddlmZdd lmZmZmZmZmZmZmZmZdd lmZdd lmZdd lmZmZm Z m!Z!m"Z"m#Z#m$Z$m%Z%m&Z&m'Z'm(Z(m)Z)m*Z*d Z+de,d<e GdddZ-e Gddde-Z.d;ddZ/dd9d:Z6d$S)?z@Shared definitions used by different parts of semantic analysis.) annotations)abstractmethod)Callable)FinalProtocol)trait)join) ErrorCode)Context ExpressionFuncDefNode SymbolNode SymbolTableSymbolTableNodeTypeInfo)TypeVarLikeScope) TypeQuery) TPDICT_FB_NAMES FunctionLikeInstance ParametersParamSpecFlavor ParamSpecTypePlaceholderType ProperType TupleTypeType TypeVarIdTypeVarLikeTypeget_proper_typerPRIORITY_FALLBACKSc@seZdZdZe d2d3d d Zed4ddZed5ddZe d2dddd6ddZeddd7ddZ ed8dd Z ed9d:d$d%Z ed;d'd(Z e edSemanticAnalyzerCoreInterfacezA core abstract interface to generic semantic analyzer functionality. This is implemented by both semantic analyzer passes 2 and 3. Fnamestrctxr suppress_errorsboolreturnSymbolTableNode | NonecCtNNotImplementedErrorselfr$r&r'r1j/var/www/html/riverr-enterprise-integrations-main/venv/lib/python3.10/site-packages/mypy/semanal_shared.pylookup_qualified7z.SemanticAnalyzerCoreInterface.lookup_qualifiedrcCr+r,r-r0r$r1r1r2lookup_fully_qualified=z4SemanticAnalyzerCoreInterface.lookup_fully_qualifiedcCr+r,r-r5r1r1r2lookup_fully_qualified_or_noneAr7z)r;r%r&r r:r=r)r>r)r>)NF)rCrDrEr(r)r>)rGr%r)r(r)r()rKr%r)r()__name__ __module__ __qualname____doc__rr3r6r8r?r@rBrFrHpropertyrJrLrMrNr1r1r1r2r#0sB      r#c@seZdZUdZded<e dUdVd dZedWdXddZedWdYddZedZddZ edddddddd[d)d*Z ed\d.d/Z ed]d4d5Z ed^d9d:Z ed_d=d>Zed`d@dAZe   dadbdGdHZedcdIdJZedddNdOZededQdRZeedfdSdTZdS)gSemanticAnalyzerInterfacezA limited abstract interface to some generic semantic analyzer pass 2 functionality. We use this interface for various reasons: * Looser coupling * Cleaner import graph * Less need to pass around callback functions r tvar_scopeFr$r%r&r r'r(r)r*cCr+r,r-r/r1r1r2lookupr4z SemanticAnalyzerInterface.lookupNrGargslist[Type] | NonercCr+r,r-r0rGr[r1r1r2 named_typer7z$SemanticAnalyzerInterface.named_typeInstance | NonecCr+r,r-r]r1r1r2named_type_or_noner7z,SemanticAnalyzerInterface.named_type_or_nonenoder r>cCr+r,r-)r0rar1r1r2acceptr7z SemanticAnalyzerInterface.acceptT)rYallow_tuple_literalallow_unbound_tvarsallow_requiredallow_placeholderreport_invalid_typestrTypeVarLikeScope | Nonercrdrerfrg Type | NonecCr+r,r-)r0rhrYrcrdrerfrgr1r1r2 anal_types z#SemanticAnalyzerInterface.anal_type type_exprslist[Expression]list[TypeVarLikeType]cCr+r,r-)r0rlr1r1r2get_and_bind_all_tvarsr7z0SemanticAnalyzerInterface.get_and_bind_all_tvarsbasetype_or_fallbacklineintrcCr+r,r-)r0r$rprqr1r1r2basic_new_typeinfor7z,SemanticAnalyzerInterface.basic_new_typeinfopriorityfnCallable[[], None]cCr+r,r-)r0rtrur1r1r2schedule_patchr7z(SemanticAnalyzerInterface.schedule_patchstnodercCr+)z%Add node to the current symbol table.r-)r0r$rxr1r1r2add_symbol_table_noderIz/SemanticAnalyzerInterface.add_symbol_table_nodercCr+)z^Get currently active symbol table. May be module, class, or local namespace. r-rAr1r1r2current_symbol_tablesz.SemanticAnalyzerInterface.current_symbol_tablercontext module_public module_hidden can_defercCr+)z'Add symbol to the current symbol table.r-)r0r$rar{r|r}r~r1r1r2 add_symbols z$SemanticAnalyzerInterface.add_symbolcCr+)aAdd symbol to the current symbol table, skipping locals. This is used to store symbol nodes in a symbol table that is going to be serialized (local namespaces are not serialized). See implementation docstring for more details. r-)r0r$rar1r1r2add_symbol_skip_localsz/SemanticAnalyzerInterface.add_symbol_skip_localexprr bool | NonecCr+r,r-)r0rr1r1r2 parse_boolr7z$SemanticAnalyzerInterface.parse_boolncCr+r,r-)r0rr1r1r2qualified_namer7z(SemanticAnalyzerInterface.qualified_namecCr+r,r-rAr1r1r2is_typeshed_stub_filerIz/SemanticAnalyzerInterface.is_typeshed_stub_filerOrPr,)rGr%r[r\r)r)rGr%r[r\r)r_)rar r)r>)rhrrYrircr(rdr(rer(rfr(rgr(r)rj)rlrmr)rn)r$r%rprrqrrr)r)rtrrrurvr)r>)r$r%rxrr)r()r)r)TFT)r$r%rarr{r r|r(r}r(r~r(r)r()r$r%rarr)r>)rr r)r)rr%r)r%rR)rSrTrUrV__annotations__rrZr^r`rbrkrorsrwryrzrrrrrWrr1r1r1r2rXwsX           rXsigrfdefr r)rcCsXt|}t|tr*|jr$|jjtvrd}n|jj}||jd|S||jS|S)N TypedDictz of )r isinstancerinforGrr$ with_name)rr class_namer1r1r2set_callable_names   rtyprr>cCs<|j}|jjdks Jtt|jf|jdd|_dS)aCalculate a precise item type for the fallback of a tuple type. This must be called only after the main semantic analysis pass, since joins aren't available before that. Note that there is an apparent chicken and egg problem with respect to verifying type arguments against bounds. Verifying bounds might require fallbacks, but we might use the bounds to calculate the fallbacks. In practice this is not a problem, since the worst that can happen is that we have invalid type argument values, and these can happen in later stages as well (they will generate errors, but we don't prevent their existence). builtins.tupler!N)partial_fallbacktyperGrjoin_type_listlistitemsr[)rfallbackr1r1r2calculate_tuple_fallbacks&rc@seZdZd d dd ZdS) _NamedTypeCallbackNfully_qualified_namer%r[r\r)rcCsdSr,r1)r0rr[r1r1r2__call__z_NamedTypeCallback.__call__r,)rr%r[r\r)r)rSrTrUrr1r1r1r2rsrN)rqcolumnprefixr$r%rGidTypeVarId | intnamed_type_funcrqrrrrParameters | Nonerc Cs&t|||tj|d|dg|||dS)Nrbuiltins.objectflavor upper_boundrqrr)rrARGSr$rGrrrqrrr1r1r2paramspec_args s rc Cs,t|||tj|d|d|dg|||dS)Nz builtins.dictz builtins.strrr)rrKWARGSrr1r1r2paramspec_kwargs s rcs(eZdZd fdd Zd dd ZZS) HasPlaceholdersr)r>csttdSr,)super__init__anyrA __class__r1r2r9szHasPlaceholders.__init__rhrr(cCsdS)NTr1)r0rhr1r1r2visit_placeholder_type<rz&HasPlaceholders.visit_placeholder_typerQ)rhrr)r()rSrTrUrr __classcell__r1r1rr2r8srr(cCs |tS)z=Check if a type contains any placeholder types (recursively).)rbr)rr1r1r2has_placeholder@s r)rrrr r)r)rrr)r>)r$r%rGr%rrrrrqrrrrrrrr)r)rrr)r()7rV __future__rabcrtypingrtyping_extensionsrrmypy_extensionsrmypyrmypy.errorcodesr mypy.nodesr r r r rrrrmypy.tvar_scopermypy.type_visitorr mypy.typesrrrrrrrrrrrrr r"rr#rXrrrrrr(rrr1r1r1r2s<      ( < F j