It says that it is based on ConcurrentHashMap implementation from jdk.
The jdk yses RB-Tree to optimise collision in the worst case scenario.
Why does Gauva avoid this? Do they not expect such collision? It can degrade to O(n) in the worst case scenario. The hash function can be easily targeted to create input where all the keys fall in the same bucket thus degrading to a Linkedlist. How/Why does Gauva avoid this?
Project site: https://github.com/google/guava
This group: http://groups.google.com/group/guava-discuss
This list is for general discussion.
To report an issue: https://github.com/google/guava/issues/new
To get help: http://stackoverflow.com/questions/ask?tags=guava
You received this message because you are subscribed to the Google Groups "guava-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to guava-discus...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/guava-discuss/4213090b-3021-494e-9f1c-657d896a9c4fn%40googlegroups.com.