Package | Description |
---|---|
org.assertj.core.internal |
Modifier and Type | Method and Description |
---|---|
private static java.util.Deque<DeepDifference.DualKey> |
DeepDifference.initStack(java.lang.Object a,
java.lang.Object b,
java.util.List<java.lang.String> parentPath,
java.util.Map<java.lang.String,java.util.Comparator<?>> comparatorByPropertyOrField,
TypeComparators comparatorByType) |
Modifier and Type | Method and Description |
---|---|
private static boolean |
DeepDifference.hasCustomComparator(DeepDifference.DualKey dualKey,
java.util.Map<java.lang.String,java.util.Comparator<?>> comparatorByPropertyOrField,
TypeComparators comparatorByType) |
Modifier and Type | Method and Description |
---|---|
private static boolean |
DeepDifference.compareArrays(java.lang.Object array1,
java.lang.Object array2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare to Arrays [].
|
private static boolean |
DeepDifference.compareArrays(java.lang.Object array1,
java.lang.Object array2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare to Arrays [].
|
private static <K,V> boolean |
DeepDifference.compareOrderedCollection(java.util.Collection<K> col1,
java.util.Collection<V> col2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare two Collections that must be same length and in same
order.
|
private static <K,V> boolean |
DeepDifference.compareOrderedCollection(java.util.Collection<K> col1,
java.util.Collection<V> col2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare two Collections that must be same length and in same
order.
|
private static <K1,V1,K2,V2> |
DeepDifference.compareSortedMap(java.util.SortedMap<K1,V1> map1,
java.util.SortedMap<K2,V2> map2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare two SortedMap instances.
|
private static <K1,V1,K2,V2> |
DeepDifference.compareSortedMap(java.util.SortedMap<K1,V1> map1,
java.util.SortedMap<K2,V2> map2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare two SortedMap instances.
|
private static <K,V> boolean |
DeepDifference.compareUnorderedCollection(java.util.Collection<K> col1,
java.util.Collection<V> col2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited,
java.util.Map<java.lang.String,java.util.Comparator<?>> comparatorByPropertyOrField,
TypeComparators comparatorByType) |
private static <K,V> boolean |
DeepDifference.compareUnorderedCollection(java.util.Collection<K> col1,
java.util.Collection<V> col2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited,
java.util.Map<java.lang.String,java.util.Comparator<?>> comparatorByPropertyOrField,
TypeComparators comparatorByType) |
private static <K,V> boolean |
DeepDifference.compareUnorderedCollectionByHashCodes(java.util.Collection<K> col1,
java.util.Collection<V> col2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
It places one collection into a temporary Map by deepHashCode(), so that it
can walk the other collection and look for each item in the map, which
runs in O(N) time, rather than an O(N^2) lookup that would occur if each
item from collection one was scanned for in collection two.
|
private static <K,V> boolean |
DeepDifference.compareUnorderedCollectionByHashCodes(java.util.Collection<K> col1,
java.util.Collection<V> col2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
It places one collection into a temporary Map by deepHashCode(), so that it
can walk the other collection and look for each item in the map, which
runs in O(N) time, rather than an O(N^2) lookup that would occur if each
item from collection one was scanned for in collection two.
|
private static <K1,V1,K2,V2> |
DeepDifference.compareUnorderedMap(java.util.Map<K1,V1> map1,
java.util.Map<K2,V2> map2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare two Map instances.
|
private static <K1,V1,K2,V2> |
DeepDifference.compareUnorderedMap(java.util.Map<K1,V1> map1,
java.util.Map<K2,V2> map2,
java.util.List<java.lang.String> path,
java.util.Deque<DeepDifference.DualKey> toCompare,
java.util.Set<DeepDifference.DualKey> visited)
Deeply compare two Map instances.
|