File: //proc/thread-self/root/lib64/python2.7/site-packages/mercurial/hbisect.pyo
�
1�3\c @@ s� d d l m Z d d l Z d d l m Z d d l m Z m Z d d l m Z d � Z
d � Z d � Z d
� Z
d � Z d � Z d
� Z d � Z d � Z d S( i ( t absolute_importNi ( t _( t hext short( t errorc @ s� � j � � j } t g | d D] } � j | � ^ q � } � � f d � } t } | | d | d � \ } } | s� t } | | d | d � \ } } n � j | � } | s4t | d � d k r t | d � d k r | 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 rU| j |
� x` | |
� D]O } | d k r�| |
k r�|
| j |
� q�|
g |
| <| j | � q�q�WqUqUW| j � t | � } g | D]$ } | | k r| | k r| ^ q} | d k sE| rng | D] } � j | � ^ qLd | f S| d
} d } d } t � } xB| D]:}
|
| k r�| j |
j |
g � � q�n | |
p�|
g } d | |
<t | � } | | } t | | � } | | k r>|
| k r>| } |
} | | k r>Pq>n | | k ru|
| k ru| j |
j |
g � � q�n xV |
j |
g � D]B } | | r�t t | | | � � | | <q�| | g | | <q�Wq�W� 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 @ s� t g | D] } � j | � ^ q
� } t j d � � } x' � j d | | � D] } g | | <qP W| | d k r~ | d f S| | f S( Nc S@ s d S( N( t None( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt <lambda>) t s! descendants(%ln) - ancestors(%ln)( t mint revt collectionst defaultdictt revsR ( t badt goodt nt badrevt ancestorsR
( t changelogt repo( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt buildancestors' s (
R R i s+ starting revisions are not directly relateds) inconsistent state, %d:%s is good and badi����i i N( R t
parentrevst setR
t Falset Truet nodet lenR t AbortR R R t dequet popleftt appendt sortR t updatet getR t list( R t statet clparentsR R R R R R R t childrent visitt
candidatesR
t prevt 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 sz , ,
1)
!c C@ s� | | d j � } t | � d k r� | r9 | d } n
| d } t t d � | D� � t | � @� } | d k r� | d j | d � Sn d S( Ni i R R c s@ s | ] } | j � Vq d S( N( R ( t .0t i( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pys <genexpr>� s ( t parentsR R t ancestorR ( R R$ t nodesR R9 t sidet num( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt extendrange| s
& c C@ s� i g d 6g d 6g d 6g d 6} xx | j j d � D]d } | d j � \ } } | j | � } | | k r� t j t d � | � � n | | j | � q5 W| S( Nt currentR R R s bisect.statei����s unknown bisect kind %s( t vfst tryreadlinest splitt lookupR R R R ( R R$ 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 � �X xF t | � D]8 } x/ | | D]# } | j d | t | � f � qC Wq2 W| j � Wd QXd S( Ns bisect.statet wt
atomictemps %s %s
( R@ R t wlockt sortedt writeR t close( R R$ t fRE R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt
save_state� s
%c C@ s) | j j d � r% | j j d � n d S( s+ remove any bisect state from the repositorys bisect.stateN( R@ t existst unlink( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt
resetstate� s c C@ sS | d r | d r t S| d s: t j t d � � � n t j t d � � � d S( s[ check we have both 'good' and 'bad' to define a range
Raise Abort exception otherwise.R R s' cannot bisect (no known good revisions)s& cannot bisect (no known bad revisions)N( R R R R ( R$ ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt
checkstate� 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 R? 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( R R R R? ( RF t mapR R
R
R R t
ParseErrorR (
R t statusR$ RS t _tRW RX t skipsRT RU t ibat igaRV ( ( 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 skippedRU R? RV RW s good (implicit)RX 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� t | � d k r� | r. | j t d � � n | j t d � � | j | | d � t | | | | � } | d k r� | j t d � | � q� nQ | r� | j t d � � n | j t d � � x | D] } | j | | � q� W| j � d S( Ni s The first good revision is:
s The first bad revision is:
i s� Not all ancestors of this changeset have been checked.
Use bisect --extend to continue the bisection from
the common ancestor, %s.
sC Due to skipped revisions, the first good revision could be any of:
sB Due to skipped revisions, the first bad revision could be any of:
( R RK R t showR> R RL ( t uiR R$ t displayerR; R t
extendnodeR ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt printresult s
( t
__future__R R t i18nR R R R R R R6 R> RF RN RQ RR R" Ra Rf ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/hbisect.pyt <module> s d C