6 Commits

Author	SHA1	Message	Date
Brent Christian	53a90d216f	8005698: Handle Frequent HashMap Collisions with Balanced Trees ... HashMap bins with many collisions store entries in balanced trees Reviewed-by: alanb, dl, mduigou	2013-06-04 10:04:28 +01:00
Mike Duigou	1e3c417915	7199249: TEST_BUG : Add /othervm to Collisions.java @run main with -D definitions ... Reviewed-by: alanb	2012-09-18 11:04:12 -07:00
Mike Duigou	25570f8d69	7198988: re-order paramaters for Collision.java @run ... Reviewed-by: alanb	2012-09-17 11:36:10 -07:00
Mike Duigou	bb1c4324e9	7189926: Reduce test size for default run. Add additional run enabling alternative hashing ... Reviewed-by: alanb	2012-09-11 07:42:02 -07:00
Mike Duigou	36dbbfde4b	7175758: Improve unit test of Map iterators and Iterator.remove() ... Adds additional tests of Map iterators and Iterator.remove() Reviewed-by: lancea	2012-06-15 13:01:38 -07:00
Mike Duigou	705c53b045	7126277: Alternative String hashing implementation ... 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	2012-05-30 22:18:37 -07:00