| Disable Functions: Path : /usr/lib64/python2.7/site-packages/mercurial/ |
| Current File : //usr/lib64/python2.7/site-packages/mercurial/ancestor.pyc |
�
Hq�Qc @ s] d d l Z d d l Z d d l m Z d � Z d � Z d � Z d e f d � � YZ d S( i����N( t nullrevc s� t | t � s t | � } n t | k r1 t � St | � d k rG | S� f d � } � f d � } | | � } t | � d k r� | S| | � S( s�
Returns the common ancestors of a and b that are furthest from a
root (as measured by longest path).
pfunc must return a list of parent vertices for a given vertex.
i c s% d t | � >d } d g t | � d } x( t | � D] \ } } d | >| | <q8 Wd | d >} t � } t | � } } t | � d } x�| d k r | r | }
| d 8} | |
s� q� n | |
} | | k r=| d 8} | | k r=| j |
� | | O} |
| k r:| d 8} | d k r7t |
g � Sq:q=n | | k r�x� � |
� D]d } | | }
| t k rxqVn |
d k r�| | | <| d 7} qV|
| k rV| | c | O<qVqVWq� xY � |
� D]K } | t k r�q�n | | }
|
r|
| k r| d 8} n | | | <q�Wq� W| S( Ni i ( t lent maxt enumeratet sett addR ( t nodest allseent seent it nt poisont gcat interestingt leftt nvt vt svt pt sp( t pfunc( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt
candidates sR
c s� i } t | � d } d g | } d g | } g } x[ t t | � � D]G \ } } d | | <d | >} | | | <d | | <| j | | f � qI W| d } x�| d k rct | � d k rc| }
| d 8} | |
} | d k r� q� n | |
} x>� |
� D]0}
|
t k rqn | |
} | |
} } | | k r�| d | |
<| | k r2| | c d 7<| } | |
<| r�| | c d 8<| | d k r�| | =q�q�q2q| | d k r| | B} | | k r�qn | | |
<| j | d � | | c d 7<| | c d 8<| | d k r2| | =q2qqW| | c d 8<| | d k r� | | =q� q� Wt | � d k rzg Sd � x | D] } � | O� q�Wt � f d � | D� � S( Ni i c 3 s% | ] \ } } � | @r | Vq d S( N( ( t .0R R
( t k( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pys <genexpr>} s ( R R t sortedt appendR R t
setdefaultR ( R R
t countt depthR t mappingR R
t bR R t dvR R t dpt nspR ( R ( R s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt deepestG sh
!
( t
isinstanceR R R ( R t orignodesR R" R ( ( R s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt ancestors s .8 c
s< | | k r | St | | g � \ } } i � | | g } i � x� | r9| d } g | | � D] } | t k r` | ^ q` } | � | <| s� d � | <| j � qC xF | D]> } | | k s� | | k r� | S| � k r� | j | � q� q� W| d | k rC t g | D] } � | ^ q� d � | <| j � qC qC W� � f d � � � f d � } | | � } | | � } | j � }
| j � } y� x� t r!|
d | d k r�x& |
d D] } | | d k r�| Sq�W| j � } | j � }
q�|
d | d k r| j � } q�| j � }
q�WWn t k
r7d SXd S( s:
Returns the common ancestor of a and b that is furthest from a
root (as measured by longest path) or None if no ancestor is
found. If there are multiple common ancestors at the same
distance, the first one found is returned.
pfunc must return a list of parent vertices for a given vertex
i����i i c 3 s� � | | f g } t � } xu | r� t j | � \ } } | | k r | j | � | | f Vx/ � | D] } t j | � | | f � qi Wq q Wd S( N( R t heapqt heappopR t heappush( t vertext hR t dR
R ( R t parentcache( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyR% � s
c 3 s� d t � } } x` � | � D]R \ } } | | k rb | rI | | f Vn | t | f � } } q | j | � q W| | f Vd S( N( t NoneR R ( R) t sgt st gR ( R% ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt generations� s N( R R t popR t mint nextt Truet
StopIterationR- (
t aR R t visitR) R t plR1 t xt yt gxt gyR ( ( R% R R, s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt genericancestor� sP
+
+
c C s� t | � } t | � } | s" g S| s8 | j t � n t t | � t | � � } | j | � } | j | � | j | � g } xIt | t d � D]5} | s� Pn | | k r| j | � x; | | � D]- } | j | � | j | � | j | � q� Wq� n | | k r*| j | � | }
| } n | | k r� | }
| } n q� |
j | � xr | | � D]d } | t k rwqb| | k s�| | k r�| j | � | j | � | j | � qb|
j | � qbWq� W| j
� | S( s\ Return all the ancestors of revs that are not ancestors of bases.
This may include elements from revs.
Equivalent to the revset (::revs - ::bases). Revs are returned in
revision number order, which is a topological order.
revs and bases should both be iterables. pfunc must return a list of
parent revs for a given revs.
i����( R R R R t intersectiont difference_updatet xranget removet discardR t reverse( t revst basesR t revsvisitt
basesvisitt startt bothvisitt missingt currR t thisvisitt
othervisit( ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt missingancestors� sP
t
lazyancestorsc B s) e Z d e d � Z d � Z d � Z RS( i c C s| | j | _ | | _ | | _ | | _ g | D]
} | ^ q. | _ t j | j � | rl t | � | _ n t � | _ d S( s� Create a new object generating ancestors for the given revs. Does
not generate revs lower than stoprev.
This is computed lazily starting from revs. The object supports
iteration and membership.
cl should be a changelog and revs should be an iterable. inclusive is
a boolean that indicates whether revs should be included. Revs lower
than stoprev will not be generated.
Result does not include the null revision.N(
t
parentrevst _parentrevst _initrevst _stoprevt
_inclusivet _containsvisitR& t heapifyR t
_containsseen( t selft clRE t stoprevt inclusivet rev( ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt __init__* s c c s� t � } | j } | j rA x | D] } | Vq" W| j | � n | j } | j } t j | � } xa | r� xT | | j � � D]@ } | | k r~ | | k r~ | j | � | j
| � | Vq~ q~ Wqe Wd S( se Generate the ancestors of _initrevs in reverse topological order.
If inclusive is False, yield a sequence of revision numbers starting
with the parents of each revision in revs, i.e., each revision is *not*
considered an ancestor of itself. Results are in breadth-first order:
parents of each rev in revs, then parents of those, etc.
If inclusive is True, yield all the revs first (ignoring stoprev),
then yield all the ancestors of revs as when inclusive is False.
If an element in revs is an ancestor of a different rev it is not
yielded again.N( R RS RU t updateRR RT t utilt dequet popleftR R ( RY R RE R] RQ R[ R8 t parent( ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt __iter__H s
c
C s� | j } | | k r t S| j } | j } | j } t j } t j } t } x� | r� | d | k r� | r� xi | | | � � D]T } | | k s� | | k r� q� n | | | � | j | � | | k r� t } q� q� WqO W| S( s5 Test whether target is an ancestor of self._initrevs.i (
RX R5 RR RV RT R& R' R( t FalseR (
RY t targetR RQ R8 R[ R' R( t
targetseenRc ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt __contains__f s$ !
( t __name__t
__module__Re R^ Rd Rh ( ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyRP ) s ( R& R` t nodeR R% R> RO t objectRP ( ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/ancestor.pyt <module> s
z S Q