| 1 |
On Mon, Jun 4, 2012 at 9:48 AM, Dirkjan Ochtman <djc@g.o> wrote: |
| 2 |
> |
| 3 |
> You simply walk the tree from root to tip. When you encounter an |
| 4 |
> unsigned changeset, the nearest signed descendant is responsible for |
| 5 |
> merging that changeset. |
| 6 |
> |
| 7 |
|
| 8 |
How do you KNOW that the nearest signed descendant actually merged it? |
| 9 |
|
| 10 |
How do you know it wasn't added by a hacker? |
| 11 |
|
| 12 |
Also, when walking the tree keep in mind that there isn't just one |
| 13 |
path in it (with merge commits), and the links are from any particular |
| 14 |
HEAD going back. I'm not convinced that this is impossible, but it |
| 15 |
isn't as trivial as it might seem at first glance. |
| 16 |
|
| 17 |
Rich |
Archives