[PATCH 0 of 5] RFC: Implement O(n + m) algorithm for findrenames()

[Dirkjan Ochtman]

On Sun, Mar 7, 2010 at 14:14, David Greenaway <hg-dev at davidgreenaway.com> wrote:
> After the patches are applied (changing the algorithm from O(n * m) time
> complexity to O(n + m) time complexity), this testcase takes a little
> under 10 minutes.

Sounds great... I do note that your coding style doesn't really match ours:

http://mercurial.selenic.com/wiki/BasicCodingStyle

(But you might want to wait with fixing that up until someone who's
not me thoroughly reviews your patches.)

Cheers,

Dirkjan