equal
deleted
inserted
replaced
290 # count how many times we'll use this |
290 # count how many times we'll use this |
291 needed[p] += 1 |
291 needed[p] += 1 |
292 |
292 |
293 # sort by revision (per file) which is a topological order |
293 # sort by revision (per file) which is a topological order |
294 visit = [] |
294 visit = [] |
295 files.reverse() |
|
296 for f in files: |
295 for f in files: |
297 fn = [(n._filerev, n) for n in needed.keys() if n._path == f] |
296 fn = [(n.rev(), n) for n in needed.keys() if n._path == f] |
298 fn.sort() |
|
299 visit.extend(fn) |
297 visit.extend(fn) |
|
298 visit.sort() |
300 hist = {} |
299 hist = {} |
301 |
300 |
302 for r, f in visit: |
301 for r, f in visit: |
303 curr = decorate(f.data(), f) |
302 curr = decorate(f.data(), f) |
304 for p in parents(f): |
303 for p in parents(f): |