@GwtCompatible public interface MapDifference<K,V>
Modifier and Type | Interface and Description |
---|---|
static interface |
MapDifference.ValueDifference<V>
A difference between the mappings from two maps with the same key.
|
Modifier and Type | Method and Description |
---|---|
boolean |
areEqual()
Returns
true if there are no differences between the two maps; that is, if the maps are
equal. |
Map<K,MapDifference.ValueDifference<V>> |
entriesDiffering()
Returns an unmodifiable map describing keys that appear in both maps, but with different
values.
|
Map<K,V> |
entriesInCommon()
Returns an unmodifiable map containing the entries that appear in both maps; that is, the
intersection of the two maps.
|
Map<K,V> |
entriesOnlyOnLeft()
Returns an unmodifiable map containing the entries from the left map whose keys are not present
in the right map.
|
Map<K,V> |
entriesOnlyOnRight()
Returns an unmodifiable map containing the entries from the right map whose keys are not
present in the left map.
|
boolean |
equals(Object object)
Compares the specified object with this instance for equality.
|
int |
hashCode()
Returns the hash code for this instance.
|
boolean areEqual()
true
if there are no differences between the two maps; that is, if the maps are
equal.Map<K,V> entriesOnlyOnLeft()
Map<K,V> entriesOnlyOnRight()
Map<K,V> entriesInCommon()
Map<K,MapDifference.ValueDifference<V>> entriesDiffering()
boolean equals(@NullableDecl Object object)
true
if the
given object is also a MapDifference
and the values returned by the entriesOnlyOnLeft()
, entriesOnlyOnRight()
, entriesInCommon()
and entriesDiffering()
of the two instances are equal.equals
in class Object
object
- the reference object with which to compare.true
if this object is the same as the obj
argument; false
otherwise.Object.hashCode()
,
HashMap
int hashCode()
Arrays.asList(entriesOnlyOnLeft(), entriesOnlyOnRight(),
entriesInCommon(), entriesDiffering())
hashCode
in class Object
Object.equals(java.lang.Object)
,
System.identityHashCode(java.lang.Object)
Copyright © 2010–2018. All rights reserved.