author | Balazs Dezso <deba@inf.elte.hu> |
Wed, 03 Dec 2008 14:23:22 +0100 | |
changeset 419 | 9afe81e4c543 |
parent 284 | a16cc721259e |
child 422 | 62c1ed05e83f |
permissions | -rwxr-xr-x |
alpar@272 | 1 |
#! /usr/bin/env python |
alpar@272 | 2 |
|
alpar@272 | 3 |
import sys |
alpar@376 | 4 |
|
alpar@376 | 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@376 | 14 |
u = ui.ui() |
alpar@376 | 15 |
r = hg.repository(u, ".") |
alpar@376 | 16 |
N = r.changectx(".").rev() |
alpar@376 | 17 |
lengths=[0]*(N+1) |
alpar@376 | 18 |
for i in range(N+1): |
alpar@376 | 19 |
p=r.changectx(i).parents() |
alpar@376 | 20 |
if p[0]: |
alpar@376 | 21 |
p0=lengths[p[0].rev()] |
alpar@272 | 22 |
else: |
alpar@376 | 23 |
p0=-1 |
alpar@376 | 24 |
if len(p)>1 and p[1]: |
alpar@376 | 25 |
p1=lengths[p[1].rev()] |
alpar@272 | 26 |
else: |
alpar@376 | 27 |
p1=-1 |
alpar@376 | 28 |
lengths[i]=max(p0,p1)+1 |
alpar@376 | 29 |
print lengths[N] |