From: Jakub Narebski Date: Mon, 16 Oct 2006 16:54:08 GMT Subject: Re: git-diff-tree inordinately (O(M*N)) slow on files with many changes Message-ID: In-Reply-To: Davide Libenzi wrote: > The test is fine as is. Only really bad hash collisions can show O(M*N). > Can I have the two sample files to test? Jim Meyering wrote: >   http://meyering.net/code/git-perf/configure.gz >   http://meyering.net/code/git-perf/configure-curr.gz -- Jakub Narebski Warsaw, Poland ShadeHawk on #git