--- jsr166/src/jsr166e/ConcurrentHashMapV8.java 2011/10/09 19:57:49 1.30
+++ jsr166/src/jsr166e/ConcurrentHashMapV8.java 2011/12/05 04:50:19 1.33
@@ -71,7 +71,7 @@ import java.io.Serializable;
* versions of this class, constructors may optionally specify an
* expected {@code concurrencyLevel} as an additional hint for
* internal sizing. Note that using many keys with exactly the same
- * {@code hashCode{}} is a sure way to slow down performance of any
+ * {@code hashCode()} is a sure way to slow down performance of any
* hash table.
*
*
This class and its views and iterators implement all of the
@@ -1150,7 +1150,7 @@ public class ConcurrentHashMapV8
continue;
}
else { // transiently use a locked forwarding node
- Node g = new Node(MOVED|LOCKED, nextTab, null, null);
+ Node g = new Node(MOVED|LOCKED, nextTab, null, null);
if (!casTabAt(tab, i, f, g))
continue;
setTabAt(nextTab, i, null);
@@ -1460,8 +1460,8 @@ public class ConcurrentHashMapV8
if (initialCapacity < concurrencyLevel) // Use at least as many bins
initialCapacity = concurrencyLevel; // as estimated threads
long size = (long)(1.0 + (long)initialCapacity / loadFactor);
- int cap = ((size >= (long)MAXIMUM_CAPACITY) ?
- MAXIMUM_CAPACITY: tableSizeFor((int)size));
+ int cap = ((size >= (long)MAXIMUM_CAPACITY) ?
+ MAXIMUM_CAPACITY: tableSizeFor((int)size));
this.counter = new LongAdder();
this.sizeCtl = cap;
}
@@ -2187,7 +2187,7 @@ public class ConcurrentHashMapV8
return true;
}
- public final boolean removeAll(Collection c) {
+ public final boolean removeAll(Collection> c) {
boolean modified = false;
for (Iterator> it = iter(); it.hasNext();) {
if (c.contains(it.next())) {
@@ -2267,7 +2267,7 @@ public class ConcurrentHashMapV8
}
}
- static final class EntrySet extends MapView
+ static final class EntrySet extends MapView
implements Set> {
EntrySet(ConcurrentHashMapV8 map) { super(map); }