-=[ Mr. Bumblebee ]=-
_Indonesia_
\,Tc @ 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( iN( t nullrevc G sO t | t s t | } n t | k r1 t St | d k rG | Sd t | >d } d g t | d } x( t | D] \ } } d | >| | <q Wd | d >} t } t | } t | d } xx| d k rJ| rJ| }
| d 8} | |
sq n | |
} | | k rg| d 8} | | k rg| j |
| | O} |
| k rdt |
g Sqgn | | k rx | |
D]d } | | }
| t k rqn |
d k r| | | <| d 7} q|
| k r| | c | O<qqWq xY | |
D]K } | t k rqn | | }
|
r9|
| k r9| d 8} n | | | <qWq W| S( s Returns a set with the heads of all common ancestors of all nodes,
heads(::nodes[0] and ::nodes[1] and ...) .
pfunc must return a list of parent vertices for a given vertex.
i i ( t
isinstancet setR t lent maxt enumeratet add( t pfunct nodest allseent seent it nt poisont gcat interestingt nvt vt svt pt sp( ( s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyt commonancestorsheads sZ
c s> f d } t | } t | d k r4 | 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.
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| | =qqq2q| | d k r| | B} | | k rqn | | |
<| 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 qWt f d | D S( Ni i c 3 s% | ] \ } } | @r | Vq d S( N( ( t .0R R ( t k( s6 /usr/lib/python2.7/dist-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 s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyt deepestK sh
!
i ( R R ( R t orignodesR" R ( ( R s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyt ancestorsD s
8c 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( ( s6 /usr/lib/python2.7/dist-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 _containsvisitt heapqt heapifyR t
_containsseen( t selft clR+ t stoprevt inclusivet rev( ( s6 /usr/lib/python2.7/dist-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 R9 R; t updateR8 R: t utilt dequet popleftR R ( R@ R
R+ RD R7 RB t visitt parent( ( s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyt __iter__ 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 (
R? t TrueR8 R< R: R= t heappopt heappusht FalseR (
R@ t targetR
R7 RJ RB RN RO t
targetseenRK ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyt __contains__ s$ !
( t __name__t
__module__RP RE RL RS ( ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyR6 s ( R= RG t nodeR R R$ R5 t objectR6 ( ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/ancestor.pyt <module> s 8 E Q
Copyright © 2017 || Recoded By Mr.Bumblebee