Ramkumar Ramachandra <artag...@gmail.com> writes:

> Further, this can speed up tree-rename detection greatly (in fact, I'm
> thinking the first implementation will depend on this information
> being present).  I inspect M^{tree} and I want to know how it's
> composed from M^1^{tree} and M^2^{tree}.  Simple.  In M^{tree}, look
> for trees that have this additional data filled in: then we can just
> short-circuit the rename detection to matching the similarity of this
> tree with M^1^{tree} and M^2^{tree}.

If you need the history context (i.e. M, M^1, M^2) around it to
interpret that additional information, isn't it essentially the same
as storing renames in the merge commit M?

Not very impressed, at least not yet.

To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majord...@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html

Reply via email to