관리-도구
편집 파일: btm_matcher.cpython-33.pyo
� �� f� c @ s� d Z d Z d d l Z d d l Z d d l m Z d d l m Z d d l m Z Gd d � d e � Z Gd d � d e � Z i a d d � Z d S( u� A bottom-up tree matching algorithm implementation meant to speed up 2to3's matching process. After the tree patterns are reduced to their rarest linear path, a linear Aho-Corasick automaton is created. The linear automaton traverses the linear paths from the leaves to the root of the AST and returns a set of nodes for further matching. This reduces significantly the number of candidate nodes.u+ George Boutsioukis <gboutsioukis@gmail.com>i N( u defaultdicti ( u pytree( u reduce_treec B s2 | Ee Z d Z d Z e j � Z d d � Z d S( u BMNodeu? Class for a node of the Aho-Corasick automaton used in matchingc C s1 i | _ g | _ t t j � | _ d | _ d S( Nu ( u transition_tableu fixersu nextu BMNodeu countu idu content( u self( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu __init__ s u BMNode.__init__N( u __name__u __module__u __qualname__u __doc__u itertoolsu countu __init__( u __locals__( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu BMNode s u BMNodec B sV | Ee Z d Z d Z d d � Z d d � Z d d � Z d d � Z d d � Z d S( u BottomMatcherug The main matcher class. After instantiating the patterns should be added using the add_fixer methodc C sF t � | _ t � | _ | j g | _ g | _ t j d � | _ d S( Nu RefactoringTool( u setu matchu BMNodeu rootu nodesu fixersu loggingu getLoggeru logger( u self( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu __init__ s u BottomMatcher.__init__c C sh | j j | � t | j � } | j � } | j | d | j �} x | D] } | j j | � qJ Wd S( u� Reduces a fixer's pattern tree to a linear path and adds it to the matcher(a common Aho-Corasick automaton). The fixer is appended on the matching states and called when they are reachedu startN( u fixersu appendu reduce_treeu pattern_treeu get_linear_subpatternu addu root( u selfu fixeru treeu linearu match_nodesu match_node( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu add_fixer% s u BottomMatcher.add_fixerc C s | s | g St | d t � r� g } x[ | d D]O } | j | d | �} x1 | D]) } | j | j | d d � | � � qS Wq1 W| S| d | j k r� t � } | | j | d <n | j | d } | d d � r� | j | d d � d | �} n | g } | Sd S( u5 Recursively adds a linear pattern to the AC automatoni u starti N( u isinstanceu tupleu addu extendu transition_tableu BMNode( u selfu patternu startu match_nodesu alternativeu end_nodesu endu next_node( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu add1 s" + " u BottomMatcher.addc C s� | j } t t � } x�| D]y} | } xj| r�d | _ x? | j D]4 } t | t j � rD | j d k rD d | _ PqD qD W| j d k r� | j } n | j } | | j k r� | j | } x� | j D]0 } | | k r� g | | <n | | j | � q� Wn� | j } | j d k r%| j j r%Pn | | j k r�| j | } xD | j D]6 } | | j � k rpg | | <n | | j | � qKWn | j } q+ Wq W| S( uu The main interface with the bottom matcher. The tree is traversed from the bottom using the constructed automaton. Nodes are only checked once as the tree is retraversed. When the automaton fails, we give it one more shot(in case the above tree matches as a whole with the rejected leaf), then we break for the next leaf. There is the special case of multiple arguments(see code comments) where we recheck the nodes Args: The leaves of the AST tree to be matched Returns: A dictionary of node matches with fixers as the keys u ;i TFN( u rootu defaultdictu listu Trueu was_checkedu childrenu isinstanceu pytreeu Leafu valueu Falseu typeu transition_tableu fixersu appendu parentu Noneu keys( u selfu leavesu current_ac_nodeu resultsu leafu current_ast_nodeu childu node_tokenu fixer( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu runS s> ! u BottomMatcher.runc s7 t d � � f d d � � � | j � t d � d S( u< Prints a graphviz diagram of the BM automaton(for debugging)u digraph g{c s� xy | j j � D]h } | j | } t d | j | j t | � t | j � f � | d k rn t | j � n � | � q Wd S( Nu %d -> %d [label=%s] //%si ( u transition_tableu keysu printu idu type_repru stru fixersu content( u nodeu subnode_keyu subnode( u print_node( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu print_node� s ) u* BottomMatcher.print_ac.<locals>.print_nodeu }N( u printu root( u self( ( u print_nodeu8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu print_ac� s u BottomMatcher.print_acN( u __name__u __module__u __qualname__u __doc__u __init__u add_fixeru addu runu print_ac( u __locals__( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu BottomMatcher s " =u BottomMatcherc C sh t sX d d l m } x? | j j � D]+ \ } } t | � t k r& | t | <q& q& Wn t j | | � S( Ni ( u python_symbols( u _type_reprsu pygramu python_symbolsu __dict__u itemsu typeu intu setdefault( u type_numu python_symbolsu nameu val( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu type_repr� s u type_repr( u __doc__u __author__u loggingu itertoolsu collectionsu defaultdictu u pytreeu btm_utilsu reduce_treeu objectu BMNodeu BottomMatcheru _type_reprsu type_repr( ( ( u8 /opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu <module> s �