> it will be as fast or cheaper _even_ in the common case than what we
> have now
? What is this common case. I can't see how your implementation would
be faster than a good implementation of a balanced search tree.
Regards,
Patrik Hägglund,
intrested in data structures and algorithms,
but not a kernel hacker (yet)
-
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.altern.org/andrebalsa/doc/lkml-faq.html