On Sun, Sep 07, 2008 at 10:22:02PM +0200, Stephen R. van den Berg wrote:How about the example I gave already? The first merge-base is E, but that is not correct for the merge I gave. So you propose an algorithm which will find A. But now imagine the exact some topology, but there was no cherry-pick; instead, E' is actually a merge. Wouldn't E be the right merge-base then? And yes, of course the _content_ of the trees in E' will be different in those two cases. But the shape of the history graph will be the same, and that is the only thing that goes into finding a merge base. -Peff -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
| Tarkan Erimer | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Greg KH | [GIT PATCH] driver core patches against 2.6.24 |
| holzheu | Re: [RFC/PATCH] Documentation of kernel messages |
| FUJITA Tomonori | Re: Integration of SCST in the mainstream Linux kernel |
git: | |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| Gerrit Renker | [PATCH 13/37] dccp: Deprecate Ack Ratio sysctl |
| Arjan van de Ven | Re: [GIT]: Networking |
| Evgeniy Polyakov | Re: [BUG] New Kernel Bugs |
