JEP 180: Handle Frequent HashMap Collisions with Balanced Trees (original) (raw)
Florian Weimer fweimer at redhat.com
Fri Apr 5 20:15:20 UTC 2013
- Previous message: JEP 180: Handle Frequent HashMap Collisions with Balanced Trees
- Next message: JEP 180: Handle Frequent HashMap Collisions with Balanced Trees
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Opt-in via Comparable seems rather risky to me.
It's not just potential divergence between equals() and compareTo(), which the Comparable specification explicitly allows. At the very least, you'd have to add totally separate balanced trees for each class of key objects.
-- Florian Weimer / Red Hat Product Security Team
- Previous message: JEP 180: Handle Frequent HashMap Collisions with Balanced Trees
- Next message: JEP 180: Handle Frequent HashMap Collisions with Balanced Trees
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]