>> the Git merging code currently
>> chooses the common ancestor in a sub-optimal manner, leading to more
>> merging than strictly necessary.
> Ah, I'd say that that's good news, since it means we have more potential
> for improvement. :)
That's a way of putting it.
Question to the audience: given a finite lattice, how do you
efficiency compute the least upper bound of a set of points?
Extra marks if your algorithm does The Right Thing (TM) when working
over a finite poset (not necessarily a lattice). The tricky point, of
course, is defining The Right Thing (TM).
Juliusz
_______________________________________________
darcs-devel mailing list
[email protected]
http://www.abridgegame.org/cgi-bin/mailman/listinfo/darcs-devel
