+ i:h^RIHt^RIt^RIHt^RIHt^RIHtH t H t H t H t ^RI Ht^RIHtHt]'d$^RIHt] !R ]R 7t]].]3,R,t] R ]R ,]R,]R3,t]]],,]]R 3,,],R,t!R R4tR#)) annotationsN) defaultdict)Callable) TYPE_CHECKINGTypeVarUnioncastoverload)_invalidate_cache)SuccessfulInferenceResult TransformFn)nodes_SuccessfulInferenceResultT)bound nodes.NodeNG.c]tRt^$tRtRRltRRltRRlt]RR l4t ]R R l4t ]R R l4t ]RRl4t ]RRl4t RRlt RRRllt RRRllt RRlt Rt R#)TransformVisitora8A visitor for handling transforms. The standard approach of using it is to call :meth:`~visit` with an *astroid* module and the class will take care of the rest, walking the tree and running the transforms for each encountered node. Based on its usage in AstroidManager.brain, it should not be reinstantiated. cV^8dQhRR/#)returnNone)formats"4/usr/lib/python3/dist-packages/astroid/transforms.py __annotate__TransformVisitor.__annotate__/s  $ c .\\4VnR#N)rlist transforms)selfs&r__init__TransformVisitor.__init__/s   rc V^8dQhRRRR/#)rnoder rr)rs"rrr<s8=Vrc VPpVPV,FEwr4VeV!V4'gKV!V4pVe \4TpVPV8wgKDV# V#)zTCall matching transforms for the given node if any and return the transformed node. ) __class__r!r )r"r&clstransform_func predicaterets&& r _transformTransformVisitor._transform<sknn)-)=)= %N IdOO$T*?%'D==C' *> rc V^8dQhRRRR/#rr&rrr r)rs"rrrOs % %< %,E %rc VPFOp\W4p\'d\\V4pVP V4pWC8wgKC\ WV4KQ VPV4#r)_astroid_fieldsgetattrrr _Vistables_visit_genericsetattrr-)r"r&namevaluevisiteds&& r_visitTransformVisitor._visitOs^((DD'E}Z/))%0GG,)t$$rc V^8dQhRRRR/#)rr&rrr)rs"rrr[s5545D5rc R#rrr"r&s&&rr5TransformVisitor._visit_genericZs25rc V^8dQhRRRR/#)rr&strrr)rs"rrr^s333333rc R#rrr>s&&rr5r?]s03rc V^8dQhRRRR/#)rr&zlist[nodes.NodeNG]rzlist[SuccessfulInferenceResult]r)rs"rrras..&. (.rc R#rrr>s&&rr5r?`s+.rc V^8dQhRRRR/#)rr&ztuple[nodes.NodeNG, ...]rz%tuple[SuccessfulInferenceResult, ...]r)rs"rrrfs44,4 .4rc R#rrr>s&&rr5r?es14rc V^8dQhRRRR/#r0r)rs"rrrksRR<R4MRrc R#rrr>s&&rr5r?jsORrc V^8dQhRRRR/#)rr&r4r _VisitReturnsr)rs"rrrms:-rc aV'gV#\V\4'd"VUu.uFpSPV4NK up#\V\4'd3\;QJd.V3RlV4FNK 5#!V3RlV44#\V\4'dV#SP V4#uupi \ d'\P!RT R2\^R7Tu#i;i)c3F<"TFpSPV4xK R#5ir)r5).0childr"s& r 2TransformVisitor._visit_generic..ssF,,U33s!z Astroid was unable to transform z. Some functionality will be missing unless the system recursion limit is lifted. From pylint, try: --init-hook='import sys; sys.setrecursionlimit(2000)' or higher.) stacklevel) isinstancer r5tuplerAr:RecursionErrorwarningswarn UserWarning)r"r&rNsf& rr5r?msK dD ! !<@AD5D''.DA A dE " "5FF5 F5FFF F dC K ;;t$ $B  MM24&9ee  K sB5$B::.C+*C+Nc(V^8dQhRRRRRRRR/# r node_classz!type[_SuccessfulInferenceResultT] transformz(TransformFn[_SuccessfulInferenceResultT]r+z._Predicate[_SuccessfulInferenceResultT] | Nonerrr)rs"rrrs9CC5C<CB C  Crc LVPV,PW#34R#)a"Register `transform(node)` function to be applied on the given node. The transform will only be applied if `predicate` is None or returns true when called with the node as argument. The transform function may return a value which is then used to substitute the original node in the tree. N)r!appendr"rZr[r+s&&&&rregister_transform#TransformVisitor.register_transforms  #**I+ABrc(V^8dQhRRRRRRRR/#rYr)rs"rrrs9CC5C<CB C  Crc LVPV,PW#34R#)zUnregister the given transform.N)r!remover^s&&&&runregister_transform%TransformVisitor.unregister_transforms  #**I+ABrc V^8dQhRRRR/#r0r)rs"rrrs!!,!+D!rc $VPV4#)zWalk the given astroid *tree* and transform each encountered node. Only the nodes which have transforms registered will actually be replaced or changed. )r:r>s&&rvisitTransformVisitor.visits {{4  r)r!r)__name__ __module__ __qualname____firstlineno____doc__r#r-r:r r5r_rdrh__static_attributes__rrrrr$s & %55 33 ..44RR.C C!!rr)r.) __future__rrU collectionsrcollections.abcrtypingrrrr r astroid.contextr astroid.typingr r astroidrrbool _Predicater rSrAr4rJrrrrrys ##$@@-A")%-F#67=>EJD(%0C*Dc4O  $%& %s *+,    !!r