From: Junio C Hamano <junkio@cox.net>
Date: Sun, 12 Feb 2006 05:48:19 GMT
Subject: Re: [PATCH] binary-tree-based objects.
Message-ID: <7v1wy9f7q4.fsf@assigned-by-dhcp.cox.net>
In-Reply-To: <Pine.LNX.4.64.0602112122400.3691@g5.osdl.org>

Linus Torvalds <torvalds@osdl.org> writes:

> On Sat, 11 Feb 2006, Linus Torvalds wrote:
>> 
>> If somebody shows that the other approaches are faster, then I guess I'll 
>> just have to sulk in a corner and grown quietly at people.
>
> growl. growL. With an 'L'!

I do not get it.

But my impression was the circular hash with trivial fixes were
the fastest.  I am benching them now.