-=[ Mr. Bumblebee ]=-
_Indonesia_
\,Tc @ s d Z d d l m Z d d l Z 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 nullrevNt Cc # sr | s
d S| j } | j } i } | j } x:| D]2} | | } t t g | j D]$ } | j | k r[ | j ^ q[ g | j D]6 } | j t k r | j k r | j ^ q } x| | D]t }
| j |
} | d k r t | | | |
} | |
<n | s2 j
|
q j f d | D q W| j t | f Vq8 Wd S( sG cset DAG generator yielding (id, CHANGESET, ctx, [parentids]) tuples
This generator function walks through revisions (which should be ordered
from bigger to lower). It returns a tuple for each node. The node and parent
ids are arbitrary integers which identify a node in the context of the graph
returned.
Nc 3 s! | ] } | k r | Vq d S( N( ( t .0t g( t parents( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pys <genexpr>7 s (
t changelogt mint sett sortedR t revR t gett Nonet grandparentt appendt extendt CHANGESET( t repot revst clt lowestrevt gpcachet knownrevsR t ctxt pt mparst mpart gp( ( R s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt dagwalker s(
*6
!c c s t | } xr | D]j } | | } t g | j D]$ } | j | k r3 | j ^ q3 } | 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.
N( R R t nodeR R R ( R t nodest includeR R R R ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyR ; 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} qWg } x t | D] \ } } | | k rZ| | } | j | | j
| | | | j
d d | j
d d f q| |
k rxZ |
D]O } | | } | j | | j
| | | j
d d | j
d d f qmWqqW|
| | | | 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>d s c S s i S( N( ( R ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyR% f s it N( t uit configitemst rsplitt isdigitt intt
setdefaultt isalnumt utilt lrucachefuncR
t indext popt enumerateR
( t dagR t seent colorst newcolort keyt valR# t settingt getconft curt typet dataR t colR" t nextR t
addparentst it edgest ecolt eidt bconf( ( R$ R s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt coloredG s^
%
!c
C s t | g } t } t } t t | } x | r | j } | | k r3 | | k r3 | | k ry | j | n) | j g | j | D] } | ^ q | j | q3 q3 Wt | S( s_ Return all ancestors of head in roots which revision is
greater or equal to lowestrev.
( R t maxR R1 t addt updatet
parentrevsR (
R R t rootst headt pendingR4 t keptt
llowestrevt rR ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyR s )c c s | | k r | j | n | j | } g } g } x7 | D]/ } | | k r` | j | q> | j | q> 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 =q Wt | d k r|
j | | f n t | d k r|
j | | d f n t | |
} | | (| | | | |
|
| f f Vd S( s9 adds edge info to changelog DAG walk suitable for ascii()i i s \i N( R
R0 t lenR ( R< t chart linesR4 R R t nodeidxt knownparentst
newparentst parentt ncolst nextseenR RB t nmorecols( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt
asciiedges s>
4
c C sJ xC t | D]5 \ } \ } } | | k r
| | d f | | <q
q
Wd S( Ni ( R2 ( RB RA 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 rt t | d | } d d g | | d } | j d d g | | | Sd d g | | d Sn d d g | | d Sd S( Ni ii t |t t /s \( RG R ( t
node_indext p_node_indext n_columnst n_columns_difft p_difft fix_tailR\ t tail( ( 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 rz 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 Ra i s \R_ t +t -( RQ t range( RB t nodelinet interlineR\ R] RA ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt
_drawedges s "c C s g } | j d d g | | | d f | k sE | | f | k rN d } n d } | j | d g | j d d g | | d | S( NR_ R` i ( R ( t niRd RB t linet c( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt _getpaddingline s ( c C s
d d g S( s= returns the initial value for the "state" argument to ascii()i ( ( ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt
asciistate s c C s | \ } } } } d | k o) d k n s4 t | d k rM t | n t | d k o | d k o g | D]" \ }
} |
d | k rr |
^ qr } t | d k o | }
d d g | } | j | d g | j t | | d | | | d |
d d g | } | d k r+d } d } n' | d k rFd } d } n d } d
} | j | d g | j | d g | | d t | | | | g } | r| j t | | | n | j | x) t | t | k r| j d qWt | t | k rTd d g | | } x, t | t | k rP| j | q(Wn t | | | } xT t | | D]C \ } } d d | d j
| | f } | j | j d
qwW| | 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.
ii ii R_ R` i Ra i s \R& s %-*s %ss
N(
t AssertionErrorR^ RQ R Ri Ro R
Rs RG t zipt joint writet rstrip( R' t stateR< RR t textt coldatat idxRB RX t coldifft xt yt add_padding_linet fix_nodeline_tailRm t shift_interlinet n_spacest edge_chRS t extra_interlinet indentation_levelRq t logstrt ln( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt ascii sP "
/
( t __doc__t mercurial.nodeR R. R R R RF R R[ R^ Ri Ro Rs Rt R ( ( ( s6 /usr/lib/python2.7/dist-packages/mercurial/graphmod.pyt <module> s " N +
Copyright © 2017 || Recoded By Mr.Bumblebee