File: //proc/self/root/usr/lib64/python2.7/site-packages/mercurial/graphmod.pyc
�
1�3\c @@ s� d Z d d l m Z d d l m Z d d l m Z m Z m Z m Z d Z
d Z d Z d Z
i d
e 6d e 6d e
6Z d � Z d
� Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d � Z d S( s> supports walking the history as DAGs suitable for graphical output
The most basic format we use is that of::
(id, type, data, [parentids])
The node and parent ids are arbitrary integers which identify a node in the
context of the graph returned. Type is a constant specifying the node type.
Data depends on type.
i ( t absolute_importi ( t nullrev( t dagopt pycompatt smartsett utilt Ct Pt Gt Mt |t :c
#@ s� i } x�� D]�} | | } t � f d � | j � D� � � g | j � D]6 } | j � t k rL | j � � k rL | j � ^ qL } g t � � D] } t | f ^ q� } x� | D]� } | j | � } | d k r(t � t j
� s� t j
� � � n t t t j | � | g � � � } | | <n | sQ| j
t | f � � j | � q� | j � f d � | D� � � j | � q� W| j � t | | f Vq
Wd S( s� cset DAG generator yielding (id, CHANGESET, ctx, [parentinfo]) tuples
This generator function walks through revisions (which should be ordered
from bigger to lower). It returns a tuple for each node.
Each parentinfo entry is a tuple with (edgetype, parentid), where edgetype
is one of PARENT, GRANDPARENT or MISSINGPARENT. The node and parent ids
are arbitrary integers which identify a node in the context of the graph
returned.
c 3@ s- | ]# } | j � � k r | j � Vq d S( N( t rev( t .0t p( t revs( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pys <genexpr>; s c 3@ s' | ] } | � k r t | f Vq d S( N( t GRANDPARENT( R
t g( t pset( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pys <genexpr>M s N( t sett parentsR R t sortedt PARENTt gett Nonet
isinstanceR t basesetR t reachablerootst appendt
MISSINGPARENTt addt extendt updatet CHANGESET(
t repoR t gpcacheR t ctxR t mparsR t mpart gp( ( R R s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt dagwalker( s(
"6%
# c #@ sj t | � � xW | D]O } | | } t � f d � | j � D� � } | j � t | t | � f Vq Wd S( s� cset DAG generator yielding (id, CHANGESET, ctx, [parentids]) tuples
This generator function walks the given nodes. It only returns parents
that are in nodes, too.
c 3@ s3 | ]) } | j � � k r t | j � f Vq d S( N( t nodeR R ( R
R ( t include( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pys <genexpr>[ s N( R R R R! R ( R" t nodesR) R$ R ( ( R* s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyR+ R s
"c #@ s� g } i } d } i � x� � j j d � D]� \ } } d | k r+ | j d d � \ } } | d k r� | j � r� t | � � j | i � | <q� | d k r� | j � r� | � j | i � | <q� q+ q+ W� r� t j � � f d � � } n d � } x�| D]�\ }
} } }
|
| k r@| j |
� | | |
<| d 7} n | j
|
� } | j |
� } | } g |
D] \ } } | | k rl| ^ ql} | | | | d +xA t | � D]3 \ } } | s�| | | <q�| | | <| d 7} q�Wg } x� t | � D]� \ } } | | k r`| | � } | j | | j
| � | | | j
d d � | j
d d � f � q�| |
k r�x` |
D]U \ } } | | � } | j | | j
| � | | j
d d � | j
d d � f � qsWq�q�W|
| | | | f | f V| } q� Wd
S( sx annotates a DAG with colored edge information
For each DAG node this function emits tuples::
(id, type, data, (col, color), [(col, nextcol, color)])
with the following new elements:
- Tuple (col, color) with column and color index for the current node
- A list of tuples indicating the edges between the current node and its
parents.
i t grapht .t widtht colorc @ s � j � | j � i � S( N( R t branch( R ( t configR" ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt <lambda>| t c S@ s i S( N( ( R ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyR2 ~ R3 i����R3 N( t uit configitemst rsplitt isdigitt intt
setdefaultt isalnumR t lrucachefuncR t indext popt enumerateR ( t dagR" t seent colorst newcolort keyt valR0 t settingt getconft curt typet dataR t colR/ t nextt ptR t
addparentst it edgest ecolt eidt bconft ptype( ( R1 R" s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt colored_ s^
+
!c c@ s[ | d } | | k r& | j | � n | j | � } g } g } xm | D]e \ } }
|
| k rf qH n |
| k r� | j |
� qH | j |
� | d j | d � | d |
<qH Wt | � } d | d } | }
| |
| | d +g | D] } | |
j | � f ^ q� } |
| (x� t | � d k r�| j | | f � | j | | d f � d } | d 7} | | | | | | | f f Vd } | d 7} | d 7} g } | d =qWt | � d k r�| j | | f � n t | � d k r�| j | | d f � n t |
� | } | d k r&| d 7} n | d j | d � | | | | | | | f f Vd S(
s9 adds edge info to changelog DAG walk suitable for ascii()R@ t stylesR
RO i i s \i N( R R< R t lenR= R ( RH t chart stateR R R@ t nodeidxt knownparentst
newparentsRS t parentt ncolsR. t nextseenR RO t nmorecols( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt
asciiedges� sN
" (
c C@ sJ xC t | � D]5 \ } \ } } | | k r
| | d f | | <q
q
Wd S( Ni ( R> ( RO RN t startt end( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt _fixlongrightedges� s c
C@ s� | r� | | k r� | d k r� | d k ru t | d | � } | | d | d d !} | j d d g | | � | Sd d g | | d Sn+ | | d } | d k r� | | d Sg Sd S( Ni i����i i t /t s \( t maxR (
t echarst idxt pidxR] t coldifft pdifft fix_tailRa t tailt remainder( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt _getnodelineedgestail� s c C@ s x | D]\ } } | | d k r8 d | d | d <q | | d k r] d | d | d <q | | k r� | d | | d | <q d | t | � k r� q n d | d | <| | k r� | | } } n x@ t d | d d | � D]# } | | d k r� d | | <q� q� Wq Wd S( Ni Rd i s \t +t -( RV t range( Rg RO t nodelinet interlineRa Rb RN ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt
_drawedges� s "c C@ s� | | d } | | d f | k s6 | | f | k rY | j | | d | d d !� n | j d d g � | | d } | d k r� | j | | d � n | S( Ni i Re i ( R ( Rg Rh R] RO t lineRn ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt _getpaddingline s (# c C@ s� d | j � k r d S| d d d � } x$ | rO | d d k rO | j � q, Wt | j d � d d d � } | d s� d n d } x( t | � | | k r� | j | � q� W| r�g } g } | j d � }
x_ t | |
d d � |
d � D]= \ } } | d k r | j | d � q� | j | d � q� Wt t
|
|
t | � d d � � }
| } x� | | D]� } d g t | � |
| |
)xg t
t | � � D]S } | | d } t | |
| � | | <| |
| k r�d n | | | | | <q�WqmWn | d s i d
d 6d d 6n
i d d 6} xX t | � D]J \ } } d | k rUq7n g | D] } | pw| j | d � ^ q\| (q7Wg | j � D] \ } } | d k r�| ^ q�} x" | D] } | | =| j
| � q�Wd S( s� Draw ending lines for missing parent edges
None indicates an edge that ends at between this node and the next
Replace with a short line ending in ~ and add / lines to any edges to
the right.
Ni i����i i t graphshorteni Re Rd R
t ~( R t valuesR= Rf t countRV R R< R> t listRr R t itemst remove( t linest extrat edgemapR@ RX t edgecharst
shift_sizet minlinest emptiest toshiftt first_emptyRN t ct targetst positionsRv t post mapR R~ R\ ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt _drawendinglines sD - &3+ 01
c C@ s4 i g d 6i d 6d d 6d d 6t j � d 6t d 6S( s= returns the initial value for the "state" argument to ascii()R@ RO i t lastcoldifft lastindexRU Rx ( t EDGESt copyt False( ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt
asciistateO s
c C@ s6 x/ | D]' \ } } | j | | j � d � q Wd S( sX outputs an ASCII graph of a DAG
this is a helper function for 'ascii' below.
takes the following arguments:
- ui to write to
- graph data: list of { graph nodes/edges, text }
this function can be monkey-patched by extensions to alter graph display
without needing to mimic all of the edge-fixup logic in ascii()
s
N( t writet rstrip( R4 R, t lnt logstr( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt outputgraphZ s
c @ s� | \ } } } } d | k o) d k n s4 t � | d | d }
} g | D]+ } |
j | d � d f D] }
|
^ ql qP } | j d t | | t | � d � � | d k r� t | � n t | � d k o | d k o g | D]" \ } } | d | k r� | ^ q� } t | � d k o%| } | | d } | j | d g � | j t | | | d
| | | d | � � | | d } x( t j d | � D] } | j d � q�W| | d } | d k r�x� t j | � D] } | j d d g � q�Wn\ | d k r(| j | | d d | d !� n- x* t j | � D] } | j d
d g � q8Wt
| | | | � | g � | r�� j t | | | | � � n | d r�t d � | D� � r�� j | � q�n
� j | � | | | d } t � � t | � k r0x- t � � t | � k r,� j | � qWn t
� | |
| | � x) t | � t � � k rq| j d � qIWt d � |
j � D� � r%| d t d � � f d � } xM t � � D]? \ } } g | D]% }
| |
| � r�|
d n � ^ q�| (q�W|
j � f d � |
j � D� � n t | | | � } g � D]# } d d | d j | � f ^ q?� t | t � | � � | | d <| | d
<d S( s� prints an ASCII graph of the DAG
takes the following arguments (one call per node in the graph):
- ui to write to
- Somewhere to keep the needed state in (init to asciistate())
- Column of the current node in the set of ongoing edges.
- Type indicator of node data, usually 'C' for changesets.
- Payload: (char, lines):
- Character to use as node's symbol.
- List of lines to display as the node's text.
- Edges; a list of (col, next_col) indicating the edges between
the current node and its parents.
- Number of columns (ongoing edges) in the current revision.
- The difference between the number of columns (ongoing edges)
in the next revision and the number of columns (ongoing edges)
in the current revision. That is: -1 means one column removed;
0 means no columns added or removed; 1 means one column added.
i����i RO R@ R
Re i i����i R� R� Rd s \Rx c s@ s! | ] } | r | d k Vq d S( s \/N( ( R
R� ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pys <genexpr>� s R3 c s@ s! | ] } t | � d k Vq d S( i N( RV ( R
RW ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pys <genexpr>� s RU c @ sQ t | � d k r t St | d � } | d k r= | | k St � � | | k S( Ni i����i ( RV t TrueR8 ( RW RN t num( R ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt _drawgp� s c 3@ s9 | ]/ \ } } | t | � d k r* | n � f Vq d S( i N( RV ( R
t eR� ( R\ ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pys <genexpr>� s s %-*s N( R
Re ( t AssertionErrorR R Rf RV Rc Ro R t xrangeR Ru Rw t anyR� Rz R R> R R} t joinR� t zip( R4 RX RH RW t textt coldataRh RO R] Rj R� R@ R R� Rg t xt yt add_padding_linet fix_nodeline_tailRs t shift_interlineRN R{ t extra_interlineR� Rv t indentation_level( ( R R\ s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt asciij sl "8(
/ #
7 0
N( t __doc__t
__future__R R) R R3 R R R R R! R R R R R� R( R+ RT R` Rc Ro Ru Rw R� R� R� R� ( ( ( s8 /usr/lib64/python2.7/site-packages/mercurial/graphmod.pyt <module> s( " *
N 5 3