I am thinking this method can give better perfomance becouse tree
becomes smaller in N times, where N is a number of elements in hash
array.
It is an interesting data structure, thanks for presenting it.
But it still has one of the fundamental problems we were trying to
remove by going to a non-tree mechanism, the balancing cost.
Later,
David S. Miller
davem@dm.cobaltmicro.com
-
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/