File: //usr/lib/python2.7/dist-packages/mercurial/graphmod.pyc
ó
ŰXc @@ sÖ d Z d d l m Z d d l m Z d d l 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 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 revsett utilt Ct Pt Gt Mt |t :c
#@ s¨ s
d Si } x D]} | | } t f d | j D g | j D]6 } | j t k rV | j k rV | j ^ qV } g t D] } t | f ^ q } xĎ | D]Ç } | j | } | d k r2t t j
st j
n t t t j | | g } | | <n | s[| 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.
Nc 3@ s- | ]# } | j k r | j Vq d S( N( t rev( t .0t p( t revs( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>< s c 3@ s' | ] } | k r t | f Vq d S( N( t GRANDPARENT( R t g( t pset( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>N s ( t sett parentsR
R t sortedt PARENTt gett Nonet
isinstanceR t basesett reachablerootst appendt
MISSINGPARENTt addt extendt updatet CHANGESET(
t repoR
t gpcacheR
t ctxR t mparsR t mpart gp( ( R R
s6 /usr/lib/python2.7/dist-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( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>\ s N( R R R
R R ( R t nodesR' R" R ( ( R( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyR) S 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 ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt <lambda>} s c S@ s i S( N( ( R
( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyR0 s i˙˙˙˙t N( t uit configitemst rsplitt isdigitt intt
setdefaultt isalnumR t lrucachefuncR t indext popt enumerateR ( t dagR t seent colorst newcolort keyt valR. t settingt getconft curt typet dataR t colR- t nextt ptR t
addparentst it edgest ecolt eidt bconft ptype( ( R/ R s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt colored` s^
+
!c c@ s* | d } | | k r& | j | n | j | } g } g } x[ | D]S \ }
} | | k rp | j | qH | j | | d j |
d | d | <qH Wt | } | }
| |
| | d +g | D]' } | t k rĘ | |
j | f ^ qĘ } |
| (x t | d k r| j | | f | j | | d f d } | | | | | | | f f Vd } g } | d 7} | d 7} g } | d =qWt | d k rš| j | | f n t | d k rĺ| j | | d f n t |
| } | d j | d | | | | | | | f f Vd S(
s9 adds edge info to changelog DAG walk suitable for ascii()R> t stylesR RM i i s \i N( R R: R t lenR R; R ( RF t chart linest stateR
R R> t nodeidxt knownparentst
newparentsRQ t parentt ncolst nextseenR RM t nmorecols( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt
asciiedgesŽ sF
" 1
c C@ sJ xC t | D]5 \ } \ } } | | k r
| | d f | | <q
q
Wd S( Ni ( R< ( RM RL t startt end( ( s6 /usr/lib/python2.7/dist-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_tailR` t tailt remainder( ( s6 /usr/lib/python2.7/dist-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 Rc i s \t +t -( RT t range( Rf RM t nodelinet interlineR` Ra RL ( ( s6 /usr/lib/python2.7/dist-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 } | d k r | j | | d n | S( Ni i s i ( R ( Rf Rg R\ RM t lineRm ( ( s6 /usr/lib/python2.7/dist-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 } x( t | d | k r | j | qs 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 | | | |
| <qWqWWn i d d 6d
d 6} xX t | D]J \ } }
d |
k r(q
n g |
D] }
|
pJ| j | d ^ q/|
(q
Wg | j D] \ } }
|
d k re| ^ qe} x" | D] } | | =| j
| qWd 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 i Rd Rc R t ~( R t valuesR; Re t countRT R R: R< t listRq R t itemst remove( RV t extrat edgemapR> t edgecharst
shift_sizet emptiest toshiftt first_emptyRL t ct targetst positionsRu t post mapR R| R[ ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt _drawendinglines sB - &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> RM i t lastcoldifft lastindexRS t graphshorten( t EDGESt copyt False( ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt
asciistateJ s
c @ sV | \ } } } } 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 } | j d d | | | d } | d k rÇ| j d | n@ | d k rö| j | | d d | d ! n | j d
| t | | | | | g | rH j t | | | | n | d r{t
d | D r j | qn
j | | | | d } t t | k râx- t t | k rŢ j | qľWn t | |
| x) t | t k r | j d qřWt
d |
j D rÔ| d t
d f d } xM t D]? \ } } g | D]% }
| |
| r|
d n ^ q~| (qkW|
j f d |
j D n t | | | } xT t | D]C \ } } d d | d j | | f } | j | j d q÷W| | 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 RM R> R Rd i i˙˙˙˙i R R s / s \ R c s@ s! | ] } | r | d k Vq d S( s \/N( ( R R ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>Ž s R1 c s@ s! | ] } t | d k Vq d S( i N( RT ( R RU ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>Ŕ s RS c @ sQ t | d k r t St | d } | d k r= | | k St | | k S( Ni i˙˙˙˙i ( RT t TrueR6 ( RU RL t num( RV ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt _drawgpÄ s c 3@ s9 | ]/ \ } } | t | d k r* | n f Vq d S( i N( RT ( R t eR ( R[ ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>Î s s %-*s %ss
N( R Rd ( t AssertionErrorR R Re RT Rb Rn Rt R Rv t anyR Rx R R< R R{ t zipt joint writet rstrip( R2 RW RF RU t textt coldataRg RM R\ Ri R~ R> R R Rf t xt yt add_padding_linet fix_nodeline_tailRr t shift_interlineRy t extra_interlineR RL Ru t indentation_levelt logstrt ln( ( RV R[ s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt asciiU sh "8(
/ #
7
N( t __doc__t
__future__R R' R R1 R R R R R R R R R& R) RR R_ Rb Rn Rt Rv R R RŚ ( ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt <module> s& -
N 0 2