Johannes Schindelin <Johannes.Schindelin@xxxxxx> writes: > If that should be not true, you always could rely on topo order. Which > does not seem to solve the problem for you. The computation of merge-base is about computing topo order cheaply, so that is a recursive definition of the problem, not a solution, I am afraid. With the generation counter, we know the clean-up phase needs to parse and traverse unparsed parents with the same or higher generation counter than the lowest we have in the result list, which would limit our clean-up traversal. In order to look at the generation number of parent, we would need to parse it, so we would end up parsing one level more than needed at the edge, though. - : send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html