Files @ r559:9b9ffe7d9b75

Location: LEMON/LEMON-official/scripts/chg-len.py

Load file history 
r559:9b9ffe7d9b75
648 B
text/x-python
Show annotation Show as raw Download as raw
gravatar
deba@inf.elte.hu
Fixes for MSVC 2008 in grap_adaptors.h and edge_set.h (#194) Several renamings and changes in adaptors and edge sets - Fixing scope usage for MSVC - ResidualDigraph based on SubDigraph instead of FilterArcs - Use initialize() in adaptors and edge sets - Wrap ListDigraph for edge set tests
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#! /usr/bin/env python



import sys



from mercurial import ui, hg

from mercurial import util



util.rcpath = lambda : []



if len(sys.argv)>1 and sys.argv[1] in ["-h","--help"]:

    print """

This utility just prints the length of the longest path

in the revision graph from revison 0 to the current one.

"""

    exit(0)



u = ui.ui()

r = hg.repository(u, ".")

N = r.changectx(".").rev()

lengths=[0]*(N+1)

for i in range(N+1):

    p=r.changectx(i).parents()

    if p[0]:

        p0=lengths[p[0].rev()]

    else:

        p0=-1

    if len(p)>1 and p[1]:

        p1=lengths[p[1].rev()]

    else:

        p1=-1

    lengths[i]=max(p0,p1)+1

print lengths[N]