관리-도구
편집 파일: hbisect.pyc
� Hq�Qc @ s� d d l Z d d l Z d d l m Z d d l m Z m Z d d l Z d � Z d � Z d � Z d � Z d � Z d � Z d S( i����N( t _( t shortt hexc s� � j � t g | d D] } � j | � ^ q � } � � f d � } t } | | d | d � \ } } | s� t } | | d | d � \ } } n � j | � } | st | d � d k r� t | d � d k r� t j t d � � � n t j t d � | t | � f � � n i } t j | g � } g } x� | r�| j � } | | g k r8| j | � x` � | � D]O } | d k rt| | k r�| | j | � q�| g | | <| j | � qtqtWq8q8W| j � t | � } g | D]$ } | | k r�| | k r�| ^ q�} | d k s(| rQg | D] } � j | � ^ q/d | f S| d } d } d } t � } xB| D]:} | | k r�| j | j | g � � qwn | | p�| g } d | | <t | � } | | } t | | � } | | k r!| | k r!| } | } | | k r!Pq!n | | k rX| | k rX| j | j | g � � qwn xV | j | g � D]B } | | r�t t | | | � � | | <qk| | g | | <qkWqwW| d k s�t � � j | � } | g | | f S( s� find the next node (if any) for testing during a bisect search. returns a (nodes, number, good) tuple. 'nodes' is the final result of the bisect if 'number' is 0. Otherwise 'number' indicates the remaining possible candidates for the search and 'nodes' contains the next bisect target. 'good' is True if bisect is searching for a first good changeset, False if searching for a first bad one. t skipc sp t g | D] } � j | � ^ q � } g | D] } � j | � ^ q/ } t | � } d g t � � d } x | D] } g | | <qt WxO � j | d � D]: } x1 � | � D]# } | | g k r� g | | <q� q� Wq� Wx | D] } d | | <q� WxT � j t � � | � D]: } | | d k rx! � | � D] } d | | <q1WqqW| | d k rf| d f S| | f S( Ni ( t mint revt Nonet lent revs( t badt goodt nt badrevt goodrevst goodrevt ancestorsR t prev( t changelogt clparents( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt buildancestors s& (" R R i s+ starting revisions are not directly relateds) inconsistent state, %s:%s is good and badi����i i N( t parentrevst setR t Falset Truet nodeR t utilt AbortR R t dequet popleftt appendt sortR t updatet getR t listt AssertionError( R t stateR R R R R R R t childrent visitt candidatesR R t tott ct unskippedt perfectt best_revt best_lent poisont at xt yt valuet best_node( ( R R s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt bisect sx , , 1) !c C s� i g d 6g d 6g d 6g d 6} t j j | j d � � r� xx | j d � D]d } | d j � \ } } | j | � } | | k r� t j t d � | � � n | | j | � qM Wn | S( Nt currentR R R s bisect.statei����s unknown bisect kind %s( t ost patht existst joint openert splitt lookupR R R R ( t repoR# t lt kindR ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt load_state� s " c C s� | j d d d t �} | j � } zW xF t | � D]8 } x/ | | D]# } | j d | t | � f � qE Wq4 W| j � Wd | j � Xd S( Ns bisect.statet wt atomictemps %s %s ( R9 R t wlockt sortedt writeR t closet release( R< R# t fRB R> R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt save_state� s %c C sh t | � } | d k r/ t | j j | | � Sd } | j d � } t | � d k re d } d } n d } d } d } d | | | f } d | | f } d } d } d | | | f } | d k r� | j | � S| d k r� | j | � S| d k r| j | � S| d k r | j | � S| d k r6| j | � S| d k rO| j | � St j t d � � � d S( s Return a list of revision(s) that match the given status: - ``good``, ``bad``, ``skip``: csets explicitly marked as good/bad/skip - ``goods``, ``bads`` : csets topologically good/bad - ``range`` : csets taking part in the bisection - ``pruned`` : csets that are goods, bads or skipped - ``untested`` : csets whose fate is yet unknown - ``ignored`` : csets ignored due to DAG topology - ``current`` : the cset currently being bisected R R R R4 s9 ( bisect(bad)::bisect(good) | bisect(good)::bisect(bad) )s bisect(good)::bisect(bad)i s bisect(good)::s ::bisect(bad)s ::bisect(good)s bisect(bad)::s bisect(skip)s ( (%s) | (%s) | (%s) )s ( (%s) - (%s) )s ::bisect(bad) - ::bisect(good)s ::bisect(good) - ::bisect(bad)s ( ( (%s) | (%s) ) - (%s) )t ranget prunedt untestedt ignoredt goodst badss invalid bisect stateN( s goods bads skips current( R? t mapR R R R t errort ParseErrorR ( R< t statusR# RI t _tRM RN t skipsRJ RK t ibat igaRL ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyR � s: c C s | j j | � } | t | d � k r1 t d � S| t | d � k rP t d � S| t | d � k ro t d � S| t | d � k s� | t | d � k r� t d � S| t | d � k r� t d � S| t | d � k r� t d � S| t | d � k r t d � Sd S( NR R R t skippedRK R4 RL RM s good (implicit)RN s bad (implicit)( R R R R R ( R< R R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt label� s * c C s | r | d j � Sd S( Ni ( t upperR ( RX ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt shortlabel� s ( R5 RP t i18nR R R R R R3 R? RH R RX RZ ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt <module> s v C