|From:||Sasha Levin <levinsasha928-AT-gmail.com>|
|To:||Linus Torvalds <torvalds-AT-linux-foundation.org>|
|Subject:||Re: [RFC v2 1/7] hashtable: introduce a small and naive hashtable|
|Date:||Sat, 04 Aug 2012 02:33:07 +0200|
|Cc:||Tejun Heo <tj-AT-kernel.org>, akpm-AT-linux-foundation.org, linux-kernel-AT-vger.kernel.org, linux-mm-AT-kvack.org, paul.gortmaker-AT-windriver.com, davem-AT-davemloft.net, rostedt-AT-goodmis.org, mingo-AT-elte.hu, ebiederm-AT-xmission.com, aarcange-AT-redhat.com, ericvh-AT-gmail.com, netdev-AT-vger.kernel.org|
On 08/04/2012 02:05 AM, Linus Torvalds wrote: > On Fri, Aug 3, 2012 at 5:03 PM, Sasha Levin <firstname.lastname@example.org> wrote: >> >> The problem with that code was that it doesn't work with dynamically allocated hashtables, or hashtables that grow/shrink. > > Sure. But once you have that kind of complexity, why would you care > about the trivial cases? Because there are far more trivial cases than complex ones - I've counted 50+ of these "trivial" cases. None of them need the complexity we're trying to deal with at the moment. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to email@example.com. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"firstname.lastname@example.org"> email@example.com </a>
Copyright © 2012, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds