# | Line 2815 | Line 2815 | public class ConcurrentHashMap<K,V> impl | |
---|---|---|
2815 | * that are accessible independently of lock. So instead we | |
2816 | * swap the tree linkages. | |
2817 | * | |
2818 | < | * @return true if now too small so should be untreeified. |
2818 | > | * @return true if now too small, so should be untreeified |
2819 | */ | |
2820 | final boolean removeTreeNode(TreeNode<K,V> p) { | |
2821 | TreeNode<K,V> next = (TreeNode<K,V>)p.next; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |