equal
deleted
inserted
replaced
980 for i in allrevs: |
980 for i in allrevs: |
981 revs.append(i) |
981 revs.append(i) |
982 if len(revs) >= revcount: |
982 if len(revs) >= revcount: |
983 break |
983 break |
984 |
984 |
985 dag = graphmod.dagwalker(web.repo, revs) |
985 # We have to feed a baseset to dagwalker as it is expecting smartset |
|
986 # object. This does not have a big impact on hgweb performance itself |
|
987 # since hgweb graphing code is not itself lazy yet. |
|
988 dag = graphmod.dagwalker(web.repo, revset.baseset(revs)) |
|
989 # As we said one line above... not lazy. |
986 tree = list(graphmod.colored(dag, web.repo)) |
990 tree = list(graphmod.colored(dag, web.repo)) |
987 |
991 |
988 def getcolumns(tree): |
992 def getcolumns(tree): |
989 cols = 0 |
993 cols = 0 |
990 for (id, type, ctx, vtx, edges) in tree: |
994 for (id, type, ctx, vtx, edges) in tree: |