| 53 |
|
* throw <tt>ConcurrentModificationException</tt> on a best-effort basis. |
| 54 |
|
* Therefore, it would be wrong to write a program that depended on this |
| 55 |
|
* exception for its correctness: <i>the fail-fast behavior of iterators |
| 56 |
< |
* should be used only to detect bugs.</i><p> |
| 56 |
> |
* should be used only to detect bugs.</i> |
| 57 |
|
* |
| 58 |
< |
* This class is a member of the |
| 58 |
> |
* <p>This class is a member of the |
| 59 |
|
* <a href="{@docRoot}/../guide/collections/index.html"> |
| 60 |
|
* Java Collections Framework</a>. |
| 61 |
|
* |
| 265 |
|
if (m.size()==0 && c.size() > 0 && |
| 266 |
|
c instanceof SortedSet && |
| 267 |
|
m instanceof TreeMap) { |
| 268 |
< |
SortedSet<Map.Entry<E, Object>> set = (SortedSet<Map.Entry<E, Object>>) (SortedSet) c; |
| 268 |
> |
SortedSet<? extends E> set = (SortedSet<? extends E>) c; |
| 269 |
|
TreeMap<E,Object> map = (TreeMap<E, Object>) m; |
| 270 |
< |
Comparator<? super E> cc = (Comparator<E>) set.comparator(); |
| 270 |
> |
Comparator<? super E> cc = (Comparator<? super E>) set.comparator(); |
| 271 |
|
Comparator<? super E> mc = map.comparator(); |
| 272 |
|
if (cc==mc || (cc != null && cc.equals(mc))) { |
| 273 |
|
map.addAllForTreeSet(set, PRESENT); |
| 652 |
|
s.defaultReadObject(); |
| 653 |
|
|
| 654 |
|
// Read in Comparator |
| 655 |
< |
Comparator<E> c = (Comparator<E>) s.readObject(); |
| 655 |
> |
Comparator<? super E> c = (Comparator<? super E>) s.readObject(); |
| 656 |
|
|
| 657 |
|
// Create backing TreeMap |
| 658 |
|
TreeMap<E,Object> tm; |
