Johannes Schindelin [off-list ref] writes:
On Tue, 4 Jul 2006, Junio C Hamano wrote:
quoted
This is "for concepts" only -- it still seems to have bugs
somewhere to break other tests, although it passes your new
tests.
Doesn't this introduce a nasty O(n*m) performance (where m is the
number of merge bases, and n the number of traversed commits)? I think
possibly many commits are traversed multiple times.
In practice m is small and the recomputation of bases between
bases does not require the minimalization so O(m^2). I've given
the numbers from a small real world example on the fixed code.