Re: git-diff-tree inordinately (O(M*N)) slow on files with many changes
- From
Jakub Narebski <jnareb@gmail.com>
- Date
- Oct 16, 2006, 16:54 UTC
- Message-ID
- <eh0del$g4t$1@sea.gmane.org>
- In-Reply-To
- <Pine.LNX.4.64.0610160920250.7697@alien.or.mcafeemobile.com>
<opublikowany i wysłany>
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