/usr/lib64/python2.6/lib2to3
Edit: /usr/lib64/python2.6/lib2to3/fixer_util.pyc (14387B)
Ñò
« gc @ s d Z d d k l Z d d k l Z l Z d d k l Z d d k l
Z
d „ Z d „ Z d „ Z
d „ Z d1 d
„ Z d „ Z d „ Z d
„ Z e ƒ e
ƒ d „ Z d1 d1 d „ Z d „ Z d „ Z d1 d „ Z d „ Z d1 d „ Z d1 d „ Z d „ Z d „ Z d „ Z d „ Z e d d d d d d d d! d" g ƒ Z! d# „ Z" d$ a# d% a$ d& a% e& a' d' „ Z( d( „ Z) d) „ Z* d* „ Z+ d+ „ Z, d, „ Z- d- „ Z. e e i/ e i0 g ƒ Z1 d1 d. „ Z2 e e i0 e i/ e i3 g ƒ Z4 d/ „ Z5 d1 d0 „ Z6 d1 S(2 s1 Utility functions, node construction macros, etc.i ( t token( t Leaft Node( t python_symbols( t patcompc C s% t t i | t t i d ƒ | g ƒ S( Nu =( R t symst argumentR R t EQUAL( t keywordt value( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt
KeywordArg s c C s t t i d ƒ S( Nu (( R R t LPAR( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt LParen s c C s t t i d ƒ S( Nu )( R R t RPAR( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt RParen s c C sp t | t ƒ p
| g } n t | t ƒ p d | _ | g } n t t i | t t i d d d ƒg | ƒ S( s Build an assignment statementu u =t prefix( t
isinstancet listR R R t atomR R R ( t targett source( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt Assign s
c C s t t i | d | ƒS( s Return a NAME leafR ( R R t NAME( t nameR ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt Name$ s c C s | t t i t ƒ | g ƒ g S( s A node tuple for obj.attr( R R t trailert Dot( t objt attr( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt Attr( s c C s t t i d ƒ S( s A comma leafu ,( R R t COMMA( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt Comma, s c C s t t i d ƒ S( s A period (.) leafu .( R R t DOT( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyR 0 s c C sO t t i | i ƒ | i ƒ g ƒ } | o | i d t t i | ƒ ƒ n | S( s- A parenthesised argument list, used by Call()i ( R R R t clonet insert_childt arglist( t argst lparent rparent node( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt ArgList4 s $ c C s< t t i | t | ƒ g ƒ } | d j o
| | _ n | S( s A function callN( R R t powerR( t NoneR ( t func_nameR$ R R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt Call; s
c C s t t i d ƒ S( s A newline literalu
( R R t NEWLINE( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt NewlineB s c C s t t i d ƒ S( s A blank lineu ( R R R- ( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt BlankLineF s c C s t t i | d | ƒS( NR ( R R t NUMBER( t nR ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt NumberJ s c C s1 t t i t t i d ƒ | t t i d ƒ g ƒ S( s A numeric or string subscriptu [u ]( R R R R R t LBRACEt RBRACE( t
index_node( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt SubscriptM s c C s t t i | d | ƒS( s
A string leafR ( R R t STRING( t stringR ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt StringS s c C s d | _ d | _ d | _ t t i d ƒ } d | _ t t i d ƒ } d | _ | | | | g } | oG d | _ t t i d ƒ } d | _ | i t t i | | g ƒ ƒ n t t i | t t i | ƒ g ƒ } t t i
t t i d ƒ | t t i d ƒ g ƒ S( su A list comprehension of the form [xp for fp in it if test].
If test is None, the "if test" part is omitted.
u u u foru inu ifu [u ](
R R R R t appendR R t comp_ift listmakert comp_forR R3 R4 ( t xpt fpt itt testt for_leaft in_leaft
inner_argst if_leaft inner( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt ListCompW s$ #$ c C s x | D] } | i ƒ q Wt t i d ƒ t t i | d d ƒt t i d d d ƒt t i | ƒ g } t t i | ƒ } | S( sO Return an import statement in the form:
from package import name_leafsu fromR u u import( t removeR R R R R t import_as_namest import_from( t package_namet
name_leafst leaft childrent imp( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt
FromImporto s c C sÇ t | t ƒ o! | i t ƒ t ƒ g j o t St | t ƒ o† t | i ƒ d j op t | i d t ƒ oY t | i d t ƒ oB t | i d t ƒ o+ | i d i d j o | i d i d j S( s( Does the node represent a tuple literal?i i i i u (u )( R R RN R R t Truet lenR R ( R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt is_tuple‡ s ,c C s t | t ƒ oo t | i ƒ d j oY t | i d t ƒ oB t | i d t ƒ o+ | i d i d j o | i d i d j S( s' Does the node represent a list literal?i i iÿÿÿÿu [u ]( R R RR RN R R ( R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt is_list“ s c C s t t i t ƒ | t ƒ g ƒ S( N( R R R R R ( R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt parenthesize¡ s t sortedR t sett anyt allt tuplet sumt mint maxc c s6 t | | ƒ } x | o | Vt | | ƒ } q Wd S( sl Follow an attribute chain.
If you have a chain of objects where a.foo -> b, b.foo-> c, etc,
use this to iterate over all objects in the chain. Iteration is
terminated by getattr(x, attr) is None.
Args:
obj: the starting object
attr: the name of the chaining attribute
Yields:
Each successive object in the chain.
N( t getattr( R R t next( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt
attr_chain¨ s
se for_stmt< 'for' any 'in' node=any ':' any* >
| comp_for< 'for' any 'in' node=any any* >
s¥
power<
( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' |
'any' | 'all' | (any* trailer< '.' 'join' >) )
trailer< '(' node=any ')' >
any*
>
sN
power<
'sorted'
trailer< '(' arglist
')' >
any*
>
c C s© t p7 t i t ƒ a t i t ƒ a t i t ƒ a t a n t t t g } xU t | t | d ƒ ƒ D]; \ } } h } | i | | ƒ o | d | j o t Sqf Wt
S( s Returns true if node is in an environment where all that is required
of it is being itterable (ie, it doesn't matter if it returns a list
or an itterator).
See test_map_nochange in test_fixers.py for some examples and tests.
t parentR' ( t
pats_builtR t compile_patternt p1t p0t p2RQ t zipR` t matcht False( R' t patternst patternRa t results( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt in_special_contextÎ s
$ c C sç | i } | d j o | i t i j o t S| i } | i t i t i f j o t S| i t i
j o | i d | j o t S| i t i j pG | i t i
j o9 | d j o | i t i j p | i d | j o t St S( sG
Check that something isn't an attribute or function name etc.
i N( t prev_siblingR* t typeR R Ri Ra R t funcdeft classdeft expr_stmtRN t
parameterst
typedargslistR RQ ( R' t prevRa ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt is_probably_builtiná s ' c C sY | i t i j o | S| i ƒ } | i d } | _ t t i | g ƒ } | | _ | S( N( Ro R t suiteR! Ra R* R ( R' Ra Rw ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt
make_suiteü s c C s< x5 | i t i j o! | i p
t d ‚ | i } q W| S( s Find the top level namespace.s< Tree is insane! root found before file_input node was found.( Ro R t
file_inputRa t AssertionError( R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt find_root s
c C s" t | t | ƒ | ƒ } t | ƒ S( sÞ Returns true if name is imported from package at the
top level of the tree which node belongs to.
To cover the case of an import like 'import foo', use
None for the package and 'foo' for the name. ( t find_bindingR{ t bool( t packageR R' t binding( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt does_tree_import s c C s | i t i t i f j S( s0 Returns true if the node is an import statement.( Ro R t import_nameRJ ( R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt is_import s c C s½ d „ } t | ƒ } t | | | ƒ o d Sd } } xr t | i ƒ D]a \ } } | | ƒ p qG n x3 t | i | ƒ D] \ } } | | ƒ p Pq{ q{ W| | } PqG W| d j oj xg t | i ƒ D]R \ } } | i t i j o3 | i o) | i d i t i j o | d } PqÉ qÉ Wn | d j o: t
t i t t i
d ƒ t t i
| d d ƒg ƒ } n% t | t t i
| d d ƒg ƒ } | t ƒ g }
| i | t
t i |
ƒ ƒ d S( s\ Works like `does_tree_import` but adds an import statement
if it was not imported. c S s. | i t i j o | i o t | i d ƒ S( Ni ( Ro R t simple_stmtRN R‚ ( R' ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt is_import_stmt s Ni i u importR u ( R{ R€ t enumerateRN Ro R Rƒ R R7 R* R R R R RP R. R" ( R~ R R' R„ t roott
insert_post offsett idxt node2t import_RN ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt touch_import s:
"$c C so xh| i D]]} d } | i t i j oP t | | i d ƒ o | St | t | i d ƒ | ƒ } | o
| } q>nÆ| i t i t i f j o4 t | t | i d ƒ | ƒ } | o
| } q>nv| i t i
j o³ t | t | i d ƒ | ƒ } | o
| } q>x/t | i d ƒ D]g \ } } | i t i
j oH | i d j o8 t | t | i | d ƒ | ƒ } | o
| } q‡q q Wn° | i t j o! | i d i | j o
| } n t | | | ƒ o
| } nb | i t i j o t | | | ƒ } n9 | i t i j o% t | | i d ƒ o
| } q>n | o" | p | St | ƒ o | Sq
q
Wd S( sº Returns the node which binds variable name, otherwise None.
If optional argument package is supplied, only imports will
be returned.
See test cases for examples.i iÿÿÿÿi i t :i i N( RN R* Ro R t for_stmtt _findR| Rx t if_stmtt
while_stmtt try_stmtR… R t COLONR t _def_symst _is_import_bindingRƒ Rr R‚ ( R R' R~ t childt retR1 t it kid( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyR| H sL
## '
c C s„ | g } xt | ol | i ƒ } | i d j o$ | i t j o | i | i ƒ q | i t i j o | i | j o | Sq Wd S( Ni ( t popRo t _block_symst extendRN R R R R* ( R R' t nodes( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyR s s #
c C sQ | i t i j o| o | i d } | i t i j os xä | i D]a } | i t i j o | i d i | j o | SqE | i t i j o | i | j o | SqE WqM| i t i j o9 | i d } | i t i j o | i | j o | SqM| i t i j o | i | j o | Sn(| i t i j o| o% t
| i d ƒ i ƒ | j o d S| i d } | o t
d | ƒ o d S| i t i j o t
| | ƒ o | S| i t i j o9 | i d } | i t i j o | i | j o | SqM| i t i j o | i | j o | S| o | i t i j o | Sn d S( s› Will reuturn node if node will import name, or node
will import * from package. None is returned otherwise.
See test cases for examples. i i iÿÿÿÿi u asN( Ro R R RN t dotted_as_namest dotted_as_nameR R R RJ t unicodet stripR* R RI t import_as_namet STAR( R' R R~ RO R– t lastR1 ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyR• } sB
#
# # '
#
# # N(7 t __doc__t pgen2R t pytreeR R t pygramR R t R R
R R R R* R R R R R( R, R. R/ R2 R6 R9 RG RP RS RT RU RW t consuming_callsR` Re Rd Rf Ri Rb Rm Rv Rx R{ R€ R‚ RŒ Rq Rp R” R| R R› R R• ( ( ( s* /usr/lib64/python2.6/lib2to3/fixer_util.pyt sV - *