+=dZddlmZddlmZddlmZmZmZdZ dZ dZ dZ e d e d e d iZ d Zd ZdZdZdZdZdZdZdZej.GddZdZdZy )a>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. )nullrev)attr)dagopsmartsetutilCPGM|:Nc #~ Ki}|D]}||}|jDchc]%}|j|vs|j'c} |jDcgc];}|jtk7r"|j vr|j=}}t Dcgc] }t|f }}|D]}|j |} | ^t |tjstj|}tttj|||gx} ||<| s)|jt|f j||j fd| D j!| |jt"||fycc}wcc}wcc}ww)acset 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. Nc38K|]}|vst|fywN) GRANDPARENT).0gpsets 6usr/lib/python3.12/site-packages/mercurial/graphmod.py zdagwalker..QsMAq} Q/s  )parentsrevrsortedPARENTget isinstancerbasesetsetrreachablerootsappend MISSINGPARENTaddextendupdate CHANGESET) reporevsgpcacherctxpmparsrmpargprs @r dagwalkerr.(sG3i"%BA!%%'T/B[[] "uuw'!aeegT&9 EEG"  )/t 5 1FA; 5DT"Bz"$(8(89#++D1D%+,,T4$@A&WT] t45MMM B"wwy)S'22= C 6s/ F=F.F. F="AF3"F=1F8C=F=c#Kt|}|D]n}||}|jDchc]+}|j|vst|j f-}}|j t |t |fpycc}ww)zcset 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)rrnoderrr%r)r&nodesincluder0r)r*rs rr1r1Ws~ %jG4j'*{{} '4!G8KVQUUW }  wwy)S&/::  s(BBB-Bc #Kg}i}d}ijjdD]\}}d|vs |jdd\}}|dk(r/|jrt |j |i|<T|dk(sZ|j sk|j |i|<rtjfd} nd} |D]h\} } } } | |vr|j| ||| <|dz }|j| }|j| }|dd}| Dcgc] \}}||vs |}}}||||dzt|D]\}}|s|||<|||<|dz }g}t|D]\}}||vrQ| |}|j||j||||jdd |jdd f[|| k(sa| D]R\}}| |}|j||j|||jdd |jdd fT| | | ||f|f|}kycc}}ww) axannotates 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. rsgraph.swidthscolorcJj|jiSr)rbranch)rconfigr&s rzcolored..s 49#3#3#5r:ciSr)rs rr8zcolored..sbr9Nr9)ui configitemsrsplitisdigitint setdefaultisalnumr lrucachefuncr indexpop enumerater)dagr&seencolorsnewcolorkeyvalr6settinggetconfcurtypedatarcolcolornextptr* addparentsiedgesecoleidbconfptyper7s ` @rcoloredr^fsq D FH FGG''1S 3;!jjq1OFG("s{{}9WEB aW >(S37j)DAq!q $q A  *"4ID#d{   3s  (B/ (C0  'HE1#AJELL  JJqM!!IIh3!IIh4 !()4D$e e44k'*?s2.H>AH>H>B H> H8,H80BH>A0H>c#K|j}||vr|j||j|}g}g}|D][\} } | |k(r | |vr|j| "|j| |jj | d|j | <]t |} d| dzz} |dd} || ||dz|Dcgc]}|| j|f}}| |ddt |dkDr\|j||f|j||dzfd}| dz } ||| ||| |ffd}|dz }| dz } g}|d=t |dkDr\t |dkDr|j||ft |dkDr|j||dzft | | z }|dkDr| dz } |j j|d||| ||| |ffycc}ww)z9adds edge info to changelog DAG walk suitable for ascii()r rN\)rIr rEstylesrrYlenrF)rQcharstaterrrInodeidx knownparents newparentsr]parentncolswidthnextseenr*rY nmorecolss r asciiedgesros ::D $ CjjoGLJ v S=  T>    '   f %"',,"2"25$"?EKK ! IE  MEAwH&0HWw{#3? @>##cc I  " -   " -iood+a/14a8J**qH e*x*, , U1X e*x*, ,kk$' eKNN3[A5EFDAqyq1u%q1u% G u[+G q8H*H!LMAJ :+,'D"&3t9{+B!CD 3y>*lQ&"3 3 ! $''!*$4D% :KS +(%*$6$6dt QICU#4 t  267$Q1(4(($7Q$ $MMO 9ODAqqyaOF 9 FO F 8:sH); H.H.cteZdZdZej dej eZej dej e Z ej ddZ ej ddZ ej dej e jZej ddZy) asciistatez State of ascii() graph renderingF)initdefaultrbN)__name__ __module__ __qualname____doc__ribFactoryrrIdictrY lastcoldiff lastindexEDGEScopyrcrr;r9rrrgs* 477|t||D'9 :D DGG  T(: ;E$''ua0KUA.I TWW%ejj)A BF477u5Lr9rcb|D]*\}}|j||zjdz,y)aXoutputs 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()  N)writerstrip)r=graphlnlogstrs r outputgraphrss0 V "v+%%'%/0r9c |\}}}} d| cxkrdksJJ|j|j} } | D cgc]} | j| ddfD]} | }} } |jdt || zt | z dz| dk(r t |t |dkDxr%| dk(xr|Dcgc]\}}|dz|ks|c}}}t |dkxr| }|d |dz}|j|dg|jt|||j|| |j||d |dz}td| zD]}|jd||z dz }| dk(r$t|D]}|jd dgnF| dk(r|j||dzdz|dzn#t|D]}|jd dgt|||||g}|r|jt|||||jr$td |Dr#|j|n|j||d || zdz}t |t |krCt |t |kr,|j|d d t |t |kr,t!||| | |t |t |kr)|jd t |t |kr)t ||| z}|Dcgc]}dd|zd j#|fz}}t%|t'||| |_ ||_y cc} } wcc}}wcc}w)aprints 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. r`r rv)r rvrbr<rNrurac3*K|] }|s|dv yw)s\/Nr;)rrs rrzascii..s9OqqqF{Os r9s%-*s )rYrIrr#rwrdrsrrrrr rrranyrjoinrzip)r=rfrQretextcoldataryrYrkr{rrIr*rrxxyadd_padding_linefix_nodeline_tailrshift_interlinerXrrextra_interlineindentation_levelrs rasciirsz(")Cw  !   KKTG DA At(::u  Ct$% EEOKE(-QT s"M3MM M)rr0r thirdpartyrrrrr%rrr!rr.r1r^rorsrrrrsrrrr;r9rrs     {D->,3^ ;Wt3Bl( C'&*1h6661"r9