2751 |
|
* that are accessible independently of lock. So instead we |
2752 |
|
* swap the tree linkages. |
2753 |
|
* |
2754 |
< |
* @return true if now too small so should be untreeified. |
2754 |
> |
* @return true if now too small, so should be untreeified |
2755 |
|
*/ |
2756 |
|
final boolean removeTreeNode(TreeNode<K,V> p) { |
2757 |
|
TreeNode<K,V> next = (TreeNode<K,V>)p.next; |
3498 |
|
* of all (key, value) pairs |
3499 |
|
* @since 1.8 |
3500 |
|
*/ |
3501 |
< |
public double reduceToDoubleIn(long parallelismThreshold, |
3502 |
< |
ObjectByObjectToDouble<? super K, ? super V> transformer, |
3503 |
< |
double basis, |
3504 |
< |
DoubleByDoubleToDouble reducer) { |
3501 |
> |
public double reduceToDouble(long parallelismThreshold, |
3502 |
> |
ObjectByObjectToDouble<? super K, ? super V> transformer, |
3503 |
> |
double basis, |
3504 |
> |
DoubleByDoubleToDouble reducer) { |
3505 |
|
if (transformer == null || reducer == null) |
3506 |
|
throw new NullPointerException(); |
3507 |
|
return new MapReduceMappingsToDoubleTask<K,V> |