Eric Dumazet writes:
> Indeed. It would be nice to see how it performs with say 2^20 elements...
> Because with your data, I wonder if the extra complexity of the trash is
> worth
> it (since most lookups are going to only hit the hash and give the answer
> without intermediate nodes)
I don't know if I understand you fully. Yes in most cases the first lookup via
"hash-header" will take us to direct to the correct leaf. If there are
"collisions"
we have to sort them out by adding intermediate nodes.
Something like where you have resizable hash where is each bucket in turn is a
resizable hash etc.
Cheers
--ro
-
To unsubscribe from this list: send the line "unsubscribe netdev" in
the body of a message to [EMAIL PROTECTED]
More majordomo info at http://vger.kernel.org/majordomo-info.html
