| 1 |
Rich Freeman wrote: |
| 2 |
> I'm storing a history of when files change, starting by looking at |
| 3 |
> commits in complete isolation. |
| 4 |
|
| 5 |
The more gitty way would be to use the trees. |
| 6 |
|
| 7 |
|
| 8 |
> Off the top of my head I can't think of a simple fix (other than |
| 9 |
> pairwise comparison the way that git show $commit works - which |
| 10 |
> would be much more difficult to run in parallel). |
| 11 |
|
| 12 |
It would be two passes. First pass tree[n%2=0] with tree[n+1] and on |
| 13 |
second pass tree[n%2=1] with tree[n+1]. |
| 14 |
|
| 15 |
|
| 16 |
> One way that comes to mind is to do a second pass that just looks |
| 17 |
> for deletions, using the cvs data to cheat - each deletion could be |
| 18 |
> checked in parallel doing a pairwise compare on a single file. |
| 19 |
|
| 20 |
It would compare trees, not files, but sure, that works too. It will |
| 21 |
not notice if something extra has been deleted in git however, if the |
| 22 |
same file does not have any further changes in CVS. |
| 23 |
|
| 24 |
|
| 25 |
//Peter |
Archives