Reviewed-by: chegar

8016446: Improve forEach/replaceAll for Map, HashMap, Hashtable, IdentityHashMap, WeakHashMap, TreeMap, ConcurrentMap
Reviewed-by: forax, mduigou, psandoz
Contributed-by: NMike Duigou &lt;mike.duigou@oracle.com&gt;, Remi Forax <forax@univ-mlv.fr>

Reviewed-by: lancea, chegar, psandoz

Summary: HashMap bins with many collisions store entries in balanced trees
Reviewed-by: alanb, dl, mduigou

Reviewed-by: chegar, ksrini

Summary: All of the hashing based Map implementations: HashMap, Hashtable, LinkedHashMap, WeakHashMap and ConcurrentHashMap are modified to use an enhanced hashing algorithm for string keys when the capacity of the hash table has ever grown beyond 512 entries. The enhanced hashing implementation uses the murmur3 hashing algorithm along with random hash seeds and index masks. These enhancements mitigate cases where colliding String hash values could result in a performance bottleneck.
Reviewed-by: alanb, forax, dl

Summary: Minor code changes to cleanup warnings in java.util.*
Reviewed-by: mduigou, naoto, smarks
Contributed-by: NRemi Forax <forax@univ-mlv.fr>

Reviewed-by: dholmes

Reviewed-by: darcy, lancea, alanb, briangoetz, mduigou, mchung

Reviewed-by: darcy, weijun