On Mon, 4 Feb 2008, Linus Torvalds wrote:.. and it won't actually solve the problem you pointed to. It's not enough that the positive commits should be connected to the negative ones, the problem is that no negative ones could possibly connect to the positives. So scratch that patch as broken too. Really annoying. It does look like we really want to check the *totally* connected case, and we simply cannot do the "two unconnected trees" decision case without traversing both trees fully (since we won't know that they are *really* unconnected until we do). And that seems really quite expensive. I wonder if I've missed something again. Linus - 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
| Greg Kroah-Hartman | [PATCH 001/196] Chinese: Add the known_regression URI to the HOWTO |
| Andy Whitcroft | clam |
| Vladislav Bolkhovitin | Re: Integration of SCST in the mainstream Linux kernel |
git: | |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | [GIT]: Networking |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| Evgeniy Polyakov | Re: [BUG] New Kernel Bugs |
