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