On Mon, Sep 05, 2011 at 12:12:31PM +0200, Stefan Sperling wrote: > > Anyway we can implement top-level part of handling moves and then > > optimize it using FSFS successor ID storage or something else. > > We need the bottom parts first. > It won't perform well enough without successor-IDs.
I should have been clearer: "It" in my quote above is not the algorithm I posted pseudo-code for. "It" is a different algorithm that finds nodes which were deleted in the history of the target branch of a merge (again, see http://svn.haxx.se/dev/archive-2011-08/0624.shtml).
