korsygfhrtzangaiide
Elepffwdsff
/
lib64
/
python2.7
/
site-packages
/
mercurial
/
Upload FileeE
HOME
� Hq�Qc @ s� d d l m Z d d l m Z d e f d � � YZ d e f d � � YZ d e f d � � YZ d e f d � � YZ d e e f d � � YZ d S( i����( t nullrev( t _t basedagc B s� e Z d Z d � Z d � Z d � Z d � Z d � Z d d � Z d d � Z d � Z d � Z d � Z d � Z e d � Z RS( s� generic interface for DAGs terms: "ix" (short for index) identifies a nodes internally, "id" identifies one externally. All params are ixs unless explicitly suffixed otherwise. Pluralized params are lists or sets. c C s d | _ d S( N( t Nonet _inverse( t self( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt __init__ s c C s t � d S( s set of all node idxsN( t NotImplementedError( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt nodeset s c C s t � d S( s list of head ixsN( R ( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt heads s c C s t � d S( s list of parents ixs of ixN( R ( R t ix( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt parents# s c C s t � d S( s1 inverse DAG, where parents becomes children, etc.N( R ( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt inverse' s c C s t � d S( sV set of all ancestors of starts (incl), but stop walk at stops (excl) N( R ( R t startst stops( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt ancestorset+ s c C s | j � j | | � S( sX set of all descendants of starts (incl), but stop walk at stops (excl) ( R R ( R R R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt descendantset1 s c C s t � d S( s� subset of connected list of ixs so that no node has a descendant in it By "connected list" we mean that if an ancestor and a descendant are in the list, then so is at least one path connecting them. N( R ( R t ixs( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt headsetofconnecteds7 s c C s | j | � S( s4 return a list of (or set if given a set) of node ids( t _externalize( R R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt externalize@ s c C s2 | j | � } t | t � r( t | � St | � S( s4 return a list of (or set if given a set) of node ids( t _externalizeallt isinstancet sett list( R R t ids( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt externalizeallD s c C s | j | � S( s4 return a list of (or set if given a set) of node ixs( t _internalize( R t id( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt internalizeK s c C s5 | j | | � } t | t � r+ t | � St | � S( s4 return a list of (or set if given a set) of node ids( t _internalizeallR R R ( R R t filterunknownR ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt internalizeallO s N( t __name__t __module__t __doc__R R R R R R R R R R R R t FalseR ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR s t genericdagc B s# e Z d Z d d � Z d � Z RS( s generic implementations for DAGsc C s� | r t | � p t � } t � } t | � } xT | r� | j � } | | k r3 | | k r3 | j | � | j | j | � � q3 q3 W| S( N( R R t popt addt extendR ( R R R t seent pendingt n( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR Z s c C sR t | � } | s | Sx5 | D]- } x$ | j | � D] } | j | � q3 Wq W| S( N( R R t discard( R R t hdsR+ t p( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR e s N( R! R" R# R R R ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR% W s t revlogbaseddagc B sM e Z d Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z RS( s! generic dag interface to a revlogc C s, t j | � | | _ d | _ | | _ d S( N( R R t _revlogR t _headst _nodeset( R t revlogR ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR s s c C s | j S( N( R2 ( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR y s c C s( | j d k r! | j � | _ n | j S( N( R1 R t _getheads( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR | s c C s | j j | d S( Ni ( R0 t index( R R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s+ | j j } g | D] } | | d ^ q S( Ni ( R0 R5 ( R R t idxt i( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C sC | j j | � } | t k r? t | | j j t d � � � n | S( Nt nullid( R0 t revR t LookupErrort indexfileR ( R R R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s !c C s] | j } | rM g t | j j | � D]$ } | d k r% | t k r% | ^ q% St | j | � S( N( R0 t mapt nodemapt getR R R ( R R R t rlt r( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s "( R! R" R# R R R R R R R ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR/ p s t revlogdagc B sP e Z d Z d � Z d � Z d � Z d � Z d d � Z d � Z d � Z RS( s dag interface to a revlogc C s) t j | | t t t | � � � � d S( N( R/ R R t xranget len( R R3 ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s, g | j j � D] } | t k r | ^ q S( N( R0 t headrevsR ( R R@ ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR4 � s c C sz | j } | j } | | } | d } | t k rY | d } | t k rO | g S| | g S| d } | t k rv | g Sg S( Ni i ( R0 R5 R ( R R t rlogR6 t revdatat prevt prev2( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s( | j d k r! t | � | _ n | j S( N( R R t inverserevlogdag( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s� | j } | j } | r$ t | � p* t � } t � } t | � } x� | r� | j � } | | k rE | | k rE | j | � | | } x= d d g D], } | | } | t k r� | j | � q� q� WqE qE W| S( Ni i ( R0 R5 R R R& R' R t append( R R R RE R6 R) R* R9 RF R7 RG ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s� | s t � S| j } | j } t | � } xU | D]M } | | } x: d d g D], } | | } | t k rO | j | � qO qO Wq2 W| S( Ni i ( R R0 R5 R R, ( R R RE R6 RD R9 RF R7 RG ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s� g } t | j | � � } | j d t � t � } x� | r� | j � } | d k r� | d } | | k r� | j | � | j | � q� q7 | j | d � | g | j | � D]$ } | | k r� | | k r� | ^ q� 7} q7 W| S( s� linearize and topologically sort a list of revisions The linearization process tries to create long runs of revs where a child rev comes immediately after its first parent. This is done by visiting the heads of the given revs in inverse topological order, and for each visited rev, visiting its second parent, then its first parent, then adding the rev itself to the output list. t reversei i ( R R t sortt TrueR R& RJ R' R ( R R t sortedt visitt finishedt curR. ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt linearize� s )N( R! R" R# R R4 R R R R R RR ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyRA � s RI c B s; e Z d Z d � Z d � Z d � Z d � Z d � Z RS( s: inverse of an existing revlog dag; see revlogdag.inverse()c C sN t j | | j | j � | | _ i | _ g | _ t | j � d | _ d S( Ni ( R/ R R0 R2 t _origt _childrent _rootsRC t _walkfrom( R t orig( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR � s c C s� | j } | j } | j } | j j } x� | | k r� | | } t } xJ | d | d g D]4 } | t k r[ | j | g � j | � t } q[ q[ W| r� | j | � n | d 8} q* W| | _ d S( Ni i i ( RV RT RU R0 R5 RM R t setdefaultRJ R$ ( R t walktoR9 t cst rootsR6 t datat isrootRG ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt _walkto� s c C s | j t � | j S( N( R^ R RU ( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR4 s c C sB | d k r g S| | j k r/ | j | � n | j j | g � S( N( R RV R^ RT R> ( R R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR s c C s | j S( N( RS ( R ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyR s ( R! R" R# R R^ R4 R R ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyRI � s N( t nodeR t i18nR t objectR R% R/ RA RI ( ( ( s7 /usr/lib64/python2.7/site-packages/mercurial/dagutil.pyt <module> s J$Z