grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026+ u=p~Rt^RI5R1RRRRRR2/RlltRtR3R RR R/R lltR tR tR4RltRtRt R5Rlt Rs R6Rlt Rt RR/RltRtRR/Rlt!RR]4t!RR]4t!RR]4t!RR ]4t!R!R"]4t]!]R#4'gR$tR%t]!]]4]n!R&R']4t!R(R)] 4t!!R*R+] 4t"!R,R-] 4t#R.t$R6R/lt%]&R08Xd ]%!4R#R#)7a The `ast` module helps Python applications to process trees of the Python abstract syntax grammar. The abstract syntax itself might change with each Python release; this module helps to find out programmatically what the current grammar looks like and allows modifications of it. An abstract syntax tree can be generated by passing `ast.PyCF_ONLY_AST` as a flag to the `compile()` builtin function or by using the `parse()` function from this module. The result will be a tree of objects whose classes all inherit from `ast.AST`. A modified abstract syntax tree can be compiled into a Python code object using the built-in `compile()` function. Additionally various helper functions are provided that make working with the trees simpler. The main intention of the helper functions and this module in general is to provide an easy to use interface for libraries that work tightly with the python syntax (template engines for example). :copyright: Copyright 2008 by Armin Ronacher. :license: Python License. )* type_commentsFfeature_versionNoptimizec \pV^8dV\,pV'dV\,pVfRpM1\V\4'dVwrxV^8wd\ RV 24hTp\ WW&WER7#)z Parse the source into an AST node. Equivalent to compile(source, filename, mode, PyCF_ONLY_AST). Pass type_comments=True to get back type comments where the syntax allows. zUnsupported major version: )_feature_versionr) PyCF_ONLY_ASTPyCF_OPTIMIZED_ASTPyCF_TYPE_COMMENTS isinstancetuple ValueErrorcompile) sourcefilenamemoderrrflagsmajorminors &&&$$$ */opt/alt/python314/lib64/python3.14/ast.pyparsers} E!| ## ## OU + +&  A::5'BC C 6T$3 HHcaaaa\V\4'd\VPR4RR7p\V\4'd VP pRoV3RloV3RloVVVV3RloS!V4#)a< Evaluate an expression node or a string containing only a Python expression. The string or node provided may only consist of the following Python literal structures: strings, bytes, numbers, tuples, lists, dicts, sets, booleans, and None. Caution: A complex expression can overflow the C stack and cause a crash. z eval)rctRp\VRR4;p'd VRV 2, p\VRV: 2,4h)zmalformed node or stringlinenoNz on line z: )getattrr)nodemsglnos& r_raise_malformed_node+literal_eval.._raise_malformed_node?sB($$/ /3 / Yse$ $CD8},--rc<\V\4'd*\VP4\\ \ 39d S!V4VP#N)r Constanttypevalueintfloatcomplex)rr!s&r _convert_num"literal_eval.._convert_numDs:$))T$**-=c5RYEZ-Z !$ 'zzrc<\V\4'd_\VP\\34'd9S!VP 4p\VP\4'dV5#V)#S!V4#r$)r UnaryOpopUAddUSuboperand)rr2r+s& r_convert_signed_num)literal_eval.._convert_signed_numHs^ dG $ $DGGdD\)J)J"4<<0G$''4(( y  y D!!rc *<\V\4'd VP#\V\4'd \ \ SVP 44#\V\4'd \\ SVP 44#\V\4'd \\ SVP 44#\V\4'dk\VP\4'dKVPPR8Xd0VPVP u;8Xd.8Xd \4#\V\"4'ds\%VP&4\%VP(48wd S!V4\+\-\ SVP&4\ SVP(444#\V\.4'd\VP0\2\434'dS!VP64pS!VP84p\V\:\<34'dG\V\>4'd1\VP0\24'd W,#W, #S!V4#)set) r r%r'Tupler mapeltsListlistSetr6CallfuncNameidargskeywordsDictlenkeysvaluesdictzipBinOpr/AddSubleftrightr(r)r*)rrLrM_convertr+r3r!s& rrNliteral_eval.._convertPs dH % %::  e $ $Xtyy12 2 d # #Hdii01 1 c " "s8TYY/0 0t$$DIIt)D)Diille# T]](Hb(H5L)I d # #499~T[[!11%d+C$))4$++689 9 e $ $DGGc3Z)H)H&tyy1D ,E$e --*UG2L2Ldggs++<'<'"4((r)r strrlstrip Expressionbody)node_or_stringrNr+r3r!s&@@@@r literal_evalrU2sg.#&&~44U;&I.*--',,. "))4 N ##rindent show_emptycaaaaaRVVVVV3Rllo\V\4'g'\RVPP,4hSe \S\ 4'g RS,oS!V4^,#)a Return a formatted dump of the tree in node. This is mainly useful for debugging purposes. If annotate_fields is true (by default), the returned string will show the names and the values for fields. If annotate_fields is false, the result string will be more compact by omitting unambiguous field names. Attributes such as line numbers and column offsets are not dumped by default. If this is wanted, include_attributes can be set to true. If indent is a non-negative integer or string, then the tree will be pretty-printed with that indent level. None (the default) selects the single line representation. If show_empty is False, then empty lists and fields that are None will be omitted from the output for better readability. c<aSe+S^, oRSS,,pRSS,,pMRpRp\V\4'Ed\V4p.p.pRpSpVPFp \ W 4p T f\ YIR4fRpK%S'g|T .8XdZTP PT \4p \ T RR4\Jd%T'gTP\T 44KT'gTPT4.pS !T S4wrT;'dT pT'dTPT : RT : 24KTPT 4K S'duVP'dcVPFRp \ W 4p T f\ YIR4fK#S !T S4wrT;'dT pTPT : RT : 24KT V'dE\V4^8:d5VPP : R RP#V4: R 2V'*3#VPP : R V: VP#V4: R 2R 3#\V\4'd1V'gR#R V: VP#V V3R lV44: R2R 3#\V4R3# \ dRpEKTi;i \ dEKKi;i)N z, z, T. __origin__=()F[c3D<"TFpS!VS4^,xK R#5i)N).0x_formatlevels& r (dump.._format..s /Sd50A!0D0Dds ])z[]T)r ASTr&_fieldsrAttributeError _field_typesgetobjectr;appendreprextend _attributesrD __class____name__join)rrgprefixsepclsrA args_buffer allsimplerBnamer' field_typesimplerfannotate_fieldsinclude_attributesrVrWs&f rrfdump.._formatsu   QJEFUN*F&5.(CFC dC t*CDKI&H #D/E=WS%<%D#H!{%(%5%5%9%9$%G ":|SATI#+ + 2 24; ?$# K0&( 'u 5 %00& KK4 78KK&1%2"d&6&6&6 ,,D! ' 3}C)@)H $+E5$9ME ) 4 4fIKK4 78-SY!^#'>>#:#:DIIdOLRVhVV!%!8!8&#((4.QSXX X d # #!!%sxx/Sd/S'STV[[ [Dz4Q&#H4*! !s$/ J. K. K?K KKzexpected AST, got %r )rb)r rk TypeErrorrurvrP)rrrrVrWrfs&ffdd@rdumprmsb$9 9 v dC .1H1HHII *VS"9"9v 4= rcRFopW!P9gKW P9gK'\WR4pVf-\W4'gKJVPR4'gKc\ WV4Kq V#)z Copy source location (`lineno`, `col_offset`, `end_lineno`, and `end_col_offset` attributes) from *old_node* to *new_node* if possible, and return *new_node*. Nend_)r col_offset end_linenoend_col_offset)rtrhasattr startswithsetattr)new_nodeold_nodeattrr's&& r copy_locationrse G '' 'D4H4H,HHD1E ''DOOF,C,C.G Orc,aV3RloS!V^^^^4V#)ac When you compile a node tree with compile(), the compiler expects lineno and col_offset attributes for every node that supports them. This is rather tedious to fill in for generated nodes, so this helper adds these attributes recursively where not already set, by setting them to the values of the parent node. It works recursively starting at *node*. c<RVP9d&\VR4'gWnM VPpRVP9d#\VRR4fW0nM VPpRVP9d&\VR4'gW nM VP pRVP9d#\VRR4fW@nM VP p\V4F pS!WQW#V4K R#)rrNrr)rtrrrrrriter_child_nodes)rrrrrchild_fixs&&&&& rr#fix_missing_locations.._fixs t'' '4**$  4++ +t\408",!__ 4++ +4..",!__ t// /t-t4<&4#!%!4!4%d+E   G,rrc)rrs&@rfix_missing_locationsrs H. q!Q KrcF\V4Fp\V\4'd\VR^4V,VnK4RVP 9d\VR^4V,VnRVP 9gKq\VR^4;pfKW1,VnK V#)z Increment the line number and end line number of each node in the tree starting at *node* by *n*. This is useful to "move code" to a different location in a file. rr)walkr TypeIgnorerrrtr)rnrrs&& rincrement_linenors d eZ ( ("5(A6:EL  u(( ("5(A6:EL E-- -&ulA>>K)~E  Krc#x"VPFpV\W43xK R# \dK'i;i5i)zg Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields`` that is present on *node*. N)rlrrm)rfields& r iter_fieldsr s=  -- -   s:(: 7:7:c#"\V4F^wr\V\4'dVxK!\V\4'gK9VFp\V\4'gKVxK! K` R#5i)z} Yield all direct child nodes of *node*, that is, all fields that are nodes and all items of fields that are lists of nodes. N)rr rkr;)rr}ritems& rrrsS #4(  eS ! !K t $ $dC((J )sAA2A2$A2c\V\\\\34'g'\ RVP P,4hVP'd(\VP^,\4'gR#VP^,Pp\V\4'd.\VP\4'dVPpMR#V'd^RI pVPV4pV#)a+ Return the docstring for the given node or None if no docstring can be found. If the node provided does not have docstrings a TypeError will be raised. If *clean* is `True`, all tabs are expanded to spaces and any whitespace that can be uniformly removed from the second line onwards is removed. z%r can't have docstringsN)r AsyncFunctionDef FunctionDefClassDefModulerrurvrSExprr'r%rPinspectcleandoc)rcleantextrs&& r get_docstringr&s d-{HfM N N2T^^5L5LLMM 999DIIaL$77 99Q<  D$!!jS&A&Azz % Krc\f^RIpVPR4s.p\\P V4^4F*wrEVe WA8dV#VP V^,4K, V#)zuSplit a string into lines ignoring form feed and other chars. This mimics how the Python parser splits source code. Nz(.*?(?:\r\n|\n|\r|$))) _line_patternrer enumeratefinditerrq)rmaxlinesrlinesrmatchs&& r_splitlines_no_ffr?sl  #;< E"=#9#9&#A1E   F$5  L  U1XF LrcPRpVFpVR9d W, pKVR, pK V#)z6Replace all chars except '\f\t' in a line with spaces.r[z rrc)rresultcs& r_pad_whitespacerRs/ F  ; KF cMF  MrpaddedcVPeVPfR#VP^, pVP^, pVPpVPp\ Y^,R7pYC8Xd'Ys,P 4YVP4#T'd2\Ys,P 4RTP44pMRpYT,P 4TRP4,p Yt,P 4RTP4p Ys^,TpTP^T 4TPT 4RPT4# \dR#i;i)a.Get source code segment of the *source* that generated *node*. If some location information (`lineno`, `end_lineno`, `col_offset`, or `end_col_offset`) is missing, return None. If *padded* is `True`, the first line of a multi-line statement will be padded with spaces to match its original position. N)rr[) rrrrrmrencodedecoderinsertrqrw) rrrrrrrrpaddingfirstlasts &&$ rget_source_segmentr]s@ ?? "d&9&9&Aq__q( __ ,, f!| % sE,>E,, E;:E;c#"^RIHpV!V.4pV'd1VP4pVP\ V44VxK8R#5i)z Recursively yield all descendant nodes in the tree starting at *node* (including *node* itself), in no specified order. This is useful if you only want to modify nodes in place and don't care about the context. )dequeN) collectionsrpopleftrsr)rrtodos& rrrs? " $=D ||~ $T*+  s A 2A compare_attributescaaa\4oVV3RloVV3RlpV3Rlp\V4\V4JdR#V!W4'gR#S'dV!W4'gR#R#)aWRecursively compares two ASTs. compare_attributes affects whether AST attributes are considered in the comparison. If compare_attributes is False (default), then attributes are ignored. Otherwise they must all be equal. This option is useful to check whether the ASTs are structurally equal but might differ in whitespace or similar details. c@<\V\4'd\VVSR7#\V\4'dC\ V4\ V48wdR#\ W4Fwr#S!W#4'dKR# R#\ V4\ V4J;'dW8H#))rFT)r rkcomparer;rDrHr&)aba_itemb_item_comparers&& rrcompare.._compares a  #5  4 1vQ"%a)// #,7d1g%00!& 0rc<VPVP8wdR#VPFIp\WS4p\WS4pVSJd VSJdK)VSJgVSJdR#S!W44'dKHR# R#FT)rlr)rrra_fieldb_fieldrsentinels&& r_compare_fields compare.._compare_fieldsss 99 !YYEa1Ga1G("w(':("g&9G--rc<VPVP8wdR#VPF2p\WS4p\WS4pVSJd VSJdK)W48wgK1R# R#r)rtr)rrra_attrb_attrrs&& r_compare_attributes$compare.._compare_attributess\ ==AMM )MMDQh/FQh/F!f&8"rFT)rpr&)rrrrrrrs""d @@rrrsR xH1."  Awd1g 1 "5a";"; rc0a]tRtRtoRtRtRtRtVtR#) NodeVisitoria A node visitor base class that walks the abstract syntax tree and calls a visitor function for every node found. This function may return a value which is forwarded by the `visit` method. This class is meant to be subclassed, with the subclass adding visitor methods. Per default the visitor functions for the nodes are ``'visit_'`` + class name of the node. So a `TryFinally` node visit function would be `visit_TryFinally`. This behavior can be changed by overriding the `visit` method. If no visitor function exists for a node (return value `None`) the `generic_visit` visitor is used instead. Don't use the `NodeVisitor` if you want to apply changes to nodes during traversing. For this a special visitor exists (`NodeTransformer`) that allows modifications. c xRVPP,p\WVP4pV!V4#)z Visit a node.visit_)rurvr generic_visit)selfrmethodvisitors&& rvisitNodeVisitor.visits2DNN333$(:(:;t}rc \V4Fxwr#\V\4'd5VF,p\V\4'gKVP V4K. KO\V\4'gKgVP V4Kz R#)z9Called if no explicit visitor function exists for a node.N)rr r;rkr)rrrr'rs&& rrNodeVisitor.generic_visits^'-LE%&&!D!$,, 4("E3'' 5! .rrcN) rv __module__ __qualname____firstlineno____doc__rr__static_attributes____classdictcell__ __classdict__s@rrrs& ""rrc*a]tRtRtoRtRtRtVtR#)NodeTransformeria A :class:`NodeVisitor` subclass that walks the abstract syntax tree and allows modification of nodes. The `NodeTransformer` will walk the AST and use the return value of the visitor methods to replace or remove the old node. If the return value of the visitor method is ``None``, the node will be removed from its location, otherwise it is replaced with the return value. The return value may be the original node in which case no replacement takes place. Here is an example transformer that rewrites all occurrences of name lookups (``foo``) to ``data['foo']``:: class RewriteName(NodeTransformer): def visit_Name(self, node): return Subscript( value=Name(id='data', ctx=Load()), slice=Constant(value=node.id), ctx=node.ctx ) Keep in mind that if the node you're operating on has child nodes you must either transform the child nodes yourself or call the :meth:`generic_visit` method for the node first. For nodes that were part of a collection of statements (that applies to all statement nodes), the visitor may also return a list of nodes rather than just a single node. Usually you use the transformer like this:: node = YourTransformer().visit(node) c\V4Fwr#\V\4'dy.pVFjp\V\4'dAVP V4pVfK0\V\4'gVP V4KYVP V4Kl WCR&K\V\4'gKVP V4pVf\W4K\WV4K V#)N:NNN) rr r;rkrrsrqdelattrr)rrr old_value new_valuesr'rs&& rrNodeTransformer.generic_visit+s +D 1 E)T** &E!%-- $ 5 1 =$!+E3!7!7&--e4$%%e,' *! Is++::i0#D(D2%!2& rrcN)rvrrrrrrrrs@rrrs!Frrc]tRtRtRtRtR#)sliceiAzDeprecated AST node class.rcNrvrrrrrrcrrrrAs$rrc*a]tRtRtoRtRtRtVtR#)IndexiDz@Deprecated AST node class. Use the index value directly instead.c V#r$rc)rzr'kwargss&&,r__new__ Index.__new__Fs rrcNrvrrrrrrrrs@rrrDsJrrc.a]tRtRtoRtRRltRtVtR#)ExtSliceiIz1Deprecated AST node class. Use ast.Tuple instead.c >\\V4\43/VB#r$)r7r;Load)rzdimsrs&&,rrExtSlice.__new__KsT$Z2622rrcN)rcrrs@rrrIs;33rrrcVP#)zDeprecated. Use elts instead.r9)rs&r _dims_getterr Ss yyrcWnR#r$r )rr's&&r _dims_setterrWs rc]tRtRtRtRtR#)Suitei\/Deprecated AST node class. Unused in Python 3.rcNrrcrrrr\9rrc]tRtRtRtRtR#)AugLoadi_rrcNrrcrrrr_rrrc]tRtRtRtRtR#)AugStoreibrrcNrrcrrrrbrrrc]tRtRtRtRtR#)ParamierrcNrrcrrrrerrrc|\4pVP V4# \d^RIHs\4pL.i;i)rb)Unparser) _Unparser NameError _ast_unparserr)ast_objunparsers& runparser is:; >>' "" 6;s ;;c |^RIp^RIpVPRR7pVPRRRRR7VPR R R R,R R 7VPRRRRR7VPRRRRR7VPRR\^RR7VPR\ RRRR7VPRR \R-R!R"R7VPR#R$RR%R7VP V4pVPR8Xd(R&pVPPP4pMCVPp\VPR'4;_uu_4pVP4pRRR4RpVP'd2\\VPPR(^44wrXX 3p\#XW@P$VP&WpP(R*7p \+\-WP.VP0VP2R+74R# +'giL;i \dTP!R)4Li;i).rbNT)colorinfile?-z$the file to parse; defaults to stdin)nargsdefaulthelpz-mz--modeexecz(specify what kind of code must be parsed)r'choicesr(z--no-type-comments store_falsez)don't add information about type comments)r'actionr(z-az--include-attributes store_truez:include attributes such as line numbers and column offsets)r,r(z-iz--indentz'indentation of nodes (number of spaces))r&r'r(z--feature-versionVERSIONz4Python version in the format 3.x (for example, 3.10))r&r'metavarr(z-Oz --optimizeLEVELz*optimization level for parser (default -1)z --show-emptyFz*show empty lists and fields in dump outputzrb.zMInvalid format for --feature-version; expected format 3.x (for example, 3.10))rrr)rrVrW)r)singler func_typer)argparsesysArgumentParser add_argumentr(rP parse_argsr#stdinbufferreadopenrr8splitrerrorrrno_type_commentsrprintrrrVrW) rAr5r6parserr}rr#rrrtrees & rmainrDss<  $ $4 $ 0F SCE h GGI ,d=HJ 4\./ jsAFH + $ 34 l "gIK lIK   T "D {{c!!&&({{ $++t $ $[[]F%O  DsD$8$8$>$>sA$FGLE !%. yy8M8M!0== JD $t(?(?kkdoo ?@!% $ D LLC D DsH 5,H H H;:H;__main__)z r)r)TF))Tr$)'r_astrrUrrrrrrrrrrrrrrprrrkrrrrr7r rpropertyrmodr expr_contextrrrr rDrvrcrrrKs^,HH/3H>@H08$vQ Q"Qh" F.  0 &"u"J O  Od""&""J8k8t%C%E 3u3 uf, 5EJ:C::l::|::L:#2@h zFr