1 |
|
/* |
2 |
|
* %W% %E% |
3 |
|
* |
4 |
< |
* Copyright 2005 Sun Microsystems, Inc. All rights reserved. |
4 |
> |
* Copyright 2006 Sun Microsystems, Inc. All rights reserved. |
5 |
|
* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. |
6 |
|
*/ |
7 |
|
|
253 |
|
* @throws IllegalArgumentException {@inheritDoc} |
254 |
|
*/ |
255 |
|
public void putAll(Map<? extends K, ? extends V> m) { |
256 |
< |
Iterator<? extends Entry<? extends K, ? extends V>> i = m.entrySet().iterator(); |
257 |
< |
while (i.hasNext()) { |
258 |
< |
Entry<? extends K, ? extends V> e = i.next(); |
259 |
< |
put(e.getKey(), e.getValue()); |
260 |
< |
} |
256 |
> |
for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) |
257 |
> |
put(e.getKey(), e.getValue()); |
258 |
|
} |
259 |
|
|
260 |
|
/** |
471 |
|
* <tt>", "</tt> (comma and space). Each key-value mapping is rendered as |
472 |
|
* the key followed by an equals sign (<tt>"="</tt>) followed by the |
473 |
|
* associated value. Keys and values are converted to strings as by |
474 |
< |
* <tt>String.valueOf(Object)</tt>.<p> |
478 |
< |
* |
479 |
< |
* This implementation creates an empty string buffer, appends a left |
480 |
< |
* brace, and iterates over the map's <tt>entrySet</tt> view, appending |
481 |
< |
* the string representation of each <tt>map.entry</tt> in turn. After |
482 |
< |
* appending each entry except the last, the string <tt>", "</tt> is |
483 |
< |
* appended. Finally a right brace is appended. A string is obtained |
484 |
< |
* from the stringbuffer, and returned. |
474 |
> |
* {@link String#valueOf(Object)}. |
475 |
|
* |
476 |
< |
* @return a String representation of this map |
476 |
> |
* @return a string representation of this map |
477 |
|
*/ |
478 |
|
public String toString() { |
489 |
– |
StringBuilder sb = new StringBuilder(); |
490 |
– |
sb.append("{"); |
491 |
– |
|
479 |
|
Iterator<Entry<K,V>> i = entrySet().iterator(); |
480 |
< |
boolean hasNext = i.hasNext(); |
481 |
< |
while (hasNext) { |
480 |
> |
if (! i.hasNext()) |
481 |
> |
return "{}"; |
482 |
> |
|
483 |
> |
StringBuilder sb = new StringBuilder(); |
484 |
> |
sb.append('{'); |
485 |
> |
for (;;) { |
486 |
|
Entry<K,V> e = i.next(); |
487 |
|
K key = e.getKey(); |
488 |
< |
V value = e.getValue(); |
489 |
< |
if (key == this) |
490 |
< |
sb.append("(this Map)"); |
491 |
< |
else |
492 |
< |
sb.append(key); |
493 |
< |
sb.append("="); |
494 |
< |
if (value == this) |
495 |
< |
sb.append("(this Map)"); |
505 |
< |
else |
506 |
< |
sb.append(value); |
507 |
< |
hasNext = i.hasNext(); |
508 |
< |
if (hasNext) |
509 |
< |
sb.append(", "); |
510 |
< |
} |
511 |
< |
|
512 |
< |
sb.append("}"); |
513 |
< |
return sb.toString(); |
488 |
> |
V value = e.getValue(); |
489 |
> |
sb.append(key == this ? "(this Map)" : key); |
490 |
> |
sb.append('='); |
491 |
> |
sb.append(value == this ? "(this Map)" : value); |
492 |
> |
if (! i.hasNext()) |
493 |
> |
return sb.append('}').toString(); |
494 |
> |
sb.append(", "); |
495 |
> |
} |
496 |
|
} |
497 |
|
|
498 |
|
/** |
513 |
|
* Test for equality, checking for nulls. |
514 |
|
*/ |
515 |
|
private static boolean eq(Object o1, Object o2) { |
516 |
< |
return (o1 == null ? o2 == null : o1.equals(o2)); |
516 |
> |
return o1 == null ? o2 == null : o1.equals(o2); |
517 |
|
} |
518 |
|
|
519 |
|
// Implementation Note: SimpleEntry and SimpleImmutableEntry |
530 |
|
* facilitates the process of building custom map |
531 |
|
* implementations. For example, it may be convenient to return |
532 |
|
* arrays of <tt>SimpleEntry</tt> instances in method |
533 |
< |
* <tt>Map.entrySet().toArray</tt> |
533 |
> |
* <tt>Map.entrySet().toArray</tt>. |
534 |
|
* |
535 |
|
* @since 1.6 |
536 |
|
*/ |
537 |
< |
public static class SimpleEntry<K,V> implements Entry<K,V> { |
537 |
> |
public static class SimpleEntry<K,V> |
538 |
> |
implements Entry<K,V>, java.io.Serializable |
539 |
> |
{ |
540 |
> |
private static final long serialVersionUID = -8499721149061103585L; |
541 |
> |
|
542 |
|
private final K key; |
543 |
|
private V value; |
544 |
|
|
596 |
|
return oldValue; |
597 |
|
} |
598 |
|
|
599 |
+ |
/** |
600 |
+ |
* Compares the specified object with this entry for equality. |
601 |
+ |
* Returns {@code true} if the given object is also a map entry and |
602 |
+ |
* the two entries represent the same mapping. More formally, two |
603 |
+ |
* entries {@code e1} and {@code e2} represent the same mapping |
604 |
+ |
* if<pre> |
605 |
+ |
* (e1.getKey()==null ? |
606 |
+ |
* e2.getKey()==null : |
607 |
+ |
* e1.getKey().equals(e2.getKey())) |
608 |
+ |
* && |
609 |
+ |
* (e1.getValue()==null ? |
610 |
+ |
* e2.getValue()==null : |
611 |
+ |
* e1.getValue().equals(e2.getValue()))</pre> |
612 |
+ |
* This ensures that the {@code equals} method works properly across |
613 |
+ |
* different implementations of the {@code Map.Entry} interface. |
614 |
+ |
* |
615 |
+ |
* @param o object to be compared for equality with this map entry |
616 |
+ |
* @return {@code true} if the specified object is equal to this map |
617 |
+ |
* entry |
618 |
+ |
* @see #hashCode |
619 |
+ |
*/ |
620 |
|
public boolean equals(Object o) { |
621 |
|
if (!(o instanceof Map.Entry)) |
622 |
|
return false; |
624 |
|
return eq(key, e.getKey()) && eq(value, e.getValue()); |
625 |
|
} |
626 |
|
|
627 |
+ |
/** |
628 |
+ |
* Returns the hash code value for this map entry. The hash code |
629 |
+ |
* of a map entry {@code e} is defined to be: <pre> |
630 |
+ |
* (e.getKey()==null ? 0 : e.getKey().hashCode()) ^ |
631 |
+ |
* (e.getValue()==null ? 0 : e.getValue().hashCode())</pre> |
632 |
+ |
* This ensures that {@code e1.equals(e2)} implies that |
633 |
+ |
* {@code e1.hashCode()==e2.hashCode()} for any two Entries |
634 |
+ |
* {@code e1} and {@code e2}, as required by the general |
635 |
+ |
* contract of {@link Object#hashCode}. |
636 |
+ |
* |
637 |
+ |
* @return the hash code value for this map entry |
638 |
+ |
* @see #equals |
639 |
+ |
*/ |
640 |
|
public int hashCode() { |
641 |
< |
return ((key == null) ? 0 : key.hashCode()) ^ |
642 |
< |
((value == null) ? 0 : value.hashCode()); |
641 |
> |
return (key == null ? 0 : key.hashCode()) ^ |
642 |
> |
(value == null ? 0 : value.hashCode()); |
643 |
|
} |
644 |
|
|
645 |
|
/** |
657 |
|
} |
658 |
|
|
659 |
|
/** |
660 |
< |
* An Entry maintaining an immutable key and value, This class |
660 |
> |
* An Entry maintaining an immutable key and value. This class |
661 |
|
* does not support method <tt>setValue</tt>. This class may be |
662 |
|
* convenient in methods that return thread-safe snapshots of |
663 |
|
* key-value mappings. |
664 |
|
* |
665 |
|
* @since 1.6 |
666 |
|
*/ |
667 |
< |
public static class SimpleImmutableEntry<K,V> implements Entry<K,V> { |
667 |
> |
public static class SimpleImmutableEntry<K,V> |
668 |
> |
implements Entry<K,V>, java.io.Serializable |
669 |
> |
{ |
670 |
> |
private static final long serialVersionUID = 7138329143949025153L; |
671 |
> |
|
672 |
|
private final K key; |
673 |
|
private final V value; |
674 |
|
|
727 |
|
throw new UnsupportedOperationException(); |
728 |
|
} |
729 |
|
|
730 |
+ |
/** |
731 |
+ |
* Compares the specified object with this entry for equality. |
732 |
+ |
* Returns {@code true} if the given object is also a map entry and |
733 |
+ |
* the two entries represent the same mapping. More formally, two |
734 |
+ |
* entries {@code e1} and {@code e2} represent the same mapping |
735 |
+ |
* if<pre> |
736 |
+ |
* (e1.getKey()==null ? |
737 |
+ |
* e2.getKey()==null : |
738 |
+ |
* e1.getKey().equals(e2.getKey())) |
739 |
+ |
* && |
740 |
+ |
* (e1.getValue()==null ? |
741 |
+ |
* e2.getValue()==null : |
742 |
+ |
* e1.getValue().equals(e2.getValue()))</pre> |
743 |
+ |
* This ensures that the {@code equals} method works properly across |
744 |
+ |
* different implementations of the {@code Map.Entry} interface. |
745 |
+ |
* |
746 |
+ |
* @param o object to be compared for equality with this map entry |
747 |
+ |
* @return {@code true} if the specified object is equal to this map |
748 |
+ |
* entry |
749 |
+ |
* @see #hashCode |
750 |
+ |
*/ |
751 |
|
public boolean equals(Object o) { |
752 |
|
if (!(o instanceof Map.Entry)) |
753 |
|
return false; |
755 |
|
return eq(key, e.getKey()) && eq(value, e.getValue()); |
756 |
|
} |
757 |
|
|
758 |
+ |
/** |
759 |
+ |
* Returns the hash code value for this map entry. The hash code |
760 |
+ |
* of a map entry {@code e} is defined to be: <pre> |
761 |
+ |
* (e.getKey()==null ? 0 : e.getKey().hashCode()) ^ |
762 |
+ |
* (e.getValue()==null ? 0 : e.getValue().hashCode())</pre> |
763 |
+ |
* This ensures that {@code e1.equals(e2)} implies that |
764 |
+ |
* {@code e1.hashCode()==e2.hashCode()} for any two Entries |
765 |
+ |
* {@code e1} and {@code e2}, as required by the general |
766 |
+ |
* contract of {@link Object#hashCode}. |
767 |
+ |
* |
768 |
+ |
* @return the hash code value for this map entry |
769 |
+ |
* @see #equals |
770 |
+ |
*/ |
771 |
|
public int hashCode() { |
772 |
< |
return ((key == null) ? 0 : key.hashCode()) ^ |
773 |
< |
((value == null) ? 0 : value.hashCode()); |
772 |
> |
return (key == null ? 0 : key.hashCode()) ^ |
773 |
> |
(value == null ? 0 : value.hashCode()); |
774 |
|
} |
775 |
|
|
776 |
|
/** |