Messages in this thread | | | Date | Sat, 04 Aug 2012 02:33:07 +0200 | From | Sasha Levin <> | Subject | Re: [RFC v2 1/7] hashtable: introduce a small and naive hashtable |
| |
On 08/04/2012 02:05 AM, Linus Torvalds wrote: > On Fri, Aug 3, 2012 at 5:03 PM, Sasha Levin <levinsasha928@gmail.com> 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.
| |