5

I'm wondering the best way to compare these two HashMaps. I want to verify if they are the same, and if not, what is the difference. If it matters, then I'm wondering what the 2nd one has/does not have that the first hashmap does have. I'll need to know if one has a key the other does not, as well as the Value List differences per key. I'm hoping there is a simple way to map this, but not sure. Basic Example:

    HashMap<String, List<String>> hmOne = new HashMap<String, List<String>>();
    List<String>l1 = new ArrayList<String>();

    l1.add("one");
    l1.add("two");
    l1.add("three");
    l1.add("four");
    l1.add("five");
    hmOne.put("firstkey", l1);
    l1 = new ArrayList<String>();

    l1.add("1");
    l1.add("2");
    l1.add("3");
    l1.add("4");
    l1.add("5");
    hmOne.put("secondkey", l1);

    HashMap<String, List<String>> hmTwo = new HashMap<String, List<String>>();
    List<String>l2 = new ArrayList<String>();
    l2.add("one");
    l2.add("two");
    l2.add("four");
    l2.add("five");
    hmTwo.put("firstkey", l2);
    l2 = new ArrayList<String>();

    l2.add("1");
    l2.add("3");
    l2.add("4");
    l2.add("5");
    hmTwo.put("secondkey", l2);

Thanks for any help.

3
  • 1
    stackoverflow.com/questions/3387155/difference-between-two-maps/… Commented Oct 19, 2011 at 19:02
  • 1
    I wrote my own comparison. I pass in the two hashmaps to compare and I get back what the first has that the second does not, and vice versa. Commented Oct 20, 2011 at 19:50
  • @Green i know it has been some time, but could you..accept an answer or post your own solution as an answer (prefered)? greetings Commented Sep 20, 2017 at 14:02

4 Answers 4

6

guava has Maps.difference(map1, map2)

Sign up to request clarification or add additional context in comments.

1 Comment

Guava also has Lists.newArrayList("1", "2", "3", "4", "5"), which will make the original code much shorter than it is right now.
2

HashMap.equals will tell you if they are identical (same keys and values) but the rest you will have to roll yourself.

You will need to iterate the keyset() of one HashMap, look for it in the keySet() of the other and if found then compare the values.

Then, you will have to do the reverse, looking for keys in the second that don't exist in the first. You can probably use Set methods for this.

4 Comments

Easier to use the methods of mapOne.entrySet(): .containsAll(mapTwo.entrySet())/.removeAll(mapTwo.entrySet())/.retainAll(mapTwo.entrySet()) than iterating manually. Possibly with a clone of mapOne since the methods are destructive.
@ChristofferHammarström I mentioned the set methods for reverse but not for first because value comparison is also required.
That's why you use .entrySet(), not .keySet().
Oops yes. Sorry I was blind earlier.
0

Off the top of my head, you could first use HashMap.equals() to tell if they are different and then get the keySet of each hashmap and compare them:

What is the fastest way to compare two sets in Java?

Then once you've got the differences in keys, you could repeat the process on your value collections.

Comments

0

You know that Map's .equals() method will tell you if two Maps are equal, right?

If they aren't equal, you're going to have to parse them both and figure out the differences on your own.

Comments

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.