Bruno Haible:
> Here is a new AVL patch. It uses normal linked lists in the normal case,
> and switches to AVL when the number of VMAs exceeds a certain threshold:
> 32 VMAs. It thus combines the good timings of plain 2.1.119 with the
> guaranteed worst-case O(log n) scalability of the AVL trees.
>
Ahhh. Thank you.
Linus, please apply this (or something with eqally good timings for the
lots-of-VMA case) to 2.1. Some people _do_ depend on it.
NB, I don't particularly care whether it's a hash or an AVL. However, any
hash with a fixed number of hash slots _is_ going to lose (given a
sufficiently high number of table entries), and a dynamic implementation
will probably get blocked by the magic words "feature freeze", so...
-- Matthias Urlichs | noris network GmbH | smurf@noris.de The quote was selected randomly. Really. | http://www.noris.de/~smurf/-- The brain works from the moment of birth until you stand up to speak in public.- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/faq.html