[MERGE] Implement guess-renames

[Aaron Bentley]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

John Arbash Meinel wrote:
> Rather than using individual lines to determine the match, it uses pairs
> of lines (one can argue that it is the 'edge' between the lines).

> I think the big win of Aaron's algorithm is that he hashes every line in
> the unmatched source, and then effectively compares all the unknown
> files against all possible sources.

This is somewhat similar to http://catb.org/~esr/comparator/, except
that it uses three lines and the hash is sha-1.  I may have
subconsciously been thinking about it, though.

Aaron
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.9 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iEYEARECAAYFAknIXsoACgkQ0F+nu1YWqI3j+QCfZOQParpT3BVyuSGyW/qiq0Vy
iDQAn3VsuI5nIk3VhUgS8wtvA/k5ameR
=8LMk
-----END PGP SIGNATURE-----