How to use compareUnorderedMap method of org.assertj.core.api.recursive.comparison.RecursiveComparisonDifferenceCalculator class

Best Assertj code snippet using org.assertj.core.api.recursive.comparison.RecursiveComparisonDifferenceCalculator.compareUnorderedMap

Source:RecursiveComparisonDifferenceCalculator.java

...221      }222      // Compare two Unordered Maps. This is a slightly more expensive comparison because order cannot be assumed, therefore a223      // temporary Map must be created, however the comparison still runs in O(N) time.224      if (dualValue.isExpectedFieldAMap()) {225        compareUnorderedMap(dualValue, comparisonState);226        continue;227      }228      if (shouldCompareDualValue(recursiveComparisonConfiguration, dualValue)) {229        if (!actualFieldValue.equals(expectedFieldValue)) comparisonState.addDifference(dualValue);230        continue;231      }232      Class<?> actualFieldValueClass = actualFieldValue.getClass();233      Class<?> expectedFieldClass = expectedFieldValue.getClass();234      if (recursiveComparisonConfiguration.isInStrictTypeCheckingMode() && expectedTypeIsNotSubtypeOfActualType(dualValue)) {235        comparisonState.addDifference(dualValue, STRICT_TYPE_ERROR, expectedFieldClass.getName(),236                                      actualFieldValueClass.getName());237        continue;238      }239      Set<String> actualNonIgnoredFieldsNames = recursiveComparisonConfiguration.getNonIgnoredActualFieldNames(dualValue);240      Set<String> expectedFieldsNames = getFieldsNames(expectedFieldClass);241      // Check if expected has more fields than actual, in that case the additional fields are reported as difference242      if (!expectedFieldsNames.containsAll(actualNonIgnoredFieldsNames)) {243        // report missing fields in actual244        Set<String> actualFieldsNamesNotInExpected = newHashSet(actualNonIgnoredFieldsNames);245        actualFieldsNamesNotInExpected.removeAll(expectedFieldsNames);246        String missingFields = actualFieldsNamesNotInExpected.toString();247        String expectedClassName = expectedFieldClass.getName();248        String actualClassName = actualFieldValueClass.getName();249        String missingFieldsDescription = format(MISSING_FIELDS, actualClassName, expectedClassName,250                                                 expectedFieldClass.getSimpleName(), actualFieldValueClass.getSimpleName(),251                                                 missingFields);252        comparisonState.addDifference(dualValue, missingFieldsDescription);253      } else { // TODO remove else to report more diff254        // compare actual's fields against expected :255        // - if actual has more fields than expected, the additional fields are ignored as expected is the reference256        for (String actualFieldName : actualNonIgnoredFieldsNames) {257          if (expectedFieldsNames.contains(actualFieldName)) {258            DualValue newDualValue = new DualValue(currentPath, actualFieldName,259                                                   COMPARISON.getSimpleValue(actualFieldName, actualFieldValue),260                                                   COMPARISON.getSimpleValue(actualFieldName, expectedFieldValue));261            comparisonState.registerForComparison(newDualValue);262          }263        }264      }265    }266    return comparisonState.getDifferences();267  }268  private static boolean shouldCompareDualValue(RecursiveComparisonConfiguration recursiveComparisonConfiguration,269                                                final DualValue dualValue) {270    return !recursiveComparisonConfiguration.shouldIgnoreOverriddenEqualsOf(dualValue)271           && hasOverriddenEquals(dualValue.actual.getClass());272  }273  // avoid comparing enum recursively since they contain static fields which are ignored in recursive comparison274  // this would make different field enum value to be considered the same!275  private static void compareAsEnums(final DualValue dualValue,276                                     ComparisonState comparisonState,277                                     RecursiveComparisonConfiguration recursiveComparisonConfiguration) {278    if (recursiveComparisonConfiguration.isInStrictTypeCheckingMode()) {279      // we can use == for comparison which checks both actual and expected values and types are the same280      if (dualValue.actual != dualValue.expected) comparisonState.addDifference(dualValue);281      return;282    }283    if (!dualValue.isActualAnEnum()) {284      comparisonState.addDifference(dualValue, differentTypeErrorMessage(dualValue, "an enum"));285      return;286    }287    // both actual and expected are enums288    Enum<?> actualEnum = (Enum<?>) dualValue.actual;289    Enum<?> expectedEnum = (Enum<?>) dualValue.expected;290    // we must only compare actual and expected enum by value but not by type291    if (!actualEnum.name().equals(expectedEnum.name())) comparisonState.addDifference(dualValue);292  }293  private static boolean shouldHonorOverriddenEquals(DualValue dualValue,294                                                     RecursiveComparisonConfiguration recursiveComparisonConfiguration) {295    boolean shouldNotIgnoreOverriddenEqualsIfAny = !recursiveComparisonConfiguration.shouldIgnoreOverriddenEqualsOf(dualValue);296    return shouldNotIgnoreOverriddenEqualsIfAny && dualValue.actual != null && hasOverriddenEquals(dualValue.actual.getClass());297  }298  private static void compareArrays(DualValue dualValue, ComparisonState comparisonState) {299    if (!dualValue.isActualFieldAnArray()) {300      // at the moment we only allow comparing arrays with arrays but we might allow comparing to collections later on301      // but only if we are not in strict type mode.302      comparisonState.addDifference(dualValue, differentTypeErrorMessage(dualValue, "an array"));303      return;304    }305    // both values in dualValue are arrays306    int actualArrayLength = Array.getLength(dualValue.actual);307    int expectedArrayLength = Array.getLength(dualValue.expected);308    if (actualArrayLength != expectedArrayLength) {309      comparisonState.addDifference(dualValue, DIFFERENT_SIZE_ERROR, "arrays", actualArrayLength, expectedArrayLength);310      // no need to inspect elements, arrays are not equal as they don't have the same size311      return;312    }313    // register each pair of actual/expected elements for recursive comparison314    List<String> arrayFieldPath = dualValue.getPath();315    for (int i = 0; i < actualArrayLength; i++) {316      Object actualElement = Array.get(dualValue.actual, i);317      Object expectedElement = Array.get(dualValue.expected, i);318      // TODO add [i] to the path ?319      comparisonState.registerForComparison(new DualValue(arrayFieldPath, actualElement, expectedElement));320    }321  }322  /*323   * Deeply compare two Collections that must be same length and in same order.324   */325  private static void compareOrderedCollections(DualValue dualValue, ComparisonState comparisonState) {326    if (!dualValue.isActualFieldAnOrderedCollection()) {327      // at the moment if expected is an ordered collection then actual should also be one328      comparisonState.addDifference(dualValue, ACTUAL_NOT_ORDERED_COLLECTION, dualValue.actual.getClass().getCanonicalName());329      return;330    }331    Collection<?> actualCollection = (Collection<?>) dualValue.actual;332    Collection<?> expectedCollection = (Collection<?>) dualValue.expected;333    if (actualCollection.size() != expectedCollection.size()) {334      comparisonState.addDifference(dualValue, DIFFERENT_SIZE_ERROR,335                                    "collections", actualCollection.size(), expectedCollection.size());336      // no need to inspect elements, arrays are not equal as they don't have the same size337      return;338    }339    // register pair of elements with same index for later comparison as we compare elements in order340    Iterator<?> expectedIterator = expectedCollection.iterator();341    List<String> path = dualValue.getPath();342    actualCollection.stream()343                    .map(element -> new DualValue(path, element, expectedIterator.next()))344                    .forEach(comparisonState::registerForComparison);345  }346  private static String differentTypeErrorMessage(DualValue dualValue, String actualTypeDescription) {347    return format(DIFFERENT_ACTUAL_AND_EXPECTED_FIELD_TYPES,348                  actualTypeDescription, dualValue.actual.getClass().getCanonicalName());349  }350  private static void compareUnorderedIterables(DualValue dualValue, ComparisonState comparisonState) {351    if (!dualValue.isActualFieldAnIterable()) {352      // at the moment we only compare iterable with iterables (but we might allow arrays too)353      comparisonState.addDifference(dualValue, differentTypeErrorMessage(dualValue, "an iterable"));354      return;355    }356    Iterable<?> actual = (Iterable<?>) dualValue.actual;357    Iterable<?> expected = (Iterable<?>) dualValue.expected;358    int actualSize = sizeOf(actual);359    int expectedSize = sizeOf(expected);360    if (actualSize != expectedSize) {361      comparisonState.addDifference(dualValue, DIFFERENT_SIZE_ERROR, "collections", actualSize, expectedSize);362      // no need to inspect elements, iterables are not equal as they don't have the same size363      return;364      // TODO instead we could register the diff between expected and actual that is:365      // - unexpected actual elements (the ones not matching any expected)366      // - expected elements not found in actual.367    }368    List<String> path = dualValue.getPath();369    // copy expected as we will remove elements found in actual370    Collection<?> expectedCopy = new LinkedList<>(toCollection(expected));371    for (Object actualElement : actual) {372      // compare recursively actualElement to all remaining expected elements373      Iterator<?> expectedIterator = expectedCopy.iterator();374      while (expectedIterator.hasNext()) {375        Object expectedElement = expectedIterator.next();376        // we need to get the currently visited dual values otherwise a cycle would cause an infinite recursion.377        List<ComparisonDifference> differences = determineDifferences(actualElement, expectedElement, path, false,378                                                                      comparisonState.visitedDualValues,379                                                                      comparisonState.recursiveComparisonConfiguration);380        if (differences.isEmpty()) {381          // we found an element in expected matching actualElement, we must remove it as if actual matches expected382          // it means for each actual element there is one and only matching expected element.383          expectedIterator.remove();384          // jump to next actual element check385          break;386        }387      }388    }389    // expectedCopy not empty = there was at least one actual element not matching any expected elements.390    if (!expectedCopy.isEmpty()) comparisonState.addDifference(dualValue);391    // TODO instead we could register the diff between expected and actual that is:392    // - unexpected actual elements (the ones not matching any expected)393    // - expected elements not found in actual.394  }395  private static <K, V> void compareSortedMap(DualValue dualValue, ComparisonState comparisonState) {396    if (!dualValue.isActualFieldASortedMap()) {397      // at the moment we only compare iterable with iterables (but we might allow arrays too)398      comparisonState.addDifference(dualValue, differentTypeErrorMessage(dualValue, "a sorted map"));399      return;400    }401    Map<?, ?> actualMap = (Map<?, ?>) dualValue.actual;402    @SuppressWarnings("unchecked")403    Map<K, V> expectedMap = (Map<K, V>) dualValue.expected;404    if (actualMap.size() != expectedMap.size()) {405      comparisonState.addDifference(dualValue, DIFFERENT_SIZE_ERROR, "sorted maps", actualMap.size(), expectedMap.size());406      // no need to inspect entries, maps are not equal as they don't have the same size407      return;408      // TODO instead we could register the diff between expected and actual that is:409      // - unexpected actual entries (the ones not matching any expected)410      // - expected entries not found in actual.411    }412    List<String> path = dualValue.getPath();413    Iterator<Map.Entry<K, V>> expectedMapEntries = expectedMap.entrySet().iterator();414    for (Map.Entry<?, ?> actualEntry : actualMap.entrySet()) {415      Map.Entry<?, ?> expectedEntry = expectedMapEntries.next();416      // Must split the Key and Value so that Map.Entry's equals() method is not used.417      comparisonState.registerForComparison(new DualValue(path, actualEntry.getKey(), expectedEntry.getKey()));418      comparisonState.registerForComparison(new DualValue(path, actualEntry.getValue(), expectedEntry.getValue()));419    }420  }421  private static void compareUnorderedMap(DualValue dualValue, ComparisonState comparisonState) {422    if (!dualValue.isActualFieldAMap()) {423      comparisonState.addDifference(dualValue, differentTypeErrorMessage(dualValue, "a map"));424      return;425    }426    Map<?, ?> actualMap = (Map<?, ?>) dualValue.actual;427    Map<?, ?> expectedMap = (Map<?, ?>) dualValue.expected;428    if (actualMap.size() != expectedMap.size()) {429      comparisonState.addDifference(dualValue, DIFFERENT_SIZE_ERROR, "maps", actualMap.size(), expectedMap.size());430      // no need to inspect entries, maps are not equal as they don't have the same size431      return;432      // TODO instead we could register the diff between expected and actual that is:433      // - unexpected actual entries (the ones not matching any expected)434      // - expected entries not found in actual.435    }...

compareUnorderedMap

Using AI Code Generation

1import static org.assertj.core.api.Assertions.assertThat;2import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifferenceCalculator.compareUnorderedMap;3import static org.assertj.core.util.Lists.list;4import java.util.List;5import java.util.Map;6import org.assertj.core.api.recursive.comparison.Difference;7import org.junit.jupiter.api.Test;8class RecursiveComparisonDifferenceCalculatorTest {9  void should_return_empty_difference_when_comparing_two_empty_maps() {10    Map<String, String> expected = Map.of();11    Map<String, String> actual = Map.of();12    List<Difference> differences = compareUnorderedMap(expected, actual);13    assertThat(differences).isEmpty();14  }15  void should_return_difference_when_comparing_two_maps_with_different_key_sets() {16    Map<String, String> expected = Map.of("name", "Yoda");17    Map<String, String> actual = Map.of();18    List<Difference> differences = compareUnorderedMap(expected, actual);19    assertThat(differences).containsExactly(20        Difference.builder()21                  .actualValue(null)22                  .expectedValue("Yoda")23                  .path(list("name"))24                  .build()25    );26  }27  void should_return_difference_when_comparing_two_maps_with_different_values() {28    Map<String, String> expected = Map.of("name", "Yoda");29    Map<String, String> actual = Map.of("name", "Luke");30    List<Difference> differences = compareUnorderedMap(expected, actual);31    assertThat(differences).containsExactly(32        Difference.builder()33                  .actualValue("Luke")34                  .expectedValue("Yoda")35                  .path(list("name"))36                  .build()37    );38  }39  void should_return_difference_when_comparing_two_maps_with_different_value_types() {40    Map<String, Object> expected = Map.of("name", "Yoda");41    Map<String, Object> actual = Map.of("name", 42);42    List<Difference> differences = compareUnorderedMap(expected, actual);43    assertThat(differences).containsExactly(44        Difference.builder()45                  .actualValue(42)46                  .expectedValue("Yoda")

compareUnorderedMap

Using AI Code Generation

1package org.assertj.core.api.recursive.comparison;2import java.util.List;3import org.assertj.core.api.recursive.comparison.FieldLocation.FieldLocationBuilder;4public class RecursiveComparisonDifferenceCalculator {5  public List<RecursiveComparisonDifference> compareUnorderedMap(FieldLocation fieldLocation, Object expected, Object actual) {6  }7  public List<RecursiveComparisonDifference> compareUnorderedMap(FieldLocationBuilder fieldLocationBuilder, Object expected, Object actual) {8  }9}10package org.assertj.core.api.recursive.comparison;11import org.assertj.core.api.recursive.comparison.FieldLocation.FieldLocationBuilder;12public class RecursiveComparisonDifferenceCalculatorTest {13  public void testCompareUnorderedMap() {14  }15}16package org.assertj.core.api.recursive.comparison;17import java.util.ArrayList;18import java.util.HashMap;19import java.util.List;20import java.util.Map;21import org.assertj.core.api.recursive.comparison.FieldLocation.FieldLocationBuilder;22import org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.DifferenceType;23import org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.RecursiveComparisonDifferenceBuilder;24import org.junit.jupiter.api.Test;25import static java.util.Collections.emptyMap;26import static java.util.Collections.singletonMap;27import static org.assertj.core.api.Assertions.assertThat;28import static org.assertj.core.api.recursive.comparison.FieldLocation.FieldLocationBuilder.fieldLocation;29import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.DifferenceType.ARRAY_LENGTH_DID_NOT_MATCH;30import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.DifferenceType.KEY_DID_NOT_MATCH;31import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.DifferenceType.MISSING_ELEMENT;32import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.DifferenceType.UNORDERED_COLLECTION_DID_NOT_MATCH;33import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.DifferenceType.UNORDERED_MAP_DID_NOT_MATCH;34import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.RecursiveComparisonDifferenceBuilder.comparisonDifference;35import static org.assertj.core.api.recursive.comparison.RecursiveComparisonDifference.RecursiveComparisonDifferenceBuilder.difference

compareUnorderedMap

Using AI Code Generation

1import org.assertj.core.api.recursive.comparison.RecursiveComparisonDifferenceCalculator;2import java.util.ArrayList;3import java.util.HashMap;4import java.util.List;5import java.util.Map;6public class CompareUnorderedMap {7    public static void main(String[] args) {8        Map<String, Object> map1 = new HashMap<>();9        map1.put("key1", "value1");10        map1.put("key2", "value2");11        Map<String, Object> nestedMap1 = new HashMap<>();12        nestedMap1.put("nestedKey1", "nestedValue1");13        nestedMap1.put("nestedKey2", "nestedValue2");14        map1.put("nestedMap", nestedMap1);15        Map<String, Object> map2 = new HashMap<>();16        map2.put("key1", "value1");17        map2.put("key2", "value2");18        Map<String, Object> nestedMap2 = new HashMap<>();19        nestedMap2.put("nestedKey1", "nestedValue1");20        nestedMap2.put("nestedKey2", "nestedValue2");21        map2.put("nestedMap", nestedMap2);22        List<RecursiveComparisonDifference> differences = new RecursiveComparisonDifferenceCalculator().compareUnorderedMap(map1, map2);23        System.out.println(differences);24    }25}

Automation Testing Tutorials

Learn to execute automation testing from scratch with LambdaTest Learning Hub. Right from setting up the prerequisites to run your first automation test, to following best practices and diving deeper into advanced test scenarios. LambdaTest Learning Hubs compile a list of step-by-step guides to help you be proficient with different test automation frameworks i.e. Selenium, Cypress, TestNG etc.