Re: [PATCH] binary-tree-based objects.

Linus Torvalds [off-list ref] writes:

On Sat, 11 Feb 2006, Linus Torvalds wrote:

quoted

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.