scripts/chg-len.py
author Peter Kovacs <kpeter@inf.elte.hu>
Sun, 30 Nov 2008 22:06:36 +0100
changeset 411 c5f010a5647a
parent 284 a16cc721259e
child 439 62c1ed05e83f
permissions -rwxr-xr-x
Improve unify-sources.sh (#186)
Errors can also be accepted when the script is used as a hg hook.
Sometimes it is useful (e.g. if someone else made the errors).
alpar@272
     1
#! /usr/bin/env python
alpar@272
     2
alpar@272
     3
import sys
alpar@390
     4
alpar@390
     5
from mercurial import ui, hg
alpar@272
     6
alpar@272
     7
if len(sys.argv)>1 and sys.argv[1] in ["-h","--help"]:
alpar@272
     8
    print """
alpar@272
     9
This utility just prints the length of the longest path
alpar@272
    10
in the revision graph from revison 0 to the current one.
alpar@272
    11
"""
alpar@272
    12
    exit(0)
alpar@272
    13
alpar@390
    14
u = ui.ui()
alpar@390
    15
r = hg.repository(u, ".")
alpar@390
    16
N = r.changectx(".").rev()
alpar@390
    17
lengths=[0]*(N+1)
alpar@390
    18
for i in range(N+1):
alpar@390
    19
    p=r.changectx(i).parents()
alpar@390
    20
    if p[0]:
alpar@390
    21
        p0=lengths[p[0].rev()]
alpar@272
    22
    else:
alpar@390
    23
        p0=-1
alpar@390
    24
    if len(p)>1 and p[1]:
alpar@390
    25
        p1=lengths[p[1].rev()]
alpar@272
    26
    else:
alpar@390
    27
        p1=-1
alpar@390
    28
    lengths[i]=max(p0,p1)+1
alpar@390
    29
print lengths[N]